The search functionality is under construction.

The search functionality is under construction.

A reduced complexity quantization error correction method for lattice reduction aided (LRA) vector precoding is proposed. For LRA vector precoding,Babai's approximation procedure can generate quantization errors leading to performance loss. Instead of making a list to correct all possible errors as is done in the existing scheme, we propose a novel method in which only a subset of all possible errors are corrected. The size of the subset is determined by the probability distribution of the number of actual errors. Thus, the computation complexity of our correction procedure is reduced with little performance loss compared with the existing correction scheme.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.7 pp.2525-2528

- Publication Date
- 2009/07/01

- Publicized

- Online ISSN
- 1745-1345

- DOI
- 10.1587/transcom.E92.B.2525

- Type of Manuscript
- LETTER

- Category
- Wireless Communication Technologies

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Xuan GENG , Ling-ge JIANG, Chen HE, "A Reduced Complexity Quantization Error Correction Method for Lattice Reduction Aided Vector Precoding" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 7, pp. 2525-2528, July 2009, doi: 10.1587/transcom.E92.B.2525.

Abstract: A reduced complexity quantization error correction method for lattice reduction aided (LRA) vector precoding is proposed. For LRA vector precoding,Babai's approximation procedure can generate quantization errors leading to performance loss. Instead of making a list to correct all possible errors as is done in the existing scheme, we propose a novel method in which only a subset of all possible errors are corrected. The size of the subset is determined by the probability distribution of the number of actual errors. Thus, the computation complexity of our correction procedure is reduced with little performance loss compared with the existing correction scheme.

URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2525/_p

Copy

@ARTICLE{e92-b_7_2525,

author={Xuan GENG , Ling-ge JIANG, Chen HE, },

journal={IEICE TRANSACTIONS on Communications},

title={A Reduced Complexity Quantization Error Correction Method for Lattice Reduction Aided Vector Precoding},

year={2009},

volume={E92-B},

number={7},

pages={2525-2528},

abstract={A reduced complexity quantization error correction method for lattice reduction aided (LRA) vector precoding is proposed. For LRA vector precoding,Babai's approximation procedure can generate quantization errors leading to performance loss. Instead of making a list to correct all possible errors as is done in the existing scheme, we propose a novel method in which only a subset of all possible errors are corrected. The size of the subset is determined by the probability distribution of the number of actual errors. Thus, the computation complexity of our correction procedure is reduced with little performance loss compared with the existing correction scheme.},

keywords={},

doi={10.1587/transcom.E92.B.2525},

ISSN={1745-1345},

month={July},}

Copy

TY - JOUR

TI - A Reduced Complexity Quantization Error Correction Method for Lattice Reduction Aided Vector Precoding

T2 - IEICE TRANSACTIONS on Communications

SP - 2525

EP - 2528

AU - Xuan GENG

AU - Ling-ge JIANG

AU - Chen HE

PY - 2009

DO - 10.1587/transcom.E92.B.2525

JO - IEICE TRANSACTIONS on Communications

SN - 1745-1345

VL - E92-B

IS - 7

JA - IEICE TRANSACTIONS on Communications

Y1 - July 2009

AB - A reduced complexity quantization error correction method for lattice reduction aided (LRA) vector precoding is proposed. For LRA vector precoding,Babai's approximation procedure can generate quantization errors leading to performance loss. Instead of making a list to correct all possible errors as is done in the existing scheme, we propose a novel method in which only a subset of all possible errors are corrected. The size of the subset is determined by the probability distribution of the number of actual errors. Thus, the computation complexity of our correction procedure is reduced with little performance loss compared with the existing correction scheme.

ER -