Sciweavers

15 search results - page 2 / 3
» On Low-Complexity Maximum-Likelihood Decoding of Convolution...
Sort
View
VTC
2006
IEEE
104views Communications» more  VTC 2006»
13 years 11 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
GLOBECOM
2008
IEEE
13 years 11 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
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 5 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
GLOBECOM
2006
IEEE
13 years 11 months ago
Low-Complexity Turbo Equalization for Alamouti Space-Time Block Coded EDGE Systems
— Enhanced Data Rates for Global Evolution (EDGE) based systems are expected to facilitate the same services as third generation WCDMA systems. This goal is achieved through phys...
K. C. B. Wavegedara, Vijay K. Bhargava
ICASSP
2011
IEEE
12 years 9 months ago
Analog joint source-channel coding in Rayleigh fading channels
We consider discrete-time all-analog-processing joint sourcechannel coding, using non-linear spiral-like curves. We assume a Rayleigh channel, where the receiver may employ or not...
Glauber Gomes de Oliveira Brante, Richard Demo Sou...