Sciweavers

195 search results - page 11 / 39
» ml 2008
Sort
View
69
Voted
GLOBECOM
2008
IEEE
14 years 9 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
TWC
2008
77views more  TWC 2008»
14 years 9 months ago
Preamble-based cell identification for cellular OFDM systems
Preamble-based cell identification (CID) schemes are derived for orthogonal frequency division multiplexing (OFDM) systems. They include the optimal schemes based on the Bayesian a...
Wooseok Nam, Yong Hoon Lee
ECEASST
2008
67views more  ECEASST 2008»
14 years 9 months ago
Sharing OCL Constraints by Using Web Rules
This paper presents an MDE-based approach to interchanging rules between the Object Constraint Language (OCL) and REWERSE I1 Rule Markup Language (R2ML). The R2ML tends to be a sta...
Milan Milanovic, Dragan Gasevic, Adrian Giurca, Ge...
84
Voted
GLOBECOM
2008
IEEE
15 years 4 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
ICASSP
2008
IEEE
15 years 4 months ago
Stability analysis of complex maximum likelihood ica using Wirtinger calculus
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
Hualiang Li, Tülay Adali