1243 search results - page 64 / 249 » Complexity reduction of C-Algorithm |
116
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
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...
100
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
121
click to vote
TSP
2008
15 years 1 months ago
2008
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)....
VTC
2007
IEEE
15 years 7 months ago
2007
IEEE
— A novel scheduling for turbo equalization with turbo decoding is proposed. The use of turbo codes associated to turbo equalizers has been frequently investigated in the literat...
160
click to vote
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...