S. Benedetto and G. Montorsi. Performance evaluation of turbo codes. IEE Electronics Letters, 31(3):163-165, Feb. 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... The discovery of Turbo codes and the near capacity performance reported in [1] has stimulated a flurry of research e#orts to fully understand this new coding scheme [2] 43] Initially greeted with some skepticism, the original results were independently reproduced by several researchers [6] [7], 10] 11] 12] 13] and [30] Subsequently, recent research on Turbo codes has focused on understanding the reasons for their outstanding performance [8] 9] 16] 22] 24] 28] At this point, there are two fundamental questions regarding Turbo codes. First, does the iterative ....

....first constituent encoder to high weight parity sequences in the second constituent encoder. Thus, for low weight codewords N d w d N 1, where N d N (4) is called the e#ective multiplicity of codewords of weight d. The e#ect of the interleaver size on the multiplicity is also studied in [7], 8] and [9] 2.2 Asymptotic Performance For moderate and high signal to noise ratios, it is well known that the free distance term in the union bound on the bit error rate performance dominates the bound [44] Thus, for Turbo codes the asymptotic performance approaches P b # N free w ....

S. Benedetto and G. Montorsi, "Performance evaluation of TURBO-codes", Electronics Letters, Vol. 31, No. 3, pp. 163-165, February 2, 1995.

.... The discovery of Turbo codes and the near capacity performance reported in [1] has stimulated a flurry of research efforts to fully understand this new coding scheme [2] 43] Initially greeted with some skepticism, the original results were independently reproduced by several researchers [6] [7], 10] 11] 12] 13] and [30] Subsequently, recent research on Turbo codes has focused on understanding the reasons for their outstanding performance [8] 9] 16] 22] 24] 28] At this point, there are two fundamental questions regarding Turbo codes. First, does the iterative ....

....constituent encoder to high weight parity sequences in the second constituent encoder. Thus, for low weight codewords N d w d N 1; where N d N (4) is called the effective multiplicity of codewords of weight d. The effect of the interleaver size on the multiplicity is also studied in [7], 8] and [9] 2.2 Asymptotic Performance For moderate and high signal to noise ratios, it is well known that the free distance term in the union bound on the bit error rate performance dominates the bound [44] Thus, for Turbo codes the asymptotic performance approaches P b N free w free ....

S. Benedetto and G. Montorsi, "Performance evaluation of TURBOcodes ", Electronics Letters, Vol. 31, No. 3, pp. 163-165, February 2, 1995.

....to 2x10 5 when the frame size increases from 100 to 10,000. The memory two turbo code for a BER 10 4 is even better than the memory four turbo code for the Rayleigh fading channel. Benedetto and Montorsi have proposed an analytical upper bound to the average performance of turbo codes [49 51]. Their investigation is based on the input redundancy weight enumerating function and using an uniform interleaver. This uniform interleaver is defined as a probabilistic device which maps a given input word of weight w into all distinct permutations # k w # with equal probability # k w ....

S. Benedetto and G. Montorsi, "Performance evaluation of turbo codes," Electron. Lett., vol. 31, No. 3, pp. 163--165, Feb. 1995.

No context found.

S. Benedetto and G. Montorsi. Performance evaluation of turbo codes. IEE Electronics Letters, 31(3):163-165, Feb. 1995.

No context found.

BENEDETTO, SERGIO, & MONTORSI, GUIDO. 1995b. Performance Evaluation of Turbo Codes. Electronics Letters, 31(3), 163--165.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC