WO2010092437A1 - Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable - Google Patents

Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable Download PDF

Info

Publication number
WO2010092437A1
WO2010092437A1 PCT/IB2009/050585 IB2009050585W WO2010092437A1 WO 2010092437 A1 WO2010092437 A1 WO 2010092437A1 IB 2009050585 W IB2009050585 W IB 2009050585W WO 2010092437 A1 WO2010092437 A1 WO 2010092437A1
Authority
WO
WIPO (PCT)
Prior art keywords
symbols
posteriori probabilities
code bits
soft
calculating
Prior art date
Application number
PCT/IB2009/050585
Other languages
English (en)
Inventor
Jorma Olavi Lilleberg
Feng Hu
Original Assignee
Nokia Corporation
Nokia Inc.
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 Nokia Corporation, Nokia Inc. filed Critical Nokia Corporation
Priority to PCT/IB2009/050585 priority Critical patent/WO2010092437A1/fr
Publication of WO2010092437A1 publication Critical patent/WO2010092437A1/fr

Links

Classifications

    • 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/03171—Arrangements involving maximum a posteriori probability [MAP] detection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15592—Adapting at the relay station communication parameters for supporting cooperative relaying, i.e. transmission of the same data via direct - and relayed path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0055—MAP-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/06—Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection
    • H04L25/067—Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection providing soft decisions, i.e. decisions together with an estimate of reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/0008—Modulated-carrier systems arrangements for allowing a transmitter or receiver to use more than one type of modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0097—Relays

Definitions

  • Exemplary embodiments of the present invention generally relate to network communication, and more particularly, relate to an apparatus and method for relaying data transmissions in network communication.
  • Radio communication systems such as a wireless data networks (e.g., Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) systems, spread spectrum systems (such as Code Division Multiple Access (CDMA) networks), Time Division Multiple Access (TDMA) networks, etc.), provide users with the convenience of mobility along with a rich set of services and features.
  • 3GPP Third Generation Partnership Project
  • LTE Long Term Evolution
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • an apparatus includes a processor and a memory storing executable instructions that in response to execution cause the apparatus to at least perform a number of functions.
  • the apparatus of this aspect is caused to perform calculating a posteriori probabilities for a plurality of symbols of a signal received over a communication link.
  • the processor is caused to perform estimating soft symbols corresponding to the plurality of symbols.
  • each soft symbol is estimated as a function of a constellation set of symbols and he a posteriori probabilities of a respective one of the plurality of symbols.
  • Each of the a posteriori probabilities for a respective one of the plurality of symbols may be associated with a respective one of the symbols of the constellation set of symbols.
  • estimating the soft symbols may include for each transmitted symbol, estimating a corresponding soft symbol as a linear combination or a scaled linear combination of the symbols of the constellation set of symbols, where each of the symbols of the constellation set is weighted by a respective, associated a posteriori probability.
  • estimating soft symbols as a function of a constellation set of symbols may include estimating soft symbols as a function of a subset of the symbols and their associated a posteriori probabilities.
  • the soft symbols may be estimated as a function of a subset of the symbols and without others of the symbols of the constellation set of symbols, and as a function of the a posteriori probabilities associated with the symbols of the subset without the a posteriori probabilities associated with the others of the symbols.
  • the memory may store executable instructions that in response to execution cause the apparatus to further perform demodulating the signal to produce a plurality of code bits. Additionally, the memory may store executable instructions that in response to execution cause the apparatus to further perform decoding the plurality of code bits to produce a plurality of message bits, and re-encoding the plurality of message bits to produce a second plurality of code bits.
  • calculating a posteriori probabilities may include calculating a posteriori probabilities for the plurality of code bits or the second plurality of code bits, and calculating the a posteriori probabilities for the plurality of symbols based upon the a posteriori probabilities for the plurality of code bits.
  • Embodiments of the present invention therefore provide an apparatus, method and computer-readable storage medium for providing transmission relay using soft symbol estimation.
  • exemplary embodiments of the present invention may solve problems identified by prior techniques and provide additional advantages.
  • FIGs. IA and IB are diagrams of a non-cooperative relay system and a cooperative relay system, respectively, according to various exemplary embodiments of the present invention
  • FIG. 2 is a diagram of a relay node capable of providing soft symbol estimation, according to an exemplary embodiment
  • FIG. 3 is a flowchart of a relay process utilizing soft symbol estimation, in accordance with an embodiment of the present invention
  • FIGS. 4, 5 and 6 are graphs comparing the performance of various relay schemes, according to exemplary embodiments of the present invention.
  • FIG. 7 is a diagram of hardware that may be used to implement an exemplary embodiment of the present invention.
  • Exemplary embodiments of the present invention provide an apparatus, method and computer-readable storage medium for relaying using soft symbol estimation.
  • the present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the present invention are shown.
  • This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the present invention to those skilled in the art.
  • well- known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the embodiments of the present invention.
  • Like numbers refer to like elements throughout.
  • the terms "data,” “content,” “information” and similar terms may be used interchangeably to refer to data capable of being transmitted, received and/or stored in accordance with embodiments of the present invention.
  • exemplary is not provided to convey any qualitative assessment, but instead merely to convey an illustration of an example. Thus, use of any such terms should not be taken to limit the spirit and scope of embodiments of the present invention.
  • exemplary embodiments of the present invention may be discussed with respect to a communication network having the Third Generation Partnership Project (3 GPP) Long Term Evolution (LTE) architecture. It should be understood, however, that exemplary embodiments of the present invention may have applicability to any of a number of different types of communication systems and equivalent functional capabilities.
  • 3 GPP Third Generation Partnership Project
  • LTE Long Term Evolution
  • FIGS. IA and IB are diagrams of a non-cooperative relay system 100 and a cooperative relay system 110, respectively, according to various exemplary embodiments of the present invention.
  • a relayed transmission system provides transmission of signals from one terminal to another through a number of relays without using larger power at the transmitter.
  • cooperative schemes between source and destination apparatus, and relay apparatuses may be employed: (1) relay technology for coverage extension (as shown in FIG. IA), and (2) relay technology for throughput enhancement (as shown in FIG. IB).
  • various apparatuses or components, or various components of apparatuses, of the relay systems 100, 110 functions may perform various functions. It should be understood, however, that the apparatuses or components may more particularly be configured to perform the respective, various functions.
  • the relay system 100 may be referred to as a non- cooperative relay system, while the second scenario is a cooperative relay system 1 10.
  • the non-cooperative relay system 100 may include a source apparatus
  • the first phase involve transmission of the signal to the relay apparatus 105, which then forwards the signal to the destination apparatus 103 in the second phase.
  • a source apparatus 101 transmits a signal to both a relay apparatus 105 and a destination apparatus 103.
  • the second phase involves the relay apparatus 105 subsequently transmitting the received signal from the source apparatus 101 to the destination apparatus 103.
  • AF Amplify and Forward
  • DF Decode (or Demodulate) and Forward
  • the relay apparatus 105 simply amplifies the source's signal and forwards the amplified signal to the destination 103.
  • the DF scheme involves demodulating, decoding, re-encoding, re-modulating and forwarding the re-generated signal to the destination.
  • DF demodulate and forward
  • static DF refers to a relay apparatus that forwards received signals to the destination irrespective of whether the signal may be correctly decoded.
  • non-cooperative relay system 100 is essentially a derivative of the cooperative relay system 1 10, only the model for the cooperative relay system 1 10 is explained; as the non-cooperative relay system 100 may be specialized in a straight forward manner.
  • the source apparatus 101
  • ⁇ m J may broadcast x to both the relay 105 and destination 103.
  • the received signals at relay y sr and destination y ⁇ are: where h sr and h sct are the fading coefficients between source and relay and between source and destination, respectively. Also in the above, n sr ,k and n Sd , k are zero mean complex Gaussian white noise with variances and ⁇ ] d k , respectively.
  • the relay apparatus 105 employs a static
  • the relay apparatus 105 of this embodiment demodulates or decodes the received signal, but does not perform hard decisions. Instead, as explained in greater detail below, the relay apparatus 105 uses the demodulated/decoded soft information to re-modulate to soft symbol and transmits such information in the second phase, which is denoted as x k .
  • the relay apparatus 105 may employ the same modulation mode as the source apparatus 101 or a different modulation mode according to, for example, the channel quality — e.g., AMC in the relay apparatus 105.
  • the signal received by destination may be written as: where h r(t is the fading coefficients between relay and destination and n r d,k is a zero mean complex Gaussian white noise with variance ⁇ r 2 d k .
  • the destination 103 may combine the two versions of source signal y ⁇ and y rd to decode and obtain the information.
  • the destination may combine the two versions in any of a number of different manners, such as by performing a maximal ratio combining based on the channel and noise variance of the link between the source and destination (S-D link), and the link between the relay and destination (R-D link).
  • S-D link the link between the source and destination
  • R-D link link between the relay and destination
  • the relayed soft symbol is from a different size constellation set than the symbol sent from the source apparatus 101
  • the combination of the direct and relayed signals at the destination apparatus 103 may become more involved, but even in this instance, it may still be generalized maximal ratio combining.
  • the y ⁇ may be ignored.
  • FIG. 2 is a functional diagram of a relay apparatus configured to provide soft symbol estimation, according to an exemplary embodiment of the present invention.
  • a relay apparatus 105 may be deployed in either of the systems 100, 110 in FIG. 1.
  • the relay apparatus 105 may provide a soft symbol estimator 301 to enhance the traditional DF scheme.
  • the relay apparatus 105 may include a demodulator 303 as well as an optional decoder 305 (which is utilized in a decode-and-forward technique).
  • a re-encoder 307 may be provided, if the decoder 305 exists.
  • the relay apparatus 105 of this embodiment may have a re-modulator 309.
  • FIG. 3 is a flowchart of a relay process utilizing soft symbol estimation, in accordance with an exemplary embodiment of the present invention.
  • the illustrated process is a soft symbol estimation scheme, which may be employed in a DF relay technique to improve the performance in both scenarios of relay systems 100, 110.
  • the relay apparatus 105 of this embodiment receives a signal y sr from the source apparatus 101. It is assumed that the relay apparatus 105 knows the exact channel coefficient h sr of the link from the source apparatus to the relay (i.e., the S-R link). The vector y sr may then be passed through demodulator 303, decoder 305 and re-encoder 307.
  • the relay system 1 10 utilizes an estimate and forward scheme based on deriving the Bayesian MMSE (Minimum Mean-Square Error) estimate of the received symbols.
  • the relay may estimate each received symbol x k based on the received signal vector y sr . From the signal y sr , k received by the relay apparatus 105, the probabilistic description p ⁇ ⁇ [x k y Sf ) relating the random variables X k and Y sr can be constructed.
  • M represents the size of the constellation set used for M-ary modulation
  • Ci is the /th constellation point in the set (i.e., the /th symbol point in the constellation set of symbols).
  • AAPs can be related to and thus calculated based
  • the LS scheme may be described herein with respect to 16QAM (quadrature amplitude modulation) modulation; but it should be understood that any of a number of other modulation schemes may be employed, including for example, BPSK (binary phase-shift keying), QPSK (quadrature phase-shift keying) or the like.
  • BPSK binary phase-shift keying
  • QPSK quadrature phase-shift keying
  • the LS scheme can be used to form soft symbols x k of any new symbols synthesized at the relay apparatus 105 or at any other transmitting apparatus (e.g., source apparatus 101) knowing only the probabilities of the code bits to be used to form the new symbols.
  • the LS scheme may be represented as follows:
  • the symbol alphabet can be freely selected, and if so, M refers to the new modulation alphabet constellation size. This can be applied for a number of different purposes, such as for data compression and adaptive coding and modulation (ACM) at the relay apparatus 105 or other transmitting apparatus.
  • ACM adaptive coding and modulation
  • the simplest form of data compression may be to reduce the redundancy of the message by removing (puncturing) some code bits before forming new symbols, possibly using a lower-order modulation alphabet, and forming soft symbols and forwarding the soft symbols to the destination apparatus 103. It should be understood that redundancy and modulation order can also be increased at the relay apparatus 105 or other transmitting apparatus, following which equation (5) may be implemented to form new soft symbols that are transmitted to the destination apparatus 103.
  • the symbol estimate x k can be modeled as follows:
  • the soft symbol may be equal to the true symbol x ⁇ plus some noise
  • the signal received by the destination may be expressed as follows:
  • n d k ⁇ n d k + h d — is the total noise effect in the signal received from the relay
  • M destination apparatus 103 may need to be informed about the power of — - or it may ⁇ estimate the total noise power of n ⁇ k - If the modulation order is large, constellation point c ⁇ can have many possible choices and result in an undesirable number of multiplication and addition operations.
  • the relay 105 of exemplary embodiments may perform all of the necessary operations, or may limit its consideration to a few constellation points that correspond to the few largest probabilities.
  • the relay may limit its consideration to the four largest probabilities and their corresponding constellation points, and may do so with the same or similar performance as in the case of considering all of the constellation points.
  • the APPs may be ranked so that only the L largest are used to form the soft symbol estimate.
  • the estimate may therefore be represented as follows: where L ⁇ M and ⁇ (i) represents a ranking function fulfilling the following conditions: PxfrA** ⁇ -
  • the destination apparatus 103 may combine the two versions y ⁇ and y id in symbol level if the same modulation is applied in both source and relay or in bit lever if different modulations are applied in source and relay.
  • the destination apparatus 103 In the non-cooperative relay system 100 (FIG. IA), the destination apparatus 103 only operates on y rd . Again, the destination apparatus 103 may combine the two versions by performing a maximal ratio combining based on the S-D and R-D link.
  • FIGS. 4-6 illustrate graphs comparing the performance of the DF scheme, a soft symbol estimation scheme utilizing likelihood ratios (abbreviated as the "LLR" scheme below and in the figures), and the LS scheme with the following metrics.
  • the relay 105 soft maps the K systematic bits into K/m symbols in the second time slot.
  • the modulations of source 101 and relay 105 are both 16QAM.
  • the channel model is Gaussian channel.
  • the SNR of R- D link (relay 105 to destination 103) is fixed to 5dB.
  • the difference in the graphs of FIGS. 4-6 may be seen in their different illustrated relationships between the SNR of the S-D and S-R link displayed as x-axis.
  • the LS scheme demonstrates increased performance over the DF and LLR schemes when the bit error rate (BER) decreases below 10% and the SNR increases. And the increase in performance of the LS scheme continues to increase along with the increasing SNR of S-D link.
  • BER bit error rate
  • the LS scheme is better than DF at any time, while it has the similar result with LLR in low SNR situations and much better than the LLR scheme with a high SNR.
  • the LS scheme and the LLR scheme demonstrate a performance gain compared with DF at any time.
  • the difference between LS and LLR schemes may be small, with performance of the LS scheme being somewhat better than that of the LLR scheme.
  • the soft symbol estimation scheme may be used effectively in cooperative and non-cooperative relay systems.
  • the soft symbol estimation scheme is applied only in the relay apparatus 105, and is transparent to the source apparatus 101 and the destination apparatus 103.
  • this approach does not increase operational complexity in the source apparatus 101 or the destination apparatus 103.
  • the increase in complexity within the relay apparatus 105 to provide the soft re-modulation function is found to be negligible.
  • the soft symbol estimation scheme may support AMC in both the source apparatus 101 as well as the relay apparatus 105. Consequently, the source apparatus 101 and the relay apparatus 105 may utilize the same or different modulation, as this does not impact use of the soft symbol estimation scheme.
  • the processes associated with relaying may be performed by various means, such as hardware and/or firmware, alone and/or under control of a computer program or computer software including executable instructions.
  • the computer program may be part of a computer program product for performing one or more functions of exemplary embodiments of the present invention.
  • This computer program product may include a computer-readable storage medium, such as the nonvolatile storage medium, and software including computer-readable program code portions, such as a series of computer instructions, embodied in the computer-readable storage medium.
  • a computing system 1200 of the illustrated embodiment includes a bus 1201 or other communication mechanism for communicating information and a processor 1203 coupled to the bus 1201 for processing information.
  • the processor may include any of a number of different apparatuses programmed or otherwise configured to carry out functions according to exemplary embodiments of the present invention.
  • the processor may include (1) one or more microprocessors, (2) one or more processor(s) with accompanying digital signal processor(s), (3) one or more processor(s) without accompanying digital signal processor(s), (4) one or more special-purpose computer chips, (5) one or more field-programmable gate arrays (FPGAS), (6) one or more controllers, (7) one or more application-specific integrated circuits (ASICS), (8) one or more combinations of hardware/firmware, (9) other processing circuitry, or (10) one or more computer(s).
  • FPGAS field-programmable gate arrays
  • ASICS application-specific integrated circuits
  • ASICS application-specific integrated circuits
  • the computing system 1200 may also include main memory 1205, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 1201 for storing information and instructions to be executed by the processor 1203. Main memory 1205 may also be used for storing temporary variables or other intermediate information during execution of instructions by the processor 1203.
  • the computing system 1200 may further include a read only memory (ROM) 1207 or other static storage device coupled to the bus 1201 for storing static information and instructions for the processor 1203.
  • ROM read only memory
  • a storage device 1209 such as a magnetic disk or optical disk, may be coupled to the bus 1201 for persistently storing information and instructions.
  • the computing system 1200 may be coupled via the bus 1201 to a display 1211, such as a liquid crystal display, or active matrix display, for displaying information to a user.
  • An input device 1213 such as a keyboard including alphanumeric and other keys, may be coupled to the bus 1201 for communicating information and command selections to the processor 1203.
  • the input device 1213 may include a cursor control, such as a mouse, a trackball, or cursor direction keys, for communicating direction information and command selections to the processor 1203 and for controlling cursor movement on the display 1211.
  • the processes described herein may be provided by the computing system 1200 in response to the processor 1203 executing an arrangement of instructions contained in main memory 1205.
  • Such instructions may be read into main memory 1205 from another computer- readable medium, such as the storage device 1209.
  • Execution of the arrangement of instructions contained in main memory 1205 may cause the processor 1203 to perform the process steps described herein.
  • processors in a multi-processing arrangement may also be employed to execute the instructions contained in main memory 1205.
  • hard-wired circuitry may be used in place of or in combination with software instructions to implement exemplary embodiments of the present invention.
  • reconfigurable hardware such as Field Programmable Gate Arrays (FPGAs) may be used, in which the functionality and connection topology of its logic gates are customizable at run-time, typically by programming memory look up tables.
  • FPGAs Field Programmable Gate Arrays
  • exemplary embodiments of the present invention are not limited to any specific combination of hardware circuitry and software.
  • the computing system 1200 also includes at least one communication interface 1215 coupled to bus 1201.
  • the communication interface 1215 provides a two-way data communication coupling to a network link (not shown).
  • the communication interface 1215 sends and receives electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information.
  • the communication interface 1215 may include peripheral interface devices, such as a Universal Serial Bus (USB) interface, a PCMCIA (Personal Computer Memory Card International Association) interface, etc.
  • USB Universal Serial Bus
  • PCMCIA Personal Computer Memory Card International Association
  • the processor 1203 may execute the transmitted code while being received and/or store the code in the storage device 1209, or other non-volatile storage for later execution. In this manner, the computing system 1200 may obtain application code in the form of a carrier wave.
  • Non-volatile media include, for example, optical or magnetic disks, such as the storage device 1209.
  • Volatile media include dynamic memory, such as main memory 1205.
  • Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise the bus 1201. Transmission media may also take the form of acoustic, optical, or electromagnetic waves, such as those generated during radio frequency (RF) and infrared (IR) data communications.
  • RF radio frequency
  • IR infrared
  • Computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM (compact disc read-only memory), CDRW (compact disc rewritable), DVD (digital versatile disc), any other optical medium, punch cards, paper tape, optical mark sheets, any other physical medium with patterns of holes or other optically recognizable indicia, a RAM (random access memory), a PROM (programmable read-only memory), and EPROM (erasable PROM), a FLASH-EPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer may read.
  • Various forms of computer-readable media may be involved in providing instructions to a processor for execution.
  • the instructions for carrying out at least part of exemplary embodiments of the present invention may initially be borne on a magnetic disk of a remote computer.
  • the remote computer loads the instructions into main memory and sends the instructions over a telephone line using a modem.
  • a modem of a local system may receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal and transmit the infrared signal to a portable computing device, such as a personal digital assistant (PDA) or a laptop.
  • PDA personal digital assistant
  • An infrared detector on the portable computing device may receive the information and instructions borne by the infrared signal and place the data on a bus.
  • the bus may convey the data to main memory, from which a processor may retrieve and execute the instructions.
  • the instructions received by main memory may optionally be stored on storage device either before or after execution by a processor.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'appareil selon l'invention comprend un processeur et une mémoire qui stocke des instructions exécutables qui, en réponse à leur exécution, incitent l'appareil à remplir un certain nombre de fonctions. A cet égard, l'appareil selon cette invention est amené à exécuter un calcul de probabilités a posteriori d'une pluralité de symboles d'un signal reçu sur une liaison de communication. Le processeur est amené à exécuter une estimation de symboles variables correspondant aux symboles. Chaque symbole variable est estimé en fonction d'un ensemble de constellation de symboles et des probabilités a posteriori d'un symbole respectif parmi les symboles. Un procédé associé et un support de stockage lisible par ordinateur sont également fournis.
PCT/IB2009/050585 2009-02-12 2009-02-12 Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable WO2010092437A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/IB2009/050585 WO2010092437A1 (fr) 2009-02-12 2009-02-12 Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2009/050585 WO2010092437A1 (fr) 2009-02-12 2009-02-12 Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable

Publications (1)

Publication Number Publication Date
WO2010092437A1 true WO2010092437A1 (fr) 2010-08-19

Family

ID=41557643

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2009/050585 WO2010092437A1 (fr) 2009-02-12 2009-02-12 Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable

Country Status (1)

Country Link
WO (1) WO2010092437A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101276601B1 (ko) 2010-09-01 2013-06-19 가부시키가이샤 엔티티 도코모 무선 통신 시스템에서 수신 신호를 디코딩하는 수신기 및 방법
WO2016083764A1 (fr) * 2014-11-28 2016-06-02 Orange Procede et dispositif de relayage souple et selectif ssdf
CN113242190A (zh) * 2021-04-13 2021-08-10 华南理工大学 一种基于后验软符号的多通道通信最小误码率Turbo均衡方法
CN115037340A (zh) * 2022-06-07 2022-09-09 网络通信与安全紫金山实验室 信号检测方法、装置、电子设备及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030095593A1 (en) * 2001-10-19 2003-05-22 Vinayak Tripathi Adaptive turbo decision feedback equalization method and device
US20070153943A1 (en) * 2005-12-30 2007-07-05 Nokia Corporation Turbo equalization scheme
WO2008035809A1 (fr) * 2006-09-20 2008-03-27 Nec Corporation Procédé de démodulation

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030095593A1 (en) * 2001-10-19 2003-05-22 Vinayak Tripathi Adaptive turbo decision feedback equalization method and device
US20070153943A1 (en) * 2005-12-30 2007-07-05 Nokia Corporation Turbo equalization scheme
WO2008035809A1 (fr) * 2006-09-20 2008-03-27 Nec Corporation Procédé de démodulation

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SNEESSENS H H ET AL: "Soft Decode and Forward Improves Cooperative Communications", 1ST I EEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING, 13 December 2005 (2005-12-13), NJ, USA, pages 157 - 160, XP010878976, ISBN: 978-0-7803-9322-6 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101276601B1 (ko) 2010-09-01 2013-06-19 가부시키가이샤 엔티티 도코모 무선 통신 시스템에서 수신 신호를 디코딩하는 수신기 및 방법
WO2016083764A1 (fr) * 2014-11-28 2016-06-02 Orange Procede et dispositif de relayage souple et selectif ssdf
FR3029375A1 (fr) * 2014-11-28 2016-06-03 Orange Procede et dispositif de relayage souple et selectif ssdf
US10313052B2 (en) 2014-11-28 2019-06-04 Orange Method and device for flexible, selective SSDF relaying
CN113242190A (zh) * 2021-04-13 2021-08-10 华南理工大学 一种基于后验软符号的多通道通信最小误码率Turbo均衡方法
CN113242190B (zh) * 2021-04-13 2022-04-22 华南理工大学 一种基于后验软符号的多通道通信最小误码率Turbo均衡方法
CN115037340A (zh) * 2022-06-07 2022-09-09 网络通信与安全紫金山实验室 信号检测方法、装置、电子设备及存储介质
CN115037340B (zh) * 2022-06-07 2023-11-07 网络通信与安全紫金山实验室 信号检测方法、装置、电子设备及存储介质

Similar Documents

Publication Publication Date Title
CN102484564B (zh) 使用联合llr提取和先验概率的统一迭代解码架构
EP2204984B1 (fr) Récepteur de diffusion et procédé pour optimiser un facteur d'échelle pour un mappeur de vraisemblances logarithmiques
EP2474120B1 (fr) Architecture de décodage itératif avec combinaison harq et estimation de canal dirigée par décision douce
EP1849312B1 (fr) Reception en diversite iterative
JP5167393B2 (ja) 無線通信システムにおいて受信信号を復号化するための受信機及び方法
EP2624467B1 (fr) Suppression d'interférences dans un récepteur multi utilisateurs
US8953717B2 (en) Receiving method, apparatus, and system in cooperative communications
WO2011025008A1 (fr) Système de communication sans fil, appareil de station de base et procédé de communication
US10484133B2 (en) Methods and systems for decoding a data signal based on the generation of a decoding tree
KR101210343B1 (ko) 데이터 중계 방법 및 데이터 중계 시스템
US20150124694A1 (en) Method of transmitting a digital signal for a non-orthogonal ms-marc system, and a corresponding program product and relay device
US20130022088A1 (en) Method for transmitting a digital signal for a semi-orthogonal marc system having half-duplex relay, and corresponding program product and relay device
US9385836B2 (en) Wireless relay apparatus, wireless receiving apparatus, and decoding method
JP2012525094A (ja) データパケット中継およびデータパケット復号のための方法および装置
US20070116092A1 (en) Relay station and method for enabling reliable digital communications between two nodes in a wireless relay based network
WO2010092437A1 (fr) Procédé et appareil destinés à fournir un relais de transmission à l'aide d'une estimation de symbole variable
US10313052B2 (en) Method and device for flexible, selective SSDF relaying
WO2011158727A1 (fr) Appareil de communication sans fil, procédé de réception et programme associé
Debessu et al. Blind encoder parameter estimation for turbo codes
Hu et al. Novel soft symbol estimate and forward scheme in cooperative relaying networks
Shehni et al. Virtual full-duplex distributed spatial modulation with SER-optimal and suboptimal detection
Wang et al. An EM approach for joint channel estimation and channel decoding in systems employing physical-layer network coding
US8699634B2 (en) Wireless communications device having map trellis decoder with partial sum tables and related methods
EP1783917A1 (fr) Méthode pour la modulation codée et dispositif correspondant
Lenkeit et al. Complexity Reduction Strategy for RAID in Multi-User Relay Systems

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: 09786310

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09786310

Country of ref document: EP

Kind code of ref document: A1