Sciweavers

1245 search results - page 82 / 249
» Binary Sparse Coding
Sort
View
LCPC
1998
Springer
15 years 9 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
TIT
2010
112views Education» more  TIT 2010»
14 years 11 months ago
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by ran
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
David L. Donoho, Jared Tanner
DATE
2006
IEEE
134views Hardware» more  DATE 2006»
15 years 10 months ago
ASIP-based multiprocessor SoC design for simple and double binary turbo decoding
This paper presents a new multiprocessor platform for high throughput turbo decoding. The proposed platform is based on a new configurable ASIP combined with an efficient memory a...
Olivier Muller, Amer Baghdadi, Michel Jéz&e...
ISCAS
2007
IEEE
109views Hardware» more  ISCAS 2007»
15 years 11 months ago
Energy-Efficient Double-Binary Tail-Biting Turbo Decoder Based on Border Metric Encoding
—This paper presents an energy-efficient turbo decoder based on border metric encoding, which is especially suitable for non-binary circular turbo codes. In the proposed method, ...
Ji-Hoon Kim, In-Cheol Park
PASTE
2005
ACM
15 years 10 months ago
String analysis for x86 binaries
Information about string values at key points in a program can help program understanding, reverse engineering, and forensics. We present a static-analysis technique for recoverin...
Mihai Christodorescu, Nicholas Kidd, Wen-Han Goh