scholarly journals Combining the Burrows-Wheeler Transform and RCM-LDGM Codes for the Transmission of Sources with Memory at High Spectral Efficiencies

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 378 ◽  
Author(s):  
Imanol Granada ◽  
Pedro Crespo ◽  
Javier Garcia-Frías
Keyword(s):  
Markov Chain ◽  
Hidden Markov ◽  
Low Density ◽  
Generator Matrix ◽  
Original Source ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Burrows Wheeler Transform ◽  
With Memory ◽  
Binary Sources

In this paper, we look at the problem of implementing high-throughput Joint Source- Channel (JSC) coding schemes for the transmission of binary sources with memory over AWGN channels. The sources are modeled either by a Markov chain (MC) or a hidden Markov model (HMM). We propose a coding scheme based on the Burrows-Wheeler Transform (BWT) and the parallel concatenation of Rate-Compatible Modulation and Low-Density Generator Matrix (RCM-LDGM) codes. The proposed scheme uses the BWT to convert the original source with memory into a set of independent non-uniform Discrete Memoryless (DMS) binary sources, which are then separately encoded, with optimal rates, using RCM-LDGM codes.

scholarly journals Weak convergence of stochastic integrals with respect to the state occupation measure of a Markov chain

2021 ◽  
Vol 58 (2) ◽  
pp. 372-393
Author(s):  
H. M. Jansen
Keyword(s):  
Markov Chain ◽  
Weak Convergence ◽  
Regime Switching ◽  
Sufficient Conditions ◽  
The State ◽  
Stochastic Integrals ◽  
Occupation Measure ◽  
Generator Matrix ◽  
Markov Modulated ◽  
Erlang Loss

AbstractOur aim is to find sufficient conditions for weak convergence of stochastic integrals with respect to the state occupation measure of a Markov chain. First, we study properties of the state indicator function and the state occupation measure of a Markov chain. In particular, we establish weak convergence of the state occupation measure under a scaling of the generator matrix. Then, relying on the connection between the state occupation measure and the Dynkin martingale, we provide sufficient conditions for weak convergence of stochastic integrals with respect to the state occupation measure. We apply our results to derive diffusion limits for the Markov-modulated Erlang loss model and the regime-switching Cox–Ingersoll–Ross process.

scholarly journals An overview of channel coding for 5G NR cellular communications

2019 ◽  
Vol 8 ◽  
Author(s):  
Jung Hyun Bae ◽  
Ahmed Abotabl ◽  
Hsien-Ping Lin ◽  
Kee-Bong Song ◽  
Jungwon Lee
Keyword(s):  
Channel Coding ◽  
Ldpc Codes ◽  
Low Latency ◽  
Polar Codes ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Successive Cancellation ◽  
New Radio ◽  
Key Characteristics ◽  
User Data

AbstractA 5G new radio cellular system is characterized by three main usage scenarios of enhanced mobile broadband (eMBB), ultra-reliable and low latency communications (URLLC), and massive machine type communications, which require improved throughput, latency, and reliability compared with a 4G system. This overview paper discusses key characteristics of 5G channel coding schemes which are mainly designed for the eMBB scenario as well as for partial support of the URLLC scenario focusing on low latency. Two capacity-achieving channel coding schemes of low-density parity-check (LDPC) codes and polar codes have been adopted for 5G where the former is for user data and the latter is for control information. As a coding scheme for data, 5G LDPC codes are designed to support high throughput, a variable code rate and length and hybrid automatic repeat request in addition to good error correcting capability. 5G polar codes, as a coding scheme for control, are designed to perform well with short block length while addressing a latency issue of successive cancellation decoding.

Sign in / Sign up

Export Citation Format

Share Document