arXiv subjects

Qinghua Guo

Publications and source records attributed to Qinghua Guo.

At least 73 records · Page 4Linked to original sources

arXiv2019

DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access

In the upcoming Internet-of-Things (IoT) era, the communication is often featured by massive connection, sporadic transmission, and small-sized data packets, which poses new requirements on the delay expectation and resource allocation efficiency of the Random Access (RA) mechanisms of the IoT communication stack. A grant-free non-orthogonal random access (NORA) system is considered in this paper, which could simultaneously reduce the access delay and support more Machine Type Communication (MTC) devices with limited resources. In order to address the joint user activity detection (UAD) and channel estimation (CE) problem in the grant-free NORA system, we propose a deep neural network-aided message passing-based block sparse Bayesian learning (DNN-MP-BSBL) algorithm. In the DNN-MP-BSBL algorithm, the iterative message passing process is transferred from a factor graph to a deep neural network (DNN). Weights are imposed on the messages in the DNN and trained to minimize the estimation error. It is shown that the trained weights could alleviate the convergence problem of the MP-BSBL algorithm, especially on crowded RA scenarios. Simulation results show that the proposed DNN-MP-BSBL algorithm could improve the UAD and CE accuracy with a smaller number of iterations, indicating its advantages for low-latency grant-free NORA systems.

cs.IT↗

arXiv2019

DNN-Aided Message Passing Based Block Sparse Bayesian Learning for Joint User Activity Detection and Channel Estimation

Faced with the massive connection, sporadic transmission, and small-sized data packets in future cellular communication, a grant-free non-orthogonal random access (NORA) system is considered in this paper, which could reduce the access delay and support more devices. In order to address the joint user activity detection (UAD) and channel estimation (CE) problem in the grant-free NORA system, we propose a deep neural network-aided message passing-based block sparse Bayesian learning (DNN-MP-BSBL) algorithm. In this algorithm, the message passing process is transferred from a factor graph to a deep neural network (DNN). Weights are imposed on the messages in the DNN and trained to minimize the estimation error. It is shown that the weights could alleviate the convergence problem of the MP-BSBL algorithm. Simulation results show that the proposed DNN-MP-BSBL algorithm could improve the UAD and CE accuracy with a smaller number of iterations.

cs.IT↗

arXiv2019

Sparse Bayesian Learning Using Approximate Message Passing with Unitary Transformation

Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it is vulnerable to `difficult' measurement matrices as AMP can easily diverge. Damped AMP has been used to alleviate the problem at the cost of slowing the convergence speed. In this work, we propose an SBL algorithm based on the AMP with unitary transformation (UTAMP), where the shape parameter of the hyperprior is tuned automatically. It is shown that, compared to the state-of-the-art AMP based SBL algorithm, the proposed UTAMP-SBL is much more robust and much faster, leading to remarkably better performance. It is shown that in many cases, UTAMP-SBL can approach the support-oracle bound closely.

cs.IT↗

arXiv2019

Highly degenerate photonic flat bands arising from complete graph configurations

Inspired by complete graph theory, we demonstrate that a metallic claw "meta-atom" structure can carry a high number of nearly degenerate resonant modes. A photonic meta-crystal composing of a lattice of such meta-atoms exhibits a large number of flat bands that are squeezed into a narrow frequency window, and these flat bands can be designed to locate in a wide complete 3D bandgap. The degeneracy dimension (Nf) of the flat bands is determined by the number of branches (Nb) of the metallic claw with Nf=Nb-3, which is geometrically related to the complete graph theory. Different from those flat bands emerging from special lattice arrangements (e.g., Kagome lattice), the isolated flat bands here are insensitive to lattice perturbations. The proposed mechanism offers a new platform for realizing various dispersion-less phenomena and a new paradigm to realize high density of states and spectra compressing.

physics.class-ph↗

arXiv2019

Channel Covariance Matrix Estimation via Dimension Reduction for Hybrid MIMO MmWave Communication Systems

Hybrid massive MIMO structures with lower hardware complexity and power consumption have been considered as a potential candidate for millimeter wave (mmWave) communications. Channel covariance information can be used for designing transmitter precoders, receiver combiners, channel estimators, etc. However, hybrid structures allow only a lower-dimensional signal to be observed, which adds difficulties for channel covariance matrix estimation. In this paper, we formulate the channel covariance estimation as a structured low-rank matrix sensing problem via Kronecker product expansion and use a low-complexity algorithm to solve this problem. Numerical results with uniform linear arrays (ULA) and uniform squared planar arrays (USPA) are provided to demonstrate the effectiveness of our proposed method.

eess.SP↗

arXiv2019

On the Performance of Massive MIMO Systems With Low-Resolution ADCs Over Rician Fading Channels

This paper considers uplink massive multiple-input multiple-output (MIMO) systems with lowresolution analog-to-digital converters (ADCs) over Rician fading channels. Maximum-ratio-combining (MRC) and zero-forcing (ZF) receivers are considered under the assumption of perfect and imperfect channel state information (CSI). Low-resolution ADCs are considered for both data detection and channel estimation, and the resulting performance is analyzed. Asymptotic approximations of the spectrum efficiency (SE) for large systems are derived based on random matrix theory. With these results, we can provide insights into the trade-offs between the SE and the ADC resolution and study the influence of the Rician K-factors on the performance. It is shown that a large value of K-factors may lead to better performance and alleviate the influence of quantization noise on channel estimation. Moreover, we investigate the power scaling laws for both receivers under imperfect CSI and it shows that when the number of base station (BS) antennas is very large, without loss of SE performance, the transmission power can be scaled by the number of BS antennas for both receivers while the overall performance is limited by the resolution of ADCs. The asymptotic analysis is validated by numerical results. Besides, it is also shown that the SE gap between the two receivers is narrowed down when the K-factor is increased. We also show that ADCs with moderate resolutions lead to better energy efficiency (EE) than that with high-resolution or extremely low-resolution ADCs and using ZF receivers achieve higher EE as compared with the MRC receivers.

eess.SP↗

arXiv2019

Extreme Learning Machine Based Non-Iterative and Iterative Nonlinearity Mitigation for LED Communications

This work concerns receiver design for light emitting diode (LED) communications where the LED nonlinearity can severely degrade the performance of communications. We propose extreme learning machine (ELM) based non-iterative receivers and iterative receivers to effectively handle the LED nonlinearity and memory effects. For the iterative receiver design, we also develop a data-aided receiver, where data is used as virtual training sequence in ELM training. It is shown that the ELM based receivers significantly outperform conventional polynomial based receivers; iterative receivers can achieve huge performance gain compared to non-iterative receivers; and the data-aided receiver can reduce training overhead considerably. This work can also be extended to radio frequency communications, e.g., to deal with the nonlinearity of power amplifiers.

eess.SP↗

arXiv2019

Extreme Learning Machine-Based Receiver for MIMO LED Communications

This work concerns receiver design for light-emitting diode (LED) multiple input multiple output (MIMO) communications where the LED nonlinearity can severely degrade the performance of communications. In this paper, we propose an extreme learning machine (ELM) based receiver to jointly handle the LED nonlinearity and cross-LED interference, and a circulant input weight matrix is employed, which significantly reduces the complexity of the receiver with the fast Fourier transform (FFT). It is demonstrated that the proposed receiver can efficiently handle the LED nonlinearity and cross-LED interference.

eess.SP↗

arXiv2018

Linear Shrinkage Estimation of Covariance Matrices Using Low-Complexity Cross-Validation

Shrinkage can effectively improve the condition number and accuracy of covariance matrix estimation, especially for low-sample-support applications with the number of training samples smaller than the dimensionality. This paper investigates parameter choice for linear shrinkage estimators. We propose data-driven, leave-one-out cross-validation (LOOCV) methods for automatically choosing the shrinkage coefficients, aiming to minimize the Frobenius norm of the estimation error. A quadratic loss is used as the prediction error for LOOCV. The resulting solutions can be found analytically or by solving optimization problems of small sizes and thus have low complexities. Our proposed methods are compared with various existing techniques. We show that the LOOCV method achieves near-oracle performance for shrinkage designs using sample covariance matrix (SCM) and several typical shrinkage targets. Furthermore, the LOOCV method provides low-complexity solutions for estimators that use general shrinkage targets, multiple targets, and/or ordinary least squares (OLS)-based covariance matrix estimation. We also show applications of our proposed techniques to several different problems in array signal processing.

cs.IT↗

arXiv2018

Matrix Completion-Based Channel Estimation for MmWave Communication Systems With Array-Inherent Impairments

Hybrid massive MIMO structures with reduced hardware complexity and power consumption have been widely studied as a potential candidate for millimeter wave (mmWave) communications. Channel estimators that require knowledge of the array response, such as those using compressive sensing (CS) methods, may suffer from performance degradation when array-inherent impairments bring unknown phase errors and gain errors to the antenna elements. In this paper, we design matrix completion (MC)-based channel estimation schemes which are robust against the array-inherent impairments. We first design an open-loop training scheme that can sample entries from the effective channel matrix randomly and is compatible with the phase shifter-based hybrid system. Leveraging the low-rank property of the effective channel matrix, we then design a channel estimator based on the generalized conditional gradient (GCG) framework and the alternating minimization (AltMin) approach. The resulting estimator is immune to array-inherent impairments and can be implemented to systems with any array shapes for its independence of the array response. In addition, we extend our design to sample a transformed channel matrix following the concept of inductive matrix completion (IMC), which can be solved efficiently using our proposed estimator and achieve similar performance with a lower requirement of the dynamic range of the transmission power per antenna. Numerical results demonstrate the advantages of our proposed MC-based channel estimators in terms of estimation performance, computational complexity and robustness against array-inherent impairments over the orthogonal matching pursuit (OMP)-based CS channel estimator.

cs.IT↗

arXiv2018

Observation of Three-dimensional Photonic Dirac points and Spin-polarized Surface Arcs

Topological phases arise from the elegant mathematical structures imposed by the interplay between symmetry and topology1-5. From gapped topological insulators to gapless semimetals, topological materials in both quantum and classical systems, have grown rapidly in the last decade. Among them, three-dimensional Dirac semimetal lies at the topological phase transition point between various topological phases. It shares multiple exotic topological features with other topological materials, such as Fermi arcs and chiral anomaly with Weyl semimetals30, spin-dependent surface states with topological insulators29. In spite of the important role it plays in topological physics, no experimental observation of three-dimension Dirac points has been reported in classical systems so far. Here, we experimentally demonstrate three-dimension photonic Dirac points in an elaborately designed photonic metamaterial, in which two symmetrically placed Dirac points are stabilized by electromagnetic duality symmetry31. Spin-polarized surface arcs (counterparts of Fermi arcs in electronic systems) are demonstrated, which paves the way towards spin-multiplexed topological surface wave propagation. Closely linked to other exotic states through topological phase transitions, our system offers an effective medium platform for topological photonics.

physics.optics↗

arXiv2017

A Low Complexity OFDM Receiver with Combined GAMP and MF Message Passing

With a unified belief propagation (BP) and mean field (MF) framework, we propose an iterative message passing receiver, which performs joint channel state and noise precision (the reciprocal of noise variance) estimation and decoding for OFDM systems. The recently developed generalized approximate message passing (GAMP) is incorporated to the BP-MF framework, where MF is used to handle observation factor nodes with unknown noise precision and GAMP is used for channel estimation in the time-frequency domain. Compared to state-of-the-art algorithms in the literature, the proposed algorithm either delivers similar performance with much lower complexity, or delivers much better performance with similar complexity. In addition, the proposed algorithm exhibits fastest convergence.

cs.IT↗

arXiv2017

Iterative Receivers for Downlink MIMO-SCMA: Message Passing and Distributed Cooperative Detection

The rapid development of the mobile communications requires ever higher spectral efficiency. The non-orthogonal multiple access (NOMA) has emerged as a promising technology to further increase the access efficiency of wireless networks. Amongst several NOMA schemes, the sparse code multiple access (SCMA) has been shown to be able to achieve better performance. In this paper, we consider a downlink MIMO-SCMA system over frequency selective fading channels. For optimal detection, the complexity increases exponentially with the product of the number of users, the number of antennas and the channel length. To tackle this challenge, we propose near optimal low-complexity iterative receivers based on factor graph. By introducing auxiliary variables, a stretched factor graph is constructed and a hybrid belief propagation (BP) and expectation propagation (EP) receiver, named as `Stretch-BP-EP', is proposed. Considering the convergence problem of BP algorithm on loopy factor graph, we convexify the Bethe free energy and propose a convergence-guaranteed BP-EP receiver, named as `Conv-BP-EP'. We further consider cooperative network and propose two distributed cooperative detection schemes to exploit the diversity gain, namely, belief consensus-based algorithm and Bregman alternative direction method of multipliers (ADMM)-based method. Simulation results verify the superior performance of the proposed Conv-BP-EP receiver compared with other methods. The two proposed distributed cooperative detection schemes can improve the bit error rate performance by exploiting the diversity gain. Moreover, Bregman ADMM method outperforms the belief consensus-based algorithm in noisy inter-user links.

cs.IT↗

arXiv2017

Three dimensional photonic Dirac points in metamaterials

Topological semimetals, representing a new topological phase that lacks a full bandgap in bulk states and exhibiting nontrivial topological orders, recently have been extended to photonic systems, predominantly in photonic crystals and to a lesser extent, metamaterials. Photonic crystal realizations of Dirac degeneracies are protected by various space symmetries, where Bloch modes span the spin and orbital subspaces. Here, we theoretically show that Dirac points can also be realized in effective media through the intrinsic degrees of freedom in electromagnetism under electromagnetic duality. A pair of spin polarized Fermi arc like surface states is observed at the interface between air and the Dirac metamaterials. These surface states show linear k-space dispersion relation, resulting in nearly diffraction-less propagation. Furthermore, eigen reflection fields show the decomposition from a Dirac point to two Weyl points. We also find the topological correlation between a Dirac point and vortex/vector beams in classic photonics. The theoretical proposal of photonic Dirac point lays foundation for unveiling the connection between intrinsic physics and global topology in electromagnetism.

physics.optics↗

arXiv2017

Discovery of ideal Weyl points with helicoid surface states

Weyl points, serving as monopoles in the momentum space and laying the foundation of topological gapless phases, have recently been experimentally demonstrated in various physical systems. However, none of the observed Weyl degeneracies are ideal: they either offset in energy or coexist with trivial dispersions at other momenta. The lack of an ideal Weyl system sets a serious limit to the further development of Weyl physics and potential applications. Here, by constructing a photonic metamaterial, we experimentally observe an ideal Weyl system, whose nodal frequencies are pinned by symmetries to exactly the same value. Benefitting from the ideal Weyl nodes, we are able to map out the complete evolution of the helicoid surface states spinning around the projections of each Weyl nodes. Our discovery provides an ideal photonic platform for Weyl systems and novel topological devices.

cond-mat.mtrl-sci↗

arXiv2017

Observation of photonic Fermi arcs in topological metamaterials

The discovery of topological phases introduces new perspectives and platforms for various interesting physics originally investigated in quantum context and then, on an equal footing, in classic wave systems, such as photonics, acoustics and mechanics. As a characteristic feature, nontrivial Fermi arcs, connecting between topologically distinct Fermi surfaces, play vital roles in the clarification of Dirac and Weyl semimetals and have been observed in quantum materials very recently. However, in classical systems, no direct experimental observation of Fermi arcs in the momentum space has been reported so far. Here, using near-field scanning measurements, we show the observation of a photonic Fermi arcs connecting topologically distinct bulk states in chiral hyperbolic metamaterials. To verify the topological nature of this system, we further observe backscattering-immune propagation of nontrivial surface wave across a three-dimension physical step. Our results demonstrate metamaterial approach towards topological photonics and offer a deeper understanding of topological phases in three-dimension classical systems.

physics.optics↗

arXiv2017

Low-Complexity Message Passing Based Massive MIMO Channel Estimation by Exploiting Unknown Sparse Common Support with Dirichlet Process

This paper investigates the problem of estimating sparse channels in massive MIMO systems. Most wireless channels are sparse with large delay spread, while some channels can be observed having sparse common support (SCS) within a certain area of the antenna array, i.e., the antenna array can be grouped into several clusters according to the sparse supports of channels. The SCS property is attractive when it comes to the estimation of large number of channels in massive MIMO systems. Using the SCS of channels, one expects better performance, but the number of clusters and the elements for each cluster are always unknown in the receiver. In this paper, {the Dirichlet process} is exploited to model such sparse channels where those in each cluster have SCS. We proposed a low complexity message passing based sparse Bayesian learning to perform channel estimation in massive MIMO systems by using combined BP with MF on a factor graph. Simulation results demonstrate that the proposed massive MIMO sparse channel estimation outperforms the state-of-the-art algorithms. Especially, it even shows better performance than the variational Bayesian method applied for massive MIMO channel estimation.

cs.IT↗

arXiv2017

A New Combination of Message Passing Techniques for Receiver Design in MIMO-OFDM Systems

In this paper, we propose a new combined message passing algorithm which allows belief propagation (BP) and mean filed (MF) applied on a same factor node, so that MF can be applied to hard constraint factors. Based on the proposed message passing algorithm, a iterative receiver is designed for MIMO-OFDM systems. Both BP and MF are exploited to deal with the hard constraint factor nodes involving the multiplication of channel coefficients and data symbols to reduce the complexity of the only BP used. The numerical results show that the BER performance of the proposed low complexity receiver closely approach that of the state-of-the-art receiver, where only BP is used to handled the hard constraint factors, in the high SNRs.

cs.IT↗