An Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise
نویسنده
چکیده
In this paper, an iterative decoding algorithm for channels with additive linear dynamical noise is presented. The proposed algorithm is based on the tightly coupled two inference algorithms: the sum-product algorithm which infers the information symbols of an low density parity check(LDPC) code and the Kalman smoothing algorithm which infers the channel states. The linear dynamical noise are the noise generated from a linear dynamical system. We often encounter such noise (i.e.,additive colored noise) in practical communication and storage systems. The conventional iterative decoding algorithms such as the sum-product algorithm cannot derive full potential of turbo codes nor LDPC codes over such a channel because the conventional algorithms are designed under the independence assumption on the noise. Several simulations have been performed to assess the performance of the proposed algorithm. From the simulation results, it can be concluded that the Kalman smoothing algorithm deserves to be implemented in a decoder when the linear dynamical part of the linear dynamical noise is dominant rather than the white Gaussian noise part. In such a case, the performance of the proposed algorithm is far superior to that of the conventional algorithm. key words: iterative decoding algorithm, Kalman smoother, linear dynamical system, LDPC codes
منابع مشابه
An Iterative Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channels
An iterative decoding algorithm of low density parity check(LDPC) codes for hidden Markov noise channels is presented. The hidden Markov noise channel is an additive noise channel whose noise statistics is modeled by a hidden Markov model(HMM). The proposed decoding algorithm consists of two parts: the conventional sum-product algorithm for the LDPC codes and a forward-backward likelihood estim...
متن کاملLinear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches
In recent work (Feldman and Karger [8]), we introduced a new approach to decoding turbo-like codes based on linear programming (LP). We gave a precise characterization of the noise patterns that cause decoding error under the binary symmetric and additive white Gaussian noise channels. We used this characterization to prove that the word error rate is bounded by an inverse polynomial in the cod...
متن کاملPerformance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels
Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying (CPFSK) facilitates powerful error correction. CPFSK also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidt...
متن کاملSelection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes
This letter considers an iterative decoding algorithm for non-binary linear block codes in which erasure and error decoding is performed for input words given by the sums of a hard-decision received sequence and given test patterns. We have proposed a new selection method of test patterns for the iterative decoding algorithm. Simulation results have shown that the decoding algorithm with test p...
متن کاملIterative Threshold Decoding of Majority Logic Decodable Codes on Rayleigh Fading Channels
Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algo...
متن کامل