Low complexity QR-decomposition architecture using the logarithmic number system

Authors:
Jochen Rust;Frank Ludwig;Steffen Paul
Affiliations:
University of Bremen, Bremen, Germany;University of Bremen, Bremen, Germany;University of Bremen, Bremen, Germany
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2013

Citing 6
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Precoding and Signal Shaping for Digital Transmission

Precoding and Signal Shaping for Digital Transmission
Elementary Functions: Algorithms and Implementation

Elementary Functions: Algorithms and Implementation
The CORDIC computing technique

IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication

Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication
The Accelerator Store framework for high-performance, low-power accelerator-based systems

IEEE Computer Architecture Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a QR-decomposition hardware implementation that processes complex calculations in the logarithmic number system. Thus, low complexity numeric format converters are installed, using nonuniform piecewise and multiplier-less function approximation. The proposed algorithm is simulated with several different configurations in a downlink precoding environment for 4x4 and 8x8 multi-antenna wireless communication systems. In addition, the results are compared to default CORDIC-based architectures. In a second step, HDL implementation as well as logical and physical CMOS synthesis are performed. The comparison to actual references highlight our approach as highly efficient in terms of hardware complexity and accuracy.