A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...

An efficient decoding algorithm named ‘divided decoder’ is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides various combinations of two or more different searching algorithms. Hence it makes flexibility in error rate and complexity for the algorithms using it. We c...

The existing machine translation systems, whether phrase-based or neural, have relied almost exclusively on word-level modelling with explicit segmentation. In this paper, we ask a fundamental question: can neural machine translation generate a character sequence without any explicit segmentation? To answer this question, we evaluate an attention-based encoder– decoder with a subword-level enco...

The emerging technology of Internet of Things (IoT) has raised fundamental challenges in the design of practical and high performance data transmission and storage systems. Current network architectures and communication schemes are incapable of supporting the massive data, high rate, low latency, and large number of users that are envisioned in the applications of IoT. I am interested in novel...

Hardware implementation of Low-Density Parity-Check (LDPC) decoders using conventional algorithms such as Sum-Product or Min-Sum requires large amount of hardware resources. A rather simplistic way to reduce hardware resources is to reduce the intrinsic message quantization. However this adversely affects the bit error rate (BER) performance significantly. In this paper, a resource efficient LD...

In principle, to nd the optimal code one needs to optimize the tness functionH with respect to all its 2 m s degrees of freedom, the m s entries of the encoder e i and the m s entries of the decoder dj!, taking into account the m conservation relations for the encoder P i e i = 1 and the s conservation relations for the decoder P ! dj! = 1. However, although the degrees of freedom of the encode...

In this paper, a directional bi-directional Soft-Output Viterbi algorithm (SOVA) based Turbo decoder architecture is proposed. By performing an extra pass through the decoder trellis, effectively bi-directional decoding, decoder performance can be improved. The bi-directional decoding results in a 60% increase in operations over the conventional SOVA decoder, while incurring no significant incr...

A method of efficiently implementing a continuous MAP decoding algorithm is presented. A sliding window technique is used to reduce the block size at the expense of extra computations. The smaller block size results in a large reduction in memory storage requirements, reduced delay, and the ability to implement a continuous MAP decoder. A technique for reducing the synchronisation time for a tu...

Many natural language generation tasks, such as abstractive summarization and text simplification, are paraphrase-orientated. In these tasks, copying and rewriting are two main writing modes. Most previous sequence-to-sequence (Seq2Seq) models use a single decoder and neglect this fact. In this paper, we develop a novel Seq2Seq model to fuse a copying decoder and a restricted generative decoder...

Recently, much advance has been made in image captioning, and an encoder-decoder framework has achieved outstanding performance for this task. In this paper, we propose an extension of the encoder-decoder framework by adding a component called guiding network. The guiding network models the attribute properties of input images, and its output is leveraged to compose the input of the decoder at ...