Sciweavers

1245 search results - page 136 / 249
» Binary Sparse Coding
Sort
View
CORR
2007
Springer
85views Education» more  CORR 2007»
15 years 3 months ago
The star trellis decoding of Reed-Solomon codes
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes. I. THE GOLAY CODE IN STAR...
Sergei Fedorenko
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
CORR
2011
Springer
203views Education» more  CORR 2011»
14 years 10 months ago
AWGN Channel Analysis of Terminated LDPC Convolutional Codes
— It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linear...
David G. M. Mitchell, Michael Lentmaier, Daniel J....
124
Voted
ICC
2011
IEEE
203views Communications» more  ICC 2011»
14 years 3 months ago
Constellation Shaping for Bit-Interleaved Coded APSK
—This paper considers a technique for shaping a turbo-coded amplitude-phase shift keying (APSK) constellation. After bit-interleaving, a subset of the bits output by a binary tur...
Matthew C. Valenti, Xingyu Xiang
ISCA
2006
IEEE
131views Hardware» more  ISCA 2006»
15 years 9 months ago
Reducing Startup Time in Co-Designed Virtual Machines
A Co-Designed Virtual Machine allows designers to implement a processor via a combination of hardware and software. Dynamic binary translation converts code written for a conventi...
Shiliang Hu, James E. Smith