نتایج جستجو برای: turbo codes

تعداد نتایج: 82074  

2016
Nahidul Islam Md. Rakibul Islam Mahmudul Hasan Iqbal Izaz Khan Petar Popovski Ljupco Kocarev

It is highly known that an interleaver (a device that scrambles the order of a sequence of numbers) is a key component of a turbo encoder to guarantee excellent bit error rate and frame error rate performances. Turbo codes were initially proposed using a randomly constructed interleaver. Turbo codes are a rank of high-performance forward error correction (FEC) codes, which were the initial prac...

2010
Camille LEROUX Christophe JEGO Patrick ADDE Michel JEZEQUEL

—In this paper, we demonstrate the higher hardware ef ciency of Reed-Solomon (RS) parallel turbo decoding compared with BCH parallel turbo decoding. Based on an innovative architecture, this is the rst implementation of fully parallel RS turbo decoder. A performance analysis is performed showing that RS Block Turbo Codes (RS-BTC) have decoding performance equivalent to Bose Ray-Chaudhuri Hocque...

1996
Eric K. Hall

Fading in wireless environments is a major obstacle to reliable communications. In order to mitigate the e ects of fading, channel coding is often employed. In this thesis, the performance and design of the channel coding technique, turbo codes, [1] is examined over Rayleigh fading channels. The thesis considers coherent BPSK signaling over both time-correlated and fully-interleaved Rayleigh, s...

2001
Ramesh Annavajjala Ananthanarayanan Chockalingam Laurence B. Milstein

In this paper, we are concerned with the performance of turbo codes on Rayleigh fading channels when noncoherent detection is employed. Performance of turbo codes with noncoherent detection on AWGN channels has been analyzed by Hall and Wilson. They compared the performance of turbo codes with the achievable information theoretic channel capacity for noncoherent detection on AWGN channels. We, ...

2010
Lucian TRIFINA Daniela TĂRNICERIU Ana-Mirela ROTOPĂNESCU

The performances of turbo coded modulation using asymmetric turbo codes with transmit antenna diversity are analyzed. The component convolutional codes are considered to have memory 2 and 3, respectively, and their generator polynomials are both primitive and nonprimitive. The performances of asymmetric turbo coded modulation were evaluated performing simulations to obtain the bit error rate (B...

2003
Apichit Pradabphon Ditsapon Chumchewkul Keattisak Sripimanwat Attasit Lasakul Pham Manh Lam

In this paper, a proposed wireless transmission model by concatenation of turbo codes and Spiral curve phase precoding is introduced. It is a novel ISI-combating method for BPSK signals through multipath fading channel. Simulation results show that Spiral curve phase precoding with binary turbo codes achieves the better gain at high SNR compared to that of Viterbi equalizer with the same turbo ...

2005
Dariush Divsalar Hui Jin Robert J. McEliece

In this paper we discuss AWGN coding theorems for ensembles of coding systems which are built from fixed convolutional codes interconnected with random interleavers. We call these systems “turbo-like” codes and they include as special cases both the classical turbo codes [1,2,3] and the serial concatentation of interleaved convolutional codes [4]. We offer a general conjecture about the behavio...

Journal: :IEEE Trans. Information Theory 2002
Hui Jin Robert J. McEliece

This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are “good” in the following sense. For a turbo code ensemble defined by a fixed set of component codes (subject only to mild necessary restrictions), there exists a positive number 0 such that for any binary-input memoryless channel whose Bhattacharyya noise parameter is...

2003
Ruoheng Liu Predrag Spasojević Emina Soljanin

We analyze the asymptotic performance of punctured turbo codes. The analysis is based on the union bound on the word error probability of maximum likelihood decoding for a punctured turbo code ensembles averaged over all possible puncturing patterns and interleavers. By using special probabilistic puncturing, we prove that, for a given mother turbo code ensemble [C] with a finite noise threshol...

2001
Hui Jin Robert J. McEliece

This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are “good” in the following sense. For a turbo code ensemble defined by a fixed set of component codes (subject only to mild necessary restrictions), there exists a positive number γ0 such that for any binary-input memoryless channel whose Bhattacharyya noise parameter i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید