This paper is aimed to optimize the binary LDPC decoder which has been shown to outperform commonly used codes for many communications and storage channels. Currently proposed binary LDPC decoder architectures have very high rates close to the channel capacity for the large code word length, in this research work we had presented a decoding algorithm based on belief propagation and provide deta...

An area and computational-time efficient turbo decoder implementation on a reconfigurable processor is presented. The turbo decoder takes advantage of the latest sliding window algorithms to produce a design with minimal storage requirements as well as offering the ability to configure key system parameters via software. The parameter programmability allows the decoder to be used in a research ...

This thesis deals with the asymptotic analysis of coding systems based on sparse graph codes. The goal of this work is to analyze the decoder performance when transmitting over a general binary-input memoryless symmetricoutput (BMS) channel. We consider the two most fundamental decoders, the optimal maximum a posteriori (MAP) decoder and the sub-optimal belief propagation (BP) decoder. The BP d...

We present a simple, effective iterative structure for joint source-channel decoding using global iterations between a source and channel decoder. The source decoder uses the Sequence Based Approximate Minimum Mean Square Error (SAMMSE) algorithm. The iterative structure is tested using both LDPC and turbo channel codes and simulations show significant performance gains over non-iterative syste...

This paper presents a neural decoder for trellis coded modulation (TCM) schemes. Decoding is performed with Radial Basis Function Networks and Multi-Layer Perceptrons. The neural decoder effectively implements an adaptive Viterbi algorithm for TCM which learns communication channel imperfections. The implementation and performance of the neural decoder for trellis encoded 16-QAM with amplitude ...

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give (p, q) instance optimality for a large class of encoders with 1 ≤ p ≤ q ≤ 2 and (p, q) 6= (2, 2). We also show that, if the encoding matrix is drawn from an appropriate distribution, ...

An on-panel 6-bit R-string gamma-correction digital-to-analog converter (DAC) with reordering decoder circuit for panel data driver is proposed, which is composed of folded R-string circuit, segmented digital decoder, and reordering decoding circuit. By using the proposed reordering decoder circuit, the area of the proposed circuit is effectively reduced to about one sixth compared with the con...

We investigate methods of generating additional bilingual phrase pairs for a phrasebased decoder by translating short sequences of source text. Because our translation task is more constrained, we can use a model that employs more linguistically rich features than a traditional decoder. We have implemented an example of this approach. Experimental results suggest that the phrase pairs produced ...

A programmable turbo decoder is designed for multiple third-generation (3G) wireless communication standards. It mainly consists of a configurable SISO decoder and a 16-bit SIMD processor equipped with five processing elements and specialized instructions customized for interleaving. A fast and flexible incremental block interleaving algorithm that causes no timing overhead in changing interlea...

Abstractive document summarization seeks to automatically generate a summary for a document, based on some abstract “understanding” of the original document. State-of-the-art techniques traditionally use attentive encoder–decoder architectures. However, due to the large number of parameters in these models, they require large training datasets and long training times. In this paper, we propose ...