arXiv subjects

Ling-Hua Chang

Publications and source records attributed to Ling-Hua Chang.

7 recordsLinked to original sources

arXiv2023

On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input

The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of the probability of MAP decoder ties to the probability of error when no MAP decoding ties occur grows at most linearly in blocklength, thus showing that decoder ties do not affect the code's error exponent. This result generalizes a similar recent result shown for the case of block codes transmitted over the BSC under a uniform input distribution.

cs.IT↗

arXiv2021

Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel

The generalized Poor-Verdu error lower bound established in [1] for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence of block codes sent over the memoryless binary symmetric channel (BSC), the minimum probability of error (under maximum likelihood decoding) has a relative deviation from the generalized bound that grows at most linearly in blocklength. This result directly implies that for arbitrary codes used over the BSC, decoder ties can only affect the subexponential behavior of the minimum probability of error.

cs.IT↗

arXiv2021

Phonon-Mediated Superconductivity near the Lattice Instability in Hole-doped Hydrogenated Monolayer Hexagonal Boron Nitride

Employing the density-functional theory with local density approximation, we show that the fully hydrogenated monolayer-hexagonal boron nitride (H$_2$BN) has a direct-band gap of 2.96 eV in the blue-light region while the pristine $\textit{h}$-BN has a wider indirect-band gap of 4.78 eV. The hole-doped H$_2$BN is stable at low carrier density ($n$) but becomes dynamically unstable at higher $n$. We predict that it is a phonon-mediated superconductor with a transition temperature ($T_c$) which can reach $\sim$31 K at $n$ of $1.5\times$ $10^{14}$ holes cm$^{-2}$ near the lattice instability. The $T_c$ could be enhanced up to $\sim$82 K by applying a biaxial tensile strain at 6 % along with doping at $n$ of $3.4\times$ 10$^{14}$ holes cm$^{-2}$ close to a new lattice instability.

cond-mat.supr-con↗

arXiv2020

The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate

The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to infinity. It is also shown that the asymptotic generalized bound achieves the error exponent (or reliability function) of the memoryless binary symmetric channel at zero coding rates.

cs.IT↗

arXiv2018

On the Maximum Size of Block Codes Subject to a Distance Criterion

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a codeword. We demonstrate that the number of such balls that cover the entire code alphabet cannot exceed this maximum size. Our approach can be applied to codes $i)$ with elements over arbitrary code alphabets, and $ii)$ under a broad class of distance measures, thereby ensuring the generality of our formula. Our formula indicates that the maximum code size can be fully characterized by the cumulative distribution function of the distance measure evaluated at two independent and identically distributed random codewords. When the two random codewords assume a uniform distribution over the entire code alphabet, our formula recovers and obtains a natural generalization of the Gilbert-Varshamov (GV) lower bound. We also establish a general formula for the zero-error capacity of any sequence of channels. Finally, we extend our study to the asymptotic setting, where we establish first- and second-order bounds on the asymptotic code rate subject to a normalized minimum distance constraint.

cs.IT↗

arXiv2014

An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit

A sufficient condition reported very recently for perfect recovery of a K-sparse vector via orthogonal matching pursuit (OMP) in K iterations is that the restricted isometry constant of the sensing matrix satisfies delta_K+1<1/(sqrt(delta_K+1)+1). By exploiting an approximate orthogonality condition characterized via the achievable angles between two orthogonal sparse vectors upon compression, this paper shows that the upper bound on delta can be further relaxed to delta_K+1<(sqrt(1+4*delta_K+1)-1)/(2K).This result thus narrows the gap between the so far best known bound and the ultimate performance guarantee delta_K+1<1/(sqrt(delta_K+1)) that is conjectured by Dai and Milenkovic in 2009. The proposed approximate orthogonality condition is also exploited to derive less restricted sufficient conditions for signal reconstruction in several compressive sensing problems, including signal recovery via OMP in a noisy environment, compressive domain interference cancellation, and support identification via the subspace pursuit algorithm.

cs.IT↗

arXiv2012

Achievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems. Assuming that (i) u and v are two sparse vectors separated by an angle thetha, and (ii) the sensing matrix Phi satisfies RIP, this paper is aimed at analytically characterizing the achievable angles between Phi*u and Phi*v. Motivated by geometric interpretations of RIP and with the aid of the well-known law of cosines, we propose a plane geometry based formulation for the study of the considered problem. It is shown that all the RIP-induced norm/distance constraints on Phi*u and Phi*v can be jointly depicted via a simple geometric diagram in the two-dimensional plane. This allows for a joint analysis of all the considered algebraic constraints from a geometric perspective. By conducting plane geometry analyses based on the constructed diagram, closed-form formulae for the maximal and minimal achievable angles are derived. Computer simulations confirm that the proposed solution is tighter than an existing algebraic-based estimate derived using the polarization identity. The obtained results are used to derive a tighter restricted isometry constant of structured sensing matrices of a certain kind, to wit, those in the form of a product of an orthogonal projection matrix and a random sensing matrix. Follow-up applications to three CS problems, namely, compressed-domain interference cancellation, RIP-based analysis of the orthogonal matching pursuit algorithm, and the study of democratic nature of random sensing matrices are investigated.

cs.IT↗