This paper proposes an efficient H.264/AVC entropy decoder. It requires no ROM/RAM fabrication process that decreases fabrication cost and increases operation speed. It was achieved by optimizing lookup tables and internal buffers, which significantly improves area, speed, and power. The proposed entropy decoder does not exploit embedded processor for bitstream manipulation, which also improves...

Acquisition of 3D data accurately and densely in real time using a low cost structured light system is still an ongoing topic among the computer vision community as it is hard to achieve all these features together. Among several techniques the pseudorandom array technique is widely used in real time 3D scene capturing as it tends to concentrate the entire coding scheme into a single pattern. B...

State-of-the-art graph-based parsers use features over higher-order dependencies that rely on decoding algorithms that are slow and difficult to generalize. On the other hand, transition-based dependency parsers can easily utilize such features without increasing the linear complexity of the shift-reduce system beyond a constant. In this paper, we attempt to address this imbalance for graph-bas...

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptively splits the input sequence into small chunks over which soft attention is ...

In this paper, the implementation of a digital signal processor (DSP) based multi-format decoder for an IP set-top box is described. Using several software optimization techniques, the multi-format decoder has been fitted into a TMS320DM641 DSP @ 480 Mhz. Starting from a native C code implementation, a six-step software optimization process has been applied to improve the decoder performance. C...

In this paper we survey the various erasure codes which had been proposed and patented recently, and along the survey we provide introductory tutorial on many of the essential concepts and readings in erasure and Fountain codes. Packet erasure is a fundamental characteristic inherent in data storage and data transmission system. Traditionally replication/ retransmission based techniques had bee...

In this paper we deal with the heuristic exploration of general hypothesis spaces arising both in the HMM and segment-based approaches of speech recognition. The generated hypothesis space is a tree where we assign costs to its nodes. The tree and the costs are both generated in a top-down way where we have node extension rules and aggregation operators for the cost calculation. We introduce a ...

Defining the reordering search space is a crucial issue in phrase-based SMT between distant languages. In fact, the optimal tradeoff between accuracy and complexity of decoding is nowadays reached by harshly limiting the input permutation space. We propose a method to dynamically shape such space and, thus, capture long-range word movements without hurting translation quality nor decoding time....

Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of language model integration. In this paper we borrow from phrase-based decoding the idea to generate a translation incrementally left-to-right, and show that for tree-to-string models, with a clever encoding of derivat...

We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost -yet effectivedecoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and ...