Results 291 to 300 of about 2,722,658 (361)
Some of the next articles are maybe not open access.
Proceedings of the IEEE Information Theory Workshop, 2003
In this paper we investigate turbo coding for BLAST (Bell Labs layered space-time) by encoding single user data streams and transmitting the symbols in different antennas. At the receiver we adopt an MMSE nulling, incremental decoding and soft cancellation approach to decode the symbols.
openaire +1 more source
In this paper we investigate turbo coding for BLAST (Bell Labs layered space-time) by encoding single user data streams and transmitting the symbols in different antennas. At the receiver we adopt an MMSE nulling, incremental decoding and soft cancellation approach to decode the symbols.
openaire +1 more source
Improving turbo code error performance by multifold coding
IEEE Communications Letters, 2002B Honary
exaly +2 more sources
Iterative MAP decoding of turbo coded OOK and turbo coded BPPM
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002Infrared wireless communication and optical communication usually adopt on-off keying (OOK) and pulse position modulation (PPM). In this paper, we present iterative maximum a posteriori probability (MAP) decoding of Turbo coded OOK and Turbo coded binary PPM (BPPM).
Naotake Yamamoto, Tomoaki Ohtsuki
openaire +1 more source
Improved Low Complexity Hybrid Turbo Code: A Modified Turbo Code
2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009Turbo Convolutional Codes (TCC) are excellent error correcting codes as they show near Shannon capacity performance in communication systems. However, Turbo decoders are computationally complex. Recently, a class of modified Turbo codes called Low Complexity Hybrid Turbo Codes (LCHTC) is proposed with Bit Error Rate (BER) which is almost same as that ...
Archana Bhise, Prakash D. Vyavahare
openaire +1 more source
Aspects of interleaving for turbo codes
2013 International Conference on ICT Convergence (ICTC), 2013In this letter, we present some aspects of bit interleaving schemes applicable for turbo codes with block and convolutional codes as their component codes. A bit interleaving scheme across inter-codewords can be used to increase the performance of the codes when a block of correlated channel information exits in a codeword.
Saleem Ahmed +4 more
openaire +1 more source
A note on asymmetric turbo-codes
IEEE Communications Letters, 1999Little attention has been devoted in the literature to turbo-codes with nonidentical component codes. However, in order to optimize the performance of parallel concatenated schemes with respect to both the so called "error-floor" and the "waterfall" regions, the idea has certain advantages.
Oscar Y. Takeshita +3 more
openaire +1 more source
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