P. Jung. Novel low complexity decoder for Turbo codes. Electronics Letters, 31:86-87, Jan. 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for majority logic decoding based on the APP algorithm of [4] simply consists of expressing all the steps of the algorithm with respect to logarithms of probabilities rather than probabilities. The same standard approximation was used to derive the Max Log MAP algorithm from the MAP algorithm [10, 11]. This simple algorithm allows to process low complexity iterative decoding of LDPC codes, but at the expense of about 1 dB degradation in error performance with respect to the BP algorithm at the bit error rate (BER) 10 Gamma5 . A second simplified algorithm is then considered. For this ....

P. Jung, "Novel low complexity decoder for turbo-codes," Electronic Letters, vol. 31, pp. 86-87, Jan. 1995.

....been devoted to these questions, e.g. 54, 20, 21, 19] Much of this work has focused on the improved weight distribution obtained by using a suitable (usually random) interleaver. Others focused on developing a more suitable soft decision decoder to be used in the turbo decoding process, e.g. [13, 31]. This section will focus on developing turbo codes in the framework of the input state output representation for convolutional codes. We will give a brief review of turbo codes. We will then present the natural generator and parity check descriptions of turbo codes that follow from the local ....

....is a choice as to which soft decision decoding algorithm to use in the above process. The original work done in this area used a modi ed version of the BCJR decoding algorithm [7] More recently the focus has shifted to a soft output Viterbi algorithm (SOVA) 28, 13] Another approach is o ered in [31]. Regardless of which approach is used, the basic principle is the same. Decoding is based on the fact that several parity check matrices are available to us. The rst two are immediate from the input state output representation and the fact that we require each valid N block to begin and end ....

P. Jung. Novel low complexity decoder for turbo codes. Electronics Letters, 31(2):86-87, 1995.

....limit on the AWGN channel. As a powerful coding technique, turbo codes offer great promise for improving the reliability of communications over wireless channels where fading is problematic. To date, only limited attention has been given to the performance of turbo codes on fading channels [2] [3]. In this work, we explore both the performance and design of turbo codes for fully interleaved channels and correlated Rayleigh slow fading channels. Sponsored by National Science Foundation, Grant NCR 9415996 and NASA LeRC under NAG3 1948 The organization of the paper includes a brief ....

P. Jung, "Novel low complexity decoder for turbo codes," Electronics Letters, pp. 86--87, Jan. 1995.

....severe for uncoded systems. Fortunately, channel coding can be used to help mitigate these effects. As a powerful coding technique, turbo codes are a prime candidate for wireless applications. To date, there have been only two works which have considered turbo codes over fading channels. Jung, in [4], showed simulation results for a reduced 3 complexity decoding scheme over a fully interleaved Rayleigh channel. Also, Goff et al., in [5] considered Rayleigh channels for a bandwidth efficient turbo code scheme. In both cases, only simulation results were given and no attention was paid to ....

P. Jung, "Novel low complexity decoder for turbo codes," Electronic Letters, pp. 86--87, Jan. 1995.

No context found.

P. Jung. Novel low complexity decoder for Turbo codes. Electronics Letters, 31:86-87, Jan. 1995.

No context found.

P. Jung, "Novel low complexity decoder for turbo-codes", Electronics Letters, Vol. 31. 2, pp. 86--87, January 19, 1995.

No context found.

P. Jung, "Novel low complexity decoder for turbo-codes", Electronics Letters, Vol. 31. 2, pp. 86--87, January 19, 1995.

No context found.

P. Jung, "Novel low complexity decoder for turbo--codes," Electron. Lett., vol. 31, No. 2, pp. 86--87, Jan. 1995.

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