Results 301 to 310 of about 86,909 (315)

Fundamentals of Turbo Codes

2018
Turbo codes are composed of two or more convolutional codes. Therefore, in Sect. 2.1 we present the manner in which they can be described (i.e. generator matrix, state diagram and trellis diagram). Notions such as minimum Hamming distance, weight of a bit sequence, weight enumeration functions are assumed to be known (Proakis 1995; Trifina and Munteanu
Daniela Tarniceriu, Lucian Trifina
openaire   +2 more sources

Improved Low Complexity Hybrid Turbo Code: A Modified Turbo Code

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009
Turbo Convolutional Codes (TCC) are excellent error correcting codes as they show near Shannon capacity performance in communication systems. However, Turbo decoders are computationally complex. Recently, a class of modified Turbo codes called Low Complexity Hybrid Turbo Codes (LCHTC) is proposed with Bit Error Rate (BER) which is almost same as that ...
Prakash D. Vyavahare, Archana Bhise
openaire   +2 more sources

VLSI architectures for turbo codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999
A 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, PICCININI, GIANLUCA, RUO ROCH, Massimo, ZAMBONI, Maurizio   +3 more
openaire   +2 more sources

Iterative MAP decoding of turbo coded OOK and turbo coded BPPM

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
Infrared 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).
N. Yamamoto, Tomoaki Ohtsuki
openaire   +2 more sources

Turbo multiuser detection for turbo-coded CDMA

WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), 2003
An iterative receiver structure is proposed for decoding multiuser information data in a turbo-coded DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process.
H.V. Poor, Xiaodong Wang
openaire   +2 more sources

Code-Aided Turbo Synchronization

Proceedings of the IEEE, 2007
The introduction of turbo and low-density parity-check (LDPC) codes with iterative decoding that almost attain Shannon capacity challenges the synchronization subsystems of a data modem. Fast and accurate signal synchronization has to be performed at a much lower value of signal-to-noise ratio (SNR) than in previous less efficiently coded systems.
HERZET C, NOELS N, LOTTICI, VINCENZO, WYMEERSCH H, LUISE, MARCO, MOENECLAEY M, VANDENDORPE L.   +6 more
openaire   +3 more sources

Applications of Turbo Codes

2000
Turbo and serial concatenated convolutional codes have been proposed for various communication systems, such as deep space, cellular mobile and satellite communication networks. The standard turbo codes are presented in this chapter.
Jinhong Yuan, Branka Vucetic
openaire   +2 more sources

Turbo-Like Codes Constructions

2014
This chapter provides design, analysis, construction, and performance of the turbo codes, serially concatenated codes, and turbo-like codes including the design of interleavers in concatenation of codes. Also this chapter describes the iterative decoding algorithms for these codes.
BENEDETTO, Sergio, Divsalar D., MONTORSI, Guido   +2 more
openaire   +2 more sources

Turbo Codes

2009
Shu Lin, William Ryan
openaire   +2 more sources

Verkettete Codes („Turbo-Codes“) und iterative Decodierung („Turbo-Prinzip“)

2011
Bei der „soft-input“-Decodierung profitiert der Decodierer von wertkontinuierlichen Empfangswerten. Beispielsweise ist der Viterbi-Algorithmus in der Lage, eine „soft-input“-Decodierung durchzufuhren [A. J. Viterbi 1967, G. D. Forney 1973]. Allerdings stellt der Viterbi-Algorithmus am Ausgang des Decodierers keine Zuverlassigkeitsinformation zur ...
openaire   +2 more sources