Journal ArticleDOI
Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes
TLDR
A novel iterative error control technique based on the threshold decoding algorithm and new convolutional self-doubly orthogonal codes is proposed, providing good tradeoff between complexity, latency and error performance.Abstract:
A novel iterative error control technique based on the threshold decoding algorithm and new convolutional self-doubly orthogonal codes is proposed. It differs from parallel concatenated turbo decoding as it uses a single convolutional encoder, a single decoder and hence no interleaver, neither at encoding nor at decoding. Decoding is performed iteratively using a single threshold decoder at each iteration, thereby providing good tradeoff between complexity, latency and error performance.read more
Citations
More filters
Journal ArticleDOI
An analysis of the orthogonality structures of convolutional codes for iterative decoding
Yu-Cheng He,David Haccoun +1 more
TL;DR: It is shown that the double orthogonality property of convolutional self-doubly-orthogonal codes improves the code structure by maximizing the number of independent observations over two successive decoding iterations while minimizing thenumber of cycles of lengths 6 and 8 on the code graphs.
Journal ArticleDOI
Search and determination of convolutional self-doubly orthogonal codes for iterative threshold decoding
TL;DR: A code-searching technique based on heuristic computer searching algorithms which have yielded the best known CSO/sup 2/C-WS, which is quite efficient especially in reducing very substantially the execution time required to determine the codes with the shortest spans.
Journal ArticleDOI
Multi-Stage Threshold Decoding for Self-Orthogonal Convolutional Codes
TL;DR: A new dimension of soft decoding turbo-like multi-stage threshold decoding for self-orthogonal convolutional codes (SOCCs) and gives 0.20 dB more coding gain compared to MTD for equivalent SOCCs at the bit error rate less than 10-4.
Proceedings ArticleDOI
A New Approach for the Construction of Powerful LDPC Convolutional Codes
TL;DR: A novel approach for the algebraic construction of low-density parity-check (LDPC) convolutional codes is presented, based on the orthogonality structures of the codes, which leads to a girth of at least 10 in the Tanner graph.
Journal ArticleDOI
High-rate punctured convolutional self-doubly orthogonal codes for iterative threshold decoding
David Haccoun,C. Cardinal +1 more
TL;DR: It is shown that there is no need for the punctured mother codes to respect all the required conditions, in order to maintain the double orthogonality at the second iteration step of the iterative threshold-decoding algorithm.
References
More filters
Book
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Journal ArticleDOI
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Related Papers (5)
An analysis of the orthogonality structures of convolutional codes for iterative decoding
Yu-Cheng He,David Haccoun +1 more