Greedy detection

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology

Volumn 30, Issue 1-3, 2002, Pages 179-195

  Alrustamani, Amina ^a   Vojcic, Branimir ^b   Stefanov, Andrej ^c  

^a Dubai Internet City   (United Arab Emirates)

^b The George Washington University   (United States)

^c Arizona State University   (United States)

Author keywords

Interference cancellation; Multi input multi output systems; Multiple access; Multiuser detection; Space time coding; Turbo coding

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; DATA COMMUNICATION SYSTEMS; INTERFERENCE SUPPRESSION; TELECOMMUNICATION SYSTEMS; TURBO CODES;

GREEDY ALGORITHMS;

SIGNAL DETECTION;

EID: 0036130299     PISSN: 13875485     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014055010787     Document Type: Article

References (66)

1. On limits of wireless communications in a fading environment when using multiple antennas
2. Minimum probability of error for asynchronous Gaussian multiple-access channels
3. Computational complexity of optimum multiuser detection
4. Turbo coded modulation for wireless communications with antenna diversity
5. Turbo coded modulation for systems with transmit and receive antenna diversity
6. Linear multiuser detectors for synchronous code-division multiple-access channels
7. A family of suboptimum detectors for coherent multiuser communications
8. MMSE interference suppression for direct-sequence spread spectrum CDMA
9. DS/CDMA successive interference cancellation
10. Multistage detection in asynchronous code-division multiple-access communications
11. Near-optimum detection in synchronous code-division multiple-access systems
12. Optimal multistage interference cancellation for CDMA systems using the nonlinear MMSE criterion
13. Soft interference cancellation in multiuser communications
14. Improved parallel interference cancellation for CDMA
15. Iterated soft-decision interference cancellation for CDMA
16. Decorrelating decision-feedback multiuser detector for synchronous code-division multiple-access channel
17. Synchronous DS-CDMA systems with improved decorrelating decision-feedback multiuser detection
18. Near optimum tree search detection schemes for bit-synchronous multiuser CDMA systems over Gaussian and Two-Path Rayleigh-fading channels
19. A near ideal noise whitening filter for an asynchronous time-varying CDMA systems
20. Joint signal detection and parameter estimation in multiuser communications
21. Multiuser signal detection using sequential decoding
22. Breadth-first maximum likelihood detection in multiuser CDMA
23. Group detection for synchronous Gaussian code-division multiple-access channels
24. Parallel group detection for synchronous CDMA communication over frequency-selective rayleigh fading channels
25. A new multistage detector in synchronous CDMA communications
26. New suboptimum multiuser detectors for synchronous CDMA systems
27. Concatenated space-time coding
28. Concatenated space-time coding for large antenna arrays
29. The layered space-time architecture: A new prespective
30. Experiments in quadratic 0-1 programming
31. An improved branch and bound algorithm for mixed integer non-linear programs
32. Proof duality, complementation and persistency in quadratic 0-1 optimization
33. Computational aspects of a branch and bound algorithm for quadratic zero-one programming
34. Integer programming
35. Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
36. Complexity of uniqueness and local search in quadratic 0-1 programming
37. Construction of test problems in quadratic bivalent programming
38. The indefinite zero-one quadratic problem
39. Unconstrained quadratic bivalent programming problem
40. A solvable case for quadratic 0-1 programming
41. A non-orthogonal synchronous DS-CDMA case, where successive cancellation and maximum-likelihood multiuser detectors are equivalent
42. Selected applications of min cut in networks
43. Low complexity optimal joint detection for oversaturated multiple access communications
44. Vector assignment scheme for M + N users in N-dimensional global additive channel
45. Solving a class of optimum multiuser detection problems with polynomial complexity
46. Lower bounds on the maximum crosscorrelation of signals
47. Welch's bound and sequence sets for code-division multiple-access systems
48. Greedy-based multiuser detection for CDMA systems
49. Greedy multiuser detection over single-path fading channel
50. Greedy iterative multiuser detection for turbo coded multiuser communications
51. Multiuser detection in single-path fading channels
52. Limiting performance of block fading channels with multiple antennas
53. Capacity of a mobile multiple-antenna communication link in rayleigh flat fading
54. Capacity of multi-antenna Gaussian channels
55. Near shannon limit error-correcting coding: Turbo codes
56. Bit-interleaved coded modulation
57. Trellis-coded modulation with bit interleaving and iterative decoding
58. Bit-interleaved coded modulation with iterative decoding using soft feedback
59. On turbo encoded BICM
60. A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes
61. Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: System model, decoding approaches, and practical considerations