Results 221 to 230 of about 31,167 (257)

Robustness of neuroprosthetic decoding algorithms

Biological Cybernetics, 2003
We 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, Nicholas G. Hatsopoulos, Matthew Fellows, Liam Paninski, John P. Donoghue   +4 more
openaire   +3 more sources

Dynamic Chase decoding algorithm

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004
Chase 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), 2015
LP-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

A decoding algorithm for linear codes

1986
A decoding algorithm for linear codes is presented, which is able to correct beyond the half minimum distance and which has the capability to include soft decision decoding. Results on applying this algorithm to some codes (with and without soft decision) are included.
Martin Bossert, Ferdinand Hergert
openaire   +1 more source

The Leech lattice, the octacode, and decoding algorithms

IEEE Transactions on Information Theory, 1995
The authors derive a general theorem for computing the effective error coefficient of coset decoding with bounded distance decoding for the subcode. This theorem is applied to several new multilevel descriptions of the Golay code based on the Turyn construction and the holy construction, which are also presented.
Sun, F.W., Tilborg, van, H.C.A.
openaire   +3 more sources

Approximations to a Joint Detection/Decoding Algorithm

IEEE Transactions on Communications, 1977
The problem of optimally detecting coded data transmitted over channels which produce intersymbol interference is examined. The optimum bit-by-bit detector structure which directly estimates the transmitted data symbols from the received signal at the channel output is given. The performance of this joint detector is contrasted to that of a receiver in
Bruce D. Fritchman, C. D. Hafer, J. C. Mixsell, M. A. Sattar   +3 more
openaire   +2 more sources

Algorithms for Parallel Decoding

Proceedings. IEEE International Symposium on Information Theory, 2005
In 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

Gray prediction decoding algorithm for VLC decoder

The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings., 2005
A 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, null Ying-Hong Lu, null Bin-Da Liu   +2 more
openaire   +1 more source

A recursive SISO decoding algorithm

2021 IEEE Information Theory Workshop (ITW), 2021
Liudmila Karakchieva, Peter Trifonov
openaire   +1 more source

A New Decoding Algorithm for Complete Decoding of Linear Block Codes

SIAM Journal on Discrete Mathematics, 1998
Summary: In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a smallest subset of codewords ( Zero-Coverings) which need to be stored to perform the Zero-Coverings algorithm.
openaire   +2 more sources