Sciweavers

92 search results - page 6 / 19
» From maximum likelihood to iterative decoding
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 7 months ago
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 6 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
TWC
2008
137views more  TWC 2008»
13 years 7 months ago
Decoding, Performance Analysis, and Optimal Signal Designs for Coordinate Interleaved Orthogonal Designs
Space-time block codes (STBC) using coordinate interleaved orthogonal designs (CIOD) proposed recently by Khan and Rajan allow single-complex symbol decoding and offer higher data ...
Dung Ngoc Dao, Chintha Tellambura
VTC
2008
IEEE
14 years 2 months ago
Irregular Generic Detection Aided Iterative Downlink SDMA Systems
— When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper...
Chun-Yi Wei, Lajos Hanzo
CVPR
2000
IEEE
14 years 9 months ago
Structure from Motion without Correspondence
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
Frank Dellaert, Steven M. Seitz, Charles E. Thorpe...