© 2009 ETRI Journal, Volume 31, Number 5, October 2009 A high throughput parallel decoding method is developed for context-based adaptive variable length codes. In this paper, several new design ideas are devised and implemented for scalable parallel processing, a reduction in area, and a reduction in power requirements. First, simplified logical operations instead of memory lookups are used fo...

This paper describes a framework for incorporating referential semantic information from a world model or ontology directly into a probabilistic language model of the sort commonly used in speech recognition, where it can be probabilistically weighted together with phonological and syntactic factors as an integral part of the decoding process. Introducing world model referents into the decoding...

Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cyclefree. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effe...

Semantic knowledge has been adopted recently for SMT preprocessing, decoding and evaluation, in order to be able to compare sentences based on their meaning rather than on mere lexical and syntactic similarity. Little attention has been paid to semantic knowledge in the context of integrating fuzzy matches from a translation memory with SMT. We present work in progress which focuses on semantic...

In the context of coded transmission over intersymbol interference channels we investigate a bidirectional list-sequential equalizer (BI-LISS) suitable for turbo schemes. Especially for channels with an unmanageable high number of states for a trellis based APP equalization this sequential algorithm shows almost optimal performance with much smaller complexity. Generally, the list-sequential (L...

An improved method for the fast correlation attack on certain stream ciphers is presented. The proposed algorithm employs the following decoding approaches: list decoding in which a candidate is assigned to the list based on the most reliable information sets, and minimum distance decoding based on Hamming distance. Performance and complexity of the proposed algorithm are considered. A desirabl...

Coded modulation is a bandwidth efficient schemes that combines the function of coding and modulation. In this paper a comparative study of various modulation techniques such as Trellis coded modulation(TCM),Turbo Trellis coded modulation(TTCM),Bit-Interleaved Coded Modulation(BICM) ,Iterative Decoding Bit-Interleaved Coded Modulation(BICM-ID) and Superposistion Coded Modulation schemes over Ga...

This article describes a framework for incorporating referential semantic information from a world model or ontology directly into a probabilistic language model of the sort commonly used in speech recognition, where it can be probabilistically weighted together with phonological and syntactic factors as an integral part of the decoding process. Introducing world model referents into the decodi...

The role model strategy is introduced as a method for designing an estimator by approaching the output of a superior estimator that has better input observations. This strategy is shown to yield the optimal Bayesian estimator when a Markov condition is fulfilled. Two examples involving simple channels are given to illustrate its use. The strategy is combined with time averaging to construct a s...