Greedy detection

DOI10.1023/A:1014055010787zbMATH Open0996.94016OpenAlexW2912123531MaRDI QIDQ1597599FDOQ1597599

Authors: Amina AlRustamani, Branimir Vojcic, Andrej Stefanov 

Publication date: 30 May 2002

Published in: Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014055010787

Recommendations

• Polynomial complexity optimal detection of certain multiple-access systems
• A recursive linear detection algorithm for asynchronous CDMA communication system
• Multiuser detection for overloaded CDMA systems
• Adaptive multiuser detection
• A CDMA multiuser detection algorithm on the basis of belief propagation

zbMATH Keywords

greedy algorithminterference cancellationspace-time codingmultiuser detectioniterative decodingmulti-input multi-output systemsoptimum detectioncode-division multiple-access systemsturbo coding

Mathematics Subject Classification ID

Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Detection theory in information and communication theory (94A13)

Cited In (3)

• Greedy SINR maximization in collaborative multibase wireless systems
• Recognizing Greedy Structures
• Polynomial complexity optimal detection of certain multiple-access systems

This page was built for publication: Greedy detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597599)