SORN Arithmetic for MIMO Symbol Detection - Exploration of the Type-2 Unum Format

Abstract

In this paper a new approach for a fast and low-precision number format is explored. The SORN representation uses a fixed set of exact values and open intervals in between to represent real numbers on the digital layer. With SORN arithmetic operations can be carried out using simple lookup tables which results in a very fast and low-complex way of computing. The new arithmetic is applied to an exhaustive search algorithm for maximum likelihood symbol detection in a MIMO transmission environment. The algorithm is implemented in hardware and executed on a Zynq-7000 FPGA. It is shown that the amount of possible solutions for the symbol detection can be reduced by up to 80% using the fast SORN architecture as a preprocessing stage for classic solvers.