Sciweavers

23 search results - page 4 / 5
» Algebraic Distributed Space-Time Codes with Low ML Decoding ...
Sort
View
GLOBECOM
2008
IEEE
13 years 12 months ago
Distributed Double-Differential Orthogonal Space-Time Coding for Cooperative Networks
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
Manav R. Bhatnagar, Are Hjørungnes
CORR
2006
Springer
152views Education» more  CORR 2006»
13 years 5 months ago
On Reduced Complexity Soft-Output MIMO ML detection
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
Massimiliano Siti, Michael P. Fitz
ICASSP
2010
IEEE
13 years 5 months ago
Circulant space-time codes for integration with beamforming
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
Yiyue Wu, A. Robert Calderbank
CORR
2011
Springer
166views Education» more  CORR 2011»
12 years 9 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 5 months 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