A Computationally Efficient Schnorr-Euchner Enumeration for Solving Integer Least-Squares Problem in Wireless Communications-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

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

Published:2017 Issue:1 Volume:E100.A Page:327-331
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

AHN Junil¹,CHANG Jaewon¹,LEE Chiho¹

Affiliation:

1. Agency for Defense Development (ADD)

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E100.A/1/E100.A_327/_pdf

Reference11 articles.

1. [1] U. Fincke and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,” Math. Comput., vol.44, no.170, pp.463-463, April 1985.

2. [2] C.P. Schnorr and M. Euchner, “Lattice basis reduction: Improved practical algorithms and solving subset sum problems,” Math. Program., vol.66, no.1-3, pp.181-199, 1994.

3. [3] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point search in lattices,” IEEE Trans. Inf. Theory, vol.48, no.8, pp.2201-2214, Aug. 2002.

4. [4] O. Damen, A. Chkeif, and J.-C. Belfiore, “Lattice code decoder for space-time codes,” IEEE Commun. Lett., vol.4, no.5, pp.161-163, May 2000.

5. [5] M.O. Damen, H.E. Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest lattice point,” IEEE Trans. Inf. Theory, vol.49, no.10, pp.2389-2402, Oct. 2003.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP