arXiv subjects

Mark F. Flanagan

Publications and source records attributed to Mark F. Flanagan.

At least 73 records · Page 4Linked to original sources

arXiv2019

A Block Sparsity Based Estimator for mmWave Massive MIMO Channels with Beam Squint

Multiple-input multiple-output (MIMO) millimeter wave (mmWave) communication is a key technology for next generation wireless networks. One of the consequences of utilizing a large number of antennas with an increased bandwidth is that array steering vectors vary among different subcarriers. Due to this effect, known as beam squint, the conventional channel model is no longer applicable for mmWave massive MIMO systems. In this paper, we study channel estimation under the resulting non-standard model. To that aim, we first analyze the beam squint effect from an array signal processing perspective, resulting in a model which sheds light on the angle-delay sparsity of mmWave transmission. We next design a compressive sensing based channel estimation algorithm which utilizes the shift-invariant block-sparsity of this channel model. The proposed algorithm jointly computes the off-grid angles, the off-grid delays, and the complex gains of the multi-path channel. We show that the newly proposed scheme reflects the mmWave channel more accurately and results in improved performance compared to traditional approaches. We then demonstrate how this approach can be applied to recover both the uplink as well as the downlink channel in frequency division duplex (FDD) systems, by exploiting the angle-delay reciprocity of mmWave channels.

eess.SP↗

arXiv2019

Performance Analysis of NOMA-based Cooperative Relaying in α - μ Fading Channels

Non-orthogonal multiple access (NOMA) is widely recognized as a potential multiple access technology for efficient radio spectrum utilization in the fifth-generation (5G) wireless communications standard. In this paper, we study the average achievable rate and outage probability of a cooperative relaying system (CRS) based on NOMA (CRS-NOMA) over wireless links governed by the $α$-$μ$ generalized fading model; here $α$ and $μ$ designate the nonlinearity and clustering parameters, respectively, of each link. The average achievable rate is represented in closed-form using Meijer's G-function and the extended generalized bivariate Fox's H-function (EGBFHF), and the outage probability is represented using the lower incomplete Gamma function. Our results confirm that the CRS-NOMA outperforms the CRS with conventional orthogonal multiple access (CRS-OMA) in terms of spectral efficiency at high transmit signal-to-noise ratio (SNR). It is also evident from our results that with an increase in the value of the nonlinearity/clustering parameter, the SNR at which the CRS-NOMA outperforms its OMA based counterpart becomes higher. Furthermore, the asymptotic analysis of the outage probability reveals the dependency of the diversity order of each symbol in the CRS-NOMA system on the $α$ and $μ$ parameters of the fading links.

cs.IT↗

arXiv2019

On the Performance of NOMA-based Cooperative Relaying with Receive Diversity

Non-orthogonal multiple access (NOMA) is widely recognized as a potential multiple access (MA) technology for efficient spectrum utilization in the fifth-generation (5G) wireless standard. In this paper, we present the achievable sum rate analysis of a cooperative relaying system (CRS) using NOMA with two different receive diversity schemes - selection combining (SC), where the antenna with highest instantaneous signal-to-noise ratio (SNR) is selected, and maximal-ratio combining (MRC). We also present the outage probability and diversity analysis for the CRS-NOMA system. Analytical results confirm that the CRS-NOMA system outperforms the CRS with conventional orthogonal multiple access (OMA) by achieving higher spectral efficiency at high transmit SNR and achieves a full diversity order.

cs.IT↗

arXiv2019

User-Antenna Selection for Physical-Layer Network Coding based on Euclidean Distance

In this paper, we present the error performance analysis of a multiple-input multiple-output (MIMO) physical-layer network coding (PNC) system with two different user-antenna selection (AS) schemes in asymmetric channel conditions. For the first antenna selection scheme (AS1), where the user-antenna is selected in order to maximize the overall channel gain between the user and the relay, we give an explicit analytical proof that for binary modulations, the system achieves full diversity order of $min(N_A , N_B ) \times N_R$ in the multiple-access (MA) phase, where $N_A$, $N_B$ and $N_R$ denote the number of antennas at user $A$, user $B$ and relay $R$ respectively. We present a detailed investigation of the diversity order for the MIMO-PNC system with AS1 in the MA phase for any modulation order. A tight closed-form upper bound on the average SER is also derived for the special case when $N_R = 1$, which is valid for any modulation order. We show that in this case the system fails to achieve transmit diversity in the MA phase, as the system diversity order drops to $1$ irrespective of the number of transmit antennas at the user nodes. Additionally, we propose a Euclidean distance (ED) based user-antenna selection scheme (AS2) which outperforms the first scheme in terms of error performance. Moreover, by deriving upper and lower bounds on the diversity order for the MIMO-PNC system with AS2, we show that this system enjoys both transmit and receive diversity, achieving full diversity order of $\min(N_A, N_B) \times N_R$ in the MA phase for any modulation order. Monte Carlo simulations are provided which confirm the correctness of the derived analytical results.

cs.IT↗

arXiv2017

Physical-Layer Network Coding with Multiple Antennas: An Enabling Technology for Smart Cities

Efficient heterogeneous communication technologies are critical components to provide flawless connectivity in smart cities. The proliferation of wireless technologies, services and communication devices has created the need for green and spectrally efficient communication technologies. Physical- layer network coding (PNC) is now well-known as a potential candidate for delay-sensitive and spectrally efficient communication applications, especially in bidirectional relaying, and is therefore well-suited for smart city applications. In this paper, we provide a brief introduction to PNC and the associated distance shortening phenomenon which occurs at the relay. We discuss the issues with existing schemes that mitigate the deleterious effect of distance shortening, and we propose simple and effective solutions based on the use of multiple antenna systems. Simulation results confirm that full diversity order can be achieved in a PNC system by using antenna selection schemes based on the Euclidean distance metric.

cs.IT↗

arXiv2017

Transmit Antenna Selection for Physical-Layer Network Coding Based on Euclidean Distance

Physical-layer network coding (PNC) is now well-known as a potential candidate for delay-sensitive and spectrally efficient communication applications, especially in two-way relay channels (TWRCs). In this paper, we present the error performance analysis of a multiple-input single-output (MISO) fixed network coding (FNC) system with two different transmit antenna selection (TAS) schemes. For the first scheme, where the antenna selection is performed based on the strongest channel, we derive a tight closed-form upper bound on the average symbol error rate (SER) with $M$-ary modulation and show that the system achieves a diversity order of 1 for $M > 2$. Next, we propose a Euclidean distance (ED) based antenna selection scheme which outperforms the first scheme in terms of error performance and is shown to achieve a diversity order lower bounded by the minimum of the number of antennas at the two users.

cs.IT↗

arXiv2015

Design of LDPC Code Ensembles with Fast Convergence Properties

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary erasure channel and additive white Gaussian noise channel. The error rates of codes optimized for various numbers of decoder iterations are compared and it is seen that in the cases considered, the best performance for a given number of decoder iterations is achieved by codes which are optimized for this particular number. The design of generalized LDPC (GLDPC) codes is also considered, showing that these structures can offer better performance than LDPC codes for low-iteration-number designs. Finally, it is illustrated that LDPC codes which are optimized for a small number of iterations exhibit significant deviations in terms of degree distribution and weight enumerators with respect to LDPC codes returned by more conventional design tools.

cs.IT↗

arXiv2013

Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles

In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in the other case the Tanner graph is completely unstructured and irregular. In particular, for the former ensemble class we determine exactly which ensembles have minimum distance growing linearly with the block length with probability approaching unity with increasing block length. This work extends previous results concerning LDPC and regular GLDPC codes to the case where a hybrid mixture of check node types is used.

cs.IT↗

arXiv2013

Spectral Shape of Doubly-Generalized LDPC Codes: Efficient and Exact Evaluation

This paper analyzes the asymptotic exponent of the weight spectrum for irregular doubly-generalized LDPC (D-GLDPC) codes. In the process, an efficient numerical technique for its evaluation is presented, involving the solution of a 4 x 4 system of polynomial equations. The expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. The spectral shape is shown to admit a particularly simple form in the special case where all variable nodes are repetition codes of the same degree, a case which includes Tanner codes; for this case it is also shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function. Finally, using these new results, weight and stopping set size spectral shapes are evaluated for some example generalized and doubly-generalized LDPC code ensembles.

cs.IT↗

arXiv2013

Low-Complexity LP Decoding of Nonbinary Linear Codes

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remains prohibitively large for codes of moderate to large block length. To address this problem, two low-complexity LP (LCLP) decoding algorithms for binary linear codes have been proposed by Vontobel and Koetter, henceforth called the basic LCLP decoding algorithm and the subgradient LCLP decoding algorithm. In this paper, we generalize these LCLP decoding algorithms to nonbinary linear codes. The computational complexity per iteration of the proposed nonbinary LCLP decoding algorithms scales linearly with the block length of the code. A modified BCJR algorithm for efficient check-node calculations in the nonbinary basic LCLP decoding algorithm is also proposed, which has complexity linear in the check node degree. Several simulation results are presented for nonbinary LDPC codes defined over Z_4, GF(4), and GF(8) using quaternary phase-shift keying and 8-phase-shift keying, respectively, over the AWGN channel. It is shown that for some group-structured LDPC codes, the error-correcting performance of the nonbinary LCLP decoding algorithms is similar to or better than that of the min-sum decoding algorithm.

cs.IT↗

arXiv2012

On the Pseudocodeword Redundancy of Binary Linear Codes

The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.

cs.IT↗

arXiv2011

Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC

Using the EXIT chart approach, a necessary and sufficient condition is developed for the local stability of iterative decoding of multi-edge type (MET) doubly-generalized low-density parity-check (D-GLDPC) code ensembles. In such code ensembles, the use of arbitrary linear block codes as component codes is combined with the further design of local Tanner graph connectivity through the use of multiple edge types. The stability condition for these code ensembles is shown to be succinctly described in terms of the value of the spectral radius of an appropriately defined polynomial matrix.

cs.IT↗

arXiv2011

A Unified Framework for Linear-Programming Based Communication Receivers

It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local structure of the underlying graphical model, and are inhibited by the same phenomenon, which we call 'pseudoconfigurations'. This concept is a generalization of the concept of 'pseudocodewords' for linear codes. It is proved that the LP receiver has the 'maximum likelihood certificate' property, and that the receiver output is the lowest cost pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and linear-programming pseudoconfigurations is also proved. A concept of 'system pseudodistance' is defined which generalizes the existing concept of pseudodistance for binary and nonbinary linear codes. It is demonstrated how the LP design technique may be applied to the problem of joint equalization and decoding of coded transmissions over a frequency selective channel, and a simulation-based analysis of the error events of the resulting LP receiver is also provided. For this particular application, the proposed LP receiver is shown to be competitive with other receivers, and to be capable of outperforming turbo equalization in bit and frame error rate performance.

cs.IT↗

arXiv2011

Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding

Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate and large code lengths. To overcome this problem, Vontobel et al. developed an iterative Low-Complexity LP (LCLP) decoding algorithm for binary LDPC codes. The variable and check node calculations of binary LCLP decoding algorithm are related to those of binary Belief Propagation (BP). The present authors generalized this work to derive an iterative LCLP decoding algorithm for nonbinary linear codes. Contrary to binary LCLP, the variable and check node calculations of this algorithm are in general different from that of nonbinary BP. The overall complexity of nonbinary LCLP decoding is linear in block length; however the complexity of its check node calculations is exponential in the check node degree. In this paper, we propose a modified BCJR algorithm for efficient check node processing in the nonbinary LCLP decoding algorithm. The proposed algorithm has complexity linear in the check node degree. We also introduce an alternative state metric to improve the run time of the proposed algorithm. Simulation results are presented for $(504, 252)$ and $(1008, 504)$ nonbinary LDPC codes over $\mathbb{Z}_4$.

cs.IT↗

arXiv2011

Centrosymmetric Permutations and Involutions Avoiding 1243 and 2143

A centrosymmetric permutation is one which is invariant under the reverse-complement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schutzenberger involution. In this paper, we characterize the set of permutations avoiding 1243 and 2143 whose images under the reverse-complement mapping also avoid these patterns. We also characterize in a simple manner the corresponding Schroder paths under a bijection of Egge and Mansour. We then use these results to enumerate centrosymmetric permutations avoiding the patterns 1243 and 2143. In a similar manner, centrosymmetric involutions avoiding these same patterns are shown to be enumerated by the Pell numbers.

math.CO↗

arXiv2010

Low Complexity Linear Programming Decoding of Nonbinary Linear Codes

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. The aim of LP decoding is to develop an algorithm which has error-correcting performance similar to that of the Sum-Product (SP) decoding algorithm, while at the same time it should be amenable to mathematical analysis. The LP decoding algorithm has also been extended to nonbinary linear codes by Flanagan et al. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remain prohibitively large for codes of moderate to large block length. To address this problem, Vontobel et al. proposed a low complexity LP decoding algorithm for binary linear codes which has complexity linear in the block length. In this paper, we extend the latter work and propose a low-complexity LP decoding algorithm for nonbinary linear codes. We use the LP formulation proposed by Flanagan et al. as a basis and derive a pair of primal-dual LP formulations. The dual LP is then used to develop the low-complexity LP decoding algorithm for nonbinary linear codes. In contrast to the binary low-complexity LP decoding algorithm, our proposed algorithm is not directly related to the nonbinary SP algorithm. Nevertheless, the complexity of the proposed algorithm is linear in the block length and is limited mainly by the maximum check node degree. As a proof of concept, we also present a simulation result for a $[80,48]$ LDPC code defined over $\mathbb{Z}_4$ using quaternary phase-shift keying over the AWGN channel, and we show that the error-correcting performance of the proposed LP decoding algorithm is similar to that of the standard LP decoding using the simplex solver.

cs.IT↗

arXiv2010

Spectral Shape of Check-Hybrid GLDPC Codes

This paper analyzes the asymptotic exponent of both the weight spectrum and the stopping set size spectrum for a class of generalized low-density parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed to have the same degree (regular VN set), while the check node (CN) set is assumed to be composed of a mixture of different linear block codes (hybrid CN set). A simple expression for the exponent (which is also referred to as the growth rate or the spectral shape) is developed. This expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. Furthermore, it is shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function.

cs.IT↗

arXiv2010

Exploration of AWGNC and BSC Pseudocodeword Redundancy

The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. This paper provides new results on the AWGNC, BSC, and max-fractional pseudocodeword redundancies of codes. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Also, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.

cs.IT↗