Source author record

Xiang-Gen Xia

Xiang-Gen Xia appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

44works
16topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

44 published item(s)

preprint2026arXiv

Statistical Channel Fingerprint Construction for Massive MIMO: A Unified Tensor Learning Framework

Channel fingerprint (CF) is considered a key enabler for facilitating the acquisition of channel state information (CSI) in massive multiple-input multiple-output (MIMO) communication systems. In this work, we investigate a novel type of CF that stores statistical CSI (sCSI) at each potential location, referred to as statistical CF (sCF). Specifically, we reveal the relationship between sCSI, namely the channel spatial covariance matrix (CSCM), and the channel power angular spectrum (CPAS). Building on this foundation, we construct a unified tensor representation of the sCF and further reduce its dimension by exploiting the eigenvalue decomposition of the CSCM and its correlation with the PAS. Considering the practical constraints imposed by measurement cost, privacy, and security, we focus on three representative scenarios and uniformly formulate them as tensor restoration tasks. To this end, we propose a unified tensor-based learning architecture, termed LPWTNet. The architecture incorporates a closed-form Laplacian pyramid (LP) decomposition and reconstruction framework that replaces the traditional encoder-decoder structure, enabling efficient inference while capturing multi-scale frequency subband characteristics of the sCF. Additionally, a shared mask learning strategy is introduced to adaptively refine high-frequency sCF components through level-wise adjustments. To achieve a larger receptive field without over-parameterization, we further propose a small-kernel convolution mechanism based on the wavelet transform (WT), which decouples convolution across different frequency components of the sCF and enhances feature extraction efficiency. Extensive experiments show that the proposed approach delivers competitive reconstruction accuracy and computational efficiency across various sCF construction scenarios when compared with state-of-the-art baselines.

preprint2025arXiv

Beam Structured Turbo Receiver for HF Skywave Massive MIMO

In this paper, we investigate receiver design for high frequency (HF) skywave massive multiple-input multiple-output (MIMO) communications. We first establish a modified beam based channel model (BBCM) by performing uniform sampling for directional cosine with deterministic sampling interval, where the beam matrix is constructed using a phase-shifted discrete Fourier transform (DFT) matrix. Based on the modified BBCM, we propose a beam structured turbo receiver (BSTR) involving low-dimensional beam domain signal detection for grouped user terminals (UTs), which is proved to be asymptotically optimal in terms of minimizing mean-squared error (MSE). Moreover, we extend it to windowed BSTR by introducing a windowing approach for interference suppression and complexity reduction, and propose a well-designed energy-focusing window. We also present an efficient implementation of the windowed BSTR by exploiting the structure properties of the beam matrix and the beam domain channel sparsity. Simulation results validate the superior performance of the proposed receivers but with remarkably low complexity.

preprint2025arXiv

Channel Fingerprint Construction for Massive MIMO: A Deep Conditional Generative Approach

Accurate channel state information (CSI) acquisition for massive multiple-input multiple-output (MIMO) systems is essential for future mobile communication networks. Channel fingerprint (CF), also referred to as channel knowledge map, is a key enabler for intelligent environment-aware communication and can facilitate CSI acquisition. However, due to the cost limitations of practical sensing nodes and test vehicles, the resulting CF is typically coarse-grained, making it insufficient for wireless transceiver design. In this work, we introduce the concept of CF twins and design a conditional generative diffusion model (CGDM) with strong implicit prior learning capabilities as the computational core of the CF twin to establish the connection between coarse- and fine-grained CFs. Specifically, we employ a variational inference technique to derive the evidence lower bound (ELBO) for the log-marginal distribution of the observed fine-grained CF conditioned on the coarse-grained CF, enabling the CGDM to learn the complicated distribution of the target data. During the denoising neural network optimization, the coarse-grained CF is introduced as side information to accurately guide the conditioned generation of the CGDM. To make the proposed CGDM lightweight, we further leverage the additivity of network layers and introduce a one-shot pruning approach along with a multi-objective knowledge distillation technique. Experimental results show that the proposed approach exhibits significant improvement in reconstruction performance compared to the baselines. Additionally, zero-shot testing on reconstruction tasks with different magnification factors further demonstrates the scalability and generalization ability of the proposed approach.

preprint2024arXiv

Signal Detection for Ultra-Massive MIMO: An Information Geometry Approach

In this paper, we propose an information geometry approach (IGA) for signal detection (SD) in ultra-massive multiple-input multiple-output (MIMO) systems. We formulate the signal detection as obtaining the marginals of the a posteriori probability distribution of the transmitted symbol vector. Then, a maximization of the a posteriori marginals (MPM) for signal detection can be performed. With the information geometry theory, we calculate the approximations of the a posteriori marginals. It is formulated as an iterative m-projection process between submanifolds with different constraints. We then apply the central-limit-theorem (CLT) to simplify the calculation of the m-projection since the direct calculation of the m-projection is of exponential-complexity. With the CLT, we obtain an approximate solution of the m-projection, which is asymptotically accurate. Simulation results demonstrate that the proposed IGA-SD emerges as a promising and efficient method to implement the signal detector in ultra-massive MIMO systems.

preprint2023arXiv

Excess Distortion Exponent Analysis for Semantic-Aware MIMO Communication Systems

In this paper, the analysis of excess distortion exponent for joint source-channel coding (JSCC) in semantic-aware communication systems is presented. By introducing an unobservable semantic source, we extend the classical results by Csiszar to semantic-aware communication systems. Both upper and lower bounds of the exponent for the discrete memoryless source-channel pair are established. Moreover, an extended achievable bound of the excess distortion exponent for MIMO systems is derived. Further analysis explores how the block fading and numbers of antennas influence the exponent of semanticaware MIMO systems. Our results offer some theoretical bounds of error decay performance and can be used to guide future semantic communications with joint source-channel coding scheme.

preprint2022arXiv

A General Gaussian Heatmap Label Assignment for Arbitrary-Oriented Object Detection

Recently, many arbitrary-oriented object detection (AOOD) methods have been proposed and attracted widespread attention in many fields. However, most of them are based on anchor-boxes or standard Gaussian heatmaps. Such label assignment strategy may not only fail to reflect the shape and direction characteristics of arbitrary-oriented objects, but also have high parameter-tuning efforts. In this paper, a novel AOOD method called General Gaussian Heatmap Label Assignment (GGHL) is proposed. Specifically, an anchor-free object-adaptation label assignment (OLA) strategy is presented to define the positive candidates based on two-dimensional (2-D) oriented Gaussian heatmaps, which reflect the shape and direction features of arbitrary-oriented objects. Based on OLA, an oriented-bounding-box (OBB) representation component (ORC) is developed to indicate OBBs and adjust the Gaussian center prior weights to fit the characteristics of different objects adaptively through neural network learning. Moreover, a joint-optimization loss (JOL) with area normalization and dynamic confidence weighting is designed to refine the misalign optimal results of different subtasks. Extensive experiments on public datasets demonstrate that the proposed GGHL improves the AOOD performance with low parameter-tuning and time costs. Furthermore, it is generally applicable to most AOOD methods to improve their performance including lightweight models on embedded platforms.

preprint2022arXiv

A three-dimensional dual-domain deep network for high-pitch and sparse helical CT reconstruction

In this paper, we propose a new GPU implementation of the Katsevich algorithm for helical CT reconstruction. Our implementation divides the sinograms and reconstructs the CT images pitch by pitch. By utilizing the periodic properties of the parameters of the Katsevich algorithm, our method only needs to calculate these parameters once for all the pitches and so has lower GPU-memory burdens and is very suitable for deep learning. By embedding our implementation into the network, we propose an end-to-end deep network for the high pitch helical CT reconstruction with sparse detectors. Since our network utilizes the features extracted from both sinograms and CT images, it can simultaneously reduce the streak artifacts caused by the sparsity of sinograms and preserve fine details in the CT images. Experiments show that our network outperforms the related methods both in subjective and objective evaluations.

preprint2022arXiv

Joint 3-D Positioning and Power Allocation for UAV Relay Aided by Geographic Information

In this paper, we study to employ geographic information to address the blockage problem of air-to-ground links between UAV and terrestrial nodes. In particular, a UAV relay is deployed to establish communication links from a ground base station to multiple ground users. To improve communication capacity, we first model the blockage effect caused by buildings according to the three-dimensional (3-D) geographic information. Then, an optimization problem is formulated to maximize the minimum capacity among users by jointly optimizing the 3-D position and power allocation of the UAV relay, under the constraints of link capacity, maximum transmit power, and blockage. To solve this complex non-convex problem, a two-loop optimization framework is developed based on Lagrangian relaxation. The outer-loop aims to obtain proper Lagrangian multipliers to ensure the solution of the Lagrangian problem converge to the tightest upper bound on the original problem. The inner-loop solves the Lagrangian problem by applying the block coordinate descent (BCD) and successive convex approximation (SCA) techniques, where UAV 3-D positioning and power allocation are alternately optimized in each iteration. Simulation results confirm that the proposed solution significantly outperforms two benchmark schemes and achieves a performance close to the upper bound on the UAV relay system.

preprint2022arXiv

Terahertz-Band Near-Space Communications: From a Physical-Layer Perspective

Facilitated by rapid technological development of the near-space platform stations (NSPS), near-space communication (NS-COM) is envisioned to play a pivotal role in the space-air-ground integrated network for sixth-generation (6G) communications and beyond. In NS-COM, ultra-broadband wireless connectivity between NSPSs and various airborne/spaceborne platforms is required for a plethora of bandwidth-consuming applications, such as NSPS-based Ad hoc networking, in-flight Internet and relaying technology. However, such requirement seems to contradict with the scarcity of spectrum resources at conventional microwave frequencies, which motivates the exploitation of terahertz (THz) band ranging from 0.1 to 10 THz. Due to huge available bandwidth, the THz signals are capable of supporting ultra-high-rate data transmission for NS-COM over 100 Gb/s, which are naturally suitable for the near-space environment with marginal path loss. To this end, this article provides an extensive investigation on the THz-band NS-COM (THz-NS-COM) from a physical-layer perspective. Firstly, we summarize the potential applications of THz communications in the near-space environment, where the corresponding technical barriers are analyzed. Then the channel characteristics of THz-NS-COM and the corresponding modeling strategies are discussed, respectively. Afterwards, three essential research directions are investigated to surpass the technical barriers of THz-NS-COM, i.e., robust beamforming for ultra-massive antenna array, signal processing algorithms against hybrid distortions, and integrated sensing and communications. Several open problems are also provided to unleash the full potential of THz-NS-COM.

preprint2021arXiv

A New Weighting Scheme for Fan-beam and Circle Cone-beam CT Reconstructions

In this paper, we first present an arc based algorithm for fan-beam computed tomography (CT) reconstruction via applying Katsevich's helical CT formula to 2D fan-beam CT reconstruction. Then, we propose a new weighting function to deal with the redundant projection data. By extending the weighted arc based fan-beam algorithm to circle cone-beam geometry, we also obtain a new FDK-similar algorithm for circle cone-beam CT reconstruction. Experiments show that our methods can obtain higher PSNR and SSIM compared to the Parker-weighted conventional fan-beam algorithm and the FDK algorithm for super-short-scan trajectories.

preprint2020arXiv

A deep network for sinogram and CT image reconstruction

A CT image can be well reconstructed when the sampling rate of the sinogram satisfies the Nyquist criteria and the sampled signal is noise-free. However, in practice, the sinogram is usually contaminated by noise, which degrades the quality of a reconstructed CT image. In this paper, we design a deep network for sinogram and CT image reconstruction. The network consists of two cascaded blocks that are linked by a filter backprojection (FBP) layer, where the former block is responsible for denoising and completing the sinograms while the latter is used to removing the noise and artifacts of the CT images. Experimental results show that the reconstructed CT images by our methods have the highest PSNR and SSIM in average compared to state of the art methods.

preprint2020arXiv

A model-guided deep network for limited-angle computed tomography

In this paper, we first propose a variational model for the limited-angle computed tomography (CT) image reconstruction and then convert the model into an end-to-end deep network.We use the penalty method to solve the model and divide it into three iterative subproblems, where the first subproblem completes the sinograms by utilizing the prior information of sinograms in the frequency domain and the second refines the CT images by using the prior information of CT images in the spatial domain, and the last merges the outputs of the first two subproblems. In each iteration, we use the convolutional neural networks (CNNs) to approxiamte the solutions of the first two subproblems and, thus, obtain an end-to-end deep network for the limited-angle CT image reconstruction. Our network tackles both the sinograms and the CT images, and can simultaneously suppress the artifacts caused by the incomplete data and recover fine structural information in the CT images. Experimental results show that our method outperforms the existing algorithms for the limited-angle CT image reconstruction.

preprint2020arXiv

Massive MIMO Transmission for LEO Satellite Communications

Low earth orbit (LEO) satellite communications are expected to be incorporated in future wireless networks, in particular 5G and beyond networks, to provide global wireless access with enhanced data rates. Massive MIMO techniques, though widely used in terrestrial communication systems, have not been applied to LEO satellite communication systems. In this paper, we propose a massive MIMO transmission scheme with full frequency reuse (FFR) for LEO satellite communication systems and exploit statistical channel state information (sCSI) to address the difficulty of obtaining instantaneous CSI (iCSI) at the transmitter. We first establish the massive MIMO channel model for LEO satellite communications and simplify the transmission designs via performing Doppler and delay compensations at user terminals (UTs). Then, we develop the low-complexity sCSI based downlink (DL) precoder and uplink (UL) receiver in closed-form, aiming to maximize the average signal-to-leakage-plus-noise ratio (ASLNR) and the average signal-to-interference-plus-noise ratio (ASINR), respectively. It is shown that the DL ASLNRs and UL ASINRs of all UTs reach their upper bounds under some channel condition. Motivated by this, we propose a space angle based user grouping (SAUG) algorithm to schedule the served UTs into different groups, where each group of UTs use the same time and frequency resource. The proposed algorithm is asymptotically optimal in the sense that the lower and upper bounds of the achievable rate coincide when the number of satellite antennas or UT groups is sufficiently large. Numerical results demonstrate that the proposed massive MIMO transmission scheme with FFR significantly enhances the data rate of LEO satellite communication systems. Notably, the proposed sCSI based precoder and receiver achieve the similar performance with the iCSI based ones that are often infeasible in practice.

preprint2020arXiv

Millimeter-Wave Full-Duplex UAV Relay: Joint Positioning, Beamforming, and Power Control

In this paper, a full-duplex unmanned aerial vehicle (FD-UAV) relay is employed to increase the communication capacity of millimeter-wave (mmWave) networks. Large antenna arrays are equipped at the source node (SN), destination node (DN), and FD-UAV relay to overcome the high path loss of mmWave channels and to help mitigate the self-interference at the FD-UAV relay. Specifically, we formulate a problem for maximization of the achievable rate from the SN to the DN, where the UAV position, analog beamforming, and power control are jointly optimized. Since the problem is highly non-convex and involves high-dimensional, highly coupled variable vectors, we first obtain the conditional optimal position of the FD-UAV relay for maximization of an approximate upper bound on the achievable rate in closed form, under the assumption of a line-of-sight (LoS) environment and ideal beamforming. Then, the UAV is deployed to the position which is closest to the conditional optimal position and yields LoS paths for both air-to-ground links. Subsequently, we propose an alternating interference suppression (AIS) algorithm for the joint design of the beamforming vectors and the power control variables. In each iteration, the beamforming vectors are optimized for maximization of the beamforming gains of the target signals and the successive reduction of the interference, where the optimal power control variables are obtained in closed form. Our simulation results confirm the superiority of the proposed positioning, beamforming, and power control method compared to three benchmark schemes. Furthermore, our results show that the proposed solution closely approaches a performance upper bound for mmWave FD-UAV systems.

preprint2020arXiv

On BT-limited Signals

In this paper, we introduce and characterize a subspace of bandlimited signals. The subspace consists of all $Ω$ bandlimited signals such that the non-zero parts of their Fourier transforms are pieces of some $T$ bandlimited signals. The signals in the subspace are called BT-limited signals and the subspace is named as BT-limited signal space. For BT-limited signals, a signal extrapolation with an analytic error estimate exists outside the interval [-T, T] of given signal values with errors. Some new properties about and applying BT-limited signals are also presented.

preprint2020arXiv

Self-Interference Channel Characterization in Underwater Acoustic In-Band Full-Duplex Communications Using OFDM

Due to the limited available bandwidth and dynamic channel, data rates are extremely limited in underwater acoustic (UWA) communications. Addressing this concern, in-band fullduplex (IBFD) has the potential to double the efficiency in a given bandwidth. In an IBFD scheme, transmission and reception are performed simultaneously in the same frequency band. However, in UWA-IBFD, because of reflections from the surface and bottom and the inhomogeneity of the water, a significant part of the transmitted signal returns back to the IBFD receiver. This signal contaminates the desired signal from the remote end and is known as the self-interference (SI). With an estimate of the self-interference channel impulse response (SCIR), a receiver can estimate and eliminate the SI. A better understanding of the statistical characteristics of the SCIR is necessary for an accurate SI cancellation. In this article, we use an orthogonal frequency division multiplexing (OFDM) signal to characterize the SCIR in a lake water experiment. To verify the results, SCIR estimation is performed using estimators in both the frequency and time domains. We show that, in our experiment, regardless of the depth of the hydrophone, the direct path of SCIR is strong, stable and easily tracked; however, the reflection paths are weaker and rapidly time-varying making SI cancellation challenging. Among the reflections, the first bounce from the water surface is the prevalent path with a short coherence time around 70 ms.

preprint2016arXiv

Artificial-Noise-Aided Physical Layer Phase Challenge-Response Authentication for Practical OFDM Transmission

Recently, we have developed a PHYsical layer Phase Challenge-Response Authentication Scheme (PHY-PCRAS) for independent multicarrier transmission. In this paper, we make a further step by proposing a novel artificial-noise-aided PHY-PCRAS (ANA-PHY-PCRAS) for practical orthogonal frequency division multiplexing (OFDM) transmission, where the Tikhonov-distributed artificial noise is introduced to interfere with the phase-modulated key for resisting potential key-recovery attacks whenever a static channel between two legitimate users is unfortunately encountered. Then, we address various practical issues for ANA-PHY-PCRAS with OFDM transmission, including correlation among subchannels, imperfect carrier and timing recoveries. Among them, we show that the effect of sampling offset is very significant and a search procedure in the frequency domain should be incorporated for verification. With practical OFDM transmission, the number of uncorrelated subchannels is often not sufficient. Hence, we employ a time-separated approach for allocating enough subchannels and a modified ANA-PHY-PCRAS is proposed to alleviate the discontinuity of channel phase at far-separated time slots. Finally, the key equivocation is derived for the worst case scenario. We conclude that the enhanced security of ANA-PHY-PCRAS comes from the uncertainty of both the wireless channel and introduced artificial noise, compared to the traditional challenge-response authentication scheme implemented at the upper layer.

preprint2016arXiv

Codebook Design for Millimeter-Wave Channel Estimation with Hybrid Precoding Structure

In this paper, we study hierarchical codebook design for channel estimation in millimeter-wave (mmWave) communications with a hybrid precoding structure. Due to the limited saturation power of mmWave power amplifier (PA), we take the per-antenna power constraint (PAPC) into consideration. We first propose a metric, i.e., generalized detection probability (GDP), to evaluate the quality of \emph{an arbitrary codeword}. This metric not only enables an optimization approach for mmWave codebook design, but also can be used to compare the performance of two different codewords/codebooks. To the best of our knowledge, GDP is the first metric particularly for mmWave codebook design for channel estimation. We then propose an approach to design a hierarchical codebook exploiting BeaM Widening with Multi-RF-chain Sub-array technique (BMW-MS). To obtain crucial parameters of BMW-MS, we provide two solutions, namely a low-complexity search (LCS) solution to optimize the GDP metric and a closed-form (CF) solution to pursue a flat beam pattern. Performance comparisons show that BMW-MS/LCS and BMW-MS/CF achieve very close performances, and they outperform the existing alternatives under the PAPC.

preprint2016arXiv

Enabling UAV Cellular with Millimeter-Wave Communication: Potentials and Approaches

To support high data rate urgent or ad hoc communications, we consider mmWave UAV cellular networks and the associated challenges and solutions. To enable fast beamforming training and tracking, we first investigate a hierarchical structure of beamforming codebooks and design of hierarchical codebooks with different beam widths via the sub-array techniques. We next examine the Doppler effect as a result of UAV movement and find that the Doppler effect may not be catastrophic when high gain directional transmission is used. We further explore the use of millimeter wave spatial division multiple access and demonstrate its clear advantage in improving the cellular network capacity. We also explore different ways of dealing with signal blockage and point out that possible adaptive UAV cruising algorithms would be necessary to counteract signal blockage. Finally, we identify a close relationship between UAV positioning and directional millimeter wave user discovery, where update of the former may directly impact the latter and vice versa.

preprint2016arXiv

Hierarchical Codebook Design for Beamforming Training in Millimeter-Wave Communication

In millimeter-wave communication, large antenna arrays are required to achieve high power gain by steering towards each other with narrow beams, which poses the problem to efficiently search the best beam direction in the angle domain at both Tx and Rx sides. As the exhaustive search is time consuming, hierarchical search has been widely accepted to reduce the complexity, and its performance is highly dependent on the codebook design. In this paper, we propose two basic criteria for the hierarchical codebook design, and devise an efficient hierarchical codebook by jointly exploiting sub-array and deactivation (turning-off) antenna processing techniques, where closed-form expressions are provided to generate the codebook. Performance evaluations are conducted under different system and channel models. Results show superiority of the proposed codebook over the existing alternatives.

preprint2016arXiv

Low Complexity Hybrid Precoding and Channel Estimation Based on Hierarchical Multi-Beam Search for Millimeter-Wave MIMO Systems

In millimeter-wave (mmWave) MIMO systems, while a hybrid digital/analog precoding structure offers the potential to increase the achievable rate, it also faces the challenge of the need of a low-complexity design. In specific, the hybrid precoding may require matrix operations with a scale of antenna size, which is generally large in mmWave communication. Moreover, the channel estimation is also rather time consuming due to the large number of antennas at both Tx/Rx sides. In this paper, a low-complexity hybrid precoding and channel estimation approach is proposed. In the channel estimation phase, a hierarchical multi-beam search scheme is proposed to fast acquire $N_{\rm{S}}$ (the number of streams) multipath components (MPCs)/clusters with the highest powers. In the hybrid precoding phase, the analog and digital precodings are decoupled. The analog precoding is designed to steer along the $N_{\rm{S}}$ acquired MPCs/clusters at both Tx/Rx sides, shaping an equivalent $N_{\rm{S}}\times N_{\rm{S}}$ baseband channel, while the digital precoding performs operations in the baseband with the reduced-scale channel. Performance evaluations show that, compared with a state-of-the-art scheme, while achieving a close or even better performance when the number of radio-frequency (RF) chains or streams is small, both the computational complexity of the hybrid precoding and the time complexity of the channel estimation are greatly reduced.

preprint2016arXiv

Omnidirectional Space-Time Block Coding for Common Information Broadcasting in Massive MIMO Systems

In this paper, we design space-time block codes (STBCs) to broadcast the common information omnidirectionally in a massive MIMO downlink. To reduce the burden of the downlink channel estimation and achieve partial spatial diversity from base station (BS) transmit antennas, we propose channel-independently precoded low-dimensional STBC. The precoding matrix and the signal constellation in the low-dimensional STBC are jointly designed to guarantee omnidirectional coverage at any instant time and sufficiently utilize the power amplifier capacities of BS transmit antennas, and at the same time, achieve the full diversity of the low-dimensional STBC. Under this framework, several designs are presented. To provide transmit diversity order of two, a precoded Alamouti code is proposed, which has a fast symbol-wise maximum-likelihood (ML) decoding. To provide transmit diversity order of four, three types of STBCs are proposed, being referred to as precoded orthogonal STBC (OSTBC), precoded quasi-orthogonal STBC (QOSTBC), and precoded coordinate interleaved orthogonal design (CIOD), respectively. The last two codes have the same complexity for pair-wise ML decoding, while precoded QOSTBC has a higher coding gain when the bit rate is lower than or equal to 4 bps/Hz, and precoded CIOD has a higher coding gain when the bit rate is higher than 4 bps/Hz. Precoded OSTBC has a higher decoding complexity and a lower coding gain than the other two codes, since in the precoded OSTBC the information symbols need to be jointly designed and decoded. Moreover, a precoded no-zero-entry Toeplitz code and a precoded no-zero-entry overlapped Alamouti code are also proposed. These two codes can achieve a higher diversity order with linear receivers.

preprint2015arXiv

A Coherent Integration Method Based on Radon Non-uniform FRFT for Random Pulse Repetition Interval (RPRI) Radar

To solve the range cell migration (RCM) and spectrum spread during the integration time induced by the motion of a target, this paper proposes a new coherent integration method based on Radon non-uniform FRFT (NUFRFT) for random pulse repetition interval (RPRI) radar. In this method, RCM is eliminated via searching in the motion parameters space and the spectrum spread is resolved by using NUFRFT. Comparisons with other popular methods, moving target detection (MTD), Radon-Fourier transform (RFT), and Radon-Fractional Fourier Transform (RFRFT) are performed. The simulation results demonstrate that the proposed method can detect the moving target even in low SNR scenario and is superior to the other two methods.

preprint2015arXiv

A Robust Generalized Chinese Remainder Theorem for Two Integers

A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A robust CRT has also been proposed lately for robustly reconstruct a single integer from its erroneous remainders. In this paper, we consider the reconstruction problem of two integers from their residue sets, where the remainders are not only out of order but also may have errors. We prove that two integers can be robustly reconstructed if their remainder errors are less than $M/8$, where $M$ is the greatest common divisor (gcd) of all the moduli. We also propose an efficient reconstruction algorithm. Finally, we present some simulations to verify the efficiency of the proposed algorithm. The study is motivated and has applications in the determination of multiple frequencies from multiple undersampled waveforms.

preprint2015arXiv

Artificial-Noise-Aided Message Authentication Codes with Information-Theoretic Security

In the past, two main approaches for the purpose of authentication, including information-theoretic authentication codes and complexity-theoretic message authentication codes (MACs), were almost independently developed. In this paper, we propose a new cryptographic primitive, namely, artificial-noise-aided MACs (ANA-MACs), which can be considered as both computationally secure and information-theoretically secure. For ANA-MACs, we introduce artificial noise to interfere with the complexity-theoretic MACs and quantization is further employed to facilitate packet-based transmission. With a channel coding formulation of key recovery in the MACs, the generation of standard authentication tags can be seen as an encoding process for the ensemble of codes, where the shared key between Alice and Bob is considered as the input and the message is used to specify a code from the ensemble of codes. Then, we show that the introduction of artificial noise in ANA-MACs can be well employed to resist the key recovery attack even if the opponent has an unlimited computing power. Finally, a pragmatic approach for the analysis of ANA-MACs is provided, and we show how to balance the three performance metrics, including the completeness error, the false acceptance probability, and the conditional equivocation about the key. The analysis can be well applied to a class of ANA-MACs, where MACs with Rijndael cipher are employed.

preprint2015arXiv

Iterative Eigenvalue Decomposition and Multipath-Grouping Tx/Rx Joint Beamforming for Millimeter-Wave Communication

We investigate Tx/Rx joint beamforming in millimeter-wave communications (MMWC). As the multipath components (MPCs) have different steering angles and independent fadings, beamforming aims at achieving array gain as well as diversity gain in this scenario. A sub-optimal beamforming scheme is proposed to find the antenna weight vectors (AWVs) at Tx/Rx via iterative eigenvalue decomposition (EVD), provided that full channel state information (CSI) is available at both the transmitter and receiver. To make this scheme practically feasible in MMWC, a corresponding training approach is suggested to avoid the channel estimation and iterative EVD computation. As in fast fading scenario the training approach may be time-consuming due to frequent training, another beamforming scheme, which exploits the quasi-static steering angles in MMWC, is proposed to reduce the overhead and increase the system reliability by multipath grouping (MPG). The scheme first groups the MPCs and then concurrently beamforms towards multiple steering angles of the grouped MPCs, so that both array gain and diversity gain are achieved. Performance comparisons show that, compared with the corresponding state-of-the-art schemes, the iterative EVD scheme with the training approach achieves the same performance with a reduced overhead and complexity, while the MPG scheme achieves better performance with an approximately equivalent complexity.

preprint2015arXiv

Pilot Reuse for Massive MIMO Transmission over Spatially Correlated Rayleigh Fading Channels

We propose pilot reuse (PR) in single cell for massive multiuser multiple-input multiple-output (MIMO) transmission to reduce the pilot overhead. For spatially correlated Rayleigh fading channels, we establish a relationship between channel spatial correlations and channel power angle spectrum when the base station antenna number tends to infinity. With this channel model, we show that sum mean square error (MSE) of channel estimation can be minimized provided that channel angle of arrival intervals of the user terminals reusing the pilots are non-overlapping, which shows feasibility of PR over spatially correlated massive MIMO channels with constrained channel angular spreads. Regarding that channel estimation performance might degrade due to PR, we also develop the closed-form robust multiuser uplink receiver and downlink precoder that minimize sum MSE of signal detection, and reveal a duality between them. Subsequently, we investigate pilot scheduling, which determines the PR pattern, under two minimum MSE related criteria, and propose a low complexity pilot scheduling algorithm which relies on the channel statistics only. Simulation results show that the proposed PR scheme provides significant performance gains over the conventional orthogonal training scheme in terms of net spectral efficiency.

preprint2015arXiv

Sparse Multipath Channel Estimation and Decoding for Broadband Vector OFDM Systems

Vector orthogonal frequency division multiplexing (V-OFDM) is a general system that builds a bridge between OFDM and single-carrier frequency domain equalization in terms of intersymbol interference and receiver complexity. In this paper, we investigate the sparse multipath channel estimation and decoding for broadband V-OFDM systems. Unlike the non-sparse channel estimation, sparse channel estimation only needs to recover the nonzero taps with reduced complexity. Consider the pilot signals are transmitted through a sparse channel that has only a few nonzero taps with and without additive white Gaussian noise, respectively. The exactly and approximately sparse inverse fast Fourier transform (SIFFT) can be employed for these two cases. The SIFFT-based algorithm recovers the nonzero channel coefficients and their corresponding coordinates directly, which is significant to the proposed partial intersection sphere (PIS) decoding approach. Unlike the maximum likelihood (ML) decoding that enumerates symbol constellation and estimates the transmitted symbols with the minimum distance, the PIS decoding first generates the set of possible transmitted symbols and then chooses the transmitted symbols only from this set with the minimum distance. The diversity order of the PIS decoding is determined by not only the number of nonzero taps, but also the coordinates of nonzero taps, and the bit error rate (BER) is also influenced by vector block size to some extent but roughly independent of the maximum time delay. Simulation results indicate that by choosing appropriate sphere radius, the BER performance of the PIS decoding outperforms the conventional zero-forcing decoding and minimum mean square error decoding, and approximates to the ML decoding with the increase of signal-to-noise ratio, but reduces the computational complexity significantly.

preprint2014arXiv

Cyclic Delay Transmission for Vector OFDM Systems

Single antenna vector OFDM (V-OFDM) system has been proposed and investigated in the past. It contains the conventional OFDM and the single carrier frequency domain equalizer (SC-FDE) as two special cases and is flexible to choose any number of symbols in intersymbol interference (ISI) by choosing a proper vector size. In this paper, we develop cyclic delay diversity (CDD) transmission for V-OFDM when there are multiple transmit antennas (CDD-V-OFDM). Similar to CDD-OFDM systems, CDD-V-OFDM can also collect both spatial and multipath diversities. Since V-OFDM first converts a single input single output (SISO) ISI channel to a multi-input and multi-output (MIMO) ISI channel of order/length $K$ times less, where $K$ is the vector size, for a given bandwidth, the CDD-V-OFDM can accommodate $K$ times more transmit antennas than the CDD-OFDM does to collect all the spatial and multipath diversities. This property will specially benefit a massive MIMO system. We show that with the linear MMSE equalizer at each subcarrier, the CDD-V-OFDM achieves diversity order $d_{\text{CDD-V-OFDM}}^{\text{MMSE}} = \min \{ \lfloor 2^{-R}K \rfloor, N_t L \} +1$, where $R$ is the transmission rate, $N_t$ is the number of transmit antennas, and $L$ is the ISI channel length between each transmit and receive antenna pair. Simulations are presented to illustrate our theory.

preprint2014arXiv

Error Correction in Polynomial Remainder Codes with Non-Pairwise Coprime Moduli and Robust Chinese Remainder Theorem for Polynomials

This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction problem for polynomials from erroneous residues when the degrees of all residue errors are assumed small, namely robust Chinese Remainder Theorem (CRT) for polynomials. It basically says that a polynomial can be reconstructed from erroneous residues such that the degree of the reconstruction error is upper bounded by $τ$ whenever the degrees of all residue errors are upper bounded by $τ$, where a sufficient condition for $τ$ and a reconstruction algorithm are obtained. By releasing the constraint that all residue errors have small degrees, another robust reconstruction is then presented when there are multiple unrestricted errors and an arbitrary number of errors with small degrees in the residues. By making full use of redundancy in moduli, we obtain a stronger residue error correction capability in the sense that apart from the number of errors that can be corrected in the previous existing result, some errors with small degrees can be also corrected in the residues. With this newly obtained result, improvements in uncorrected error probability and burst error correction capability in a data transmission are illustrated.

preprint2014arXiv

IRCI Free Colocated MIMO Radar Based on Sufficient Cyclic Prefix OFDM Waveforms

In this paper, we propose a cyclic prefix (CP) based MIMO-OFDM range reconstruction method and its corresponding MIMO-OFDM waveform design for co-located MIMO radar systems. Our proposed MIMO-OFDM waveform design achieves the maximum signal-to-noise ratio (SNR) gain after the range reconstruction and its peak-to-average power ratio (PAPR) in the discrete time domain is also optimal, i.e., 0dB, when Zadoff-Chu sequences are used in the discrete frequency domain as the weighting coefficients for the subcarriers. We also investigate the performance when there are transmit and receive digital beamforming (DBF) pointing errors. It is shown that our proposed CP based MIMO-OFDM range reconstruction is inter-range-cell interference (IRCI) free no matter whether there are transmit and receive DBF pointing errors or not. Simulation results are presented to verify the theory and compare it with the conventional OFDM and LFM co-located MIMO radars.

preprint2014arXiv

IRCI Free MIMO OFDM SAR Using Circularly Shifted Zadoff-Chu Sequences

Cyclic prefix (CP) based MIMO-OFDM radar has been recently proposed for distributed transmit antennas, where there is no inter-range-cell interference (IRCI). It can collect full spatial diversity and each transmitter transmits signals with the same frequency band, i.e., the range resolution is not reduced. However, it needs to transmit multiple OFDM pulses consecutively to obtain range profiles for a single swath, which may be too long in time for a reasonable swath width. In this letter, we propose a CP based MIMO-OFDM synthetic aperture radar (SAR) system, where each transmitter transmits only a single OFDM pulse to obtain range profiles for a swath and has the same frequency band, thus the range resolution is not reduced. It is IRCI free and can collect the full spatial diversity if the transmit antennas are distributed. Our main idea is to use circularly shifted Zadoff-Chu sequences as the weighting coefficients in the OFDM pulses for different transmit antennas and apply spatial filters with multiple receive antennas to divide the whole swath into multiple subswaths, and then each subswath is reconstructed/imaged using our proposed IRCI free range reconstruction method.

preprint2014arXiv

MIMO OFDM Radar IRCI Free Range Reconstruction with Sufficient Cyclic Prefix

In this paper, we propose MIMO OFDM radar with sufficient cyclic prefix (CP), where all OFDM pulses transmitted from different transmitters share the same frequency band and are orthogonal to each other for every subcarrier in the discrete frequency domain. The orthogonality is not affected by time delays from transmitters. Thus, our proposed MIMO OFDM radar has the same range resolution as single transmitter radar and achieves full spatial diversity. Orthogonal designs are used to achieve this orthogonality across the transmitters, with which it is only needed to design OFDM pulses for the first transmitter. We also propose a joint pulse compression and pulse coherent integration for range reconstruction. In order to achieve the optimal SNR for the range reconstruction, we apply the paraunitary filterbank theory to design the OFDM pulses. We then propose a modified iterative clipping and filtering (MICF) algorithm for the designs of OFDM pulses jointly, when other important factors, such as peak-to-average power ratio (PAPR) in time domain, are also considered. With our proposed MIMO OFDM radar, there is no interference for the range reconstruction not only across the transmitters but also across the range cells in a swath called inter-range-cell interference (IRCI) free that is similar to our previously proposed CP based OFDM radar for single transmitter. Simulations are presented to illustrate our proposed theory and show that the CP based MIMO OFDM radar outperforms the existing frequency-band shared MIMO radar with polyphase codes and also frequency division MIMO radar.

preprint2014arXiv

OFDM Synthetic Aperture Radar Imaging with Sufficient Cyclic Prefix

The existing linear frequency modulated (LFM) (or step frequency) and random noise synthetic aperture radar (SAR) systems may correspond to the frequency hopping (FH) and direct sequence (DS) spread spectrum systems in the past second and third generation wireless communications. Similar to the current and future wireless communications generations, in this paper, we propose OFDM SAR imaging, where a sufficient cyclic prefix (CP) is added to each OFDM pulse. The sufficient CP insertion converts an inter-symbol interference (ISI) channel from multipaths into multiple ISI-free subchannels as the key in a wireless communications system, and analogously, it provides an inter-range-cell interference (IRCI) free (high range resolution) SAR image in a SAR system. The sufficient CP insertion along with our newly proposed SAR imaging algorithm particularly for the OFDM signals also differentiates this paper from all the existing studies in the literature on OFDM radar signal processing. Simulation results are presented to illustrate the high range resolution performance of our proposed CP based OFDM SAR imaging algorithm.

preprint2013arXiv

Distributed Linear Convolutional Space-Time Coding for Two-Relay Full-Duplex Asynchronous Cooperative Networks

In this paper, a two-relay full-duplex asynchronous cooperative network with the amplify-and-forward (AF) protocol is considered. We propose two distributed space-time coding schemes for the cases with and without cross-talks, respectively. In the first case, each relay can receive the signal sent by the other through the cross-talk link. We first study the feasibility of cross-talk cancellation in this network and show that the cross-talk interference cannot be removed well. For this reason, we design space-time codes by utilizing the cross-talk signals instead of removing them. In the other case, the self-coding is realized individually through the loop channel at each relay node and the signals from the two relay nodes form a space-time code. The achievable cooperative diversity of both cases is investigated and the conditions to achieve full cooperative diversity are presented. Simulation results verify the theoretical analysis.

preprint2013arXiv

Distributed Space-Time Coding for Full-Duplex Asynchronous Cooperative Communications

In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel cancellation and amplifying, where some loop signals are used as the self-coding instead of treated as interference to be directly cancelled. We show this scheme can achieve full asynchronous cooperative diversity. We then evaluate the performance of the two schemes when loop channel information is not accurate and present an amplifying factor control method for the DLC-STC Scheme 2 to improve its performance with inaccurate loop channel information. Simulation results show that the DLC-STC Scheme 1 outperforms the DLC-STC Scheme 2 and the delay diversity scheme if perfect or high quality loop channel information is available at the relay, while the DLC-STC Scheme 2 achieves better performance if the loop channel information is imperfect.

preprint2013arXiv

IRCI Free Range Reconstruction for SAR Imaging with Arbitrary Length OFDM Pulse

Our previously proposed OFDM with sufficient cyclic prefix (CP) synthetic aperture radar (SAR) imaging algorithm is inter-range-cell interference (IRCI) free and achieves ideally zero range sidelobes for range reconstruction. In this OFDM SAR imaging algorithm, the minimum required CP length is almost equal to the number of range cells in a swath, while the number of subcarriers of an OFDM signal needs to be more than the CP length. This makes the length of a transmitted OFDM sequence at least almost twice of the number of range cells in a swath and for a wide swath imaging, the transmitted OFDM pulse length becomes long, which may cause problems in some radar applications. In this paper, we propose a CP based OFDM SAR imaging with arbitrary pulse length, which has IRCI free range reconstruction and its pulse length is independent of a swath width. We then present a novel design method for our proposed arbitrary length OFDM pulses. Simulation results are presented to illustrate the performances of the OFDM pulse design and the arbitrary pulse length CP based OFDM SAR imaging.

preprint2013arXiv

Multi-Stage Robust Chinese Remainder Theorem

It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large error in the reconstruction solution. A robust CRT was recently proposed for a special case when the greatest common divisor (gcd) of all the moduli is more than 1 and the remaining integers factorized by the gcd of all the moduli are co-prime. In this special case, a closed-form reconstruction from erroneous remainders was proposed and a necessary and sufficient condition on the remainder errors was obtained. It basically says that the reconstruction error is upper bounded by the remainder error level $τ$ if $τ$ is smaller than a quarter of the gcd of all the moduli. In this paper, we consider the robust reconstruction problem for a general set of moduli. We first present a necessary and sufficient condition for the remainder errors for a robust reconstruction from erroneous remainders with a general set of muduli and also a corresponding robust reconstruction method. This can be thought of as a single stage robust CRT. We then propose a two-stage robust CRT by grouping the moduli into several groups as follows. First, the single stage robust CRT is applied to each group. Then, with these robust reconstructions from all the groups, the single stage robust CRT is applied again across the groups. This is then easily generalized to multi-stage robust CRT. Interestingly, with this two-stage robust CRT, the robust reconstruction holds even when the remainder error level $τ$ is above the quarter of the gcd of all the moduli. In this paper, we also propose an algorithm on how to group a set of moduli for a better reconstruction robustness of the two-stage robust CRT in some special cases.

preprint2012arXiv

ISAR Image Formation Using Sequential Minimization of L0 and L2 Norms

A sparsity-driven algorithm of inverse synthetic aperture radar (ISAR) imaging is proposed. Based on the parametric sparse representation of the received ISAR signal, the problem of ISAR image formation is converted into the joint estimation of the target rotation rate and the sparse power distribution in the spatial domain. This goal is achieved by sequential minimization of L0 and L2 norms, which ensure the sparsest ISAR image and the minimum recovery error, respectively.

preprint2012arXiv

On Designs of Full Diversity Space-Time Block Codes for Two-User MIMO Interference Channels

In this paper, a design criterion for space-time block codes (STBC) is proposed for two-user MIMO interference channels when a group zero-forcing (ZF) algorithm is applied at each receiver to eliminate the inter-user interference. Based on the design criterion, a design of STBC for two-user interference channels is proposed that can achieve full diversity for each user with the group ZF receiver. The code rate approaches one when the time delay in the encoding (or code block size) gets large. Performance results demonstrate that the full diversity can be guaranteed by our proposed STBC with the group ZF receiver.

preprint2011arXiv

Performance Analysis of the Matrix Pair Beamformer with Matrix Mismatch

Matrix pair beamformer (MPB) is a blind beamformer. It exploits the temporal structure of the signal of interest (SOI) and applies generalized eigen-decomposition to a covariance matrix pair. Unlike other blind algorithms, it only uses the second order statistics. A key assumption in the previous work is that the two matrices have the same interference statistics. However, this assumption may be invalid in the presence of multipath propagations or certain "smart" jammers, and we call it as matrix mismatch. This paper analyzes the performance of MPB with matrix mismatch. First, we propose a general framework that covers the existing schemes. Then, we derive its normalized output SINR. It reveals that the matrix mismatch leads to a threshold effect caused by "steering vector competition". Second, using matrix perturbation theory, we find that, if there are generalized eigenvalues that are infinite, the threshold will increase unboundedly with the interference power. This is highly probable when there are multiple periodical interferers. Finally, we present simulation results to verify our analysis.

preprint2010arXiv

Full Diversity Space-Time Block Codes with Low-Complexity Partial Interference Cancellation Group Decoding

Partial interference cancellation (PIC) group decoding proposed by Guo and Xia is an attractive low-complexity alternative to the optimal processing for multiple-input multiple-output (MIMO) wireless communications. It can well deal with the tradeoff among rate, diversity and complexity of space-time block codes (STBC). In this paper, a systematic design of full-diversity STBC with low-complexity PIC group decoding is proposed. The proposed code design is featured as a group-orthogonal STBC by replacing every element of an Alamouti code matrix with an elementary matrix composed of multiple diagonal layers of coded symbols. With the PIC group decoding and a particular grouping scheme, the proposed STBC can achieve full diversity, a rate of $(2M)/(M+2)$ and a low-complexity decoding for $M$ transmit antennas. Simulation results show that the proposed codes can achieve the full diversity with PIC group decoding while requiring half decoding complexity of the existing codes.

preprint2010arXiv

High-Rate and Full-Diversity Space-Time Block Codes with Low Complexity Partial Interference Cancellation Group Decoding

In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be applied to any number of transmit antennas and admit a low decoding complexity while achieving full diversity. For M transmit antennas, in each codeword real and imaginary parts of PM complex information symbols are parsed into P diagonal layers and then encoded, respectively. With PIC group decoding, it is shown that the decoding complexity can be reduced to a joint decoding of M/2 real symbols. In particular, for 4 transmit antennas, the code has real symbol pairwise (i.e., single complex symbol) decoding that achieves full diversity and the code rate is 4/3. Simulation results demonstrate that the full diversity is offered by the newly proposed STBC with the PIC group decoding.

preprint2010arXiv

Two Designs of Space-Time Block Codes Achieving Full Diversity with Partial Interference Cancellation Group Decoding

A partial interference cancellation (PIC) group decoding based space-time block code (STBC) design criterion was recently proposed by Guo and Xia, where the decoding complexity and the code rate trade-off is dealt when the full diversity is achieved. In this paper, two designs of STBC are proposed for any number of transmit antennas that can obtain full diversity when a PIC group decoding (with a particular grouping scheme) is applied at receiver. With the PIC group decoding and an appropriate grouping scheme for the decoding, the proposed STBC are shown to obtain the same diversity gain as the ML decoding, but have a low decoding complexity. The first proposed STBC is designed with multiple diagonal layers and it can obtain the full diversity for two-layer design with the PIC group decoding and the rate is up to 2 symbols per channel use. But with PIC-SIC group decoding, the first proposed STBC can obtain full diversity for any number of layers and the rate can be full. The second proposed STBC can obtain full diversity and a rate up to 9/4 with the PIC group decoding. Some code design examples are given and simulation results show that the newly proposed STBC can well address the rate-performance-complexity tradeoff of the MIMO systems.