Sciweavers

642 search results - page 70 / 129
» corr 2006
Sort
View
98
Voted
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 18 days ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 17 days ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
86
Voted
CORR
2006
Springer
124views Education» more  CORR 2006»
15 years 17 days ago
A Feedback Reduction Technique for MIMO Broadcast Channels
A multiple antenna broadcast channel with perfect channel state information at the receivers is considered. If each receiver quantizes its channel knowledge to a finite number of b...
Nihar Jindal
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 17 days ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 17 days ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu