2009IET CommunicationsRequires access

Partial regularisation approach for detection problems in underdetermined linear systems

Xiao-Wen Chang, Xiaohua Yang, Tho Le‐Ngoc, Peng Wang

Open publisher page 5 citations

Abstract

The maximum likelihood detection problem in many underdetermined linear communications systems can be described as an underdetermined integer least squares (ILS) problem. To solve it efficiently, a partial regularisation approach is proposed. The original underdetermined ILS problem is first transformed to an equivalent overdetermined ILS problem by using part of the transmit vector to do the regularisation. Then the overdetermined ILS problem is solved by conventional sphere decoding algorithms. Simulation results indicate that this approach can be much more efficient than other approaches for any square constellation higher than 4QAM.

About this research paper

What this paper is about

The maximum likelihood detection problem in many underdetermined linear communications systems can be described as an underdetermined integer least squares (ILS) problem. To solve it efficiently, a partial regularisation approach is proposed. The original underdetermined ILS problem is first transformed to an equivalent overdetermined ILS problem by using part of the transmit vector to do the regularisation. Then the overdetermined ILS problem is solved by conventional sphere decoding algorithms. Simulation results indicate that this approach can be much more efficient than other approaches for any square constellation higher than 4QAM.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The maximum likelihood detection problem in many underdetermined linear communications systems can be described as an underdetermined integer least squares (ILS) problem. To solve it efficiently, a partial regularisation approach is proposed. The original underdetermined ILS problem is first transformed to an equivalent overdetermined ILS problem by using part of the transmit vector to do the regularisation. Then the overdetermined ILS problem is solved by conventional sphere decoding algorithms. Simulation results indicate that this approach can be much more efficient than other approaches for any square constellation higher than 4QAM.

Key concepts: Underdetermined system, Overdetermined system, Karush–Kuhn–Tucker conditions, Integer (computer science), Mathematics, Computer science, Algorithm, Decoding methods

Related papers

Back to paper searchBrowse research topicsOriginal source
Partial regularisation approach for detection problems in underdetermined linear systems — Research Paper | ScholarLens