Results 211 to 220 of about 2,559,254 (252)
Some of the next articles are maybe not open access.
Iterative decoding with a hamming threshold for block turbo codes
IEEE Communications Letters, 2004This 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
exaly +3 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 +2 more sources
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
How we implemented block turbo codes?
Annales Des Télécommunications, 2001This paper presents a block turbo decoding algorithm, from its theory to its implementation in a programmable circuit. In this study, we discuss the two prototypes realized. It will be possible to compare the complexity of the core of the process, which is the elementary decoder, thanks to the choice of essential parameters.
Kerouedan, Sylvie +2 more
openaire +3 more sources
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 +2 more sources
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 +3 more sources
Reduced-search SOVA for block turbo codes
IEEE International Conference on Communications, 2003. ICC '03., 2004In this paper, we propose an efficient reduced-search SOVA (soft output Viterbi algorithm) for block turbo codes. To reduce complexity, the decoder selects a part of the existing paths using the statistics of the path metrics. In addition, we compensate for the performance degradation incurred from soft output values at the parity part of the trellis ...
Sooyoung Kim 0001, Deockgil Oh
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 +2 more sources
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 +2 more sources