Results 111 to 120 of about 4,741 (155)
Some of the next articles are maybe not open access.

Turbo-like codes for the block-fading channel

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
We 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 block codes for the binary adder channel

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
A 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, 2006
This 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

Near-optimum decoding of product codes: block turbo codes

IEEE Transactions on Communications, 1998
Summary: This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration.
openaire   +2 more sources

Laminated turbo codes: A new class of block-convolutional codes

IEEE Transactions on Information Theory, 2008
In 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 decoding of linear block codes

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233), 2002
Turbo 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), 2002
We 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

Iterative Decoding With a Hamming Threshold for Block Turbo Codes

IEEE Communications Letters, 2004
This work introduces a novel approach to increase the performance of block turbo codes (BTCs). The idea is based on using a Hamming threshold to limit the search for the maximum-likelihood (ML) codeword within only those codewords that lie within this threshold. The proposed iterative decoding approach is shown to offer both significant coding gain and
Ashraf Mahran, Mohammed Benaissa
openaire   +1 more source

Interleaver design for short block length turbo codes

2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2002
The performance of a turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits.
Hamid R. Sadjadpour   +3 more
openaire   +1 more source

Efficient architecture for Reed Solomon block turbo code

2006 IEEE International Symposium on Circuits and Systems, 2006
Reed-Solomon codes are block-based error correcting codes with a wide range of applications in digital communications and storage. Recently, block turbo codes using Reed-Solomon component codes have been introduced. This was motivated by the highest code rate property of Reed-Solomon codes and their efficiency for burst error correction.
Piriou, Erwan   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy