toppbild


Referens:
  • J. Löfgren, P. Nilsson:
    On MIMO K-best sphere detector architecture complexity reductions
    ICSPCS: 2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS, PROCEEDINGS, The 2nd International Conference on Signal Processing and Communication Systems (ICSPCS 2008), Gold Coast, Australia, pp. 505-513, December 15-17, 2008.
  • (BibTeX)
Title:
On MIMO K-best sphere detector architecture complexity reductions
ICSPCS: 2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS, PROCEEDINGS
Type:
conference paper
Abstract:
This paper describes a way to modify the K-Best Sphere Detector, using the knowledge that the real and the imaginary part of complex number are always orthogonal. To ensure that this property is used, a modification to the Real Value Decomposition is proposed that will ensure that the orthogonality is seen also after the decomposition. The proposed method allows for equally efficient implementations of real-valued K-Best Sphere Detector implementations as the complex-valued implementation. The cost of the lowered complexity is an increased Bit Error Rate. With proper coding this drawback could be alleviated.
Year:
2008
MODS XML

Tillbaka

Senast uppdaterad:
Webbansvarig: Henrik Sjöland
Ansvarig utgivare: Prefekt

Institutionen för Elektro- och informationsteknik, LTH, Box 118, 221 00 Lund. Telefon: 046-222 00 00