Distributed turbo codes: towards the capacity of the relay channel

Valenti, Matthew C.; Zhao, Bin

doi:10.1109/vetecf.2003.1285032

Cited by 116 publications

(110 citation statements)

References 13 publications

Supporting

Mentioning

110

Contrasting

Order By: Relevance

“…Research in this area has taken into consideration several aspects including distributed coding schemes [13][14][15], retransmission mechanisms [16], and power allocation methods [17,18]. In addition to capacity analysis, it has been shown that cooperative relaying can provide some spacial diversity gain due to the fading effect of the radio channel caused by obstacles and multi-path propagation [8,19], even though there is an obvious trade-off between capacity and diversity gains [20].…”

Section: Related Workmentioning

confidence: 99%

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Capone

Gualandi

Yuan³

2011

Ad Hoc Networks

View full text Add to dashboard Cite

Cooperation schemes form a key aspect of infrastructure-less wireless networks that allow nodes that cannot directly communicate to exchange information through the help of intermediate nodes. The most widely adopted approach is based on hop-by-hop forwarding at the network layer along a path to destination. Cooperative relaying brings cooperation to the physical layer in order to fully exploit wireless resources. The concept exploits channel diversity by using multiple radio units to transmit the same message. The underlying fundamentals of cooperative relaying have been quite well-studied from a transmission efficiency point of view, in particular with a single pair of source and destination. Results of its performance gain in a multi-hop networking context with multiple sources and destinations are, however, less available. In this paper, we provide an optimization approach to assess the performance gain of cooperative relaying vis-a-vis conventional multi-hop forwarding under arbitrary network topology. The approach joint optimizes packet routing and transmission scheduling, and generalizes classical optimization schemes for non-cooperative networks. We provide numerical results demonstrating that the gain of cooperative relaying in networking scenarios is in general rather small and decreases when network connectivity and the number of traffic flows increase, due to interference and resource reuse limitations. In addition to quantifying the performance gain, our approach leads to a new framework for optimizing routing and scheduling in cooperative networks under a generalized Spacial Time Division Multiple Access (STDMA) scheme.Original Publication: Antonio Capone, Stefano Gualandi and Di Yuan, Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding, 2011, Ad hoc networks, (9), 7, 1256-1269. http://dx.doi.org/10.1016/j.adhoc.2011.02.002 Copyright: Elsevier Science B. V., Amsterdam http://www.elsevier.com

show abstract

Section: Related Workmentioning

confidence: 99%

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Capone

Gualandi

Yuan³

2011

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…Additionally, the RS can select from two possible policies to achieve the diversity gain: In order to maximise capacity, RS and BS should transmit uncorrelated (and ideally Gaussian) symbols, although related to the same message. This can be done by transmitting different parity data from the BS and RS when a convolutional or Turbo code is selected [11]. Further on, this process will be explained in more detail.…”

Section: Distributed Space-time Block Codesmentioning

confidence: 99%

“…This way, the paradigm of source-destination communication is changed to source-relay-destination, where the role played by the relay may be dummy (as in amplify and forward retransmission -A&F [6], [9]) or smart (when the relay decodes, reencondes conveniently and forwards -D&F [6], [10]). In the later case, taking into account Forward Error Correcting (FEC) codes, a new mode of cooperation is possible depending on the data transmitted by the relay [11][12][13]. It is named coded cooperation and in this mode the relay transmits incremental data of the received packet in order to improve the multiplexing, coding and/or the diversity gains at destination.…”

Section: Introductionmentioning

confidence: 99%

“…maximizing the mutual information or the SNR at the destination). In addition to these attributes, when the relay decides to retransmit [21], it may do it by providing the destination user with a repeated message (as in HARQ type I, chase combining) or with a re-encoded message [11][12][13] (as in HARQ type II, code combining). In both cases, the retransmission may effectively be considered a reconfigurable scheme that accommodates different error protection capabilities (enhancing the transmission rate) depending on the channel state.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Turbo FEC/ARQ Systems and Distributed Space-Time Coding for Cooperative Transmission

Agustín

Vidal

Muñoz

2005

Int J Wireless Inf Networks

View full text Add to dashboard Cite

Abstract.-Cooperative transmission can be seen as a "virtual" MIMO system, where the multiple transmit antennas are in fact implemented distributed by the antennas both at the source and the relay terminal. Depending on the system design, diversity/multiplexing gains are achievable. This design involves the definition of the type of retransmission (incremental redundancy, repetition coding), the design of the distributed space-time codes, the error correcting scheme, the operation of the relay (decode&forward or amplify&forward) and the number of antennas at each terminal. Proposed schemes are evaluated in different conditions in combination with forward error correcting codes (FEC), both for linear and near-optimum (sphere decoder) receivers, for its possible implementation in downlink high speed packet services of cellular networks. Results show the benefits of coded cooperation over direct transmission in terms of increased throughput. It is shown that multiplexing gains are observed even if the mobile station features a single antenna, provided that cell wide reuse of the relay radio resource is possible.

show abstract

“…Furthermore, a method designed for achieving cooperative diversity using rate compatible punctured codes was proposed in [12,13]. In [14,15], it was proposed to employ distributed turbo codes by exchanging extrinsic information between the data received from the source and that received from the relay, where the relay applies interleaving for the data received from the source and then uses an appropriate channel code before retransmission.…”

Section: Introductionmentioning

confidence: 99%

Distributed Turbo Coding in the Presence of Inter-User Channel Impairment

El‐Hajjar

Alamri

Hanzo

2009

2009 IEEE 70th Vehicular Technology Conference Fall

View full text Add to dashboard Cite

Abstract-We propose a Distributed Turbo Coding (DTC) scheme, where two users cooperate in a two-phase cooperation scenario constituted by the exchange of data between the users in the first phase followed by the uplink transmission of the two users' data in the second phase of cooperation. Following the information exchange phase, the data transmitted from the second user's transmitter during the second phase is an interleaved version of the first user's data. Each user's transmitter is equipped with a Recursive Systematic Convolutional (RSC) code, an interleaver and a Sphere Packing (SP) mapper. At the receiver side, interference cancellation is employed, which outputs two branches of decoded data corresponding to the data transmitted from the two users' transmitters. Iterative detection is employed by exchanging extrinsic information between the RSC decoder and the SP demapper in each decoding branch, as well as between the RSC decoders in the two branches. The proposed DTC scheme is benchmarked against another cooperative scheme, where the two users do not exchange their data, they rather transmit their data simultaneously. At the receiver of the benchmark scheme, iterative detection is carried out by exchanging extrinsic information between the SP demapper and the RSC decoder of each user, but no iterations are invoked between the RSC decoders in the two branches. The proposed scheme attains an E b /N0 gain of about 25 dB at BER of 10 −5 , when compared to the benchmark scheme, while considering a perfect Inter-User Channel (IUC) and employing I sys=5 system iterations in conjunction with an interleaver depth of D int=80, 000 bits. Additionally, we study the effects of both Gaussian as well as Ricean IUC on the achievable BER performance of the uplink DTC scheme.

show abstract

Distributed turbo codes: towards the capacity of the relay channel

Cited by 116 publications

References 13 publications

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Hybrid Turbo FEC/ARQ Systems and Distributed Space-Time Coding for Cooperative Transmission

Distributed Turbo Coding in the Presence of Inter-User Channel Impairment

Contact Info

Product

Resources

About