COMMITTEE T1 TELECOMMUNICATIONS Working Group T1E1.4 (DSL Access) Lisle, IL, May 3, 2000
|
|
- Vincent Baldwin
- 5 years ago
- Views:
Transcription
1 COMMTTEE T TELECOMMUCTOS Woring Group TE. (DSL ccess) Lisle, L, May 3, 000 TE./ COTRBUTO TTLE: ew proposal of Turbo codes for DSL modems SOURCE: VOCL Technologies Ltd PROJECT: TE., DSL Enhancements BSTRCT This paper describes a new technique for coding and decoding signals that use turbo codes with QM modulation for error correction. Contact: Juan lberto Torres, jatorres@vocal.com, Frederic Hirzel, fhirzel@vocal.com Victor Demjaneno, victord@vocal.com VOCL Technologies Ltd. 00 John James udubon Parway Buffalo, Y 8 Phone: (76) Fax: (76) OTCE This contribution has been prepared to assist ccredited Standards Committee T Telecommunications. This document is offered to the Committee as a basis for discussion and is not a binding proposal on VOCL Technologies Ltd. or any other company. The requirements are subject to change in form and numerical value after more study. VOCL Technologies specifically reserves the right to add to, amend, or withdraw the statements contained herein.
2 Lisle, L TE./ TRODUCTO. Turbo codes present a new and very powerful error control technique, which allows communication very close to the channel capacity. Since its discovery in 993, a lot of research has been done in the application of turbo codes in deep space communications, mobile satellite/cellular communications, microwave lins, paging, in OFDM and CDM architectures. Turbo codes have outperformed all previously nown coding schemes regardless of the targeted channel. The extra coding gain offered by turbo codes can be used either to minimize bandwidth or to reduce power requirements in the lin budget. Standards based in turbo codes have already been defined or are currently under investigation. Here are some examples: nmarsat s new multimedia service is based on turbo codes and 6QM that allows the user to communicate with existing nmarsat 3 spot beam satellites from a noteboo-sized terminal at 6 bit/s. The Third Generation Partnership Project (3GPP) proposal for MT-000 includes turbo codes in the multiplexing and channel coding specification. The MT-000 represents the third generation mobile radio systems worldwide standard. The 3GPP objective is to harmonize similar standards proposals from Europe, Japan, Korea and the United States. S s next-generation deep-space transponder will support turbo codes and implementation of turbo decoders in the Deep Space etwor is planned by 003. The new standard of the Consultative Committe for Space Data Systems (CCSDS) is based on turbo codes. The new standard outperforms by.5 to.8 db the old CCSDS standard based on concatenated convolutional code and Reed-Solomon code. The new European Digital Video Broadcasting (DVB) standard has also adopted turbo codes for the return channel over satellite applications. n this paper we present a new perspective of the use of turbo codes for systems with different order of QM modulations woring at the same time. This perspective that avoids the most difficult part of turbo coding: the computing requirements. The way to avoid these computing requirements is to treat the QM signal lie two M modulations (one in the direction and one in the Q direction) and use the probabilities of the and Q M values as an input to the turbo code process. Papers presented so far for DSL modems using turbo codes give details of only 6QM, and the computational effort is important. nother innovation of the technique proposed here is the mapping used for the modulated signal, providing the most protected bits for the information bits and the least protected bits for the parity bits. n this paper we present the different possible puncturing for each order of a QM modulated signal and we choose the one that provides better performance. This is the first investigation in the performance of turbo codes for all constellation sizes, up to 0 QM. The recommended solutions achieve a target BER very close to the channel capacity for the respective spectral efficiency response. The turbo code schemes proposed here are more power efficient than the trellis coded modulation schemes used traditionally with V.3.bis or V.3 standards. The larger the constellation is the more improvements that this technique provides (i.e. for 6QM the probabilities to compute in a classical turbo code are 6 points with 6 elements each point, with this technique the probabilities to compute are 8 ( in each dimension) with elements each, so if we use 0 iterations the computational savings is more VOCL Technologies Ltd.
3 Lisle, L TE./ than 0*(6*6/8*) = 80 (almost two orders of magnitude); for 56QM the computational savings is more than 0 * (56*56) / (3*6) = 80) (over three orders of magnitude). n the case of the G.99. this technique allow the system to wor at the information rate bit of 00 bps with E b / 0 below db (assuming QM and spectral efficiency of bit/s/hz symbols/s and 00 tones). We propose the use of square QM constellations with different puncturing values as function of the signal-to-noise ratio. The square constellations allow for use of very efficient blind equalization techniques an effective maintaining and Q independent. Taing into account the values of bi and gi we decide which constellation to use and with which parity.. CPCTY BOUDS The minimum E b / 0 values to achieve the Shannon bound, QM, 8QM, 6QM, 3QM, 6QM, 8QM, 56QM, 5QM and 0QM bounds for spectral efficiencies from /3 up to 7 bits/s/hz respectively are as in Table for a BER=0-5. Spectral efficiency η [bit/s/hz] Shannon bound Table. Shannon and QM bounds. QM bound [db] 6 QM bound [db] 6 QM bound [db] 56 QM bound [db] 0 QM bound [db] [db] / The conversion from E s / 0 to E b / 0 is performed using the following relation E b / 0 [db] = E s / 0 [db] - 0 log 0 (η) [db] () where η is the number of information bits per symbol. The required C/ 0 given a certain E b / 0 can be found using the following relation: C/ 0 [db-hz] = E b / 0 [db] + 0 log 0 (R b ) [db-hz] () where R b is the information bit rate. For a D-dimension modulation the following formulae are used: E [ ] E [ ] av SR = a = a = E E [ w ] D D (3) s η b () SR= E = E 0 0 D D VOCL Technologies Ltd.
4 Lisle, L TE./ where is the noise variance in each of the D dimension and η is the number of information bits per symbol. From the above relations: - η = E (5) av 0 3. CODG The proposed coding scheme is shown in Figure.The two systematic recursive codes (SRC) used are identical and are defined in Figure. The code is described by the generating polynomials 35o and 3o. d i + d i nterleaver / SRC p i nput + D D D D / SRC q i Output Figure Figure. MODULTO FOR BT/S/HZ SPECTRL EFFCECY. The scheme proposed in this case combines a rate / coding scheme with QM.. Puncturing n order to obtain a code rate of /, every other bit of the parity bits p and q from Figure are punctured. The puncturing pattern is given in Table. Table. Puncturing and Mapping for Rate / QM. nformation bit (d) d d Parity bit (p) p - Parity bit (q) - q M symbol () (u ) = (d ) (u ) = (d ) M symbol (Q) (u ) = (p ) (u ) = (q ) QM symbol (, Q) (,Q) = (u, u ) = (d, p ) (,Q) = (u, u ) = (d, q )..Modulation QM scheme is shown in Figure 3. n equivalent M modulation is shown in Figure. 0 Q - [d ] = [ 0 ] Figure 3 Figure t time, the symbol u = (u, u ) is sent through the channel and the point r in two dimensional space is received. For a QM constellation with points at - and, The E av is: ( + ) Eav= = (6) [ ] VOCL Technologies Ltd.
5 Lisle, L TE./ For a rate / code and QM, the noise variance is: η x x = Eav = = (7).3 Bit probabilities. For an WG channel the following ressions need to be evaluated: ( ) [- - a, i ] [- ( - ) ] )= i= LLR(u log = log [- ( - a ) ] [- ( - ) ] (8) 0, i 0 i= [- ( Q - a ), i ] [- ( )] Q - B i= LLR(u )= log = log [- ( Q - )] [- ( Q - B )] (9) a 0, i 0 i= The above LLRs are used as inputs to the turbo encoder. There is no need to compute the LLRs for all symbols because and Q signals are treated independently. lso the simulations for the bit-llr values are reduced to one term each. Due to the puncturing, with one in two parity bits being transmitted, the ected performance will be lower when compared with the nonpunctured scheme.. Simulations Results. Figure 5 shows the performance of a turbo code using a 0 bit S-type interleaver. The target BER of 0-7 for a,0 information bit interleaver can be achieve at E b / 0 =. db BER for Rate / QM =,0 bits WG Channel E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it QM bound Shannon bound.00e-06.00e-07.00e /o [db] Figure 5 VOCL Technologies Ltd.
6 Lisle, L TE./ CODG D MODULTO FOR BT/S/HZ SPECTRL EFFCECY. The investigated combines / coding scheme with 6QM. 5. Puncturing. n order to obtain a rate / code, every other bit of the parity bits p and q from Figure are punctured. The puncturing patter is given in Table 3. Table 3. Puncturing and Mapping for Rate / 6QM. nformation bit (d) d d parity bit (p) p - parity bit (q) - q M symbol () (u, u ) = (d, p ) M symbol (Q) (u 3, u ) = (d, p ) 6 QM symbol (, Q) (, Q) = (u, u, u 3, u ) = (d, p, d, p ) 5. Modulation t time, the symbol u = (u, u, u 3, u ) is sent through the channel and the point r in two dimensional space is received. For a 6QM constellation with points at -3, -, and 3, The E av is: ( + )+8( +9 )+(9 +9 ) E = = 0 (0) av 6 For a rate / code and 6QM, the noise variance in each dimension is: η x x =.5 = E = 0 () av t is assumed that the time, u and u modulate the component and u 3 and u modulate the Q component for a 6QM scheme. The symbol u symbol has the following mapping: u = (u, u, u 3, u ) = (d i, p i, d i+,q i+ ). The parity bits are mapped to the least protected bits of the QM symbol. ote that denotes the symbol time index and i the information bit time index. This means a puncturing of one in two parity bits. Considering two independent Gaussian noise sources with identical variance, the LLR can be determined independently for each and Q. t the receiver, the and Q signals are treated independently in order to tae advantage of the simpler formulae for the bit-llr values. The mapping of the information bit is made to the most protected bit in each dimension (u for the signal and u 3 for the Q signal). n order to estimate the performance of this scheme, rate / turbo code and M modulation is used, instead of 6QM modulation. 5.3 Bit probabilities. For an WG channel the following ressions need to be evaluated: ( ) [- - a, i ] [- ( - ) ]+ [- ( - ) ] 3 i= )= = LLR(u log log [- ( - a ) ] [- ( - ) ]+ [- ( - ) ] () 0, i 0 i= - - VOCL Technologies Ltd.
7 Lisle, L TE./ ( ) [- -a, i ] [- ( - ) ]+ [- ( - ) ] 3 i= LLR(u )= log = log [- ( -a ) ] [- ( - ) ]+ [- ( - ) ] (3) 0, i 0 i= [- ( Q -a ), i ] [- ( Q - B) ]+ [- ( )] Q - B3 i= LLR(u 3 )= log = log [- ( Q -a )] [- ( Q - B )]+ [- ( Q - B )] () 0, i 0 i= [- ( Q - a ), i ] [- ( Q - B) ]+ [- ( )] Q - B3 i= LLR(u )= log = log [- ( Q - )] [- ( Q - B )]+ [- ( Q - B )] (5) a 0, i 0 i= The above LLRs are used as inputs to the turbo encoder. There is no need to compute the 6LLRs for all symbols because and Q signals are treated independently. lso the simulations for the bit-llr values are reduced to terms each. Due to the puncturing, with one in two parity bits being transmitted, the ected performance will be lower when compared with the non punctured scheme. 5. Simulations Results. The rate / 6QM scheme described in this chapter achieves the target BER at less than.5 db from capacity. The implementation in hardware is feasible and it can be used at very high data rates. The target BER of 0-7 can be achieved at E b / 0 =.5 db for =0 information bits, as shown in Figure 6. BER for Rate / 6QM, =0 bits S-type, WG Channel.E+00.E-0 (BER).E-0.E-03.E-0.E-05.E-06 it it it QM bound Shannon bound.e-07.e /o [db] Figure 6 VOCL Technologies Ltd.
8 Lisle, L TE./ CODG D MODULTO FOR 3 BT/S/HZ SPECTRL EFFCECY. Three options are investigated in this section. The first scheme combines a rate 3/ coding scheme with 6QM. The second scheme combines a rate 3/ coding scheme with 6QM. 6. Option Rate 3/ Turbo code and 6QM 6.. Puncturing. n order to obtain a rate 3/ code, the puncturing pattern given in Table is used. Table. Puncturing and Mapping for Rate 3/ 6QM nformation bit (d) d d d 3 d d 5 d 6 parity bit (p) - p parity bit (q) q 5 - M symbol () (d, d ) (d, d 5 ) M symbol (Q) (d 3, p ) (d 6, p 5 ) 6 QM symbol (,Q) (,Q) = (d, d, d 3, p ) (, Q) = (d, d 5, d 6, q 5 ) 6.. Modulation t is assumed that at time, u and u modulate the component and u 3 and u modulate the Q component of a 6QM scheme. n order to estimate the performance of this scheme, rate 3/ turbo codes and M modulation are used. For a rate 3/ code and 6QM, noise variance is: η x3x 0 = = Eav = 0 (6) The puncturing and mapping scheme is shown in Table for 6 consecutive information bits that are encoded into 8 coded bits, therefore two 6QM symbols Bit Probabilities For each received symbol, the bit probabilities are computed as described in equations ()-(5). 6.. Simulation Results Figure 7 shows the simulation results for 6, information bits with S-type interleaver. BER of 0-7 can be achieved after 8 iterations at E b / 0 = 5.75 db for = 6 information bits. 6. Option Rate 3/6 Turbo code and 6QM 6.. Puncturing. n order to obtain a rate 3/6 code, the puncturing patter used is given in Table 5. Table 5. Puncturing and Mapping for Rate 3/6 6QM nformation bit (d) d d d 3 d d 5 d 6 parity bit (p) p - p 3 - p 5 - parity bit (q) - Q - q - q 6 8M symbol () (d, d, p ) (d, d 5, q ) 8M symbol (Q) (d 3, p 3, q ) (d 6, p 5, q 6 ) 6 QM symbol (, Q) (,Q)=(d,d, p,d 3, p 3,q ) (,Q)= (d,d 5, q,d 6, p 5,q 6 ) VOCL Technologies Ltd.
9 Lisle, L TE./ BER for Rate 3/ 6QM, =6, bits S-type, WG Channel.E+00.E-0 (BER).E-0.E-03.E-0.E-05.E-06 it it it QM bound Shannon bound.e-07.e /o [db] 6.. Modulation Figure 7 t time, the symbol u = (u, u, u 3, u, u 5, u 6 ), is sent through the channel and the point r in two dimensional space is received. t is assumed that at time u, u and u 3 modulate the component and u, u 5 and u 6 modulate the Q component of a 6QM scheme. For 6QM constellations with points at -7, -5, -3, -,, 3, 5, 7 The E av is: E av = (8(9+5+9+)+8( )+8(5+9+5+)+8(9+)) / 6= (7) For a rate 3/6 code and 6QM, the noise variance in each dimension is: η x3x = = Eav = (8) 0 n order to estimate the performance of this scheme, when rate 3/6 turbo codes and 8M modulation is used. The puncturing and mapping scheme is shown in Table 5 for 6 consecutive information bits that are encoded into coded bits, therefore two 6QM symbols Bit Probabilities For an WG channel, the following ressions need to be evaluated for the dimension: = LLR(u ) = log i= i= [- [- - a ] = - a ] (,i) ( 0,i) [- ( - ) ]+ [- ( - 5) ]+ [- ( - 6) ]+ [- ( - 7) ] n log [- ( - 0) ]+ [- ( - ) ]+ [- ( - ) + [ ( - 3) ] (9) VOCL Technologies Ltd.
10 Lisle, L TE./ = = log log LLR(u ) = i= i= [- [- - a ] = - a ] (,i) ( 0,i) [- ( - ) ]+ [- ( - 3) ]+ [- ( - 6) ]+ [- ( - 7) ] n [- ( - 0) ]+ [- ( - ) ]+ [- ( - ) + [ ( - 5) ] LLR(u ) = log 3 i= i= [- [- - a ] = - a ] (,i) ( 0,i) [- ( - ) ]+ [- ( - 5) ]+ [- ( - 3) ]+ [- ( - 7) ] n [- ( - 0) ]+ [- ( - ) ]+ [- ( - ) + [ ( - 6) ] log (0) () n identical computation effort is required for the Q dimension, the being replaced with the Q demodulated value in order to evaluate LLR(u ), LLR(u 5 ) and LLR(u 6 ). 6.. Simulation Results Figure 8 shows the simulation results for 6, information bits with S-type interleaver. BER of 0-7 can be achieved after 8 iterations at E b / 0 = 6. db for = 6, information bits. This result is 0.5 db worse than the performance of the rate 3/ 6QM scheme. BER for Rate 3/6 6QM, =6, bits S-type, WG Channel.E+00.E-0 (BER).E-0.E-03.E-0.E-05 it it it QM bound Shanon bound.e-06.e-07.e /o [db] Figure 8 VOCL Technologies Ltd.
11 Lisle, L TE./ CODG D MODULTO FOR BT/S/HZ SPECTRL EFFCECY. This section investigated four schemes for transmission of information bits in a 6 QM symbol. The mapping used for 6QM constellation has a very significant impact on the performance of these schemes. The first scheme uses independent and Q mapping and also uses Gray mapping in each dimension. The second scheme uses independent and Q mapping, but natural mapping in each dimension. The third scheme used a conventional trellis coded modulation approach based on Ungerboec set partitioning of the 6QM set. This partitioning technique splits the constellation in sub-constellations with increased Euclidian distance. n these schemes all the information bits are coded. The fourth scheme used the same conventional trellis coded modulation approach based on Ungerboec set partitioning of the 6QM set. However, only two information bits are encoded by a rate / code. The four coded bits select a subpartition of four points. The other two information bits, which are sent uncoded, identify the transmitted point. 7. Option Rate /6 6QM with independent and Q and with Gray Mapping. 7.. Puncturing n order to obtain a rate /6 code, the puncturing patter used is shown in Table 6. Table 6. Puncturing and Mapping for Rate /6 6QM Option nformation bit (d) d d d 3 d parity bit (p) p parity bit (q) - - q 3-8M symbol () (d, d, p ) 8M symbol (Q) (d 3, d, q 3 ) 6 QM symbol (, Q) (,Q)=(d,d, p,d 3, d,q 3 ) 7.. Modulation Gray mapping was used in each dimension. Four information bits are required to be sent using a 6QM constellation. For a rate /6 code and 6QM, the noise variance in each dimension is - η x x = Eav = = 5.5 () The puncturing and mapping scheme is shown in Table 6 for consecutive information bits that are encoded into 6 coded bits, therefore one 6QM symbol.the turbo encoder with the puncturing presented in Table 6 is a rate /6 turbo code which in conjunction with 6QM gives a spectral efficiency of bits/s/hz. Considering two independent Gaussian noises with identical variance, the LLR can be determined independently for each and Q. t is assumed that at time u, u and u 3 modulate the component and u, u 5 and u 6 modulate the Q component of the 6QM scheme. t the receiver, the and Q signals are treated independently in order to tae advantage of the simpler formulae for the LLR values Bit Probabilities From each received symbol, the bit probabilities are computed as follows: - - VOCL Technologies Ltd.
12 Lisle, L TE./ [- = log [- [- = log [- [- = log [- ( - ) ( - ) ] = ] ( - ) ] + [- ( - ) ] + [- ( - ) ] + [- ( - ) ( - ) ] + [- ( - ) ] + [- ( - ) + [ ( - ) ] 0 LLR( u )= log i= i= [- [- 5 a a, i 0, i ( - ) ( - ) 6 ] = ] n ( - ) ] + [- ( - ) ] + [- ( - ) ] + [- ( - ) ( - ) ] + [- ( - ) ] + [- ( - ) + [ ( - ) ] 0 LLR( u )= log i= i= [- [- 3 a a, i 0, i ( - ) ( - ) 6 ] = ] ( - ) ] + [- ( - ) ] + [- ( - ) ] + [- ( - ) ( - ) ] + [- ( - ) ] + [- ( - ) + [ ( - ) ] 0 LLR( u3 )= log i= i= [- [- 5 a a, i 0, i 3 n n ] ] ] (3) () (5) For dimension. n identical computation effort is required for the Q dimension, the being replaced with the Q demodulated value in order to evaluate LLR(u ), LLR(u 5 ) and LLR(u 6 ). 7.. Simulation Results Figure 9 shows the simulation results for,096 information bits with S-type interleaver. BER of 0 7 can be achieved after 8 iterations at E b / 0 = 8.3 db. 7. Option Rate /6 6QM with independent and Q and atural Mapping. 7.. Puncturing n order to obtain a rate /6 code, the puncturing patter used is shown in Table 7. Table 7. Puncturing and Mapping for Rate /6 6QM Option nformation bit (d) d d d 3 d parity bit (p) p parity bit (q) - - q 3-8M symbol () (d, d, p ) 8M symbol (Q) (d 3, d, q 3 ) 6 QM symbol (, Q) (,Q)=(d,d, p,d 3, d,q 3 ) VOCL Technologies Ltd.
13 Lisle, L TE./ BER for Rate /6 6QM =,096 bits WG Channel, Gray Mapping.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it QM bound Shannon bound.00e-06.00e-07.00e /o [db] 7.. Modulation Figure 9. atural mapping is used in each dimension. Four information bits are required to be sent using a 6QM constellation. This is equivalent to a rate /3 coding scheme. For a rate /6 code and 6QM, the noise variance in each dimension is = E av η 0 - b = xx E 0 - b = 5.5 E 0 - (6) The puncturing and mapping scheme is shown in Table 7 for consecutive information bits that are encoded into 6 coded bits, therefore one 6QM symbol. The turbo encoder with the puncturing presented in Table 7 is a rate /6 turbo code which in conjunction with 6QM gives a spectral efficiency of bits/s/hz. Considering two independent Gaussian noises with identical variance, the LLR can be determined independently for each and Q. t is assumed that at time u, u and u 3 modulate the component and u, u 5 and u 6 modulate the Q component of the 6QM scheme. t the receiver, the and Q signals are treated independently in order to tae advantage of the simpler formulae for the LLR values Bit Probabilities From each received symbol, the bit probabilities are computed as described in equations (3) () and (5) for dimension. n identical computation effort is required for the Q dimension, the being replaced with the Q demodulated value in order to evaluate LLR(u ), LLR(u 5 ) and LLR(u 6 ). VOCL Technologies Ltd.
14 Lisle, L TE./ Simulation Results Figure 0 shows the simulation results for,096 information bits with S-type interleaver. BER of 0 7 can be achieved after 8 iterations at E b / 0 = 0.5 db..00e+00 BER for Rate /6 6QM =,096 bits WG Channel, atural Mapping.00E-0.00E-0.00E-03.00E-0.00E-05 it it it QM bound Shannon bound.00e-06.00e-07.00e /o [db] Figure 0 8. CODG D MODULTO FOR 5 BT/S/HZ SPECTRL EFFCECY. This section investigated a rate 5/8 coding scheme with 56QM. 8. Puncturing n order to obtain a rate 5/8 code, the puncturing patter used is shown in Table 8. Table 8. Puncturing and Mapping for Rate 5/8 56QM nformation bit (d) d d d 3 d d 5 d 6 d 7 d 8 d 9 d 0 parity bit (p) p p p parity bit (q) - - q 3 - q q 0 6M symbol () (d, d, d 3, p ) (d 6, d 7, d 8, q 6 ) 6M symbol (Q) (d, d 5, q 3,p 5 ) (d 9, d 0, p 8,q 0 ) 56 QM symbol (, Q) (d,d,d 3,p,d,d 5,q 3, p 5 ) (d 6,d 7,d 8,q 6,d 9,d 0,p 8, q 0 ) 8. Modulation For a 56QM constellation with points at 5, -3, -, -9, -7, -5, -3, -,, 3, 5, 7, 9,, 3, 5. E av is: VOCL Technologies Ltd.
15 Lisle, L TE./ E av = 70 (7) t is assumed that at time the symbol u = (u, u, u 3, u, u 5, u 6, u 7, u 8 ) is sent though the channel. t is assumed that at time the symbol u, u, u 3 and u modulate the component and u 5, u 6, u 7 and u 8 modulate the Q component of a 56QM scheme. For a rate 5/8 code and 56QM, the noise variance is: - η x 5 x = = Eav = (8) 0 n order to study the performance of this scheme, a rate 5/8 turbo code and a 6M is used. The 56QM scheme will achieve a similar performance in terms of bit error rate (BER) at twice the spectral efficiency, assuming an ideal demodulator. The puncturing and mapping scheme shown in Table 8 is for 0 consecutive information bits that are coded into 6 encoded bits, therefore, one 56QM symbol. The turbo encoder is a rate 5/8 turbo code, which in conjunction with 56QM, gives a spectral efficiency of 5 bits/s/hz. 8.3 Bit Probabilities The 6M symbol is defined as u = (u, u, u 3, u ), where u is the most significant bit and u is the least significant bit. The following set can be defined.. bit--is-0 = { 0,,, 3,, 5, 6, 7 }. bit--is- = { 8, 9, 0,,, 3,, 5 } 3. bit--is-0 = { 0,,, 3, 8, 9, 0, }. bit--is- = {, 5, 6, 7,, 3,, 5 } 5. bit-3-is-0 = { 0,,, 5, 8, 9,, 3 } 6. bit-3-is- = {, 3, 6, 7, 0,,, 5 } 7. bit--is-0 = { 0,,, 6, 8, 0,, } 8. bit--is- = {, 3, 5, 7, 9,, 3, 5 } From each received symbol, R, the bit probabilities are computed as follows: - - R i LLR( )= i b i t--i s- u log (9) - R - j b i t--i s-0 j - - R i LLR( )= i b i t--i s- u log (30) - R - j b i t--i s-0 j - - R i b i t-3-i s- i LLR( u3 )= log (3) - R - j b i t-3-i s-0 j - - R i i LLR( u )= b i t--i s- log (3) - R - j b i t--i s-0 j - - VOCL Technologies Ltd.
16 Lisle, L TE./ Simulation Results Figure shows the simulation results for 5,0 information bits (,0QM symbols) with S- type interleaver. BER of 0 7 can be achieved after 8 iterations at E b / 0 =.8 db. BER for Rate 5/8 56QM =5,0 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05.00E-06 it it it QM bound Shannon bound.00e-07.00e /o [db] Figure 9. CODG D MODULTO FOR 6 BT/HZ SPECTRL EFFCECY This section investigates a rate 6/8 coding scheme with 56QM. 9. Puncturing n order to obtain a rate 6/8 code, the puncturing patter used is shown in Table 9. Table 9. Puncturing and Mapping for Rate 6/8 56QM Option nformation bit (d) d d d 3 d d 5 d 6 parity bit (p) p parity bit (q) q - - 6M symbol () (d, d, d 3, p ) 6M symbol (Q) (d, d 5, d 6, q ) 56QM symbol (, Q) (,Q ) = (d,d, d 3, p, d,d 5, d 6, q ) 9. Modulation t is assumed that at time the symbol u = (u, u, u 3, u, u 5, u 6, u 7, u 8 ) is sent though the channel. t is assumed that at time the symbol u, u, u 3 and u modulate the component and u 5, u 6, u 7 and u 8 modulate the Q component of a 56QM scheme. VOCL Technologies Ltd.
17 Lisle, L TE./ For a rate 6/8 code and 56QM, the noise variance is: - η x 6 x = = Eav = (33) The puncturing and mapping scheme shown in Table is for 6 consecutive information bits that are coded into 8 coded bits, therefore, one 56QM symbol. The turbo encoder is a rate 6/8 turbo code, which in conjunction with 56QM, gives a spectral efficiency of 6 bits/s/hz. 9.3 Bit Probabilities The 6M symbol is defined as u = (u, u, u 3, u ), where u is the most significant bit and u is the least significant bit. The following set can be defined.. bit--is-0 = { 0,,, 3,, 5, 6, 7 }. bit--is- = { 8, 9, 0,,, 3,, 5 } 3. bit--is-0 = { 0,,, 3, 8, 9, 0, }. bit--is- = {, 5, 6, 7,, 3,, 5 } 5. bit-3-is-0 = { 0,,, 5, 8, 9,, 3 } 6. bit-3-is- = {, 3, 6, 7, 0,,, 5 } 7. bit--is-0 = { 0,,, 6, 8, 0,, } 8. bit--is- = {, 3, 5, 7, 9,, 3, 5 } From each received symbol, R, the bit probabilities are computed as equations (9) to (3). 9. Simulation Results Figure shows the simulation results for 6, information bits (,0QM symbols) with S- type interleaver. BER of 0 7 can be achieved after 8 iterations at E b / 0 =. db. BER for Rate 6/8 56QM =6, bits WG Channel E+00.00E-0.00E-0.00E-03.00E-0.00E-05.00E-06 it it it QM bound Shannon bound.00e-07.00e /o [db] Figure VOCL Technologies Ltd.
18 Lisle, L TE./ CODG D MODULTO FOR 7 BT/HZ SPECTRL EFFCECY This section investigated one scheme that use independent and Q modulation. The scheme combines a rate 7/0 coding scheme with 0QM. 0. Puncturing n order to obtain a rate 7/0 code, the puncturing patter used is shown in Table. Table. Puncturing and Mapping for Rate 7/0 0QM nformation bit (d) d d d 3 d d 5 d 6 d 7 d 8 d 9 d 0 d parity bit (p) p p p d d 3 d parity bit (q) - - q q q 3-3M symbol () (d, d, d 3, p, q 3 ) (d 8, d 9, d 0, d, q 8 ) 3M symbol (Q) (d, d 5, d 6, d 7, p 6 ) (d, d 3, d, p, q 3 ) 0QM symbol (d,d, d 3, p, q 3,d,d 5, d 6,d 7,p 6 ) (d 8,d 9,d 0,d,q 8,d,d 3,d,p,q 3 ) 0. Modulation t is assumed that at time the symbol u = (u, u, u 3, u, u 5, u 6, u 7, u 8 u 9, u 0 ) is sent though the channel. t is assumed that at time the symbol u, u, u 3, u and u 5 modulate the component and u 6, u 7, u 8, u 9 and u 0 modulate the Q component of a 0QM scheme. For a 0QM constellation with points at -3, -9, -7, -5, -3, -, -9, -7, - 5, -3, -, -9, -7, -5, -3, -,, 3, 5, 7, 9,, 3, 5, 7, 9,, 3, 5, 7, 9, 3. E av is: E av = 68 (3) For a rate 7/0 code and 5QM, the noise variance is: - η x 7 x = = Eav = (35) The puncturing and mapping scheme shown in Table is for consecutive information bits that are coded into 0 coded bits, therefore, two 0QM symbols. The turbo encoder is a rate 7/0 turbo code, which in conjunction with 0QM, gives a spectral efficiency of 7 bits/s/hz. 0.3 Bit Probabilities The 3M symbol is defined as u = (u, u, u 3, u, u 5 ), where u is the most significant bit and u 5 is the least significant bit. The following set can be defined.. bit--is-0 = { 0,,, 3,, 5, 6, 7, 8, 9, 0,,, 3,, 5 }. bit--is- = { 6, 7, 8, 9, 0,,, 3,, 5, 6, 7, 8, 9, 30, 3 } 3. bit--is-0 = { 0,,, 3,, 5, 6, 7, 6, 7, 8, 9, 0,,, 3 }. bit--is- = { 8, 9, 0,,, 3,, 5,, 5, 6, 7, 8, 9, 30, 3 } 5. bit-3-is-0 = { 0,,, 3, 8, 9, 0,, 6, 7, 8, 9,, 5, 6, 7 } 6. bit-3-is- = {, 5, 6, 7,, 3,, 5, 0,,, 3, 8, 9, 30, 3 } 7. bit--is-0 = { 0,,, 5, 8, 9,, 3, 6, 7, 0,,, 5, 8, 9 } 8. bit--is- = {, 3, 6, 7, 0,,, 5, 8, 9,, 3, 6, 7, 30, 3 } 9. bit-5-is-0 = { 0,,, 6, 8, 0,,, 6, 8, 0,,, 6, 8, 30 } 0. bit-5-is- = {, 3, 5, 7, 9,, 3, 5, 7, 9,, 3, 5, 7, 9, 3 } - - VOCL Technologies Ltd.
19 Lisle, L TE./ From each received symbol, R, the bit probabilities are computed as follows: - - R i LLR( )= i b i t--i s- u log (36) - R - j b i t--i s-0 j - - R i LLR( )= i b i t--i s- u log (37) - R - j b i t--i s-0 j - - R i b i t-3-i s- i LLR( u3 )= log (38) - R - j b i t-3-i s-0 j - - R i i LLR( u )= b i t--i s- log (39) - R - j b i t--i s-0 j - - R i i b i t-5-i s- LLR( u )= log (0) 5 - R - j b i t- -i s-0 j 5 0. Simulation Results Figure 3 shows the simulation results for,08 information bits (,0QM symbols) with S- type interleaver. BER of 0 7 can be achieved after 8 iterations at E b / 0 = 7 db. BER for Rate 7/0 0QM =,0 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05.00E-06 it it it QM bound Shannon bound.00e-07.00e /o [db] VOCL Technologies Ltd. Figure 3
20 Lisle, L TE./ POWER VS. BDWDTH WG CHEL This section gives an estimate of the trade off which can be achieved between minimum required E b / 0 and bandwidth efficiency. n information data rate of,08 Mbit/s and a maximum transmitter delay of ms is considered. The corresponding interleaver size is,08 bits.. Channel model ll the simulations assumed the additive white Gaussian noise (WG) channel model, with independent and Q signals.. Simulation Results Simulations were run for bandwidth efficiencies from to 7 bit/symbol using the recommended coding and modulation schemes. The results are shown in Figures to 0. BER for Rate / QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure VOCL Technologies Ltd.
21 Lisle, L TE./ BER for Rate / 6QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 5 BER for Rate 3/ 6QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 6 VOCL Technologies Ltd.
22 Lisle, L TE./ E+00 BER for Rate /6 6QM =,00 bits WG Channel.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 7 BER for Rate 5/8 56QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 8 VOCL Technologies Ltd.
23 Lisle, L TE./ BER for Rate 6/8 56QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 9 BER for Rate 7/0 0QM =,00 bits WG Channel.00E+00.00E-0.00E-0.00E-03.00E-0.00E-05 it it it.00e-06.00e-07.00e /o [db] Figure 0 VOCL Technologies Ltd.
24 Lisle, L TE./ Conclusions Table summarizes the minimum E b / 0 required to achieve a BER of 0 7. Table Minimum E b / 0 required to achieve a BER of 0 7 Spectral efficiency η [bits/s/hz] Coding Rate nd Modulation Symbol Rate [sym/s] E b / 0 For BER = 0-7 [db] / and QM 08. / and 6QM / and 6QM /6 and 6QM /8 and 56QM /8 and 56QM /0 and 0QM The results show the potential reduction in bandwidth for a given signal-to-noise ration for a particular channel. f an E b / 0 of 7 db or more is available, the symbol rate can be reduced from 0 sym/s to 9 sym/s, a reduction of more than 70%.. COCLUSOS Table summarizes all simulation results from this study. Table. Summary of Some Simulation Results. Spectral nterleaver size Required QM efficiency Coding Modulation E b / 0 bound η[bits/s/hz] Rate [nformation [db] [db] bits] / QM,0..0 / 6QM / 6QM / 6QM,0.5. / 6QM,08.. / 6QM 3, / 6QM, / 6QM, /6 6QM, /6 6QM, /6 6QM-, /6 6QM-, /6 6QM 5, /8 56QM, /8 56QM 5, /8 56QM, /8 56QM 6, /0 0QM, PROPOSL We propose that the TE. committee supports to include in the G.99..bis and G.99..bis this proposal for Forward Error Correction DSL without Reed Solomon codes. These results are so close to the QM bounds that the Reed-Solomon is not needed. nstead of using Reed-Solomon as outer encoder we propose to use a longer interleaver in the turbo coder, up to 3768 information bits, that allow better results with the same global delay. VOCL Technologies Ltd.
Turbo Codes for xdsl modems
Turbo Codes for xdsl modems Juan Alberto Torres, Ph. D. VOCAL Technologies, Ltd. (http://www.vocal.com) John James Audubon Parkway Buffalo, NY 14228, USA Phone: +1 716 688 4675 Fax: +1 716 639 0713 Email:
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationMapper & De-Mapper System Document
Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation
More informationNAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00
NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR Sp ' 00 May 3 OPEN BOOK exam (students are permitted to bring in textbooks, handwritten notes, lecture notes
More informationNew Puncturing Pattern for Bad Interleavers in Turbo-Codes
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 2, November 2009, 351-358 UDK: 621.391.7:004.052.4 New Puncturing Pattern for Bad Interleavers in Turbo-Codes Abdelmounaim Moulay Lakhdar 1, Malika
More informationCommunication Theory II
Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic
More informationResearch on Unequal Error Protection with Punctured Turbo Codes in JPEG Image Transmission System
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 4, No. 1, June 007, 95-108 Research on Unequal Error Protection with Punctured Turbo Codes in JPEG Image Transmission System A. Moulay Lakhdar 1, R. Méliani,
More informationPUNCTURED 8-PSK TURBO-TCM TRANSMISSIONS USING RECURSIVE SYSTEMATIC CONVOLUTIONAL GF ( 2 N ) ENCODERS
19th European Signal Processing Conference (EUSIPCO 2011) Barcelona, Spain, August 29 - September 2, 2011 PUCTURED 8-PSK TURBO-TCM TRASMISSIOS USIG RECURSIVE SYSTEMATIC COVOLUTIOAL GF ( 2 ) ECODERS Calin
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
More informationPerformance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels
Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary
More informationAALTO UNIVERSITY School of Electrical Engineering. Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES
AALTO UNIVERSITY School of Electrical Engineering Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES Thesis submitted for examination for the degree of Master of Science in Technology
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationTHE EFFECT OF PUNCTURING ON THE CONVOLUTIONAL TURBO-CODES PERFORMANCES
THE EFFECT OF PUNCTURING ON THE CONVOLUTIONAL TURBO-COES PERFORMANCES Horia BALTA 1, Lucian TRIFINA, Anca RUSINARU 1 Electronics and Telecommunications Faculty, Bd. V. Parvan, 1900 Timisoara, ROMANIA,
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationChannel Coding and Interleaving
Lecture 6 Channel Coding and Interleaving 1 LORA: Future by Lund www.futurebylund.se The network will be free for those who want to try their products, services and solutions in a precommercial stage.
More informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
More information1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g
Exercise Generator polynomials of a convolutional code, given in binary form, are g 0, g 2 0 ja g 3. a) Sketch the encoding circuit. b) Sketch the state diagram. c) Find the transfer function TD. d) What
More informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
More informationIEEE C802.16a-02/66. IEEE Broadband Wireless Access Working Group <http://ieee802.org/16>
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group Method for using non-squared QAM constellations 2002-05-23 Source(s) Re: Juan Alberto Torres VOCAL
More informationAdaptive Bit-Interleaved Coded OFDM over Time-Varying Channels
Adaptive Bit-Interleaved Coded OFDM over Time-Varying Channels Jin Soo Choi, Chang Kyung Sung, Sung Hyun Moon, and Inkyu Lee School of Electrical Engineering Korea University Seoul, Korea Email:jinsoo@wireless.korea.ac.kr,
More informationIEEE Working Group on Mobile Broadband Wireless Access. <http://grouper.ieee.org/groups/802/20/>
C802.20-07/35 Project IEEE 802.20 Working Group on Mobile Broadband Wireless Access Title Date Submitted Practice letter ballot 2 comment LDPC harmonized text from
More informationQPP Interleaver Based Turbo-code For DVB-RCS Standard
212 4th International Conference on Computer Modeling and Simulation (ICCMS 212) IPCSIT vol.22 (212) (212) IACSIT Press, Singapore QPP Interleaver Based Turbo-code For DVB-RCS Standard Horia Balta, Radu
More informationTrellis Coded Modulation
Trellis Coded Modulation Trellis coded modulation (TCM) is a marriage between codes that live on trellises and signal designs We have already seen that trellises are the preferred way to view convolutional
More informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationTurbo Codes. Manjunatha. P. Professor Dept. of ECE. June 29, J.N.N. College of Engineering, Shimoga.
Turbo Codes Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga June 29, 2013 [1, 2, 3, 4, 5, 6] Note: Slides are prepared to use in class room purpose, may
More informationThe Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks
The Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks Gerald Matz Institute of Telecommunications Vienna University of Technology institute of telecommunications Acknowledgements
More informationTurbo Codes for Deep-Space Communications
TDA Progress Report 42-120 February 15, 1995 Turbo Codes for Deep-Space Communications D. Divsalar and F. Pollara Communications Systems Research Section Turbo codes were recently proposed by Berrou, Glavieux,
More informationNon-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel.
UCLA Graduate School of Engineering - Electrical Engineering Program Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel. Miguel Griot, Andres I. Vila Casado, and Richard
More informationOptimized Symbol Mappings for Bit-Interleaved Coded Modulation with Iterative Decoding
Optimized Symbol Mappings for Bit-nterleaved Coded Modulation with terative Decoding F. Schreckenbach, N. Görtz, J. Hagenauer nstitute for Communications Engineering (LNT) Munich University of Technology
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More informationOn the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding
On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding Jörg Kliewer, Soon Xin Ng 2, and Lajos Hanzo 2 University of Notre Dame, Department of Electrical Engineering, Notre Dame,
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationRevision of Lecture 5
Revision of Lecture 5 Information transferring across channels Channel characteristics and binary symmetric channel Average mutual information Average mutual information tells us what happens to information
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationPractical Polar Code Construction Using Generalised Generator Matrices
Practical Polar Code Construction Using Generalised Generator Matrices Berksan Serbetci and Ali E. Pusane Department of Electrical and Electronics Engineering Bogazici University Istanbul, Turkey E-mail:
More informationA First Course in Digital Communications
A First Course in Digital Communications Ha H. Nguyen and E. Shwedyk February 9 A First Course in Digital Communications 1/46 Introduction There are benefits to be gained when M-ary (M = 4 signaling methods
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationLow-Density Parity-Check codes An introduction
Low-Density Parity-Check codes An introduction c Tilo Strutz, 2010-2014,2016 June 9, 2016 Abstract Low-density parity-check codes (LDPC codes) are efficient channel coding codes that allow transmission
More informationA NEW CHANNEL CODING TECHNIQUE TO APPROACH THE CHANNEL CAPACITY
A NEW CHANNEL CODING TECHNIQUE TO APPROACH THE CHANNEL CAPACITY Mahesh Patel 1 and A. Annamalai 1 1 Department of Electrical and Computer Engineering, Prairie View A & M University, TX 77446, United States
More informationA Hyper-Trellis based Turbo Decoder for Wyner-Ziv Video Coding
A Hyper-Trellis based Turbo Decoder for Wyner-Ziv Video Coding Arun Avudainayagam, John M. Shea and Dapeng Wu Wireless Information Networking Group (WING) Department of Electrical and Computer Engineering
More informationMAHALAKSHMI ENGINEERING COLLEGE-TRICHY QUESTION BANK UNIT V PART-A. 1. What is binary symmetric channel (AUC DEC 2006)
MAHALAKSHMI ENGINEERING COLLEGE-TRICHY QUESTION BANK SATELLITE COMMUNICATION DEPT./SEM.:ECE/VIII UNIT V PART-A 1. What is binary symmetric channel (AUC DEC 2006) 2. Define information rate? (AUC DEC 2007)
More informationR. A. Carrasco and M. Johnston, Non-Binary Error Control Coding Cork 2009
Design of Non-Binary Error-Correction Codes and their Applications R. A. Carrasco and. Johnston, Non-Binary Error Control Coding for Wireless Communication and Data Storage, Wiley, SBN 978-- 7-89-9 Prof.
More informationLow-Density Parity-Check Code Design Techniques to Simplify Encoding
IPN Progress Report 42-171 November 15, 27 Low-Density Parity-Check Code Design Techniques to Simplify Encoding J. M. Perez 1 and K. Andrews 2 This work describes a method for encoding low-density parity-check
More informationCode Concatenation and Low-Density Parity Check Codes
Contents 11 Code Concatenation and Low-Density Parity Check Codes 254 11.1CodeConcatenation...256 11.1.1 SerialConcatenation...256 11.1.2 ParallelConcatenation...256 11.1.3 ultilevelcoding...257 11.2Interleaving...258
More informationLow-density parity-check codes
Low-density parity-check codes From principles to practice Dr. Steve Weller steven.weller@newcastle.edu.au School of Electrical Engineering and Computer Science The University of Newcastle, Callaghan,
More informationA Systematic Description of Source Significance Information
A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh
More informationSymbol Interleaved Parallel Concatenated Trellis Coded Modulation
Symbol Interleaved Parallel Concatenated Trellis Coded Modulation Christine Fragouli and Richard D. Wesel Electrical Engineering Department University of California, Los Angeles christin@ee.ucla. edu,
More informationSome UEP Concepts in Coding and Physical Transport
Some UEP Concepts in Coding and Physical Transport Werner Henkel, Neele von Deetzen, and Khaled Hassan School of Engineering and Science Jacobs University Bremen D-28759 Bremen, Germany Email: {w.henkel,
More information2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor
SYSTEM ARCHITECTURE ADVANCED SYSTEM ARCHITECTURE Error Correction Code 1 01/Fall-Winter Term Monday 1:50 Room# 1- or 5F Meeting Room Instructor: Fire Tom Wada, Professor 014/1/0 System Arch 1 Introduction
More informationEVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS
EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS Ramin Khalili, Kavé Salamatian LIP6-CNRS, Université Pierre et Marie Curie. Paris, France. Ramin.khalili, kave.salamatian@lip6.fr Abstract Bit Error
More informationConvolutional Codes. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 6th, 2008
Convolutional Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 6th, 2008 Telecommunications Laboratory (TUC) Convolutional Codes November 6th, 2008 1
More informationR. Garello. Tutorial on digital modulations - Part 9b m-pam [ ] 2
TUTORIAL ON DIGITAL MODULATIONS Part 9: m-pam [2010-1-26] 26] Roerto Garello, Politecnico di Torino Free download at: www.tlc.polito.it/garello (personal use only) 1 m-pam constellations: characteristics
More informationMaximum mutual information vector quantization of log-likelihood ratios for memory efficient HARQ implementations
Downloaded from orbit.dtu.dk on: Apr 29, 2018 Maximum mutual information vector quantization of log-likelihood ratios for memory efficient HARQ implementations Danieli, Matteo; Forchhammer, Søren; Andersen,
More informationMAHALAKSHMI ENGINEERING COLLEGE QUESTION BANK. SUBJECT CODE / Name: EC2252 COMMUNICATION THEORY UNIT-V INFORMATION THEORY PART-A
MAHALAKSHMI ENGINEERING COLLEGE QUESTION BANK DEPARTMENT: ECE SEMESTER: IV SUBJECT CODE / Name: EC2252 COMMUNICATION THEORY UNIT-V INFORMATION THEORY PART-A 1. What is binary symmetric channel (AUC DEC
More informationMulti-Edge Low-Density Parity-Check Coded Modulation. Lei Zhang
Multi-Edge Low-Density Parity-Check Coded Modulation by Lei Zhang A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department of Edward Rogers
More informationA Study on Simulating Convolutional Codes and Turbo Codes
A Study on Simulating Convolutional Code and Turbo Code Final Report By Daniel Chang July 27, 2001 Advior: Dr. P. Kinman Executive Summary Thi project include the deign of imulation of everal convolutional
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationConvolutional Codes Klaus von der Heide
Convolutional Codes Klaus von der Heide Convolutional codes encode a stream of symbols into n streams of symbols. 1/n = R is called the code rate. A second important parameter is the constraint length
More informationTurbo Codes are Low Density Parity Check Codes
Turbo Codes are Low Density Parity Check Codes David J. C. MacKay July 5, 00 Draft 0., not for distribution! (First draft written July 5, 998) Abstract Turbo codes and Gallager codes (also known as low
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationBit-wise Decomposition of M-ary Symbol Metric
Bit-wise Decomposition of M-ary Symbol Metric Prepared by Chia-Wei Chang Advisory by Prof. Po-Ning Chen In Partial Fulfillment of the Requirements For the Degree of Master of Science Department of Communications
More informationConsider a 2-D constellation, suppose that basis signals =cosine and sine. Each constellation symbol corresponds to a vector with two real components
TUTORIAL ON DIGITAL MODULATIONS Part 3: 4-PSK [2--26] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello Quadrature modulation Consider a 2-D constellation,
More informationCoding on a Trellis: Convolutional Codes
.... Coding on a Trellis: Convolutional Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 6th, 2008 Telecommunications Laboratory (TUC) Coding on a Trellis:
More informationarxiv: v1 [cs.it] 20 Nov 2010
1 Gaussian Broadcast Channels with an Orthogonal and Bidirectional Cooperation Link E. V. Belmega, B. Djeumou and S. Lasaulce Laboratoire des Signaux et Systèmes arxiv:1011.4602v1 [cs.t] 20 Nov 2010 CNRS
More informationA new analytic approach to evaluation of Packet Error Rate in Wireless Networks
A new analytic approach to evaluation of Packet Error Rate in Wireless Networks Ramin Khalili Université Pierre et Marie Curie LIP6-CNRS, Paris, France ramin.khalili@lip6.fr Kavé Salamatian Université
More informationTHE ANALYTICAL DESCRIPTION OF REGULAR LDPC CODES CORRECTING ABILITY
Transport and Telecommunication Vol. 5, no. 3, 04 Transport and Telecommunication, 04, volume 5, no. 3, 77 84 Transport and Telecommunication Institute, Lomonosova, Riga, LV-09, Latvia DOI 0.478/ttj-04-005
More informationVHDL Implementation of Reed Solomon Improved Encoding Algorithm
VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of
More informationMessage-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras
Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed
More informationEncoder. Encoder 2. ,...,u N-1. 0,v (0) ,u 1. ] v (0) =[v (0) 0,v (1) v (1) =[v (1) 0,v (2) v (2) =[v (2) (a) u v (0) v (1) v (2) (b) N-1] 1,...
Chapter 16 Turbo Coding As noted in Chapter 1, Shannon's noisy channel coding theorem implies that arbitrarily low decoding error probabilities can be achieved at any transmission rate R less than the
More informationRoll No. :... Invigilator's Signature :.. CS/B.TECH(ECE)/SEM-7/EC-703/ CODING & INFORMATION THEORY. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator's Signature :.. CS/B.TECH(ECE)/SEM-7/EC-703/2011-12 2011 CODING & INFORMATION THEORY Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks
More informationRevision of Lecture 4
Revision of Lecture 4 We have discussed all basic components of MODEM Pulse shaping Tx/Rx filter pair Modulator/demodulator Bits map symbols Discussions assume ideal channel, and for dispersive channel
More informationL interférence dans les réseaux non filaires
L interférence dans les réseaux non filaires Du contrôle de puissance au codage et alignement Jean-Claude Belfiore Télécom ParisTech 7 mars 2013 Séminaire Comelec Parts Part 1 Part 2 Part 3 Part 4 Part
More informationLDPC Codes. Intracom Telecom, Peania
LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom,
More informationLeast-Squares Performance of Analog Product Codes
Copyright 004 IEEE Published in the Proceedings of the Asilomar Conference on Signals, Systems and Computers, 7-0 ovember 004, Pacific Grove, California, USA Least-Squares Performance of Analog Product
More informationCode Concatenation and Advanced Codes
Contents 11 Code Concatenation and Advanced Codes 58 11.1 Code Concatenation....................................... 60 11.1.1 Serial Concatenation................................... 60 11.1. Parallel Concatenation..................................
More informationA Short Length Low Complexity Low Delay Recursive LDPC Code
A Short Length Low Complexity Low Delay Recursive LDPC Code BASHAR M. MANSOOR, TARIQ Z. ISMAEEL Department of Electrical Engineering College of Engineering, University of Baghdad, IRAQ bmml77@yahoo.com
More informationCS6956: Wireless and Mobile Networks Lecture Notes: 2/4/2015
CS6956: Wireless and Mobile Networks Lecture Notes: 2/4/2015 [Most of the material for this lecture has been taken from the Wireless Communications & Networks book by Stallings (2 nd edition).] Effective
More information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationFast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems
Fast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems Michael A. Enright and C.-C. Jay Kuo Department of Electrical Engineering and Signal and Image Processing Institute University
More informationChannel Coding 1. Sportturm (SpT), Room: C3165
Channel Coding Dr.-Ing. Dirk Wübben Institute for Telecommunications and High-Frequency Techniques Department of Communications Engineering Room: N3, Phone: 4/8-6385 Sportturm (SpT), Room: C365 wuebben@ant.uni-bremen.de
More informationConvolutional Coding LECTURE Overview
MIT 6.02 DRAFT Lecture Notes Spring 2010 (Last update: March 6, 2010) Comments, questions or bug reports? Please contact 6.02-staff@mit.edu LECTURE 8 Convolutional Coding This lecture introduces a powerful
More informationUtilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise
Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2012 Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check
More informationDigital Communications
Digital Communications Chapter 8: Trellis and Graph Based Codes Saeedeh Moloudi May 7, 2014 Outline 1 Introduction 2 Convolutional Codes 3 Decoding of Convolutional Codes 4 Turbo Codes May 7, 2014 Proakis-Salehi
More informationA Comparison of Cooperative Transmission Schemes for the Multiple Access Relay Channel
A Comparison of Cooperative Transmission Schemes for the ultiple Access elay Channel André Angierski andre.angierski@uni-rostock.de 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING
More informationExact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel
Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering
More informationComparative Analysis of Equalization Methods for SC-FDMA
Comparative Analysis of Equalization Methods for SC-MA Anton ogadaev, Alexander Kozlov SUA Russia Email: {dak, akozlov}@vu.spb.ru Ann Ukhanova U otonik enmark Email: annuk@fotonik.dtu.dk Abstract n this
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationNew Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding
1 New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding Alireza Kenarsari-Anhari, Student Member, IEEE, and Lutz Lampe, Senior Member, IEEE Abstract Bit-interleaved
More informationPolynomial matrix QR decomposition and iterative decoding of frequency selective MIMO channels
Loughborough University Institutional Repository Polynomial matrix QR decomposition and iterative decoding of frequency selective MIMO channels This item was submitted to Loughborough University's Institutional
More information12.4 Known Channel (Water-Filling Solution)
ECEn 665: Antennas and Propagation for Wireless Communications 54 2.4 Known Channel (Water-Filling Solution) The channel scenarios we have looed at above represent special cases for which the capacity
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications
More informationModulation codes for the deep-space optical channel
Modulation codes for the deep-space optical channel Bruce Moision, Jon Hamkins, Matt Klimesh, Robert McEliece Jet Propulsion Laboratory Pasadena, CA, USA DIMACS, March 25 26, 2004 March 25 26, 2004 DIMACS
More information