% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@inproceedings{faucris.263732548,
abstract = {We utilize the new concept of linear computation coding to reduce the computational effort in digital beamforming. For that purpose the beamforming matrix is decomposed into the product of two or more matrices which are only composed of zeros and signed powers of two. As shown in [1], this allows for a multifold reduction of the required number of additions (multiplications are treated as multiple additions and bit-shifts) per entry of the beamforming matrix.We also provide an approximate analysis of the performance of linear computation coding for matrices with independent identically distributed matrices.For a typical implementation in beamforming, the proposed algorithm reduces the number of required addition units several times. To achieve the accuracy of 4-bit signed integer arithmetic for 1k-vectors, no multipliers and only half an adder per matrix entry is needed.},
author = {MÃ¼ller, Ralf},
booktitle = {IEEE Workshop on Statistical Signal Processing Proceedings},
date = {2021-07-11/2021-07-14},
doi = {10.1109/SSP49050.2021.9513777},
faupublication = {yes},
isbn = {9781728157672},
keywords = {digital beamforming; fixed-point arithmetic; quantization},
note = {CRIS-Team Scopus Importer:2021-09-10},
pages = {186-190},
publisher = {IEEE Computer Society},
title = {{Energy}-{Efficient} {Digital} {Beamforming} by {Means} of {Linear} {Computation} {Coding}},
venue = {Virtual, Rio de Janeiro, BRA},
volume = {2021-July},
year = {2021}
}