English
Related papers

Related papers: Bilayer Protograph Codes for Half-Duplex Relay Cha…

200 papers

We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays.

Information Theory · Computer Science 2013-06-18 Frank R. Kschischang , Tobias Lutz

In this work, we present a construction of a family of space-time block codes for a Multi-Access Amplify-and- Forward Relay channel with two users and a single half-duplex relay. It is assumed that there is no Channel Side Information at…

Information Theory · Computer Science 2008-04-10 Maya Badr , Jean-Claude Belfiore

A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the…

Information Theory · Computer Science 2015-01-23 Fabian Steiner , Georg Böcherer , Gianluigi Liva

Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary LDPC code as underlying code. This special case of LDPC…

Information Theory · Computer Science 2016-08-15 Hassan Khodaiemehr , Dariush Kiani , Mohammad-Reza Sadeghi

This paper describes an approach for half-duplex cooperative transmission in a classical three-node relay channel. Assuming availability of channel state information at nodes, the approach makes use of this information to optimize distinct…

Information Theory · Computer Science 2011-11-09 Tan F. Wong , Tat M. Lok , John M. Shea

We investigate techniques for designing modulation/coding schemes for the wireless two-way relaying channel. The relay is assumed to have perfect channel state information, but the transmitters are assumed to have no channel state…

Information Theory · Computer Science 2011-07-29 Brett Hern , Krishna Narayanan

Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer…

Information Theory · Computer Science 2016-11-15 Jianquan Liu , Meixia Tao , Youyun Xu

We consider a communication system where two transmitters wish to exchange information through a half-duplex relay in the middle. The channels between the transmitters and the relay have asymmetric channel gains. More specifically, the…

Information Theory · Computer Science 2009-08-18 Makesh Pravin Wilson , Krishna Narayanan

This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns,…

Information Theory · Computer Science 2019-08-06 Federico Clazzer , Balazs Matuz , Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Sarah J. Johnson

We propose composite decode-forward (DF) schemes for the two-way relay channel in both the full- and half-duplex modes by combining coherent relaying, independent relaying and partial relaying strategies. For the full-duplex mode, the relay…

Information Theory · Computer Science 2015-04-29 Ahmad Abu Al Haija , Peng Zhong , Mai Vu

Protograph-based Raptor-like low-density parity-check codes (PBRL codes) are a recently proposed family of easily encodable and decodable rate-compatible LDPC (RC-LDPC) codes. These codes have an excellent iterative decoding threshold and…

Information Theory · Computer Science 2017-06-08 Sudarsan V. S. Ranganathan , Dariush Divsalar , Richard D. Wesel

In this work, a relay channel is studied in which a source encoder communicates with a destination decoder through a number of out-of-band relays that are connected to the decoder through capacity-constrained digital backhaul links. This…

Information Theory · Computer Science 2013-04-16 Seok-Hwan Park , Osvaldo Simeone , Onur Sahin , Shlomo Shamai

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

Information Theory · Computer Science 2007-09-29 Yijia , Fan , H. Vincent Poor , John S. Thompson

Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and two-path relay are adopted to deal with the increase of…

Information Theory · Computer Science 2013-04-09 Hao Lu , Peilin Hong , Kaiping Xue

This paper produces a rate-compatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints…

Information Theory · Computer Science 2013-02-22 Thuy Van Nguyen , Aria Nosratinia , Dariush Divsalar

Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility.…

Information Theory · Computer Science 2021-07-22 Yi Fang , Pingping Chen , Guofa Cai , Francis C. M. Lau , Soung Chang Liew , Guojun Han

A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the…

Information Theory · Computer Science 2007-08-17 Saravanan Vijayakumaran , Tan F. Wong , Tat M. Lok

This paper presents a novel design framework for protograph-based LDPC codes that simultaneously achieves full diversity in block-fading channels (BFCs) and nearcapacity performance in additive white Gaussian noise channels (AWGNCs). By…

Information Theory · Computer Science 2026-02-03 Inki Kim , Hyuntae Ahn , Yongjune Kim , Hee-Youl Kwak , Dae-Young Yun , Sang-Hyo Kim

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…

Information Theory · Computer Science 2013-05-14 Raúl Etkin , Farzad Parvaresh , Ilan Shomorony , A. Salman Avestimehr

Differential distributed space-time coding (D-DSTC) has been considered to improve both diversity and data-rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are…

Information Theory · Computer Science 2016-11-17 M. R. Avendi , Sina Poorkasmaei , Hamid Jafarkhani