Results 211 to 220 of about 31,167 (257)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Viterbi decoding algorithm
IEEE Transactions on Information Theory, 1969A new interpretation of the Viterbi decoding algorithm based on the state-space approach to dyamical systems is presented. In this interpretation the optimum decoder solves a generalized regulator control problem by dynamic programming techniques.
J Omura
exaly +2 more sources
2013 13th Canadian Workshop on Information Theory, 2013
A standard model for the energy of a computation was developed by Thompson, which relates the energy of a computation to the product of the area a circuit and the number of clock cycles needed to carry out the computation. We show that for any circuit implemented this way, using any algorithm that performs decoding of a codeword passed through a binary
Christopher Blake, Frank R. Kschischang
openaire +1 more source
A standard model for the energy of a computation was developed by Thompson, which relates the energy of a computation to the product of the area a circuit and the number of clock cycles needed to carry out the computation. We show that for any circuit implemented this way, using any algorithm that performs decoding of a codeword passed through a binary
Christopher Blake, Frank R. Kschischang
openaire +1 more source
1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 2003
We study and develop several robust decoding algorithms based on the minimax rule. The algorithms robust to estimation errors and channel variations. The decoding problem is studied when using a matched and mismatched decoder. Examples using robust the Viterbi algorithm (1967) and MAP algorithm are also presented.
Zheng Li +3 more
openaire +1 more source
We study and develop several robust decoding algorithms based on the minimax rule. The algorithms robust to estimation errors and channel variations. The decoding problem is studied when using a matched and mismatched decoder. Examples using robust the Viterbi algorithm (1967) and MAP algorithm are also presented.
Zheng Li +3 more
openaire +1 more source
Media, Culture & Society, 2019
In this article, we propose to adapt the communication theory concept of ‘decoding’ as a sensitizing device to probe how people come to know and understand algorithms, what they imagine algorithms to do, and their valorization of and responses to algorithmic work in daily media use.
Stine Lomborg, Patrick Heiberg Kapsch
openaire +2 more sources
In this article, we propose to adapt the communication theory concept of ‘decoding’ as a sensitizing device to probe how people come to know and understand algorithms, what they imagine algorithms to do, and their valorization of and responses to algorithmic work in daily media use.
Stine Lomborg, Patrick Heiberg Kapsch
openaire +2 more sources
An Adaptive Huffman Decoding Algorithm for MP3 Decoder
2010 Fifth IEEE International Symposium on Electronic Design, Test & Applications, 2010This paper proposes a novel array data structure to represent Huffman code table and an adaptive algorithm for Huffman decoding based on Single-side Growing Huffman Coding approach which provides a memory efficient and high-speed decoding algorithm. The search time of the proposed algorithm for finding a symbol is the ceiling of (CL/4) where CL is the ...
Hoang-Anh Pham +2 more
openaire +1 more source
Decoding OvTDM with sphere-decoding algorithm
The Journal of China Universities of Posts and Telecommunications, 2008Overlapped time division multiplexing (OvTDM) is a new type of transmission scheme with high spectrum efficiency and low threshold signal-to-noise ratio (SNR). In this article, the structure of OvTDM is introduced and the sphere-decoding algorithm of complex domain is proposed for OvTDM.
Xin JIN, Dao-ben LI
openaire +1 more source
IEEE Transactions on Communications, 2003
A new maximum a posteriori (MAP)-equivalent soft-input soft-output (SISO) algorithm is derived together with its simplified versions. The proposed SISO algorithms provide a good compromise between complexity and performance. Our simplest SISO algorithm has lower complexity than the log-MAP, the max-log-MAP, and the soft-output Viterbi (1998) algorithm ...
Jun Tan 0002, Gordon L. Stüber
openaire +1 more source
A new maximum a posteriori (MAP)-equivalent soft-input soft-output (SISO) algorithm is derived together with its simplified versions. The proposed SISO algorithms provide a good compromise between complexity and performance. Our simplest SISO algorithm has lower complexity than the log-MAP, the max-log-MAP, and the soft-output Viterbi (1998) algorithm ...
Jun Tan 0002, Gordon L. Stüber
openaire +1 more source
The Algorithm of Repeat TPC Decoding
Third International Conference on Information Technology and Applications (ICITA'05), 2005This paper presents the research on decoding algorithm for turbo product codes (TPC) based on principles of log-likelihood probability and the maximum posterior criterion. A log-likelihood probability approximating expression is derived and an optimal algorithm for repeated soft decoding is developed.
Yuhuang Ye, Jun Chen
openaire +1 more source
A parallel Viterbi decoding algorithm
Concurrency and Computation: Practice and Experience, 2001AbstractIn this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array.
openaire +3 more sources