Sciweavers

24421 search results - page 37 / 4885
» Communicating Complex Systems
Sort
View
GLOBECOM
2008
IEEE
14 years 2 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
PLDI
2011
ACM
12 years 10 months ago
Automatic CPU-GPU communication management and optimization
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
Thomas B. Jablin, Prakash Prabhu, James A. Jablin,...
JSAC
2006
103views more  JSAC 2006»
13 years 7 months ago
Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications
One of the major challenges in supporting multimedia services over Internet protocol (IP)-based code-division multiple-access (CDMA) wireless networks is the quality-of-service (Qo...
Hai Jiang, Weihua Zhuang, Xuemin Shen, Qi Bi
GLOBECOM
2007
IEEE
14 years 2 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
ATAL
2008
Springer
13 years 9 months ago
Methods for complex single-mind architecture designs
The implementation of software systems with large numbers of heterogeneous components calls for a powerful design methodology. Although several such methodologies have been propos...
Kristinn R. Thórisson, Gudny Ragna Jonsdott...