Results 1 - 10 of 7,158

Decoding Algorithm

by Mehnaz Rahman, Gwan S. Choi, Mehnaz Rahman, Gwan S. Choi
"... Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low complexity. In this paper, we develop the fixed point design o ..."
Abstract - Add to MetaCart
of an iterative soft decision based LR-aided K-best decoder, which reduces the complexity of existing sphere decoder. A simulation based word-length optimization is presented for physical implementation of the K-best decoder. Simulations show that the fixed point result of 16 bit precision can keep bit error rate

Decoding Algorithm in Statistical Machine Translation

by Ye-Yi Wang, Alex Waibel , 1997
"... Decoding algorithm is a crucial part in sta- tistical machine translation. We describe a stack decoding algorithm in this paper. ..."
Abstract - Cited by 44 (2 self) - Add to MetaCart
Decoding algorithm is a crucial part in sta- tistical machine translation. We describe a stack decoding algorithm in this paper.

An Efficient Decoding Algorithm for WFA

by Raghavendra Udupa U, Vinayaka D Pandit, U Vinayaka, D Pandit, Tanveer A Faruquie
"... Several promising image/video data compression techniques that explicitly exploit self-similarity in images and videos have been proposed in the recent past. While most of these fractal techniques are variants and/or enhancements of Jacquin's Iterated Function Systems (IFS), the Weighted Finite ..."
Abstract - Add to MetaCart
Finite Automata (WFA) techniques (introduced by Culik and Kari) are based on automata theory and are known to yield better compression rates than the IFS techniques in practice. The algorithm proposed by Culik and Kari for decoding WFA is simple but inecient. It is very slow and has very high memory

List Decoding: Algorithms and Applications

by Madhu Sudan - SIGACT News , 2000
"... Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of "list-decoding" for ..."
Abstract - Cited by 36 (0 self) - Add to MetaCart
" for error-correcting codes. In this survey we describe the list-decoding problem, the algorithms that have been developed, and a diverse collection of applications within complexity theory. 1

Bifurcations and chaos in the turbo decoding algorithm

by Z. Tasev, P. Popovski, G. M. Maggio, L. Kocarev - Cornell University , 2003
"... Abstract. The turbo decoding algorithm is a high-dimensional dynamical system parameterized by a large number of parameters (for a practical realization the turbo decoding algorithm has more than 10 3 variables and is parameterized by more than 10 3 parameters). In this chapter we treat the turbo de ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. The turbo decoding algorithm is a high-dimensional dynamical system parameterized by a large number of parameters (for a practical realization the turbo decoding algorithm has more than 10 3 variables and is parameterized by more than 10 3 parameters). In this chapter we treat the turbo

An Algebraic Decoding Algorithm for Convolutional Codes

by Joachim Rosenthal , 1998
"... this article to introduce a new iterative algebraic decoding algorithm which is capable of decoding convolutional codes which have a certain underlying algebraic structure. The algorithm exploits the algebraic structure of the convolutional code and it achieves its best performance if some naturally ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
this article to introduce a new iterative algebraic decoding algorithm which is capable of decoding convolutional codes which have a certain underlying algebraic structure. The algorithm exploits the algebraic structure of the convolutional code and it achieves its best performance if some

BER Analysis of Turbo Decoding Algorithms

by Prabhavati D. Bahirgonde, S. K. Dixit, Solapur India
"... Turbo decoding for 3GPP-LTE wireless communication standard is most challenging task to reduce computational complexity. The complexity of Turbo decoder is much higher than the complexity of Turbo encoder. Turbo decoder complexity depends on decoding algorithm. Less complexity in decoding gives degr ..."
Abstract - Add to MetaCart
Turbo decoding for 3GPP-LTE wireless communication standard is most challenging task to reduce computational complexity. The complexity of Turbo decoder is much higher than the complexity of Turbo encoder. Turbo decoder complexity depends on decoding algorithm. Less complexity in decoding gives

On the sphere-decoding algorithm I. Expected complexity

by Babak Hassibi, Haris Vikalo - IEEE Trans. Sig. Proc , 2005
"... Abstract—The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The ..."
Abstract - Cited by 135 (7 self) - Add to MetaCart
are known. Therefore, in this paper, rather than dwell on the worst-case complexity of the integer least-squares problem, we study its expected complexity, averaged over the noise and over the lattice. For the “sphere decoding” algorithm of Fincke and Pohst, we find a closed-form expression for the expected

Memory Optimization of MAPTurbo Decoder Algorithms

by Curt Schurgers, Francky Catthoor, Marc Engels - IEEE Trans. VLSI Syst , 2001
"... Turbo codes are the most recent breakthrough in coding theory. However, the decoder's implementation cost limits their incorporation in commercial systems. Although the decoding algorithm is highly data dominated, no true memory optimization study has been performed yet. We have extensively and ..."
Abstract - Cited by 27 (2 self) - Add to MetaCart
Turbo codes are the most recent breakthrough in coding theory. However, the decoder's implementation cost limits their incorporation in commercial systems. Although the decoding algorithm is highly data dominated, no true memory optimization study has been performed yet. We have extensively

THE SNOWFLAKE DECODING ALGORITHM

by J. B. Nation, Catherine Walker
"... Abstract. This paper describes an automated algorithm for generating a group code using any unitary group, initial vector, and generating set that satisfy a necessary condition. Examples with exceptional complex reflection groups, as well as an analysis of the decoding complexity, are also included. ..."
Abstract - Add to MetaCart
Abstract. This paper describes an automated algorithm for generating a group code using any unitary group, initial vector, and generating set that satisfy a necessary condition. Examples with exceptional complex reflection groups, as well as an analysis of the decoding complexity, are also included
Results 1 - 10 of 7,158