arXiv subjects

Min Qiu

Publications and source records attributed to Min Qiu.

At least 55 records · Page 3Linked to original sources

arXiv2022

Sub-Block Rearranged Staircase Codes

We propose a new family of spatially coupled product codes, called sub-block rearranged staircase (SR-staircase) codes. Each code block of SR-staircase codes is obtained by encoding rearranged preceding code blocks and new information block, where the rearrangement involves sub-blocks decomposition and transposition. The proposed codes can be constructed to have each code block size of $1/q$ to that of the conventional staircase codes while having the same rate and component codes, for any positive integer $q$. In this regard, we can use strong algebraic component codes to construct SR-staircase codes with a similar or the same code block size and rate as staircase codes with weak component codes. We characterize the decoding threshold of the proposed codes under iterative bounded distance decoding (iBDD) by using density evolution. We also derive the conditions under which they achieve a better decoding threshold than that of staircase codes. Further, we investigate the error floor performance by analyzing the contributing error patterns and their multiplicities. Both theoretical and simulation results show that the designed SR-staircase codes outperform staircase codes in terms of waterfall and error floor while the performance can be further improved by using a large coupling width.

cs.IT↗

arXiv2022

Sub-Block Rearranged Staircase Codes for Optical Transport Networks

We propose a new family of spatially coupled product codes, called sub-block rearranged staircase (SR-staircase) codes. Each SR-staircase code block is constructed by encoding rearranged preceding code blocks and new information blocks, where the rearrangement involves sub-blocks decomposition and transposition. The proposed codes can be constructed to have each code block size of $1/q$ to that of the conventional staircase codes while having the same rate and component codes, for any positive integer $q$. In this regard, we can use strong algebraic component codes to construct SR-staircase codes with a similar or the same code block size and rate as staircase codes with weak component codes. Moreover, both waterfall and error floor performance can be further improved by using a large coupling width. The superior performance of the proposed codes is demonstrated through density evolution and error floor analysis as well as simulation.

cs.IT↗

arXiv2022

Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes (PCCs) with a fraction of information bits repeated $q$ times. GSC-PCCs can be seen as a generalization of the original spatially-coupled parallel concatenated codes proposed by Moloudi et al. [2]. To characterize the asymptotic performance of GSC-PCCs, we derive the corresponding density evolution equations and compute their decoding thresholds. The threshold saturation effect is observed and proven. Most importantly, we rigorously prove that any rate-$R$ GSC-PCC ensemble with 2-state convolutional component codes achieves at least a fraction $1-\frac{R}{R+q}$ of the capacity of the binary erasure channel (BEC) for repetition factor $q\geq2$ and this multiplicative gap vanishes as $q$ tends to infinity. To the best of our knowledge, this is the first class of SC-TCs that are proven to be capacity-achieving. Further, the connection between the strength of the component codes, the decoding thresholds of GSC-PCCs, and the repetition factor are established. The superiority of the proposed codes with finite blocklength is exemplified by comparing their error performance with that of existing SC-TCs via computer simulations.

cs.IT↗

arXiv2021

Windowed Decoding for Delayed Bit-Interleaved Coded Modulation

Delayed bit-interleaved coded modulation (DBICM) generalizes bit-interleaved coded modulation (BICM) by modulating differently delayed sub-blocks of codewords onto the same signals. DBICM improves transmission reliability over BICM due to its capability of detecting undelayed sub-blocks with the extrinsic information of the decoded delayed sub-blocks. In this work, we propose a novel windowed decoding algorithm for DBICM, which uses the extrinsic information of both the decoded delayed and undelayed sub-blocks, to improve the detection on all sub-blocks. Numerical results show that the proposed windowed decoding significantly outperforms the original decoding.

cs.IT↗

arXiv2021

Micro-scale opto-thermo-mechanical actuation in the dry adhesive regime

Realizing optical manipulation of microscopic objects is crucial in the research fields of life science, condensed matter physics and physical chemistry. In non-liquid environments, this task is commonly regarded as difficult due to strong adhesive surface force ($\simμ\rm N$) between solid interfaces that makes tiny optical driven force ($\sim\rm pN$) insignificant. Here, by recognizing the microscopic interaction mechanism between friction force -- the parallel component of surface force on the contact surface -- and thermoelastic waves induced by pulsed optical absorption, we establish a general principle enabling the actuation of micro-objects on dry frictional surfaces based on the opto-thermo-mechanical effects. Theoretically, we predict that nanosecond pulsed optical absorption with mW-scale peak power is sufficient to tame $μ\rm N$-scale friction force. Experimentally, we demonstrate that two-dimensional spiral motion of gold plates on micro-fibers driven by a nanosecond pulsed laser, and reveal the specific rules of motion control. Our results pave the way for future development of micro-scale actuators in nonliquid environments.

physics.app-ph↗

arXiv2021

Light-induced in-plane Rotation of Microobjects on Microfibers

The transfer of angular momentum carried by photons into a microobject has been widely exploited to achieve the actuation of the microobject. However, this scheme is fundamentally defective in nonliquid environments as a result of the scale gap between friction forces ($μ$N) and optical forces (pN). To bypass this challenge, the researchers have recently proposed to take advantage of elastic waves based on opto-thermo-mechanical effects [1-4]. Grounded on this insight, we here demonstrate and characterize the in-plane rotation of a gold nanoplate in its surface contacting with a microfiber, driven by nanosecond laser pulses, which has not been explored before. Furthermore, we examine the underlying physical mechanisms and highlight the essential role of the spatial gradient of optical absorption. The combined experimental and theoretical results offer new insights into the study of the light-induced actuation of the microobjects in nonliquid environments, an emerging field far from being mature in both comprehensive understanding and practical applications.

physics.optics↗

arXiv2021

Connecting Spatially Coupled LDPC Code Chains for Bit-Interleaved Coded Modulation

This paper investigates the design of spatially coupled low-density parity-check (SC-LDPC) codes constructed from connected-chain ensembles for bit-interleaved coded modulation (BICM) schemes. For short coupling lengths, connecting multiple SC-LDPC chains can improve decoding performance over single-chains and impose structured unequal error protection (UEP). A joint design of connected-chain ensembles and bit mapping to further exploit the UEP from codes and high-order modulations is proposed. Numerical results demonstrate the superiority of the proposed design over existing connected-chain ensembles and over single-chain ensembles with existing bit mapping design.

cs.IT↗

arXiv2021

Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition

We introduce generalized spatially coupled parallel concatenated codes (GSC-PCCs), a class of spatially coupled turbo-like codes obtained by coupling parallel concatenated codes (PCCs) with a fraction of information bits repeated before the PCC encoding. GSC-PCCs can be seen as a generalization of the original spatially coupled parallel concatenated convolutional codes (SC-PCCs) proposed by Moloudi et al. [1]. To characterize the asymptotic performance of GSC-PCCs, we derive the corresponding density evolution equations and compute their decoding thresholds. We show that the proposed codes have some nice properties such as threshold saturation and that their decoding thresholds improve with the repetition factor $q$. Most notably, our analysis suggests that the proposed codes asymptotically approach the capacity as $q$ tends to infinity with any given constituent convolutional code.

cs.IT↗

arXiv2021

Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel

The two-user Gaussian interference channel (G-IC) is revisited, with a particular focus on practically amenable discrete input signalling and treating interference as noise (TIN) receivers. The corresponding deterministic interference channel (D-IC) is first investigated and coding schemes that can achieve the entire capacity region of D-IC under TIN are proposed. These schemes are then systematically translate into multi-layer superposition coding schemes based on purely discrete inputs for the real-valued G-IC. Our analysis shows that the proposed scheme is able to achieve the entire capacity region to within a constant gap for all channel parameters. To the best of our knowledge, this is the first constant-gap result under purely discrete signalling and TIN for the entire capacity region and all the interference regimes. Furthermore, the approach is extended to obtain coding scheme based on discrete inputs for the complex-valued G-IC. For such a scenario, the minimum distance and the achievable rate of the proposed scheme under TIN are analyzed, which takes into account the effects of random phase rotations introduced by the channels. Simulation results show that our scheme is capable of approaching the capacity region of the complex-valued G-IC and significantly outperforms Gaussian signalling with TIN in various interference regimes.

cs.IT↗

arXiv2021

Design and Analysis of Delayed Bit-Interleaved Coded Modulation with LDPC Codes

This paper investigates the design and performance of delayed bit-interleaved coded modulation (DBICM) with low-density parity-check (LDPC) codes. For Gray labeled square $M$-ary quadrature amplitude modulation (QAM) constellations, we investigate the optimal delay scheme with the largest spectrum efficiency of DBICM for a fixed maximum number of delayed time slots and a given signal-to-noise ratio. When analyzing the capacity of DBICM, we find two important properties: the capacity improvement due to delayed coded bits being mapped to the real and imaginary parts of the transmitted symbols are independent of each other; a pair of delay schemes with delayed coded bits having identical bit-channel capacity lead to equivalent DBICM capacity. Using these two properties, we efficiently optimize the delay scheme for any uniform Gray-QAM systems. Furthermore, these two properties enable efficient LDPC code designs regarding unequal error protection via bit-channel type classifications. Moreover, we use protograph-based extrinsic information transfer charts to jointly optimize degree distributions and channel assignments of LDPC codes and propose a constrained progressive edge growth like algorithm to jointly construct LDPC codes and bit-interleavers for DBICM, taking distinctive bit-channel's capacity into account. Simulation results demonstrate that the designed LDPC coded DBICM systems significantly outperform LDPC coded BICM systems.

cs.IT↗

arXiv2020

Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the coupling ratio and the encoding and decoding architectures of the underlying component codes can remain unchanged. For this work, we first provide the construction methods for partially coupled turbo codes with coupling memory $m$ and study the corresponding graph models. We then derive the density evolution equations for the corresponding ensembles on the binary erasure channel to precisely compute their iterative decoding thresholds. Rate-compatible designs and their decoding thresholds are also provided, where the coupling and puncturing ratios are jointly optimized to achieve the largest decoding threshold for a given target code rate. Our results show that for a wide range of code rates, the proposed codes attain close-to-capacity performance and the decoding performance improves with increasing the coupling memory. In particular, the proposed partially parity-coupled turbo codes have thresholds within 0.0002 of the BEC capacity for rates ranging from $1/3$ to $9/10$, yielding an attractive way for constructing rate-compatible capacity-approaching channel codes.

cs.IT↗

arXiv2020

Partially Information Coupled Duo-Binary Turbo Codes

Partially information coupled turbo codes (PIC-TCs) is a class of spatially coupled turbo codes that can approach the BEC capacity while keeping the encoding and decoding architectures of the underlying component codes unchanged. However, PIC-TCs have significant rate loss compared to its component rate-1/3 turbo code, and the rate loss increases with the coupling ratio. To absorb the rate loss, in this paper, we propose the partially information coupled duo-binary turbo codes (PIC-dTCs). Given a rate-1/3 turbo code as the benchmark, we construct a duo-binary turbo code by introducing one extra input to the benchmark code. Then, parts of the information sequence from the original input are coupled to the extra input of the succeeding code blocks. By looking into the graph model of PIC-dTC ensembles, we derive the exact density evolution equations of the PIC-dTC ensembles, and compute their belief propagation decoding thresholds on the binary erasure channel. Simulation results verify the correctness of our theoretical analysis, and also show significant error performance improvement over the uncoupled rate-1/3 turbo codes and existing designs of spatially coupled turbo codes.

cs.IT↗

arXiv2020

Shape deformation of nanoresonator: a quasinormal-mode perturbation theory

When material parameters are fixed, optical responses of nanoresonators are dictated by their shapes and dimensions. Therefore, both designing nanoresonators and understanding their underlying physics would benefit from a theory that predicts the evolutions of resonance modes of open systems---the so-called quasinormal modes (QNMs)---as the nanoresonator shape changes. QNM perturbation theories (PTs) are one ideal choice. However, existing theories developed for material changes are unable to provide accurate perturbation corrections for shape deformations. By introducing a novel extrapolation technique, we develop a rigorous QNM PT that faithfully represents the electromagnetic fields in perturbed domain. Numerical tests performed on the eigenfrequencies, eigenmodes and optical responses of deformed nanoresonators evidence the predictive force of the present PT, even for large deformations. This opens new avenues for inverse design, as we exemplify by designing super-cavity modes and exceptional points with remarkable ease and physical insight.

physics.optics↗

arXiv2020

Bandgap Control in Two-Dimensional Semiconductors via Coherent Doping of Plasmonic Hot Electrons

Bandgap control is of central importance for semiconductor technologies. The traditional means of control is to dope the lattice chemically, electrically or optically with charge carriers. Here, we demonstrate for the first time a widely tunable bandgap (renormalisation up to 650 meV at room-temperature) in two-dimensional (2D) semiconductors by coherently doping the lattice with plasmonic hot electrons. In particular, we integrate tungsten-disulfide (WS$_2$) monolayers into a self-assembled plasmonic crystal, which enables coherent coupling between semiconductor excitons and plasmon resonances. Accompanying this process, the plasmon-induced hot electrons can repeatedly fill the WS$_2$ conduction band, leading to population inversion and a significant reconstruction in band structures and exciton relaxations. Our findings provide an innovative and effective measure to engineer optical responses of 2D semiconductors, allowing a great flexiblity in design and optimisation of photonic and optoelectronic devices.

physics.optics↗

arXiv2020

On the $p$-adic properties of Stirling numbers of the first kind

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and Young, Leonetti and Sanna, Adelberg, Hong and Qiu made some progress in the study of the $p$-adic valuations of $s(n,k)$. In this paper, by using Washington's congruence on the generalized harmonic number and the $n$-th Bernoulli number $B_n$ and the properties of $m$-th Stirling numbers of the first kind obtained recently by the authors, we arrive at an exact expression or a lower bound of $v_p(s(ap, k))$ with $a$ and $k$ being integers such that $1\le a\le p-1$ and $1\le k\le ap$. This infers that for any regular prime $p\ge 7$ and for arbitrary integers $a$ and $k$ with $5\le a\le p-1$ and $a-2\le k\le ap-1$, one has $v_p(H(ap-1,k))<-\frac{\log{(ap-1)}}{2\log p}$ with $H(ap-1, k)$ being the $k$-th elementary symmetric function of $1, \frac{1}{2}, ..., \frac{1}{ap-1}$. This gives a partial support to a conjecture of Leonetti and Sanna raised in 2017. We also present results on $v_p(s(ap^n,ap^n-k))$ from which one can derive that under certain condition, for any prime $p\ge 5$, any odd number $k\ge 3$ and any sufficiently large integer $n$, if $(a,p)=1$, then $v_p(s(ap^{n+1},ap^{n+1}-))=v_p(s(ap^n,ap^n-k))+2$. It confirms partially Lengyel's conjecture proposed in 2015.

math.NT↗

arXiv2019

Density Evolution Analysis of Partially Information Coupled Turbo Codes on the Erasure Channel

In this paper, we investigate the performance of a class of spatially coupled codes, namely partially information coupled turbo codes (PIC-TCs) over the binary erasure channel (BEC). This class of codes enjoy flexible code rate adjustment by varying the coupling ratio. Moreover, the coupling method can be directly applied to any component codes without changing the encoding and decoding architectures of the underlying component codes. However, the theoretical performance of PIC-TCs has not been fully investigated. For this work, we consider the codes that have coupling memory $m$ and study the corresponding graph model. We then derive the exact density evolution equations for these code ensembles with any given coupling ratio and coupling memory $m$ to precisely compute their belief propagation decoding thresholds for the BEC. Our simulation results verify the correctness of our theoretical analysis and also show better error performance over uncoupled turbo codes with a variety of code rates on the BEC.

cs.IT↗

arXiv2019

Lattice Coding for Downlink Multiuser Transmission

In this thesis, we mainly investigate the lattice coding problem of the downlink communication between a base station and multiple users. The base station broadcasts a message containing each user's intended message. The capacity limit of such a system setting is already well-known while the design of practical coding and modulation schemes to approach the theoretical limit has not been fully studied and investigated in the literature. This thesis attempts to address this problem by providing a systematic design on lattice coding and modulation schemes for downlink multiuser communication systems. The main idea is to exploit the structure property of lattices to harness interference from downlink users.

cs.IT↗

arXiv2019

Downlink Non-Orthogonal Multiple Access without SIC for Block Fading Channels: An Algebraic Rotation Approach

In this paper, we investigate the problem of downlink non-orthogonal multiple access (NOMA) over block fading channels. For the single antenna case, we propose a class of NOMA schemes where all the users' signals are mapped into $n$-dimensional constellations corresponding to the same algebraic lattices from a number field, allowing every user attains full diversity gain with single-user decoding, i.e., no successive interference cancellation (SIC). The minimum product distances of the proposed scheme with arbitrary power allocation factor are analyzed and their upper bounds are derived. Within the proposed class of schemes, we also identify a special family of NOMA schemes based on lattice partitions of the underlying ideal lattices, whose minimum product distances can be easily controlled. Our analysis shows that among the proposed schemes, the lattice-partition-based schemes achieve the largest minimum product distances of the superimposed constellations, which are closely related to the symbol error rates for receivers with single-user decoding. Simulation results are presented to verify our analysis and to show the effectiveness of the proposed schemes as compared to benchmark NOMA schemes. Extensions of our design to the multi-antenna case are also considered where similar analysis and results are presented.

cs.IT↗