On MIMO K-best sphere detector architecture complexity reductions
Author
Summary, in Swedish
Abstract in Undetermined
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.
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.
Publishing year
2008
Language
English
Pages
505-513
Publication/Series
ICSPCS: 2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS, PROCEEDINGS
Document type
Conference paper
Publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
The 2nd International Conference on Signal Processing and Communication Systems (ICSPCS 2008)
Conference date
2008-12-15 - 2008-12-17
Conference place
Gold Coast, Australia
Status
Published
Research group
- Digital ASIC
- Elektronikkonstruktion
ISBN/ISSN/Other
- ISBN: 978-1-4244-4242-3