arXiv subjects

Zhongpei Zhang

Publications and source records attributed to Zhongpei Zhang.

At least 37 records · Page 2Linked to original sources

arXiv2023

Mutual Information-Based Integrated Sensing and Communications: A WMMSE Framework

In this letter, a weighted minimum mean square error (WMMSE) empowered integrated sensing and communication (ISAC) system is investigated. One transmitting base station and one receiving wireless access point are considered to serve multiple users a sensing target. Based on the theory of mutual-information (MI), communication MI and sensing MI rate are utilized as the performance metrics under the presence of clutters. In particular, we propose an novel MI-based WMMSE-ISAC method by developing a unique transceiver design mechanism to maximize the weighted sensing and communication sum-rate of this system. Such a maximization process is achieved by utilizing the classical method -- WMMSE, aiming to better manage the effect of sensing clutters and the interference among users. Numerical results show the effectiveness of our proposed method, and the performance trade-off between sensing and communication is also validated.

eess.SP↗

arXiv2023

Variant Codes Based on A Special Polynomial Ring and Their Fast Computations

Binary array codes are widely used in storage systems to prevent data loss, such as the Redundant Array of Independent Disks~(RAID). Most designs for such codes, such as Blaum-Roth~(BR) codes and Independent-Parity~(IP) codes, are carried out on the polynomial ring F_2[x]/<\sum_{i=0}^{p-1}x^i >, where F_2 is a binary field, and p is a prime number. In this paper, we consider the polynomial ring F_2[x]/<\sum_{i=0}^{p-1}x^{i\tau}>, where p>1 is an odd number and \tau \geq 1 is any power of two, and explore variant codes from codes over this polynomial ring. Particularly, the variant codes are derived by mapping parity-check matrices over the polynomial ring to binary parity-check matrices. Specifically, we first propose two classes of variant codes, termed V-ETBR and V-ESIP codes. To make these variant codes binary maximum distance separable~(MDS) array codes that achieve optimal storage efficiency, this paper then derives the connections between them and their counterparts over polynomial rings. These connections are general, making it easy to construct variant MDS array codes from various forms of matrices over polynomial rings. Subsequently, some instances are explicitly constructed based on Cauchy and Vandermonde matrices. In the proposed constructions, both V-ETBR and V-ESIP MDS array codes can have any number of parity columns and have the total number of data columns of exponential order with respect to $p$. In terms of computation, two fast syndrome computations are proposed for the Vandermonde-based V-ETBR and V-ESIP MDS array codes, both meeting the lowest known asymptotic complexity among MDS codes. Due to the fact that all variant codes are constructed from parity-check matrices over simple binary fields instead of polynomial rings, they are attractive in practice.

cs.IT↗

arXiv2023

Enhancing Near-Field Sensing and Communications with Sparse Arrays: Potentials, Challenges, and Emerging Trends

As a promising technique, extremely large-scale (XL)-arrays offer potential solutions for overcoming the severe path loss in millimeter-wave (mmWave) and TeraHertz (THz) channels, crucial for enabling 6G. Nevertheless, XL-arrays introduce deviations in electromagnetic propagation compared to traditional arrays, fundamentally challenging the assumption with the planar-wave model. Instead, it ushers in the spherical-wave (SW) model to accurately represent the near-field propagation characteristics, significantly increasing signal processing complexity. Fortunately, the SW model shows remarkable benefits on sensing and communications (S\&C), e.g., improving communication multiplexing capability, spatial resolution, and degrees of freedom. In this context, this article first overviews hardware/algorithm challenges, fundamental potentials, promising applications of near-field S\&C enabled by XL-arrays. To overcome the limitations of existing XL-arrays with dense uniform array layouts and improve S\&C applications, we introduce sparse arrays (SAs). Exploring their potential, we propose XL-SAs for mmWave/THz systems using multi-subarray designs. Finally, several applications, challenges and resarch directions are identified.

eess.SP↗

arXiv2023

Hybrid NOMA assisted Integrated Sensing and Communication via RIS

This paper investigates the optimization of reconfigurable intelligent surface (RIS) in an integrated sensing and communication (ISAC) system. \red{To meet the demand of growing number of devices, power domain non-orthogonal multiple access (NOMA) is considered. However, traditional NOMA with a large number of devices is challenging due to large decoding delay and propagation error introduced by successive interference cancellation (SIC). Thus, OMA is integrated into NOMA to support more devices}. We formulate a max-min problem to optimize the sensing beampattern \red{with constraints on communication rate}, through joint power allocation, active beamforming and RIS phase shift design. To solve the non-convex problem with a non-smooth objective function, we propose a low complexity alternating optimization (AO) algorithm, where a closed form expression for the intra-cluster power allocation (intra-CPA) is derived, and penalty and successive convex approximation (SCA) methods are used to optimize the beamforming and phase shift design. Simulation results show the effectiveness of the proposed algorithm in terms of improving minimum beampattern gain (MBPG) compared with other baselines. Furthermore, the trade-off between sensing and communication is analyzed and demonstrated in the simulation results.

eess.SP↗

arXiv2023

Performance Bounds for Near-Field Localization with Widely-Spaced Multi-Subarray mmWave/THz MIMO

This paper investigates the potential of near-field localization using widely-spaced multi-subarrays (WSMSs) and analyzing the corresponding angle and range Cram\'er-Rao bounds (CRBs). By employing the Riemann sum, closed-form CRB expressions are derived for the spherical wavefront-based WSMS (SW-WSMS). We find that the CRBs can be characterized by the angular span formed by the line connecting the array's two ends to the target, and the different WSMSs with same angular spans but different number of subarrays have identical normalized CRBs. We provide a theoretical proof that, in certain scenarios, the CRB of WSMSs is smaller than that of uniform arrays. We further yield the closed-form CRBs for the hybrid spherical and planar wavefront-based WSMS (HSPW-WSMS), and its components can be seen as decompositions of the parameters from the CRBs for the SW-WSMS. Simulations are conducted to validate the accuracy of the derived closed-form CRBs and provide further insights into various system characteristics. Basically, this paper underscores the high resolution of utilizing WSMS for localization, reinforces the validity of adopting the HSPW assumption, and, considering its applications in communications, indicates a promising outlook for integrated sensing and communications based on HSPW-WSMSs.

eess.SP↗

arXiv2023

Near-Field Channel Estimation for Extremely Large-Scale Reconfigurable Intelligent Surface (XL-RIS)-Aided Wideband mmWave Systems

Near-field communications present new opportunities over near-field channels, however, the spherical wavefront propagation makes near-field signal processing challenging. In this context, this paper proposes efficient near-field channel estimation methods for wideband MIMO mmWave systems with the aid of extremely large-scale reconfigurable intelligent surfaces (XL-RIS). For the wideband signals reflected by the analog RIS, we characterize their near-field beam squint effect in both angle and distance domains. Based on the mathematical analysis of the near-field beam patterns over all frequencies, a wideband spherical-domain dictionary is constructed by minimizing the coherence of two arbitrary beams. In light of this, we formulate a two-dimensional compressive sensing problem to recover the channel parameter based on the spherical-domain sparsity of mmWave channels. To this end, we present a correlation coefficient-based atom matching method within our proposed multi-frequency parallelizable subspace recovery framework for efficient solutions. Additionally, we propose a two-dimensional oracle estimator as a benchmark and derive its lower bound across all subcarriers. Our findings emphasize the significance of system hyperparameters and the sensing matrix of each subcarrier in determining the accuracy of the estimation. Finally, numerical results show that our proposed method achieves considerable performance compared with the lower bound and has a time complexity linear to the number of RIS elements.

cs.IT↗

arXiv2023

Reconfigurable Intelligent Surface-Aided Full-Duplex mmWave MIMO: Channel Estimation, Passive and Hybrid Beamforming

Millimeter wave (mmWave) full-duplex (FD) is a promising technique for improving capacity by maximizing the utilization of both time and the rich mmWave frequency resources. Still, it has restrictions due to FD self-interference (SI) and mmWave's limited coverage. Therefore, this study dives into FD mmWave MIMO with the assistance of reconfigurable intelligent surfaces (RIS) for capacity improvement. First, we demonstrate the angular-domain reciprocity of FD antenna arrays under the far-field planar wavefront assumption. Accordingly, a strategy for joint downlink-uplink (DL-UL) channel estimation is presented. For estimating the SI channel, the direct channel, and the cascaded channel, the Khatri-Rao product-based compressive sensing (KR-CS), distributed CS (D-CS), and two-stage multiple measurement vector-based D-CS (M-D-CS) frameworks are proposed, respectively. Additionally, we propose a passive beamforming optimization solution based on the angular-domain cascaded channel. With hybrid beamforming architectures, a novel hybrid weighted minimum mean squared error method for SI cancellation (H-WMMSE-SIC) is proposed. Simulations have revealed that joint DL-UL processing significantly improves estimation performance in comparison to separate DL/UL channel estimation. Particularly, when the interference-to-noise ratio is less than 35 dB, our proposed H-WMMSE-SIC offers spectral efficiency performance comparable to fully-digital WMMSE-SIC. Finally, the computational complexity is analyzed for our proposed methods.

cs.IT↗

arXiv2022

Active 3D Double-RIS-Aided Multi-User Communications: Two-Timescale-Based Separate Channel Estimation via Bayesian Learning

Double-reconfigurable intelligent surface (RIS) is a promising technique, achieving a substantial gain improvement compared to single-RIS techniques. However, in double-RIS-aided systems, accurate channel estimation is more challenging than in single-RIS-aided systems. This work solves the problem of double-RIS-based channel estimation based on active RIS architectures with only one radio frequency (RF) chain. Since the slow time-varying channels, i.e., the BS-RIS 1, BS-RIS 2, and RIS 1-RIS 2 channels, can be obtained with active RIS architectures, a novel multi-user two-timescale channel estimation protocol is proposed to minimize the pilot overhead. First, we propose an uplink training scheme for slow time-varying channel estimation, which can effectively address the double-reflection channel estimation problem. With channels' sparisty, a low-complexity Singular Value Decomposition Multiple Measurement Vector-Based Compressive Sensing (SVD-MMV-CS) framework with the line-of-sight (LoS)-aided off-grid MMV expectation maximization-based generalized approximate message passing (M-EM-GAMP) algorithm is proposed for channel parameter recovery. For fast time-varying channel estimation, based on the estimated large-timescale channels, a measurements-augmentation-estimate (MAE) framework is developed to decrease the pilot overhead.Additionally, a comprehensive analysis of pilot overhead and computing complexity is conducted. Finally, the simulation results demonstrate the effectiveness of our proposed multi-user two-timescale estimation strategy and the low-complexity Bayesian CS framework.

cs.IT↗

arXiv2022

Energy-Efficient Cell-Free Network Assisted by Hybrid RISs

In this letter, we investigate a cell-free network aided by hybrid reconfigurable intelligent surfaces (RISs), which consists of a mixture of passive and active elements that are capable of amplifying and reflecting the incident signal. To maximize the energy efficiency (EE) of the system, we formulate a joint transmit beamforming and RIS coefficients optimization problem. To deal with the fractional objective function, Dinkelbach transform, Lagrangian dual reformulation, and quadratic transform are utilized, with a block coordinate descent (BCD) based algorithm proposed to decouple the variables. In addition, successive convex approximation (SCA) method is applied to iteratively to tackle the non-convexity of the sub-problems. Simulation results illustrate the effectiveness and convergence of the proposed algorithm through analyzing the EE and sum rate performance with varying parameter settings. The proposed hybrid RISs schemes can achieve 92% of the sum rate but 188% of EE of active RISs schemes. As compared with passive RISs, 11% gain in sum rate can be achieved with comparable EE.

eess.SP↗

arXiv2022

Fast Compressive Channel Estimation for MmWave MIMO Hybrid Beamforming Systems

Given the high degree of computational complexity of the channel estimation technique based on the conventional one-dimensional (1-D) compressive sensing (CS) framework employed in the hybrid beamforming architecture, this study proposes two low-complexity channel estimation strategies. One is two-stage CS, which exploits row-group sparsity to estimate angle-of-arrival (AoA) first and uses the conventional 1-D CS method to obtain angle-of-departure (AoD). The other is two-dimensional (2-D) CS, which utilizes a 2-D dictionary to reconstruct the 2-D sparse signal. To conduct a meaningful comparison of the three CS frameworks, i.e., 1-D, two-stage and 2-D CS, the orthogonal match pursuit (OMP) algorithm is employed as the basic algorithm and is expanded to two variants for the proposed frameworks. Analysis and simulations demonstrate that when the 1-D CS method is compared, two-stage CS has somewhat lower performance but significantly lower computational complexity, while 2-D CS is not only the same as 1-D CS in terms of performance but also slightly lower in computational complexity than two-stage CS.

eess.SP↗

arXiv2022

Bayesian Optimization-Based Beam Alignment for MmWave MIMO Communication Systems

Due to the very narrow beam used in millimeter wave communication (mmWave), beam alignment (BA) is a critical issue. In this work, we investigate the issue of mmWave BA and present a novel beam alignment scheme on the basis of a machine learning strategy, Bayesian optimization (BO). In this context, we consider the beam alignment issue to be a black box function and then use BO to find the possible optimal beam pair. During the BA procedure, this strategy exploits information from the measured beam pairs to predict the best beam pair. In addition, we suggest a novel BO algorithm based on the gradient boosting regression tree model. The simulation results demonstrate the spectral efficiency performance of our proposed schemes for BA using three different surrogate models. They also demonstrate that the proposed schemes can achieve spectral efficiency with a small overhead when compared to the orthogonal match pursuit (OMP) algorithm and the Thompson sampling-based multi-armed bandit (TS-MAB) method.

eess.SP↗

arXiv2022

Channel Estimation for Reconfigurable Intelligent Surface-Assisted Cell-Free Communications

Recent research has focused on reconfigurable intelligent surface (RIS)-assisted cell-free systems with the goal of enhancing coverage and lowering the cost of cell-free networks. However, current research makes the assumption that the perfect channel state information is known. Channel acquisition is, certainly, a difficulty in this case. This work is aimed at investigating RIS-assisted cell-free channel estimation. Toward this end, two unique characteristics are pointed out: 1) For all users, a common channel exists between the base station (BS) and the RIS; and 2) For all BSs, a common channel exists between the RIS and the user. Based on these two characteristics, cascaded and two-timescale channel estimation concerns are studied. Subsequently, two solutions for tackling with the two issues are presented respectively: a three-dimensional multiple measurement vector (3D-MMV)-based compressive sensing technique and a multi-BS cooperative pilot-reduced methodology. Finally, simulations illustrate the effectiveness of the schemes we have presented.

eess.SP↗

arXiv2022

Low-complexity Sparse Array Synthesis Based on Off-grid Compressive Sensing

A novel sparse array synthesis method for non-uniform planar arrays is proposed, which belongs to compressive sensing (CS)-based systhesis. Particularly, we propose an off-grid refinement technique to simultaneously optimize the antenna element positions and excitations with a low complexity, in response to the antenna position optimization problem that is difficult for standard CS. More importantly, we take into account the minimum inter-element spacing constraint for ensuring the physically realizable solution. Specifically, the off-grid Orthogonal Match Pursuit (OMP) algorithm is first proposed with low complexity and then off-grid Look Ahead Orthogonal Match Pursuit (LAOMP) is designed with better synthesis performance but higher complexity. In addition, simulation results have shown the proposed schemes have more advantages in computational complexity and synthesis performances compared with the related method.

eess.SP↗

arXiv2022

Age Minimization in Outdoor and Indoor Communications with Relay-aided Dual RIS

In this paper, we investigate an outdoor and indoor wireless communication network with the assistance of a novel relay-aided double-sided reconfigurable intelligent surface (RIS). A scheduling problem is considered at the outdoor access point (AP) to minimize the sum of age of information (AoI). To serve the indoor users and further enhance the wireless link quality, a novel double-sided RIS with relay is utilized. Since the formulated problem is non-convex with highly-coupled variables, a successive convex approximation (SCA) based alternating optimization (AO) algorithm is proposed to solve it in an iterative manner. Finally, simulation results show the effectiveness and significant performance improvement in terms of AoI of the proposed algorithm compared with other benchmarks.

eess.SP↗

arXiv2021

An Off-grid Compressive Sensing Strategy for the Subarray Synthesis of Non-uniform Linear Arrays

With the increasing popularity of large-scale antenna arrays, the subarraying technology becomes more attractive. In this paper, we propose two effective subarraying methods right after formulating the subarray synthesis as a compressive sensing (CS) problem: i) Orthogonal matching pursuit based subarray synthesis (OMP-SS), a common CS approach which can be used for the subarray synthesis to attain the subarray information (the subarray number, the number of elements per subarray and corresponding excitation coeffcients) and ii) Off-grid orthogonal matching pursuit based subarray synthesis (OGOMP-SS), an advanced approach for optimizing antenna elements positions and the subarray information mentioned above simultaneously. In addition, two user-defined modes are designed for different application scenarios, wherein, mode-1 is to optimize the pattern synthesis performance for the given the number of subarrays, and mode-2 is to obtain the minimum number of subarrays for the cases when the pattern synthsis accuracy is satisfied. Finally, our simulation results reveal that it is of paramount significance to optimize antenna elements positions for the subarray synthesis performance on the one hand and demonstrate the excellent performances of proposed schemes in comparison with other competitive state-of-the-art subarray synthesis methods on the other hand.

eess.SP↗

arXiv2021

Efficient Multi-Beam Training For Terahertz Wireless communications

Although Terahertz communication systems can provide high data rates, it needs high directional beamforming at transmitters and receivers to achieve such rates over a long distance. Therefore, an efficient beam training method is vital to accelerate the link establishment. In this study, we propose a low-complexity beam training scheme of terahertz communication system which uses a low-cost small-scale hybrid architecture to assist a large-scale array for data transmission. The proposed scheme includes two key stages: (1) coarse AoAs/AoDs estimation for beam subset optimization in auxiliary array stage, and (2) accurate AoAs/AoDs estimation by exploiting channel sparsity in data transmission array stage. The analysis shows that the complexity of the scheme is linear with the number of main paths, and thus greatly reduces the complexity of beam training. Simulation results have verified the better performance in spectral efficiency of the proposed scheme than that of the related work.

cs.IT↗

arXiv2021

Optimizing the Age of Information in RIS-aided SWIPT Networks

In this letter, a reconfigurable intelligent surface (RIS)-assisted simultaneous wireless information and power transfer (SWIPT) network is investigated. To quantify the freshness of the data packets at the information receiver, the age of information (AoI) is considered. To minimize the sum AoI of the information users while ensuring that the power transferred to energy harvesting users is greater than the demanded value, we formulate a scheduling scheme, and a joint transmit beamforming and phase shift optimization at the base station (BS) and RIS, respectively. The alternating optimization (AO) algorithm is proposed to handle the coupling between active beamforming and passive RIS phase shifts, and the successive convex approximation (SCA) algorithm is utilized to tackle the non-convexity of the formulated problems. The improvement in terms of AoI provided by the proposed algorithm and the trade-off between the age of information and energy harvesting is quantified by the numerical simulation results.

eess.SP↗

arXiv2021

Spectral and Energy Efficiency of Multicell Massive MIMO With Variable-Resolution ADCs Over Correlated Rayleigh Fading Channels

This paper analyzes the performance of multicell massive multiple-input and multiple-output (MIMO) systems with variable-resolution analog-to-digital converters (ADCs). In such an architecture, each ADC uses arbitrary quantization resolution to save power and hardware cost. Along this direction, we first introduce a quantization-aware channel estimator based on additive quantization noise model (AQNM) and linear minimum mean-squared error (LMMSE) estimate theory. Afterwards, by leveraging on the estimated channel state information (CSI), we derive the asymptotic expressions of achievable uplink spectral efficiency (SE) over spatially correlated Rayleigh fading channels for maximal ratio combining (MRC), quantization-aware multicell minimum mean-squared error (QA-M-MMSE) combining, and quantization-aware single-cell MMSE (QA-S-MMSE) combining, respectively. During the derivations, we consider the effect of quantization errors and resort to random matrix theory to achieve the asymptotic results. Finally, simulation results demonstrate that our theoretical analyses are correct and that the proposed quantization-aware estimator and combiners are more beneficial than the quantization-unaware counterparts. Besides, based on a generic power consumption model, it is shown that low-resolution ADCs can obtain the best tradeoff between SE and energy efficiency (EE) under multicell scenarios.

cs.IT↗