Results 231 to 240 of about 1,593,061 (277)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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
Punctured turbo code ensembles
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004We analyze the asymptotic performance of punctured turbo codes. The analysis is based on the union bound on the word error probability of maximum likelihood decoding for punctured turbo code ensembles averaged over all possible puncturing patterns and interleavers.
Ruoheng Liu +2 more
openaire +2 more sources
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
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 +3 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
Parallel Decoding of Turbo Codes
2018Given a turbo code generated by parallelly concatenated recursive systematic convolutional encoders, the turbo decoder comprises MAP decoders coupled in a serial connection, where each MAP decoder decodes a recursive systematic convolutional code. We propose a turbo decoding algorithm that, on a logical level of abstraction, is made of several turbo ...
openaire +2 more sources