Year: 2019
Type: preprint
Abstract: In this paper, the paradigm of sphere decoding (SD) based on lattice Gaussian distribution is studied, where the sphere radius $D>0$ in the sense of Euclidean distance is characterized by the initial pruning size $K>1$, the standard deviation $σ>0$ and a regularization term $ρ_{σ,\mathbf{y}}(Λ)>0$ ($Λ$ denotes the lattice, $\mathbf{y}$ is the query point). In this way, extra freedom is obtained for analytical diagnosis of both the decoding performance and complexity. Based on it, the equivalent SD (ESD) algorithm is firstly proposed, and we show it is exactly the same with the classic Fincke-Pohst SD but characterizes the sphere radius with $D=σ\sqrt{2\ln K}$. By fixing $σ$ properly, we show that the complexity of ESD measured by the number of visited nodes is upper bounded by $|S|
Source: arXiv (Cornell University)
Authors: Wang, Zheng, Ling, Cong, Jin, Shi
Institution: Nanjing University of Aeronautics and Astronautics
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2962905065