Results 261 to 270 of about 3,817,942 (325)
Some of the next articles are maybe not open access.
VLSI architectures for turbo codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999A great interest has been gained in recent years by a new error-correcting code technique, known as "turbo coding", which has been proven to offer performance closer to the Shannon's limit than traditional concatenated codes. In this paper, several very large scale integration (VLSI) architectures suitable for turbo decoder implementation are proposed ...
MASERA, Guido +3 more
openaire +2 more sources
IEEE Communications Letters, 1999
We present a new turbo-coding method which parses the input block into n-bit symbols and interleaves on a symbol-by-symbol basis. This is used in conjunction with different modulation techniques to take advantage of tradeoffs between bit error rate performance, code-rate, spectral efficiency, and decoder complexity.
Mark Bingeman, Amir K. Khandani
openaire +1 more source
We present a new turbo-coding method which parses the input block into n-bit symbols and interleaves on a symbol-by-symbol basis. This is used in conjunction with different modulation techniques to take advantage of tradeoffs between bit error rate performance, code-rate, spectral efficiency, and decoder complexity.
Mark Bingeman, Amir K. Khandani
openaire +1 more source
IEEE Communications Letters, 2007
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo ...
Orhan Gazi, Ali Özgür Yilmaz
openaire +1 more source
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo ...
Orhan Gazi, Ali Özgür Yilmaz
openaire +1 more source
IEEE Transactions on Communications, 1998
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
Krishna R. Narayanan, Gordon L. Stüber
openaire +1 more source
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
Krishna R. Narayanan, Gordon L. Stüber
openaire +1 more source
IEEE Communications Letters, 2004
Turbo codes typically utilize time-invariant component codes whose total encoder memory is no greater than 4. In this letter, turbo codes with time-varying component codes are studied via EXIT analysis, distance spectrum analysis and simulation. Turbo codes with time-varying component codes and memory 6 are shown to have similar performance in the ...
Fan Jiang +2 more
openaire +1 more source
Turbo codes typically utilize time-invariant component codes whose total encoder memory is no greater than 4. In this letter, turbo codes with time-varying component codes are studied via EXIT analysis, distance spectrum analysis and simulation. Turbo codes with time-varying component codes and memory 6 are shown to have similar performance in the ...
Fan Jiang +2 more
openaire +1 more source
Window-Interleaved Turbo Codes
IEEE Communications Letters, 2018We consider a class of turbo codes with a band structured interleaver, such that the interleaving (and thus deinterleaving) is done within a window. This ensures that the extrinsic information for each symbol is generated from symbols within a window, allowing the processing of large message blocks with a sliding window decoder.
Onurcan Iscan, Wen Xu 0001
openaire +1 more source
VTC '98. 48th IEEE Vehicular Technology Conference. Pathway to Global Wireless Revolution (Cat. No.98CH36151), 2001
Summary: This work considers the design and performance of a stream-oriented approach to turbo codes which avoids the need for data framing. The stream paradigm applies to both serial and parallel turbo codes using continuous, free-running constituent encoders along with continuous, periodic interleavers.
Eric K. Hall, Stephen G. Wilson
openaire +1 more source
Summary: This work considers the design and performance of a stream-oriented approach to turbo codes which avoids the need for data framing. The stream paradigm applies to both serial and parallel turbo codes using continuous, free-running constituent encoders along with continuous, periodic interleavers.
Eric K. Hall, Stephen G. Wilson
openaire +1 more source
Interleaver and puncturing in turbo codes
IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2001Theoretically, turbo codes must be implemented with large block sizes. To reduce delay and complexity in practical communications systems, we need to utilize small block sizes. In these cases, interleaving and puncturing play important roles in the code performance.
Majid A. Nemati +2 more
openaire +1 more source
On error bounds and turbo-codes
IEEE Communications Letters, 1999Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. We look at the performance of turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ...
Christian Schlegel, Lance C. Pérez
openaire +1 more source