arXiv subjects

Baoming Bai

Publications and source records attributed to Baoming Bai.

41 records · Page 3Linked to original sources

arXiv2012

An Information-Spectrum Approach to the Capacity Region of General Interference Channel

This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is determined by a pair of spectral inf-mutual information rates. Although the presented formula is usually difficult to compute, it provides us useful insights into the interference channels. For example, the formula suggests us that the simplest inner bounds (obtained by treating the interference as noise) could be improved by taking into account the structure of the interference processes. This is verified numerically by computing the mutual information rates for Gaussian interference channels with embedded convolutional codes.

cs.IT↗

arXiv2011

Serial Concatenation of RS Codes with Kite Codes: Performance Analysis, Iterative Decoding and Design

In this paper, we propose a new ensemble of rateless forward error correction (FEC) codes. The proposed codes are serially concatenated codes with Reed-Solomon (RS) codes as outer codes and Kite codes as inner codes. The inner Kite codes are a special class of prefix rateless low-density parity-check (PRLDPC) codes, which can generate potentially infinite (or as many as required) random-like parity-check bits. The employment of RS codes as outer codes not only lowers down error-floors but also ensures (with high probability) the correctness of successfully decoded codewords. In addition to the conventional two-stage decoding, iterative decoding between the inner code and the outer code are also implemented to improve the performance further. The performance of the Kite codes under maximum likelihood (ML) decoding is analyzed by applying a refined Divsalar bound to the ensemble weight enumerating functions (WEF). We propose a simulation-based optimization method as well as density evolution (DE) using Gaussian approximations (GA) to design the Kite codes. Numerical results along with semi-analytic bounds show that the proposed codes can approach Shannon limits with extremely low error-floors. It is also shown by simulation that the proposed codes performs well within a wide range of signal-to-noise-ratios (SNRs).

cs.IT↗

arXiv2010

A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems

In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDPC codes.

cs.IT↗

arXiv2010

Interference Avoidance Game in the Gaussian Interference Channel: Sub-Optimal and Optimal Schemes

This paper considers a distributed interference avoidance problem employing frequency assignment in the Gaussian interference channel (IC). We divide the common channel into several subchannels and each user chooses the subchannel with less amount of interference from other users as the transmit channel. This mechanism named interference avoidance in this paper can be modeled as a competitive game model. And a completely autonomous distributed iterative algorithm called Tdistributed interference avoidance algorithm (DIA) is adopted to achieve the Nash equilibriumT (NE) of the game. Due to the self-optimum, DIA is a sub-optimal algorithm. Therefore, through introducing an optimal compensation into the competitive game model, we successfully develop a compensation-based game model to approximate the optimal interference avoidance problem. Moreover, an optimal algorithm called iterative optimal interference avoidance algorithm (IOIA) is proposed to reach the optimality of the interference avoidance scheme. We analyze the implementation complexities of the two algorithms. We also give the proof on the convergence of the proposed algorithms. The performance upper bound and lower bound are also derived for the proposed algorithms. The simulation results show that IOIA does reach the optimality under condition of interference avoidance mechanism.

cs.IT↗

arXiv2010

Using Distributed Rate-Splitting Game to Approach Rate Region Boundary of the Gaussian Interference Channel

Determining how to approach the rate boundary of the Gaussian interference channel in practical system is a big concern. In this paper, a distributed rate-splitting (DRS) scheme is proposed to approach the rate region boundary of the Gaussian interference channel. It is shown that the DRS scheme can be formulated as a non-cooperative game. We introduce the Stackelberg equilibrium (SE) with multiple leaders as the equilibrium point of the non-cooperative game. Therefore, an iterative multiple waterlevels water-filling algorithm (IML-WFA) is developed to efficiently reach the SE of the non-cooperative game. The existence of SE is established for the game. Numerical examples show that the rate-tuples achieved by the DRS are very close to the boundary of the well-known HK region.

cs.IT↗