Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 2,811 papers for “turbo decoding”

Noncoherent turbo decoding

J. Vainappel, E. Hardy, Dan Raphaeli · 2002

We propose a new turbo code noncoherent detection scheme based on a novel a-priori probability processor (APP). Using this method, many turbo encoders can be used without a change in the code or in the modulation, and without a significant change in the structure of the iterative decoder. Simulation results of this method are presented for various phase noise levels. We show a degradation of 0.7 dB from the coherent detection of the same codes.

Cited by 6

Combined turbo equalization and turbo decoding

Dan Raphaeli, Yoram Zarai · 2002

In this paper, the subject of turbo coding in the presence of intersymbol interference channel is investigated. An iterative decoder structure is presented, which combines the channel equalization and the turbo decoding. At each iteration extrinsic information from the channel detector is fed into the turbo decoders, and then their extrinsic information is fed back to the channel detector. Simulation results are presented for turbo code with BPSK and and PSK modulations, transmitted over several ISI channels having severe frequency distortion. The performances are about 1 dB from the ISI channel capacity at bit error rate of 10/sup -5/.

Cited by 71

Processing in Turbo Decoding

P. Meshkat, John Villasenor · 1998

The framework of Bayesian networks has been used to introduce n ew ways for decoding paral- lel concatenated convolutional (turbo) codes. Simu- lation results show that a noisy received block which does not converge using traditional turbo decoding can converge to the correct value with one or more of the methods introduced here.

Cited by 0

Low Complexity Turbo Decoding

Peter Haase, Hermann Rohling · 2002

In this paper a truncated turbo decoding with reduced computational complexity is proposed. In the course of iterative decoding, bits are detected that will be changed very unlikely in the current iteration step. These bits are excluded from decoding (in the current iteration step) which yields a turbo decoding with much lower complexity while the loss of bit error rate (BER) is quiet small.

Cited by 0

Hybrid turbo-decoding method

B.O. Bodnarenko, Yu.Yu. Іvanov, S.M. Skuratov · 2023

International scientific conference “MININGMETALTECH 2023 – The mining and metals sector: integration of business, technology and education” : conference proceedings (November 29–30, 2023. Riga, the Republic of Latvia). Riga, Latvia : “Baltija Publishing”, 2023. Vol. 2. 348 pages.

Cited by 0Open access

Turbo-decoding of nonbinary codes

Jens Berkmann, F. Burkert · 2002

It is shown how parallel concatenation of nonbinary codes can be put into the same framework of iterative decoding as in the binary case. The turbo-code(turbo-decoding-) idea is extended to nonbinary block codes.

Cited by 4

Turbo decoding as constrained optimization

John M. Walsh, Phillip A. Regalia, C. Richard Johnson · 2005

The turbo decoder was not originally introduced as a solution to an optimization problem. This has made explaining just why the turbo decoder performs as well as it does very difficult. Many authors have attempted to explain both the performance and convergence of the decoder, with varied success. In this document we show that the turbo decoder admits an exact interpretation as an iterative method (nonlinear block Gauss Seidel iteration) attempting to find a solution to a particular intuitively pleasing constrained optimization problem. In particular the turbo decoder is trying to find the maximum likelihood solution under the false assumption that the input to the encoders were chosen independently of one another, subject to a constraint on the probability that the messages so chosen happened to be the same. We provide an exact analytical objective function, along with an exact analytical form of the constraint, and then show that the turbo decoder is an iterative method originally suggested by Gauss, which is trying to solve the optimization problem by solving a system of equations which are the necessary conditions of Lagrange with a Lagrange multiplier of −1. 1

Cited by 0

Block turbo decoding with ORBGRAND

Kevin Galligan, Muriel Médard, Ken R. Duffy · arXiv (Cornell University) · 2022

Guessing Random Additive Noise Decoding (GRAND) is a family of universal decoding algorithms suitable for decoding any moderate redundancy code of any length. We establish that, through the use of list decoding, soft-input variants of GRAND can replace the Chase algorithm as the component decoder in the turbo decoding of product codes. In addition to being able to decode arbitrary product codes, rather than just those with dedicated hard-input component code decoders, results show that ORBGRAND achieves a coding gain of up to 0.7dB over the Chase algorithm with same list size.

Cited by 0Open access

Decoding of turbo product code

O.T. Sjahfiri · DR-NTU (Nanyang Technological University) · 2008

Two soft-input-soft-output iterative decoding algorithms for product code were studied and developed - (1) an algorithm developed by Pyndiah that uses a suboptimal modified Chase algorithm that is able to decode in a near-optimum fashion (2) a proposed single parity check based iterative decoding algorithm to decode product code.

Cited by 0

Semi-Iterative Analog Turbo Decoding

Matthieu Arzel, Cyril Lahuec, Fabrice Seguin et al. · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 2007

Based on multiple-slice turbo codes, a novel semi-iterative analog turbo decoding algorithm and its corresponding decoder architecture are presented. This work paves the way for integrating flexible analog decoders dealing with frame lengths over thousands of bits. The algorithm benefits from a partially continuous exchange of extrinsic information to improve decoding speed and correction performance. The proposed algorithm and architecture are applied to design an analog decoder for double-binary codes. Taking full advantage of multiple slice codes, the on-chip area is shown to be reduced by ten when compared to a conventional fully parallelized analog slice turbo decoder. The reconfigurable analog core area for frames of 40 bits up to 2432 bits is 37 nm <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> in a 0.25-mum BiCMOS process.

Cited by 10

Turbo decoding in ISI channels

Sanjay Kumar Soni, Puspraj Singh Chauhan, K. Vasudevan et al. · 2011

Turbo codes are family of forward error correcting codes, whose performance is near Shannon limit. Turbo decoding is based on the maximum a-posterior algorithm (MAP) algorithm. In this paper, the problem of turbo decoding in ISI channel is studied. A Super-trellis structure method has been presented and modified turbo decoding is suggested. Two methods have been suggested for turbo decoding in ISI channel. In the first method, we take all possible combinations of output of encoder-2 and in method-2, output of each encoder is passed through channel filter independently. Method-2 performs better than method-1 but requires higher bandwidth. The improvement in performance is demonstrated through simulations.

Cited by 4

Turbo Decoding Using BCJR Algorithm

Florin Lucian Morgoș · SHILAP Revista de lepidopterología · 2013

In this paper I will present some concepts related to turbo codes, the principle of their operation, and some results obtained by implementing the BCJR decoding algorithm known as the maximum aposteriori algorithm (MAP).

Cited by 0Open access

List sequence turbo decoding techniques

C.F. Leanderson, C.-E.W. Sundberg · 2004

An algorithm for decoding turbo codes that combines conventional turbo decoding and list sequence (LS) maximum a posteriori probability (MAP) decoding is presented and evaluated. Compared to previous results on this theme, a reduction in the order of 0.7 dB of the signal-to-noise ratio (SNR) is obtained for turbo codes with 514-bit pseudo-random interleaving at frame error rate (FER) 10/sup -4/ on the additive white Gaussian noise (AWGN) channel.

Cited by 1

An Adaptive Turbo Decoding Algorithm

Jianping Li, Cai Chaoshi, Yunfei Feng · 2008

The extrinsic information and the received systematic observations exert different influence on decision-making with the change of SNR values for turbo iterative decoding. By multipling a weighted coefficient for the priori information, this paper proposed a novel adaptive iterative soft decoding algorithm for turbo codes, which alters the proportion of the extrinsic information and the received systematic observations in the soft output values of turbo decoding. In this way, turbo decoding can trace the changes of channel and obtain improved performance. Simulation results show that the proposed scheme can lower the error floor of turbo codes.

Cited by 1

Collaborative decoding using turbo codes

Jang-Wook Moon, John M. Shea, Tan F. Wong · 2004

Cooperative reception allows diversity to be achieved by a group of radios that are not physically connected but that receive independent copies of a message. The receivers achieve diversity by exchanging messages. One such technique is collaborative decoding, in which the receivers iterate between decoding and information exchange. Collaborative decoding has been shown to be effective for convolutional codes. In this paper we investigate the performance of collaborative decoding with turbo codes. We also investigate collaborative detection of a partial-time jammer.

Cited by 1

Semi-Iterative Analog Turbo Decoding

Matthieu Arzel, Seguin, Fabrice, Cyril Lahuec et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2006

International audience

Cited by 0Open access