Results 191 to 200 of about 4,791 (236)
Some of the next articles are maybe not open access.
Combined turbo equalisation and block turbo coded modulation
IEE Proceedings - Communications, 2003The combination of equalisation and turbo decoded M-QAM is studied. In a system of block turbo coding based on iterative decoding of a product code, equalisation is incorporated in the decoding iteration loop. Most research in this area has considered the trellis equaliser. When using a high throughput modulation trellis equalisation is impossible. The
M. Noorbakhsh, K. Mohamed-Pour
openaire +1 more source
Block Turbo Codes: From Architecture to Application
2006 IEEE International Symposium on Information Theory, 2006This paper is concerned with the design of block turbo codes for very high bit rate applications. We first introduce an original low-complexity architecture designed for the iterative decoding of product codes. The implementation of the Chase-Pyndiah algorithm is simplified by not memorizing any of the list decoding concurrent code words.
Benoit Geller +4 more
openaire +1 more source
Block turbo codes for magnetic recording channels
2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2002Block turbo codes have been shown to have near-optimum performance and lower decoding complexity than convolutional turbo codes for additive white Gaussian noise (AWGN) channels. In this paper we discuss the applicability of block turbo codes to partial-response (PR) equalized Lorentzian channels for magnetic recording.
Hongxin Song, J. R. Cruz
openaire +1 more source
An efficient decoding algorithm for block turbo codes
IEEE Transactions on Communications, 2001Summary: An efficient soft-input soft-output iterative decoding algorithm for block turbo codes (BTCs) is proposed. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft decisions using reliability calculations.
Sameep Dave +2 more
openaire +2 more sources
Turbo block codes for the binary adder channel
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005A novel coding scheme for collaborative coding multiple access is introduced for practical application, which permits improving performance with the use of turbo ...
Maria de Lourdes M. G. Alcoforado +2 more
openaire +1 more source
Layered Coding with Block Turbo Code for Broadcasting and Multicasting Services
IEEE Vehicular Technology Conference, 2006This paper presents an efficient layered coding scheme using block turbo codes for multimedia broadcasting and multicasting services (MBMS). Because of unidirectional nature of MBMS, we cannot use adaptive coding and modulation schemes using channel quality information from a return link.
Sunheui Ryoo, Sooyoung Kim, Do-Seob Ahn
openaire +1 more source
Laminated turbo codes: A new class of block-convolutional codes
IEEE Transactions on Information Theory, 2008In this paper, a new class of codes is presented that features a block-convolutional structure-namely, laminated turbo codes. It allows combining the advantages of both a convolutional encoder memory and a block permutor, thus allowing a block-oriented decoding method.
Axel Huebner +2 more
openaire +1 more source
Turbo-like codes for the block-fading channel
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004We consider the coded modulation family of block-wise concatenated codes (BCC). The blocks are separately interleaved and fed to binary inner encoders. Finally, the output of each component inner code is mapped onto a sequence of signal components by the modulator mapping.
Albert Guillen i Fabregas +1 more
openaire +1 more source
Turbo decoding of linear block codes
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233), 2002Turbo codes, due to their novel coding and decoding technique and remarkable performance, have attracted considerable interest since 1993. We consider how to use the turbo decoding principle to decode a general linear block code. We present two decoding strategies, and give an open problem.
null Dian-Wu Yue, E. Shwedyk
openaire +1 more source
Turbo code performance as a function of code block size
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002We show that a single family of turbo codes is "nearly perfect" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the "imperfectness" of various non-turbo codes for comparison,.
S. Dolinar, D. Divsalar, F. Pollara
openaire +1 more source