Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Method for detecting spherical decode based on depth-first search

A technology of depth-first search and spherical decoding, applied in the direction of preventing/detecting errors through diversity reception, digital transmission systems, and preventing errors, etc., can solve search failure, excessive computational complexity, quantitative analysis and detection complexity and delay Difficulties and other problems, to achieve the effect of reducing computational complexity and being easy to implement

Inactive Publication Date: 2009-10-21
ST ERICSSON SEMICON BEIJING
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Hassibi and Vikalo show that sphere decoding has polynomial computational complexity
[0005] Nevertheless, there are still many deficiencies in the sphere decoding algorithm, which affect the practical application of the algorithm
First of all, the selection of initial radius is very important for spherical decoding. Too large initial radius will lead to excessive computational complexity, while too small initial radius will cause no emission signal mapping point in the sphere and the search will fail.
Then, the number of grid points in sphere decoding is a random variable, which is affected by channel conditions, noise and initial radius, so it is difficult to quantitatively analyze the detection complexity and delay. As pointed out by Jalden et al., the operation of sphere decoding is complex The degree is still NP in the worst case, which is very unfavorable in real-time high-speed applications; in addition, the uncertainty also makes the hardware implementation of sphere decoding difficult

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for detecting spherical decode based on depth-first search
  • Method for detecting spherical decode based on depth-first search
  • Method for detecting spherical decode based on depth-first search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.

[0032] For the basic MIMO system model such as figure 1 As shown, assuming that the number of transmitting antennas is N t , The number of receiving antennas is N R , Its channel is a flat fading channel, then the system can be shown by the following formula:

[0033] y=H·s+n (1)

[0034] Where y is N R ×1 received signal vector, s is N t ×1 transmit signal vector, n is N R ×1 noise vector, its mean value is 0, variance is N 0 / 2, H is N R ×N t One-dimensional channel model vector (channel matrix).

[0035] Using the maximum likelihood estimation algorithm, the expression is as follows:

[0036] min s ∈ Ω | | n ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a method for detecting spherical decode based on depth-first search, which comprises the following steps: A, performing QR deposition on a channel matrix; B, multiplying a conjugate transpose and a received signal of a Q matrix to obtain an equalizing signal rho; C, setting an initial search radius; D, executing the depth-first search according to the initial search radius, an R matrix and the rho, and updating the search radius; E, setting an upper limit value M of the search total node number and an upper limit value Ki of the ith layer search node number; F, executing the depth-first search according to the current search radius, the R matrix and the rho, and when the search gets to the ith layer, judging whether the searched node number on the ith layer is equal to Ki or not, otherwise, executing the search on the ith layer, and if so, getting to search the i+1th layer; and G, repeating the step F until the searched total node number is equal to M or all the layers cannot be searched any more, and outputting a decoding result. The method can effectively reduce the operation complexity of the sphere decoding, and is easy to achieve through hardware.

Description

Technical field [0001] The present invention belongs to the field of wireless communication, and particularly relates to a depth-first search-based sphere decoding detection method for multiple input multiple output (MIMO) systems. The present invention can also be applied to orthogonal frequency division multiplexing (OFDM) and MIMO Detection of MIMO signals in the system. Background technique [0002] MIMO maximum likelihood (ML) detection can make the system obtain the best bit error rate performance, but the ergodic search is often difficult to implement in real time in actual systems due to its non-deterministic polynomial (NP) computational complexity. It cannot be achieved, and low-complexity MIMO-ML and signal detection algorithms close to ML have always been problems to be solved by MIMO systems. [0003] Based on the research of Pohst et al., Viterbo et al. proposed a detection algorithm called sphere decoding for source signals with grid-like constellations. The sphere...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04B1/707H04L1/00H04L1/06
Inventor 邓冰
Owner ST ERICSSON SEMICON BEIJING
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products