Results 201 to 210 of about 4,791 (236)

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, M. Salehi, Neil J. A. Sloane, Gabriele Nebe   +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, Jego, Christophe, Adde, Patrick, Le Bidan, Raphaël, Jezequel, Michel   +4 more
openaire   +2 more sources

Bounds on the error probability ofml decoding for block and turbo-block codes

Annales Des Télécommunications, 1999
Les performances sur canal gaussien de turbo codes en bloc binaires systematiques, avec entrelacement structure ou aleatoire sont estimees, a l’aide de bornes superieures sur les probabilites d’erreurs, pour un decodage a maximum de vraisemblance. Ces bornes relatives a des blocs ou a des bits dependent respectivemet du spectre des distances et de la ...
Igal Sason, Shlomo Shamai (Shitz)
openaire   +1 more source

Design schemes of space-time block codes concatenated with turbo codes

Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367), 2003
Higher transmission rate and reliable communication over fading channels are major research pursuits of current wireless communications. The space-time block codes (STBC) have been introduced to improve those research goals by simple processing algorithms at the transmitter and the receiver ends.
Junghoon Suh, Mostofa K. Howlader
openaire   +1 more source

Adaptive reliability calculation for block turbo codes

2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484), 2003
This work introduces an adaptive method for reliability calculations in iterative decoding. This new method is significant in particular to the class of early termination soft decision decoding algorithms, where instead of relying on approximate calculations to determine the required number of competing codewords, the proposed method determines ...
A. Mahran, M. Benaissa
openaire   +1 more source

Trellis Decoding of Linear Block Codes, Turbo Codes

2016
During the “long” history of error control coding, especially taking into account that the proof of the Second Shannon theorem is not a “constructive” one, the search for constructive codes to approach the “promised” limits have taken a long period of time.
Predrag Ivaniš, Dušan Drajić
openaire   +1 more source

Concatenation of space-time block codes and "turbo"-TCM

1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 2003
For high data rate transmission over wireless fading channels space-time block codes provide the maximal possible diversity advantage for multiple transmit antenna systems with a very simple decoding algorithm. To achieve also a significant coding gain space-time block codes have to be concatenated with an outer code.
openaire   +1 more source

Source-controlled block turbo coding

2005
This thesis proposes the use of block turbo codes for transmitting nonuniform binary memoryless sources over AWGN channels. As opposed to standard convolutional turbo codes, block turbo codes are known to achieve good performance for high code rates, up to 98% of the channel capacity for uniform sources.
openaire   +2 more sources

An alternative approach to the design of interleavers for block “turbo” codes

1996
In this paper we describe two methods of interleaving for use with generalized product block codes that can be decoded using a “turbo” decoding strategy. These methods are designed to avoid certain specific error patterns. One method has a number theoretic basis while the other uses finite projective planes. Simulation results are presented.
Paul Guinand, John H. Lodge, Lutz Papke
openaire   +1 more source