WO2007107955A2 - Rendement amélioré par décodage par sphères - Google Patents

Rendement amélioré par décodage par sphères Download PDF

Info

Publication number
WO2007107955A2
WO2007107955A2 PCT/IB2007/050965 IB2007050965W WO2007107955A2 WO 2007107955 A2 WO2007107955 A2 WO 2007107955A2 IB 2007050965 W IB2007050965 W IB 2007050965W WO 2007107955 A2 WO2007107955 A2 WO 2007107955A2
Authority
WO
WIPO (PCT)
Prior art keywords
symbol
symbols
symbol vector
group
order
Prior art date
Application number
PCT/IB2007/050965
Other languages
English (en)
Other versions
WO2007107955A3 (fr
Inventor
Ozgun Paker
Original Assignee
Koninklijke Philips Electronics N.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics N.V. filed Critical Koninklijke Philips Electronics N.V.
Publication of WO2007107955A2 publication Critical patent/WO2007107955A2/fr
Publication of WO2007107955A3 publication Critical patent/WO2007107955A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03178—Arrangements involving sequence estimation techniques
    • H04L25/03203—Trellis search techniques
    • H04L25/03242—Methods involving sphere decoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L2025/0335—Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03375—Passband transmission
    • H04L2025/03414—Multicarrier
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L2025/0335—Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03426—Arrangements for removing intersymbol interference characterised by the type of transmission transmission using multiple-input and multiple-output channels

Definitions

  • This invention relates to a receiver, and in particular to a receiver, which uses sphere decoding to decode, received digital signals.
  • MIMO Multiple Input, Multiple Output
  • MIMO communications systems take advantage of spatial multiplexing to increase wireless bandwidth and range. Specifically, MIMO transmitters send information out using two or more antennas, and the information is received via multiple antennas as well. MIMO systems use the additional pathways to transmit more information, and then recombine the signal on the receiving end. MIMO systems provide a significant capacity gain over conventional single antenna systems, along with more reliable communication. MIMO-based transceivers can for example be employed in WLAN 802.1 In, WiMax and cellular communications systems.
  • Each point represents a symbol, a unique signal state of a modulation scheme, which conveys one or more user bits to the receiver.
  • a signal space diagram showing all the possible transmitted symbols is known as a constellation.
  • each transmit antenna transmits a symbol, and the set of transmitted symbols at any time forms a symbol vector.
  • the task of the MIMO receiver is to detect the transmitted symbol vector in each time period, using the received symbols.
  • One method for solving this detection problem is sphere decoding, for example as described in the document "VLSI Implementation of MIMO Detection Using the Sphere Decoding Algorithm", Burg, et al, IEEE Journal of Solid-State Circuits, vol. 40, no. 7, July 2005. More specifically, the possible values of a first symbol in the transmitted symbol vector are considered as nodes at a first level in a tree. The possible values of a second symbol then give rise to nodes at a second level in the tree, such that each node at the second level represents a partial symbol vector comprising one of the possible combinations of values of the first and second symbols.
  • the complete tree has the same number of levels, as there are transmit antennas, and it includes nodes at the final level corresponding to each of the possible transmitted symbol vectors.
  • One use of the sphere decoding technique is then to generate a list of possible transmitted symbol vectors that are within a sphere around the received symbol vector.
  • a maximum likelihood decoder can then be used to determine which of the vectors on this list was the most likely to have been transmitted.
  • a related use of the sphere decoding technique is to detect the one of the possible transmitted symbol vectors that has the maximum likelihood, given the received symbol vector. The technique operates by calculating a first distance measure based on one possible transmitted symbol vector, and then calculates distance measures for other possible transmitted symbol vectors, rejecting those possible transmitted symbol vectors for which the distance measure exceeds the first distance measure, but using any lower distance measure as the basis for future comparisons.
  • Efficiency gains are made by tree pruning, that is, by calculating the distance measures for the possible transmitted symbol vectors by stepping through the nodes of the tree, and rejecting, without needing to calculate a final value for the distance measure, all those possible transmitted symbol vectors that are at nodes connected to nodes corresponding to partial symbol vectors where the distance measure has already exceeded the current value of the distance measure.
  • the detection can be carried out most efficiently by calculating the first distance measure based on a possible transmitted symbol vector that has a relatively low distance, as this allows a larger amount of tree pruning, and hence allows the final detection result to be obtained using fewer calculations.
  • a method of performing a search to determine from a received symbol vector a symbol vector meeting a predetermined criterion, through a tree in which each node represents a possible symbol vector or a possible partial symbol vector comprising: - from a node of said tree, comparing a position of a next symbol in the received symbol vector with positions of symbols in a signal constellation; dividing the symbols in the signal constellation into a plurality of groups, the division being based on the position of the received symbol in the signal constellation; and for each of said groups: - determining an order for enumerating the symbols in the group, the order being based on the position of the received symbol in the signal constellation.
  • a receiver comprising a decoder for determining from a received symbol vector a symbol vector meeting a predetermined criterion, through a tree in which each node represents a possible symbol vector or a possible partial symbol vector, wherein the decoder is adapted to operate in accordance with the method according to the first aspect of the invention.
  • Fig. 1 is a block schematic diagram of a communications system in accordance with an aspect of the invention.
  • Fig. 2 illustrates symbols in the decoder of the communications system.
  • Fig. 3 is a flow chart illustrating a method in accordance with the present invention.
  • Fig. 4 illustrates a step in the method of Fig. 3.
  • Fig. 5 illustrates a further step in the method of Fig. 3.
  • FIG. 6 and 7 illustrate a further step in the method of Fig. 3.
  • Figs. 8 and 9 are an alternative illustration of the further step in the method of Fig. 3.
  • Figs. 10 and 11 are an alternative illustration of the further step in the method of Fig. 3.
  • Figs. 12 and 13 are an alternative illustration of the further step in the method of Fig. 3.
  • Figs. 14 and 15 are an alternative illustration of the further step in the method of Fig. 3.
  • Figs 16 and 17 are an alternative illustration of the further step in the method of Fig. 3.
  • Fig. 1 is a block schematic diagram of a Multiple Input, Multiple Output (MIMO) communications system 10 in accordance with an aspect of the invention.
  • the communications system 10 includes a transmitter system 12 and a receiver system 14.
  • the communications system 10 is an OFDM system, in which data is modulated onto multiple sub carriers at different frequencies. It will however be apparent to the person skilled in the art that the invention is equally applicable to other systems.
  • the transmitter system 12 includes first transmitter circuitry 16, connected through first RF circuitry 18 to a first transmit antenna 20.
  • the transmitter system 12 also includes second transmitter circuitry 22, connected through second RF circuitry 24 to a second transmit antenna 26.
  • the transmitter system 12 is generally conventional, and will not be described further herein.
  • Fig. 1 shows two separate transmitter circuitry blocks 16, 22, and two separate RF circuitry blocks 18, 24, it will be appreciated that these may be shared as required. It will further be appreciated that, although Fig. 1 shows two transmit antennas
  • the transmit system 12 may include any desired number of transmit antennas.
  • Signals from the transmitter system 12 are transmitted from the antennas 20, 26 over an air interface to the receiver system 14.
  • the receiver system 14 includes two receive antennas 28, 30. Again, although only two receive antennas are shown in Fig. 1, it will be appreciated that the receiver system 14 can include any desired number of receive antennas.
  • the first receive antenna 28 is connected to first RF receiver circuitry 32, and the output of the first RF receiver circuitry 32 is connected to a first sampling block 34, for forming digital samples of the signal received at the first receive antenna 28.
  • the digital samples are passed to a first FFT block 36, for conversion to the frequency domain.
  • the invention is applied to an OFDM system, and so this conversion to the frequency domain is required. However, the invention is equally applicable to other communications systems.
  • the output of the first FFT block 36 is passed to a symbol/bit detection block
  • the symbol/bit detection block 38 uses a sphere decoding technique, as will be described in more detail below.
  • the output-demapped symbols are passed to a deinterleaver and decoder block 40, for forming a decoded output signal.
  • the second receive antenna 30 is connected to second RF receiver circuitry 42, and the output of the second RF receiver circuitry 42 is connected to a second sampling block 44, for forming digital samples of the signal received at the second receive antenna 30.
  • the digital samples are passed to a second FFT block 46, and the output of the second FFT block 46 is passed to the symbol/bit detection block 38.
  • the output-demapped symbols are passed to the deinterleaver and decoder block 40.
  • the deinterleaver and decoder block 40 obtains the decoded output, as described in more detail below.
  • the channel matrix H is estimated at the receiver.
  • the decoding problem is then to find the transmit symbol vector s that has the minimum value of the Euclidean distance d(s) from the receive signal vector y, after multiplication by the channel matrix H. This is solved by finding the value of the Euclidean distance d(s) for all possible transmit symbol vectors s which lie within a M dimensional hypersphere of radius r :
  • the equation for the Euclidean distance d(s) of a transmit symbol vector s can then be rewritten as:
  • the constant c is independent of the data symbol, and can be ignored in the metric computation.
  • the third level nodes 51, 52 depict partial transmit symbol vectors -1 and +1 respectively.
  • the second level nodes 53, 54, 55, 56 represent partial transmit symbol vectors -1 -1; +1 -1; -1 +1; and +1 +1 respectively.
  • first level nodes 57, 58, 59, 60, 61, 62, 63, 64 represent transmit symbol vectors -1 -1 -1; +1 -1 -1; -1 +1 -1; +1 +1 -1; -1 -1 +1;+1 -1 +1; -1 +1 +1 and +1 +1 +1 respectively.
  • Each of the possible transmit symbol vectors, or possible partial transmit symbol vectors s ⁇ and the respective path metric T 1 (S 1 ) is now associated with a node in the tree 50.
  • Fig. 3 is a flow chart, illustrating the steps in the method in accordance with the present invention, for determining the next node for enumeration, from a particular node in the tree 50.
  • step 80 of the process shown in Fig. 3 b 1+ i is mapped to the 16-QAM constellation.
  • Fig. 4 shows the 16-QAM constellation, having 16 complex constellation points, representing the 16 possible symbol values, at ( ⁇ 1, ⁇ i), ( ⁇ 3, ⁇ i), ( ⁇ 1, ⁇ 3i), ( ⁇ 3, ⁇ 3i).
  • the further processing is simplified by taking , the absolute value of b 1+ i , and mapping it to the first quadrant of the 16-QAM constellation.
  • Fig. 5 is an enlarged view of the first quadrant of the 16-QAM constellation, showing only the constellation points at (1, i), (3, i), (1, 3i), (3, 3i).
  • the first quadrant of the 16-QAM constellation is divided for the purposes of this invention into nine regions Ro, R 1 , ..., Rs.
  • step 82 it is determined which of these nine regions the absolute value of b 1+ i maps to.
  • the 16 possible symbol values are divided in step 84 of the process into two groups. That is, the way in which the 16 possible symbol values are divided into two groups depends on the region to which the absolute value of bj + i maps.
  • Figs. 6 and 7 show the two groups in the case where the absolute value of b 1+ i maps to the region Ro. That is, in the case where the absolute value of b 1+ i maps to the region Ro, the first group of symbols, shown in Fig. 6, includes the symbols at ( ⁇ 1, ⁇ i), ( ⁇ 3, ⁇ 3i), while the second group of symbols, shown in Fig. 7, includes the symbols at ( ⁇ 3, ⁇ i), ( ⁇ l, ⁇ 3i).
  • step 86 in which the region Ro is divided into two areas, and it is determined which area of the region Ro the absolute value of b 1+ i maps to.
  • Fig. 6 shows the region Ro divided into two areas Ai and A 2 .
  • the mapping of the absolute value of bi + i to the two areas Ai and A 2 can be performed in hardware, by comparing the real and imaginary parts of this illustration, the real and imaginary parts of b 1+ i are denoted by x and y respectively, and the signs of the real and parts of b 1+ i are denoted by S x and S y respectively.
  • step 86 it can be determined that, if x ⁇ y, is in the area Ai of the region R 0 . Conversely, is in the area A 2 of the region R 0 . Based on the determination in step 86, the process passes to step 88, and a symbol list, indicating the order in which the symbols of the first group should be enumerated in the calculation of the path metrics, is generated.
  • the symbols of the first group can be enumerated in the order ⁇ 1+i, -1+i, 1-i, -1-i, 3+3i, -3+3i, 3-3i, -3-3i ⁇ .
  • the symbols of the first group can be enumerated in the order ⁇ 1+i, 1-i, -1+i, -1-i, 3+3i, 3-3i, -3+3i, -3-3i ⁇ .
  • step 88 After the symbol list for the first group has been generated in step 88, based on the area within the region (or simultaneously), the process passes to step 90, in which the region Ro is again divided into areas, and it is determined which area of the region Ro the absolute value of b 1+ i maps to.
  • Figure 7 shows the region Ro divided into six areas A3, A 4 , ...,
  • step 90 Based on the determination in step 90, the process passes to step 92, and a symbol list, indicating the order in which the symbols of the first group should be enumerated in the calculation of the path metrics, is generated.
  • step 82 If it is found in step 82 that b 1+ i maps to one of the other regions, Ri - Rs, then the symbols are divided into groups in different ways, but, as described above, the region is then divided into areas and the order of enumeration of the symbols in each group is determined, depending on the area to which b 1+ i maps.
  • Figs. 8 and 9 show the two groups of symbols in the case where the absolute value o ⁇ b ⁇ + i maps to the region Ri (the grouping for the region R 3 is symmetrical). Thus, Fig.
  • Fig. 9 shows the second group of symbols, and the ten areas into which the region is divided.
  • the rules for defining the areas and the order for enumerating the symbols are not given in full, for the sake of brevity, but they can be derived simply from the Figures.
  • the areas are defined such that the order for enumerating the symbols is the same for the whole of that area.
  • the order for enumeration lists the symbols of the group in order of their proximity to the position at which the absolute value of b 1+ i maps to the region.
  • Figs. 10 and 11 show the two groups of symbols in the case where the absolute value o ⁇ b ⁇ + i maps to the region R 2 (the grouping for the region R 6 is symmetrical). Thus, Fig. 10 shows the first group of symbols, and Fig. 11 shows the second group of symbols. In each case, there is no need to subdivide the region into areas. Again, the order for enumerating the symbols is not given in full, for the sake of brevity, but can be derived simply from the Figures.
  • Figs. 12 and 13 show the two groups of symbols in the case where the absolute value of b 1+ i maps to the region R 4 .
  • Fig. 12 shows the first group of symbols, and the eight areas 1-8 into which the region is divided.
  • Fig. 13 shows the second group of symbols, and the four areas into which the region is divided.
  • the rules for defining the areas and the order for enumerating the symbols are not given in full, for the sake of brevity, but they can be derived simply from the Figures.
  • Figs 14 and 15 show the two groups of symbols in the case where the absolute value o ⁇ b ⁇ + i maps to the region R 5 (the grouping for the region R 7 is symmetrical).
  • Fig. 12 shows the first group of symbols, and the eight areas 1-8 into which the region is divided.
  • Fig. 13 shows the second group of symbols, and the four areas into which the region is divided.
  • the rules for defining the areas and the order for enumerating the symbols are not
  • Figs. 16 and 17 show the two groups of symbols in the case where the absolute value o ⁇ b ⁇ + i maps to the region R 8 .
  • Fig. 16 shows the first group of symbols, and the six areas into which the region is divided.
  • Fig. 17 shows the second group of symbols, and the six areas into which the region is divided.
  • the rules for defining the areas and the order for enumerating the symbols are not given in full, for the sake of brevity, but they can be derived simply from the Figures.
  • the decoding process now continues in the conventional way, except that there are, in effect, two active search threads.
  • the groups of symbols are preferably defined such that the symbol closest to the position at which the absolute value of b 1+ i maps to the region appears in the first group.
  • the calculation of the metric values can be performed on the symbols of the first group, followed by any lower nodes connected thereto, and then on the symbols of the second group, followed by any lower nodes connected thereto.
  • the first symbol in the symbol list for the first group and the first symbol in the symbol list for the second group can be enumerated in parallel, in order to determine how to proceed through the tree.
  • the order at one level is to finish enumerating the symbols of the first group, and then move on to the symbols of the second group. If a node in the first group violates the sphere constraint, the search moves on to the second group.
  • This idea can be generalized to enable multithreaded search as the enumeration step generates two candidate symbols at each level.
  • the sphere decoding can also be used to generate a list of possible transmitted vectors, to which a maximum likelihood detection technique can be applied.
  • bit-metrics can be obtained from log likelihood ratios (LLRs) for each of the bits of the symbol.
  • LLR L
  • the LLR, L is the log of the quotient of the probability that the transmitted bit bt was a "0" (given the received symbol vector, r), and the probability that it was a "1" (also given the received symbol vector, r). That is:
  • the computation is simplified by considering only those possibly transmitted symbol vectors that are within the set of candidate vectors within a sphere around the received symbol vector.
  • This set X of the candidate possibly transmitted symbol vectors is then divided into two subsets: namely the set XO of all candidate symbol vectors which have a 0-bit at the given position, and the set Xl of all candidate symbol vectors which have a 1-bit at the given position.
  • the posterior probability of each symbol vector is proportional to exp(-

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

L'invention porte sur un procédé permettant d'effectuer une recherche en vue de déterminer à partir d'un vecteur de symbole reçu un vecteur de symbole correspondant à un critère prédéterminé, par l'intermédiaire d'un arbre dans lequel chaque noeud représente un vecteur de symbole possible ou un vecteur de symbole partiel possible. Le procédé consiste à, à partir d'un noeud de l'arbre, comparer une position du symbole suivant dans le vecteur de symbole reçu à des positions de symboles dans une constellation de signaux; et diviser ensuite les symboles de la constellation de signaux en une pluralité de groupes, la division étant basée sur la position du symbole reçu dans la constellation de signaux. Pour chacun des groupes, un ordre d'énumération des symboles est déterminé, l'ordre étant basé sur la position du symbole reçu dans la constellation de signaux. Ceci présente l'avantage de pouvoir effectuer le décodage par sphères à un rendement plus élevé.
PCT/IB2007/050965 2006-03-23 2007-03-20 Rendement amélioré par décodage par sphères WO2007107955A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP06111578.8 2006-03-23
EP06111578 2006-03-23

Publications (2)

Publication Number Publication Date
WO2007107955A2 true WO2007107955A2 (fr) 2007-09-27
WO2007107955A3 WO2007107955A3 (fr) 2007-11-22

Family

ID=38436812

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2007/050965 WO2007107955A2 (fr) 2006-03-23 2007-03-20 Rendement amélioré par décodage par sphères

Country Status (1)

Country Link
WO (1) WO2007107955A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120269303A1 (en) * 2009-12-30 2012-10-25 St-Ericsson Sa Branch Processing of Search Tree in a Sphere Decoder
WO2013030721A1 (fr) * 2011-08-29 2013-03-07 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil de traitement de signal reçu dans un récepteur à plusieurs étages

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
AGRELL E ET AL: "Closest point search in lattices" IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 48, no. 8, August 2002 (2002-08), pages 2201-2214, XP002353940 ISSN: 0018-9448 *
BURG A ET AL: "VLSI implementation of MIMO detection using the sphere decoding algorithm" IEEE JOURNAL OF SOLID-STATE CIRCUITS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 40, no. 7, July 2005 (2005-07), pages 1566-1577, XP002353941 ISSN: 0018-9200 cited in the application *
FINCKE U ET AL: "IMPROVED METHODS FOR CALCULATING VECTORS OF SHORT LENGTH IN A LATTICE, INCLUDING A COMPLEXITY ANALYSIS" MATHEMATICS OF COMPUTATION, AMERICAN MATHEMATICAL SOCIETY, US, vol. 44, no. 170, April 1985 (1985-04), pages 463-471, XP008024051 *
WIESEL A ET AL: "EFFICIENT IMPLEMENTATION OF SPHERE DEMODULATION" SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, 2003. SPAWC 2003. 4TH IEEE WORKSHOP ON ROME, ITALY 15-18 JUNE 2003, PISCATAWAY, NJ, USA,IEEE, US, 15 June 2003 (2003-06-15), pages 36-40, XP002312220 ISBN: 0-7803-7858-X *
ZIMMERMANN E ET AL: "On the Complexity of Sphere Decoding" INTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS, XX, XX, 12 September 2004 (2004-09-12), pages 1-5, XP002434986 & DAMEN M O ET AL: "Further results on the sphere decoder" PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY. ISIT 2001. WASHINGTON, WA, JUNE 24 - JUNE 29, 2001, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, NEW YORK, NY : IEEE, US, 24 June 2001 (2001-06-24), pages 333-333, XP010552939 ISBN: 0-7803-7123-2 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120269303A1 (en) * 2009-12-30 2012-10-25 St-Ericsson Sa Branch Processing of Search Tree in a Sphere Decoder
US9124459B2 (en) * 2009-12-30 2015-09-01 Telefonaktiebolaget L M Ericsson (Publ) Branch processing of search tree in a sphere decoder
WO2013030721A1 (fr) * 2011-08-29 2013-03-07 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil de traitement de signal reçu dans un récepteur à plusieurs étages
US8630375B2 (en) 2011-08-29 2014-01-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for received signal processing in a multi-stage receiver

Also Published As

Publication number Publication date
WO2007107955A3 (fr) 2007-11-22

Similar Documents

Publication Publication Date Title
US9160491B2 (en) Receiving apparatus and receiving method
JP5512776B2 (ja) Ｍｉｍｏ通信の球検出及びレート選択
CN101268647B (zh) 用于处理来自多个源的通信的装置和方法
EP2104981B1 (fr) Sélection d'antenne et démappage souple pour décodage mimo
US8811548B2 (en) Hypotheses generation based on multidimensional slicing
US9008240B1 (en) Near maximum likelihood spatial multiplexing receiver
US8483328B2 (en) System for soft symbol decoding MIMO log-map detection
US8488721B2 (en) Adaptive QRD-M algorithm based signal detecting method by using constellation set grouping in spatial multiplexing multiple-input multiple-output system
CN104079511B (zh) 最大似然ml接收机数据处理的方法及装置
US20090154600A1 (en) QRD-QLD searching based sphere detector for MIMO receiver
CN102007737A (zh) 具有概率噪声约束的半径自适应球形解码
KR20090097838A (ko) 다중 입출력 시스템에서 수신 방법 및 장치
CN101453444A (zh) 星座图简化装置和方法、接收机
CN102457470B (zh) 用于软判定球形解码的方法和装备
WO2008151165A1 (fr) Architecture vlsi évolutive
WO2008025388A1 (fr) Structure d'égalisation et procédé d'égalisation
EP3251312B1 (fr) Procédé pour décoder un bloc de données reçu sur un canal de communication et récepteur
CN112260729A (zh) 一种信号检测方法及装置、电子设备、可读存储介质
US20150180682A1 (en) Turbo Equalisation
WO2007107955A2 (fr) Rendement amélioré par décodage par sphères
JP2016171436A (ja) 通信装置、復調方法及びプログラム
CN116938394B (zh) Mimo检测方法、接收方法及其系统
CN112260727B (zh) 一种信号检测方法及装置、电子设备、可读存储介质
KR101402246B1 (ko) 다중 입출력 시스템에서 로그 우도율 생성 방법 및 장치
CN113095294B (zh) 自适应数字调制信号解调器及其解调方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07735187

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07735187

Country of ref document: EP

Kind code of ref document: A2