1245 search results - page 82 / 249 » Binary Sparse Coding |
136
click to vote
LCPC
1998
Springer
15 years 6 months ago
1998
Springer
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...
129
Voted
TIT
2010
14 years 9 months ago
2010
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 >...
130
click to vote
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
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...
103
Voted
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
—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, ...
PASTE
2005
ACM
15 years 8 months ago
2005
ACM
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...