+

WO2010036809A2 - Procédé et appareil adaptés pour relayer des informations - Google Patents

Procédé et appareil adaptés pour relayer des informations Download PDF

Info

Publication number
WO2010036809A2
WO2010036809A2 PCT/US2009/058240 US2009058240W WO2010036809A2 WO 2010036809 A2 WO2010036809 A2 WO 2010036809A2 US 2009058240 W US2009058240 W US 2009058240W WO 2010036809 A2 WO2010036809 A2 WO 2010036809A2
Authority
WO
WIPO (PCT)
Prior art keywords
relay
signaling
node
source
information
Prior art date
Application number
PCT/US2009/058240
Other languages
English (en)
Other versions
WO2010036809A3 (fr
Inventor
Noah B. Jacobsen
Original Assignee
Alcatel-Lucent Usa 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 Alcatel-Lucent Usa Inc. filed Critical Alcatel-Lucent Usa Inc.
Publication of WO2010036809A2 publication Critical patent/WO2010036809A2/fr
Publication of WO2010036809A3 publication Critical patent/WO2010036809A3/fr

Links

Classifications

    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0025—Transmission of mode-switching indication
    • 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/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0026—Transmission of channel quality indication
    • 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/0093—Point-to-multipoint
    • 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

  • the present invention relates generally to communications and, in particular, to relaying information in wireless communication systems.
  • relay channel has been studied actively by the information theory community since pioneer work by Cover and El Gamal in the 1970s [I].
  • the capacity of the relay channel is in general an open problem.
  • relays have been used for wireless communication for a while, either as amplify-and-forward radios which simply re- transmit a scaled version of the received signal or as a multi-hop device which is capable of decoding and retransmitting the source message.
  • New solutions in this space that are able to increase communication rates, lower power consumption, and/or reduce interference are clearly desirable.
  • FIG. 1 is a diagram depicting a time-axis representation of a half-duplex relay channel.
  • FIG. 2 is a diagram depicting a linear relay geometry.
  • FIG. 4 is a graph depicting capacity of a TDMA relay system with various input constellations.
  • FIG. 5 is a graph depicting TDMA LDPC relay code performance with BPSK inputs.
  • FIG. 6 is a graph depicting capacity results for both TDMA and Multi-Hop
  • FIG. 7 is a logic flow diagram of relay functionality in accordance with various embodiments of the present invention.
  • FIG. 8 is a logic flow diagram of relaying information in accordance with various embodiments of the present invention.
  • FIG. 9 is a logic flow diagram of relaying information in accordance with various embodiments of the present invention.
  • signaling is received during a first coding interval, the signaling being encoded at a first coding rate to convey information from a source node.
  • signaling is received from a relay node.
  • the signaling from the relay node is based on signaling received at the relay node from the source node.
  • the information from the source node is then recovered using the signaling received from the source node and the signaling received from the relay node.
  • signaling is received from a source node during a first coding interval and then decoded.
  • relay signaling based on the decoded signaling is transmitted.
  • Information from the source node is then recovered using the signaling received from the source node and signaling received from a relay node.
  • transmitting the relay signaling may involve encoding based on a source-to-destination link quality and a relay-to-destination link quality.
  • a code rate is selected to maximize a source-to-relay link capacity based on at least one resource constraint and a link quality between a source node and a relay node.
  • Information encoded at the selected coding rate is then broadcast to both a relay node and the destination node during a first coding interval.
  • the at least one resource constraint may include transmit power allocated to broadcasting the information.
  • FIGs. 1-6 are referenced in an attempt to illustrate some examples of specific embodiments of the present invention and/or how some specific embodiments may operate.
  • decode-and-forward protocol in which the relay decodes all or part of the source transmission and cooperatively communicates the source bits to the destination.
  • a decode-and-forward system is able to yield capacity approaching performance for many important channel geometries.
  • a practical code design is able to perform well with respect to information theoretic benchmarks.
  • Other strategies including the amplify-and-forward and compress-and-forward protocols, are known to be preferable in certain other cases [2].
  • the half-duplex relay channel is considered.
  • the relay listens to the source transmission for a fraction ⁇ - of the total time and transmits cooperatively with the source for the remaining 1 Ot fraction of time.
  • the slotted format arises due to the inability of the relay to simultaneously transmit and receive radio signals. This constraint portrays current radio hardware limitations.
  • Diagram 100 depicts a time-axis representation of a half- duplex relay channel.
  • the first time slot, during which the relay and destination listen to the source signal, is termed the Broadcast (BC) mode
  • the second slot, during which the relay and source are transmitting is termed the Multiple-Access (MAC) mode.
  • the time-sharing parameter ms chosen to maximize the capacity.
  • the flexibility to simultaneously address a variety of channel geometries is emphasized, thereby maximizing the utility.
  • the goal is to approach the capacity uniformly over the set of possible channel realizations.
  • a simple linear geometry is assumed, and the relay channel is viewed as a class of channels parameterized by the Signal-to-Noise Ratio (SNR) of its constituent links.
  • SNR Signal-to-Noise Ratio
  • the capacity of a class of channels is known [3], [4], and the existence of so-called "universal codes,” which uniformly approach the capacity, is proved.
  • LDPC Low Density Parity Check
  • TDMA Time Division Multiple Access
  • the channel model is described and capacity results are summarized.
  • the geometry (see diagram 200) is modeled as linear, with the relay 202 at a distance ⁇ from the source 201 on a unit line between the source 201 and destination 203. All links are assumed to represent real Additive White Gaussian
  • a total power constraint, P, is imposed, such that
  • the relay and destination received signals are given by:
  • n Link attenuations are modeled with scalar amplitude gain factors, ⁇ J S? ⁇ where p denotes the wireless propagation path loss exponent.
  • the relay and destination receiver noise, .Y fs > ami ⁇ ' are modeled as i.i.d. Gaussian with unit variance.
  • the relay can cooperatively transmit in band with the source, regarding all or part of the source message, during MAC mode.
  • the relay encoder function is constrained to depend only on the symbols received during previous BC mode.
  • One BC/MAC cycle is comparable to one channel use in a non- cooperative system.
  • Shannon's Gaussian capacity formula is defined in terms of the SNR, J ⁇ ai C ⁇ x) ⁇ 4 WA ⁇ ⁇ - ⁇ -
  • ⁇ denotes the covariance of A ' ⁇ . ⁇ - ⁇ ⁇ ⁇
  • TDMA Time Division Multiple Access
  • the joint channel is interpreted as a mixture of
  • AWGN channels in which the time-sharing parameter, ⁇ , and power-sharing parameter, ⁇ ⁇ are optimized. Further, in the decode-and-forward protocol, the rate from source to relay has to be less than source-relay link capacity.
  • the overall capacity can be written using the Gaussian formula follows:
  • relay decodes the source message and transmits a re-encoded version.
  • the capacity can be expressed as the minimum of the two:
  • Graph 300 depicts a numerical evaluation of the above bounds for the linear geometry with distance d ----- 1 /2 and path loss p ---- 3. In all cases, Gaussian inputs are evaluated. Note that the TDMA relay code is able to closely approximate the general case capacity, while significantly improving upon the multi-hop rate.
  • the Edge Growth and Parity Splitting (EG/PS) technique is used to develop rate compatible LDPC codes, representing the same information bits, for use in the TDMA relay framework.
  • the BC code word is chosen to approach the source-relay capacity.
  • the relay having decoded the source bits, transmits a compatible code word during MAC mode.
  • the relay parity matrix is constructed for the joint AWGN channel parameterized by the source-destination and relay-destination SNR.
  • the base parity matrix employed by the source encoder imposes a constraint on the relay parity check matrix.
  • the relay encoder degree distribution optimization is detailed next.
  • the LDPC parity matrices are optimized using an adaptation of Extrinsic Information Transfer (EXIT) chart techniques [8], which approximate the density evolution algorithm for analyzing irregular LDPC degree distributions [9]. A summary of the technique is provided here.
  • EXIT Extrinsic Information Transfer
  • variable node transfer functions are parameterized by the link SNR, in addition to the variable degree as in standard EXIT charts.
  • ⁇ s denote the extrinsic information transfer function for a degree ⁇ -?V variable node with SNR S- Analogously, the degree distribution for variable nodes with channel ⁇ is given by - ⁇ .! .
  • the channel mixture distribution representing the fraction of code bits observing channel s r is written as £Hs ⁇ L where X ⁇ lK ⁇ ) - ⁇ 1 -
  • the check node extrinsic information transfer functions follow the standard definition: JjhiV) denotes the transfer function for a check node of degree *?V.
  • the adapted EXIT optimization is performed as follows.
  • the base code parity matrix is constructed to approach the source-relay link capacity.
  • the check node degree distribution, p r (ei>
  • the extension code variable distribution is obtained via least squares curve fitting, as in standard EXIT chart optimizations:
  • Error Rate (BER) results using BPSK modulation are depicted in graph 500.
  • BER Error Rate
  • two link capacities must be satisfied, namely the source-relay capacity and the overall relay channel capacity.
  • Graph 500 shows that these two capacities are approached simultaneously by the TDMA LDPC code.
  • the benefit for utilizing the relay can be measured with respect to the overall rate achieved. We find that this benefit can be greater than 5 dB.
  • the following introduces a new error coding relay protocol, termed the Time Division Multiple Access (TDMA) relay protocol for L2 capable based relay terminals (RT).
  • TDMA Relay protocol is able to exploit the cooperative communication capability of a relay radio transceiver in a manner that is both practical and superior to existing Multi-Hop (MH) (L3-only capable RTs) techniques for either L2 or L3 capable RTs.
  • MH Multi-Hop
  • L3-only capable RTs L3-only capable RTs
  • We by using a simple adaptation of rate- compatible error correcting codes, we can achieve gains of up to 5 dB over multi-hop relay techniques (L3-only capable RTs) that do not use cooperative coding.
  • L3-only capable RTs We provide capacity results as well as performance examples with an already designed rate-compatible LDPC code optimized for the TDMA relay framework.
  • This L2 based protocol can be practically implemented without significant amounts of coordination between the RT and the LTE-advance
  • the TDMA Relay coding framework is defined for a half-duplex relay system in which the RT is constrained to either receive or transmit but not both simultaneously. Further, in the TDMA Relay framework, the source (either eNB for downlink case or UE for uplink case) is constrained to be silent while RT transmits. This yields a time-slotted structure in which, during one coding interval, source transmits the information message during the first time slot, termed Broadcast (BC) mode, and during the second time slot, termed Multiple Access (MAC) mode, RT transmits additional coded bits. Since the system is decode-and-forward, RT is required to reliably decode the transmitted message. The destination radio is assumed to receive both source and RT transmissions. Thus the optimal coding strategy for RT is to send rate-compatible code bits based on the received source message.
  • BC Broadcast
  • MAC Multiple Access
  • a linear geometry is used to model the RTs position between source and destination.
  • the RT is assumed to be half-way between the source and destination.
  • a wireless path loss exponent of 3 is further assumed. Design example
  • Rate-compatible Low Density Parity Check (LDPC) codes are constructed for use in the above TDMA Relay framework.
  • the source encoder chooses a rate near the source-RT link capacity.
  • the degree distribution employed by RT encoder is optimized for the joint channel as observed by the destination receiver, which is parameterized by the source-destination and RT-destination link Signal-to- Noise Ratios (SNRs).
  • SNRs Signal-to- Noise Ratios
  • the optimization technique is based on an adaptation of Extrinsic Information Transfer (EXIT) charts [8].
  • EXIT Extrinsic Information Transfer
  • the time sharing parameter (between BC and MAC mode) and power sharing parameter (between source and RT) are determined by the capacity maximization for the TDMA Relay code.
  • Graph 600 shows the capacity results, including the constrained capacities for different modulation alphabets, for both TDMA and Multi- Hop (MH) Relay codes.
  • the results show a large gain in spectral efficiency for the TDMA codes over MH for a given modulation alphabet. This is because the MH code does not use any cooperation between the source and RT encoders, and the MH capacity is given by the minimum of the two links. In contrast, by allowing the RT to cooperate with source encoder, a full multiplexing benefit is achieved.
  • the TDMA Relay code shows as much as 5 dB improvement from non-cooperative capacity.
  • Graph 500 shows a performance example using rate-compatible LDPC codes with BPSK modulation, as measured at a BER of 0.0001.
  • the encoder matrix used by the RT has been optimized using EXIT charts, according to the above framework, and constructed using the EG/PS algorithm for rate-compatible parity matrices [7].
  • RT requires CQI regarding the joint channel to UE, namely the eNB-UE link SNR and the RT-UE link SNR. Note that this scheme requires that the eNB have access to CQI regarding both the eNB-UE and eNB-RT links. Note further that the eNB does not require explicit CQI regarding the RT-UE link. Given the above feedback, the RT encoder is able to choose a compatible code word that maximizes the overall rate within TDMA framework.
  • the eNB first sends H-ARQ code words, during DL eNB transmission mode, until RT acknowledges the successful decoding. Then, during DL RT transmission mode, RT takes on the role of transmitting H-ARQ code words until the UE acknowledges a successful decoding.
  • the description includes: (1) a TDMA cooperative relay protocol, which can be viewed as a constrained version of a more general half-duplex relay model, (2) the application of rate-compatible error correcting codes for the purpose of determining source and relay transmitted code bits, and (3) the adaptation of the EXIT chart analysis techniques for the purpose of optimizing rate-compatible irregular LDPC codes for use in the TDMA relay protocol.
  • Some embodiments involve a rate-compatible LDPC code that is constructed according to the Edge Growth and Parity Splitting (EG/PS) algorithm. The example code is optimized to maximize the communication rate within the TDMA relay framework for a given power budget.
  • EG/PS Edge Growth and Parity Splitting
  • Embodiments may also include (1) the use of an optimal time-sharing parameter (i.e., a ratio of the first to the second coding interval) for a fixed total coding interval (which is the first + second coding interval) length; (2) the use of an optimal power sharing parameter, for a fixed total power budget, between source and relay nodes; (3) maximizing a communication rate within the constraints of either a fixed total coding interval length (which is the first + second coding interval) or a fixed total power budget between source and relay nodes; and/or (4) choosing the signals used by source and relay nodes from a rate-compatible code (representing the same source message) (also, the rate-compatible code may or may not be optimized for the specific relay configuration of the particular embodiment in question).
  • an optimal time-sharing parameter i.e., a ratio of the first to the second coding interval
  • an optimal power sharing parameter for a fixed total power budget, between source and relay nodes
  • FIG. 7 is a logic flow diagram of relay functionality in accordance with various embodiments of the present invention.
  • signaling is received (701) during a first coding interval, the signaling being encoded at a first coding rate to convey information from a source node.
  • signaling is received (702) from a relay node.
  • the signaling from the relay node is based on signaling received at the relay node from the source node.
  • the information from the source node is then recovered (703) using the signaling received from the source node and the signaling received from the relay node.
  • FIG. 8 is a logic flow diagram of relaying information in accordance with various embodiments of the present invention.
  • signaling is received (801) from a source node during a first coding interval and then decoded (802).
  • relay signaling based on the decoded signaling is transmitted (803).
  • Information from the source node is then recovered (804) using the signaling received from the source node and signaling received from a relay node.
  • transmitting the relay signaling may involve encoding based on a source-to-destination link quality and a relay-to-destination link quality.
  • FIG. 9 is a logic flow diagram of relaying information in accordance with various embodiments of the present invention.
  • a code rate is selected (901) to maximize a source-to-relay link capacity based on at least one resource constraint and a link quality between a source node and a relay node.
  • Information encoded at the selected coding rate is then broadcast (902) to both a relay node and the destination node during a first coding interval.
  • the at least one resource constraint includes transmit power allocated to broadcasting the information.
  • the term "comprises,” “comprising,” or any other variation thereof is intended to refer to a non-exclusive inclusion, such that a process, method, article of manufacture, or apparatus that comprises a list of elements does not include only those elements in the list, but may include other elements not expressly listed or inherent to such process, method, article of manufacture, or apparatus.
  • the terms a or an, as used herein, are defined as one or more than one.
  • the term plurality, as used herein, is defined as two or more than two.
  • the term another, as used herein, is defined as at least a second or more.
  • Some, but not all, examples of techniques available for communicating or referencing the object/information being indicated include the conveyance of the object/information being indicated, the conveyance of an identifier of the object/information being indicated, the conveyance of information used to generate the object/information being indicated, the conveyance of some part or portion of the object/information being indicated, the conveyance of some derivation of the object/information being indicated, and the conveyance of some symbol representing the object/information being indicated.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Relay Systems (AREA)

Abstract

La présente invention concerne la nécessité de disposer de nouveaux procédés de communication par relais qui permettent d'accélérer les débits de communication, de réduire la consommation de puissance, et/ou de réduire les interférences. Dans certains modes de réalisation, un débit de codage est sélectionné (901) dans le but d'optimiser la capacité d'une liaison source/relais en fonction d'au moins une contrainte de ressources et une qualité de ligne entre un nœud source et un nœud relais. Des informations codées au débit de codage sélectionné sont ensuite diffusées (902) à la fois vers un nœud relais et vers le nœud de destination au cours d'un premier intervalle de codage. Dans certains modes de réalisation, la ou les contraintes de ressources comprennent la quantité de puissance de transmission allouée à la diffusion des informations.
PCT/US2009/058240 2008-09-25 2009-09-24 Procédé et appareil adaptés pour relayer des informations WO2010036809A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US19420908P 2008-09-25 2008-09-25
US61/194,209 2008-09-25

Publications (2)

Publication Number Publication Date
WO2010036809A2 true WO2010036809A2 (fr) 2010-04-01
WO2010036809A3 WO2010036809A3 (fr) 2011-04-14

Family

ID=42060390

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2009/058240 WO2010036809A2 (fr) 2008-09-25 2009-09-24 Procédé et appareil adaptés pour relayer des informations

Country Status (1)

Country Link
WO (1) WO2010036809A2 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012016756A1 (fr) * 2010-07-26 2012-02-09 Siemens Aktiengesellschaft Procédé de transmission de données par commutation de paquets
WO2013006028A1 (fr) * 2011-07-01 2013-01-10 Mimos Berhad Procédé d'amélioration du signal dans un réseau de communication
DE102011088165A1 (de) * 2011-12-09 2013-06-13 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Übertragen von Daten

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004091155A1 (fr) * 2003-04-11 2004-10-21 Telefonaktiebolaget Lm Ericsson Retransmission en diversite multi-utilisateurs
WO2007064249A1 (fr) * 2005-11-29 2007-06-07 Telefonaktiebolaget Lm Ericsson (Publ) Programmation dans un reseau sans fil a sauts multiples
EP1852986A1 (fr) * 2005-03-14 2007-11-07 Matsushita Electric Industrial Co., Ltd. Systeme de communication sans fil
WO2008024158A1 (fr) * 2006-08-24 2008-02-28 Nokia Siemens Networks Gmbh & Co. Kg Système de transmission harq assistée par relais
US20080051147A1 (en) * 2006-08-23 2008-02-28 Samsung Electronics Co., Ltd. Apparatus and method for allocating resource to mobile station connected to relay station in broadband wireless communication system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004091155A1 (fr) * 2003-04-11 2004-10-21 Telefonaktiebolaget Lm Ericsson Retransmission en diversite multi-utilisateurs
EP1852986A1 (fr) * 2005-03-14 2007-11-07 Matsushita Electric Industrial Co., Ltd. Systeme de communication sans fil
WO2007064249A1 (fr) * 2005-11-29 2007-06-07 Telefonaktiebolaget Lm Ericsson (Publ) Programmation dans un reseau sans fil a sauts multiples
US20080051147A1 (en) * 2006-08-23 2008-02-28 Samsung Electronics Co., Ltd. Apparatus and method for allocating resource to mobile station connected to relay station in broadband wireless communication system
WO2008024158A1 (fr) * 2006-08-24 2008-02-28 Nokia Siemens Networks Gmbh & Co. Kg Système de transmission harq assistée par relais

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JACOBSEN N: "Practical cooperative coding for Half-Duplex relay channels", 18 March 2009 (2009-03-18), INFORMATION SCIENCES AND SYSTEMS, 2009. CISS 2009. 43RD ANNUAL CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, PAGE(S) 945 - 950, XP031468736, ISBN: 978-1-4244-2733-8 the whole document *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012016756A1 (fr) * 2010-07-26 2012-02-09 Siemens Aktiengesellschaft Procédé de transmission de données par commutation de paquets
WO2013006028A1 (fr) * 2011-07-01 2013-01-10 Mimos Berhad Procédé d'amélioration du signal dans un réseau de communication
DE102011088165A1 (de) * 2011-12-09 2013-06-13 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Übertragen von Daten
DE102011088165B4 (de) * 2011-12-09 2013-10-10 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Übertragen von Daten

Also Published As

Publication number Publication date
WO2010036809A3 (fr) 2011-04-14

Similar Documents

Publication Publication Date Title
Makki et al. Fast HARQ over finite blocklength codes: A technique for low-latency reliable communication
Li Distributed coding for cooperative wireless networks: An overview and recent advances
Azarian et al. On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
Makki et al. On the performance of RF-FSO links with and without hybrid ARQ
Steiner et al. Single-user broadcasting protocols over a two-hop relay fading channel
Ikki et al. Performance of decode-and-forward cooperative diversity networks over Nakagami-m fading channels
Tabet et al. Diversity-multiplexing-delay tradeoff in half-duplex ARQ relay channels
Makki et al. On the performance of the relay–ARQ networks
WO2011096764A2 (fr) Procédé de communication coordonné utilisant des terminaux multiples
Kim et al. Decode-and-forward relaying with quantized channel state feedback: An outage exponent analysis
Atsan et al. Towards integrating quantize-map-forward relaying into LTE
WO2010036809A2 (fr) Procédé et appareil adaptés pour relayer des informations
Lo et al. The impact of channel feedback on opportunistic relay selection for hybrid-ARQ in wireless networks
Choi et al. Energy-delay tradeoff for wireless relay systems using HARQ with incremental redundancy
Schwieger et al. Power and energy consumption for multi-hop protocols: A sensor network point of view
US8879463B2 (en) Adaptive distributed turbocoding method for a cooperative network
Khoueiry et al. A novel coding strategy for device-to-device communications
Chiu et al. Precoder design for multi-antenna partial decode-and-forward (PDF) cooperative systems with statistical CSIT and MMSE-SIC receivers
Alves et al. Performance of type-i and type-ii hybrid arq in decode and forward relaying
Weitkemper et al. Adaptive harq with memoryless relays
Makki et al. On an HARQ-based coordinated multi-point network using dynamic point selection
Sun et al. Cooperative hybrid-ARQ protocol with network coding
Schwandter et al. A practical forwarding scheme for wireless relay channels based on the quantization of log-likelihood ratios
Cocco et al. Throughput analysis in asymmetric two-way relay channel with random access
Weiner Low-latency, high-reliability wireless networks for control applications

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

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

Country of ref document: EP

Kind code of ref document: A2

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载