Sciweavers

110 search results - page 7 / 22
» Semiorthogonal space-time block codes
Sort
View
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 6 months ago
Bit Error Performance of Orthogonal Space-Time Block Codes over Time-Selective Channel
— Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always tr...
Jun He, Pooi Yuen Kam
CORR
2007
Springer
158views Education» more  CORR 2007»
15 years 13 days ago
Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
G. Susinder Rajan, B. Sundar Rajan
83
Voted
TSP
2008
123views more  TSP 2008»
15 years 10 days ago
Blind and Semiblind Channel and Carrier Frequency-Offset Estimation in Orthogonally Space-Time Block Coded MIMO Systems
In this paper, the problem of joint channel and carrier frequency offset (CFO) estimation is studied in the context of multiple-input multiple-output (MIMO) communications based on...
Shahram Shahbazpanahi, Alex B. Gershman, Georgios ...
GLOBECOM
2008
IEEE
15 years 7 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu
GLOBECOM
2008
IEEE
15 years 7 months ago
Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
Luay Azzam, Ender Ayanoglu