Results 241 to 250 of about 178,509 (285)
Some of the next articles are maybe not open access.
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
Serruya, Mijail +4 more
openaire +3 more sources
Gray prediction decoding algorithm for VLC decoder
The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings., 2005A new decoding algorithm for VLC decoder is proposed. In the traditional VLC decoding algorithms, we have to search each level of Huffman tree per operation. Therefore, the possible throughput is limited by the searching time. The proposed algorithm takes advantage of the trend among AC coefficients in each block to predict the next codeword.
null Che-Hong Chen +2 more
openaire +1 more source
Algorithms for Parallel Decoding
Proceedings. IEEE International Symposium on Information Theory, 2005In this paper we address the parallel decoding problem in a general formulation. The structure of the receiver consists of a bank of z demodulators each followed by an errors and erasures correcting decoders. Each demodulator has a threshold /spl theta/ that determines an erasure region; we then assign a cost f(/spl theta/) to the interference for ...
W.E. Stark, A.A. Hassan
openaire +1 more source
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.
C.B. Vicente, J.H. Weber
openaire +1 more source
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.
null 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.
null Zheng Li +3 more
openaire +1 more source
Fast decoding viterbi algorithm
Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., 2004The fast decoding Viterbi algorithm is proposed in this paper, which depends on majority principle for decision. The proposed algorithm is compared with conventional decoding algorithm. The comparison is done by means of decoder initialization with the metric tableset and the possible states of the encoder calculated.
M. Wainakh, I. Abboud, M. Morhej
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 ...
null Jun Tan, G.L. Stuber
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 ...
null Jun Tan, G.L. Stuber
openaire +1 more source
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