Sciweavers

44 search results - page 3 / 9
» A New Reduced Complexity ML Detection Scheme for MIMO System...
Sort
View
GLOBECOM
2008
IEEE
14 years 2 days 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
TSP
2008
81views more  TSP 2008»
13 years 5 months ago
Subspace Beamforming for Near-Capacity MIMO Performance
A subspace beamforming method is presented that decomposes a MIMO channel into multiple pairs of subchannels. The pairing is done based on singular values such that similar channel...
Sirikiat Lek Ariyavisitakul, Jun Zheng, E. Ojard, ...
TSP
2008
147views more  TSP 2008»
13 years 5 months ago
Low-Complexity MIMO Multiuser Receiver: A Joint Antenna Detection Scheme for Time-Varying Channels
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
Charlotte Dumard, Thomas Zemen
GLOBECOM
2007
IEEE
13 years 12 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
VTC
2006
IEEE
13 years 11 months ago
Soft Detection with Linear Precoding for Spatial Multiplexing Systems
— We present a precoded reduced-complexity soft detection (PRCSD) algorithm for spatial multiplexing systems. The linear operations at both transmit and receive sides based on co...
Yong Li, Jaekyun Moon