Patent
Rate-compatible protograph LDPC codes
Dariush Divsalar,Thuy Van Nguyen,Aria Nosratinia +2 more
- 10 Jun 2011
TL;DR: In this article, a linear minimum distance growth property for the protograph is defined, and all possible edges in the graph are searched for the minimum iterative decoding threshold, and the node with the lowest decoding threshold is selected.
read more
Abstract: Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints may be set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner may be used in decode and forward relay channels.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Non-binary low density parity check (NB-LDPC) codes for communication systems
Sudarsan V. S. Ranganathan,Ba-Zhong Shen +1 more
- 10 Sep 2015
TL;DR: In this paper, the NB-LDPC matrix is characterized by a base proto-matrix having elements that represent sub-matrices, and the elements are selected from a finite Galois field that includes symbols.
20
Patent
Method and System for Reliable Data Communications with Adaptive Multi-Dimensional Modulations for Variable-Iteration Decoding
Toshiaki Koike-Akino
- 11 Feb 2015
TL;DR: In this article, the degree distribution for the PCM adaptation is designed by heuristic optimization to minimize the required SNR via an extrinsic information transfer (EXIT) trajectory analysis for finite-iteration decoding.
17
Patent
Parity check matrix
Nihat Engin Tunali,Raghavendar M. Rao,Raied N. Mazahreh,Krishna R. Narayanan +3 more
- 29 Jan 2013
TL;DR: In this article, the parity check matrix comprises each element of an H matrix expanded by a Progressive Edge Growth (PEG) expansion factor and an Approximate Cycle Extrinsic Message Degree (ACE).
10
Patent
Techniques for rate matching and interleaving in wireless communications
Loncke Vincent,Kalavai Raghunath,Cao Yi,Richardson Thomas,Soriaga Josepha Binamira,Kudekar Shrinivas +5 more
- 04 Oct 2018
TL;DR: In this paper, a method for rate matching and interleaving in wireless communications (e.g., 5G NR) is described. But the method is not suitable for the use of wireless networks.
9
Patent
QC LDPC code rate matching method and device therefor
Kim Jinwoo,Shin Jongwoong,Bonghoe Kim,Kwangseok Noh,Byun Ilmu +4 more
- 21 May 2019
TL;DR: In this paper, a quasi-cyclic low density parity check (QC LDPC) code rate matching method is described, in which the minimum lifting value can be selected from among lifting values by which a codeword longer than a target code block can be generated.
8
References
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
13.5K
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
6.8K
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
J.N. Laneman,Gregory W. Wornell +1 more
TL;DR: This work develops and analyzes space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network and demonstrates that these protocols achieve full spatial diversity in the number of cooperating terminals, not just theNumber of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes.
Design of capacity-approaching irregular low-density parity-check codes
TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.