A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications

Junil AHN; Jaewon CHANG; Chiho LEE

doi:10.1587/transfun.E100.A.327

A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications

Junil AHN, Jaewon CHANG, Chiho LEE

Full Text Views

0

Share
Cite this

Summary :

The integer least-squares (ILS) problem frequently arises in wireless communication systems. Sphere decoding (SD) is a systematic search scheme for solving ILS problem. The enumeration of candidates is a key part of SD for selecting a lattice point, which will be searched by the algorithm. Herein, the authors present a computationally efficient Schnorr-Euchner enumeration (SEE) algorithm to solve the constrained ILS problems, where the solution is limited into the finite integer lattice. To trace only valid lattice points within the underlying finite lattice, the authors devise an adaptive computation of the enumeration step and counting the valid points enumerated. In contrast to previous SEE methods based on a zig-zag manner, the proposed method completely avoids enumerating invalid points outside the finite lattice, and it further reduces real arithmetic and logical operations.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.1 pp.327-331

Publication Date: 2017/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.327

Type of Manuscript: LETTER

Category: Communication Theory and Signals

Authors

Junil AHN
  the Agency for Defense Development (ADD)
Jaewon CHANG
  the Agency for Defense Development (ADD)
Chiho LEE
  the Agency for Defense Development (ADD)

Keyword

Schnorr-Euchner enumeration, integer least-squares problem, sphere decoding, finite lattice

Cite this

Copy

Junil AHN, Jaewon CHANG, Chiho LEE, "A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 1, pp. 327-331, January 2017, doi: 10.1587/transfun.E100.A.327.
Abstract: The integer least-squares (ILS) problem frequently arises in wireless communication systems. Sphere decoding (SD) is a systematic search scheme for solving ILS problem. The enumeration of candidates is a key part of SD for selecting a lattice point, which will be searched by the algorithm. Herein, the authors present a computationally efficient Schnorr-Euchner enumeration (SEE) algorithm to solve the constrained ILS problems, where the solution is limited into the finite integer lattice. To trace only valid lattice points within the underlying finite lattice, the authors devise an adaptive computation of the enumeration step and counting the valid points enumerated. In contrast to previous SEE methods based on a zig-zag manner, the proposed method completely avoids enumerating invalid points outside the finite lattice, and it further reduces real arithmetic and logical operations.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.327/_p

Copy

@ARTICLE{e100-a_1_327,
author={Junil AHN, Jaewon CHANG, Chiho LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications},
year={2017},
volume={E100-A},
number={1},
pages={327-331},
abstract={The integer least-squares (ILS) problem frequently arises in wireless communication systems. Sphere decoding (SD) is a systematic search scheme for solving ILS problem. The enumeration of candidates is a key part of SD for selecting a lattice point, which will be searched by the algorithm. Herein, the authors present a computationally efficient Schnorr-Euchner enumeration (SEE) algorithm to solve the constrained ILS problems, where the solution is limited into the finite integer lattice. To trace only valid lattice points within the underlying finite lattice, the authors devise an adaptive computation of the enumeration step and counting the valid points enumerated. In contrast to previous SEE methods based on a zig-zag manner, the proposed method completely avoids enumerating invalid points outside the finite lattice, and it further reduces real arithmetic and logical operations.},
keywords={},
doi={10.1587/transfun.E100.A.327},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 327
EP - 331
AU - Junil AHN
AU - Jaewon CHANG
AU - Chiho LEE
PY - 2017
DO - 10.1587/transfun.E100.A.327
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2017
AB - The integer least-squares (ILS) problem frequently arises in wireless communication systems. Sphere decoding (SD) is a systematic search scheme for solving ILS problem. The enumeration of candidates is a key part of SD for selecting a lattice point, which will be searched by the algorithm. Herein, the authors present a computationally efficient Schnorr-Euchner enumeration (SEE) algorithm to solve the constrained ILS problems, where the solution is limited into the finite integer lattice. To trace only valid lattice points within the underlying finite lattice, the authors devise an adaptive computation of the enumeration step and counting the valid points enumerated. In contrast to previous SEE methods based on a zig-zag manner, the proposed method completely avoids enumerating invalid points outside the finite lattice, and it further reduces real arithmetic and logical operations.
ER -