Sciweavers

9 search results - page 1 / 2
» Maximum-likelihood noncoherent OSTBC detection with polynomi...
Sort
View
TWC
2010
12 years 11 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
GLOBECOM
2008
IEEE
13 years 11 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
JCP
2006
99views more  JCP 2006»
13 years 4 months ago
On Maximum-Likelihood Detection for Non-coherent FH/BFSK in Multitone Jamming
We derive the optimum maximum-likelihood (ML) non-coherent detector for FH/BFSK systems in the environment of multitone jamming and additive white Gaussian noise with no aid of jam...
Yi-Chen Chen
GLOBECOM
2007
IEEE
13 years 11 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 4 months ago
GLRT-Optimal Noncoherent Lattice Decoding
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
Daniel J. Ryan, Iain B. Collings, I. Vaughan L. Cl...