Reduced-complexity transmit-beamforming codebook search algorithm
Reduced-complexity transmit-beamforming codebook search algorithm
A two-stage reduced-complexity index search algorithm is proposed for finding the best vector in the codebook of quantised equal gain transmission based multiple-input multiple-output arrangements. When the number of transmit antennas is more than three, the normalised complexity is halved while maintaining the same symbol error rate as the benchmark.
938-939
Kim, Y. J.
83901f19-e297-4437-ab67-48a87cbf6796
Won, Seung
3b1fcfcf-6f8b-49b3-889b-7f6cdb58978b
Park, N. Y.
557f6f77-4c56-4e77-8ca6-c09a3824cc59
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
August 2011
Kim, Y. J.
83901f19-e297-4437-ab67-48a87cbf6796
Won, Seung
3b1fcfcf-6f8b-49b3-889b-7f6cdb58978b
Park, N. Y.
557f6f77-4c56-4e77-8ca6-c09a3824cc59
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Kim, Y. J., Won, Seung, Park, N. Y. and Hanzo, Lajos
(2011)
Reduced-complexity transmit-beamforming codebook search algorithm.
Electronics Letters, 47, .
Abstract
A two-stage reduced-complexity index search algorithm is proposed for finding the best vector in the codebook of quantised equal gain transmission based multiple-input multiple-output arrangements. When the number of transmit antennas is more than three, the normalised complexity is halved while maintaining the same symbol error rate as the benchmark.
Text
05980046.pdf
- Other
More information
Published date: August 2011
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 272741
URI: http://eprints.soton.ac.uk/id/eprint/272741
ISSN: 0013-5194
PURE UUID: a8ba8eb9-0e39-479c-af69-4b3ceda6928e
Catalogue record
Date deposited: 01 Sep 2011 16:01
Last modified: 18 Mar 2024 02:35
Export record
Contributors
Author:
Y. J. Kim
Author:
Seung Won
Author:
N. Y. Park
Author:
Lajos Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics