Results 331 to 340 of about 2,501,833 (347)

Design of turbo-code interleaver using Hungarian method

, 1998
A method is presented for optimising the structure of the turbo-code interleaver using the Hungarian method (linear sum assignment problem). Numerical results are presented which show a substantial improvement with respect to a random interleaver.
A. Khandani
semanticscholar   +1 more source

Performance Comparison Between Turbo Code and Rate-Compatible LDPC Code for Evolved Utra Downlink OFDM Radio Access

IEEE Military Communications Conference, 2006
This paper compares the Release 6 turbo code and rate-compatible low-density parity-check (LDPC) codes based on the packet error rate (PER) performance and decoding complexity in order to clarify the most appropriate channel coding scheme in the OFDM ...
N. Okubo, N. Miki, Y. Kishiyama, K. Higuchi, M. Sawahashi   +4 more
semanticscholar   +1 more source

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

Serial concatenation of LDPC and turbo code for the next generation mobile communications

Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005., 2005
The effect of concatenated LDPC (low density parity check) code to improve the performance of turbo code is analyzed in this paper. Turbo code shows error floor at high SNR (signal to noise ratio) region. But LDPC code shows better performance than turbo
Sang Hoon Lee, Ji Ae Seok, E. Joo
semanticscholar   +1 more source

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

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

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

Power Optimization of Three Dimensional Turbo Code Using a Novel Modified Symbiotic Organism Search (MSOS) Algorithm

Wireless personal communications, 2016
S. Banerjee, S. Chattopadhyay
semanticscholar   +1 more source

A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers

Wireless personal communications, 2008
K. Koutsouvelis, C. Dimakis
semanticscholar   +1 more source

Turbo Codes

2009
Shu Lin, William Ryan
openaire   +2 more sources