Results 171 to 180 of about 1,331 (215)
Some of the next articles are maybe not open access.
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
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.
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
Robustness of neuroprosthetic decoding algorithms
Biological Cybernetics, 2003We assessed the ability of two algorithms to predict hand kinematics from neural activity as a function of the amount of data used to determine the algorithm parameters. Using chronically implanted intracortical arrays, single- and multineuron discharge was recorded during trained step tracking and slow continuous tracking tasks in macaque monkeys. The
Mijail Serruya +4 more
openaire +3 more sources
Dynamic Chase decoding algorithm
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance, d. The least complex version of the original Chase algorithms ("Chase-3") uses roughly d/2 trials of a conventional binary decoder, after which the best decoding result is selected as the final output.
Carlos Barrios Vicente, Jos H. Weber
openaire +1 more source
Encoding and decoding algorithms for LP-decodable multipermutation codes
2015 IEEE Information Theory Workshop (ITW), 2015LP-decodable multipermutation codes are a class of multipermutation codes that can be decoded using linear programming (LP). These codes are defined using linearly constrained multipermutation matrices, which are binary matrices that satisfy particular row sum and column sum constraints.
Xishuo Liu, Stark C. Draper
openaire +1 more source