arXiv subjects

Jinhong Yuan

Publications and source records attributed to Jinhong Yuan.

At least 109 records · Page 6Linked to original sources

arXiv2021

Deep Residual Learning for Channel Estimation in Intelligent Reflecting Surface-Assisted Multi-User Communications

Channel estimation is one of the main tasks in realizing practical intelligent reflecting surface-assisted multi-user communication (IRS-MC) systems. However, different from traditional communication systems, an IRS-MC system generally involves a cascaded channel with a sophisticated statistical distribution. In this case, the optimal minimum mean square error (MMSE) estimator requires the calculation of a multidimensional integration which is intractable to be implemented in practice. To further improve the channel estimation performance, in this paper, we model the channel estimation as a denoising problem and adopt a deep residual learning (DReL) approach to implicitly learn the residual noise for recovering the channel coefficients from the noisy pilot-based observations. To this end, we first develop a versatile DReL-based channel estimation framework where a deep residual network (DRN)-based MMSE estimator is derived in terms of Bayesian philosophy. As a realization of the developed DReL framework, a convolutional neural network (CNN)-based DRN (CDRN) is then proposed for channel estimation in IRS-MC systems, in which a CNN denoising block equipped with an element-wise subtraction structure is specifically designed to exploit both the spatial features of the noisy channel matrices and the additive nature of the noise simultaneously. In particular, an explicit expression of the proposed CDRN is derived and analyzed in terms of Bayesian estimation to characterize its properties theoretically. Finally, simulation results demonstrate that the performance of the proposed method approaches that of the optimal MMSE estimator requiring the availability of the prior probability density function of channel.

eess.SP↗

arXiv2021

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

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

cs.IT↗

arXiv2021

Joint Inter-path and Intra-path Multiplexing for Terahertz Widely-spaced Multi-subarray Hybrid Beamforming Systems

Terahertz (THz) communications with multi-GHz bandwidth are envisioned as a key technology for 6G systems. Ultra-massive (UM) MIMO with hybrid beamforming architectures are widely investigated to provide a high array gain to overcome the huge propagation loss. However, most of the existing hybrid beamforming architectures can only utilize the multiplexing offered by the multipath components, i.e., inter-path multiplexing, which is very limited due to the spatially sparse THz channel. In this paper, a widely-spaced multi-subarray (WSMS) hybrid beamforming architecture is proposed, which improves the multiplexing gain by exploiting a new type of intra-path multiplexing provided by the spherical-wave propagation among k widely-spaced subarrays, in addition to the inter-path multiplexing. The resulting multiplexing gain of WSMS architecture is k times of the existing architectures. To harness WSMS hybrid beamforming, a novel design problem is formulated by optimizing the number of subarrays, subarray spacing, and hybrid beamforming matrices to maximize the spectral efficiency, which is decomposed into two subproblems. An optimal closed-form solution is derived for the first hybrid beamforming subproblem, while a dominant-line-of-sight-relaxation algorithm is proposed for the second array configuration subproblem. Extensive simulation results demonstrate that the WSMS architecture and proposed algorithms substantially enhance the spectral efficiency and energy efficiency.

cs.IT↗

arXiv2021

Wireless Covert Communications Aided by Distributed Cooperative Jamming over Slow Fading Channels

In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication from being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.

cs.IT↗

arXiv2021

Integrated Sensing and Communication-assisted Orthogonal Time Frequency Space Transmission for Vehicular Networks

Orthogonal time frequency space (OTFS) modulation is a promising candidate for supporting reliable information transmission in high-mobility vehicular networks. In this paper, we consider the employment of the integrated (radar) sensing and communication (ISAC) technique for assisting OTFS transmission in both uplink and downlink vehicular communication systems. Benefiting from the OTFS-ISAC signals, the roadside unit (RSU) is capable of simultaneously transmitting downlink information to the vehicles and estimating the sensing parameters of vehicles, e.g., locations and speeds, based on the reflected echoes. Then, relying on the estimated kinematic parameters of vehicles, the RSU can construct the topology of the vehicular network that enables the prediction of the vehicle states in the following time instant. Consequently, the RSU can effectively formulate the transmit downlink beamformers according to the predicted parameters to counteract the channel adversity such that the vehicles can directly detect the information without the need of performing channel estimation. As for the uplink transmission, the RSU can infer the delays and Dopplers associated with different channel paths based on the aforementioned dynamic topology of the vehicular network. Thus, inserting guard space as in conventional methods are not needed for uplink channel estimation which removes the required training overhead. Finally, an efficient uplink detector is proposed by taking into account the channel estimation uncertainty. Through numerical simulations, we demonstrate the benefits of the proposed ISAC-assisted OTFS transmission scheme.

eess.SP↗

arXiv2021

Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition

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

cs.IT↗

arXiv2021

Deep Learning-Empowered Predictive Beamforming for IRS-Assisted Multi-User Communications

The realization of practical intelligent reflecting surface (IRS)-assisted multi-user communication (IRS-MUC) systems critically depends on the proper beamforming design exploiting accurate channel state information (CSI). However, channel estimation (CE) in IRS-MUC systems requires a significantly large training overhead due to the numerous reflection elements involved in IRS. In this paper, we adopt a deep learning approach to implicitly learn the historical channel features and directly predict the IRS phase shifts for the next time slot to maximize the average achievable sum-rate of an IRS-MUC system taking into account the user mobility. By doing this, only a low-dimension multiple-input single-output (MISO) CE is needed for transmit beamforming design, thus significantly reducing the CE overhead. To this end, a location-aware convolutional long short-term memory network (LA-CLNet) is first developed to facilitate predictive beamforming at IRS, where the convolutional and recurrent units are jointly adopted to exploit both the spatial and temporal features of channels simultaneously. Given the predictive IRS phase shift beamforming, an instantaneous CSI (ICSI)-aware fully-connected neural network (IA-FNN) is then proposed to optimize the transmit beamforming matrix at the access point. Simulation results demonstrate that the sum-rate performance achieved by the proposed method approaches that of the genie-aided scheme with the full perfect ICSI.

cs.IT↗

arXiv2021

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

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

cs.IT↗

arXiv2021

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

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

cs.IT↗

arXiv2021

Iterative Detection for Orthogonal Time Frequency Space Modulation with Unitary Approximate Message Passing

The orthogonal-time-frequency-space (OTFS) modulation has emerged as a promising modulation scheme for high mobility wireless communications. To harvest the time and frequency diversity promised by OTFS, some promising detectors, especially message passing based ones, have been developed by taking advantage of the sparsity of the channel in the delay-Doppler domain. However, when the number of channel paths is relatively large or fractional Doppler {shifts have} to be considered, the complexity of existing detectors is a concern, and the message passing based detectors may suffer from performance loss due to the short loops involved in message passing. In this work, we investigate the design of OTFS detectors based on the approximate message passing (AMP). In particular, {leveraging the unitary AMP (UAMP), we design new detectors that enjoy} the structure of the channel matrix and allow efficient implementation. In addition, the estimation of noise variance is incorporated into the UAMP-based detectors. Thanks to the robustness of UAMP relative to AMP, the UAMP-based detectors deliver superior performance, and outperform state-of-the-art detectors significantly. We also investigate iterative joint detection and decoding in a coded OTFS system, where the OTFS detectors are integrated into a powerful turbo receiver, leading to considerable performance gains.

cs.IT↗

arXiv2021

Orthogonal Time-Frequency Space Modulation: A Promising Next-Generation Waveform

The sixth-generation (6G) wireless networks are envisioned to provide a global coverage for the intelligent digital society of the near future, ranging from traditional terrestrial to non-terrestrial networks, where reliable communications in high-mobility scenarios at high carrier frequencies would play a vital role. In such scenarios, the conventional orthogonal frequency division multiplexing (OFDM) modulation, that has been widely used in both the fourth-generation (4G) and the emerging fifth-generation (5G) cellular systems as well as in WiFi networks, is vulnerable to severe Doppler spread. In this context, this article aims to introduce a recently proposed two-dimensional modulation scheme referred to as orthogonal time-frequency space (OTFS) modulation, which conveniently accommodates the channel dynamics via modulating information in the delay-Doppler domain. This article provides an easy-reading overview of OTFS, highlighting its underlying motivation and specific features. The critical challenges of OTFS and our preliminary results are presented. We also discuss a range of promising research opportunities and potential applications of OTFS in 6G wireless networks.

cs.IT↗

arXiv2021

Performance Analysis and Window Design for Channel Estimation of OTFS Modulation

In this paper, we investigate the impacts of transmitter and receiver windows on orthogonal time-frequency space (OTFS) modulation and propose a window design to improve the OTFS channel estimation performance. Assuming ideal pulse shaping filters at the transceiver, we first identify the role of window in effective channel and the reduced channel sparsity with conventional rectangular window. Then, we characterize the impacts of windowing on the effective channel estimation performance for OTFS modulation. Based on the revealed insights, we propose to apply a Dolph-Chebyshev (DC) window at either the transmitter or the receiver to effectively enhance the sparsity of the effective channel. As such, the channel spread due to the fractional Doppler is significantly reduced, which leads to a lower error floor in channel estimation compared with that of the rectangular window. Simulation results verify the accuracy of the obtained analytical results and confirm the superiority of the proposed window designs in improving the channel estimation performance over the conventional rectangular or Sine windows.

cs.IT↗

arXiv2021

Hybrid Beamforming for Terahertz Wireless Communications: Challenges, Architectures, and Open Problems

Terahertz (THz) communications are regarded as a pillar technology for the sixth generation (6G) wireless systems, by offering multi-ten-GHz bandwidth. To overcome the short transmission distance and huge propagation loss, ultra-massive (UM) MIMO systems that employ sub-millimeter wavelength antennas array are proposed to enable an enticingly high array gain. In the UM-MIMO systems, hybrid beamforming stands out for its great potential in promisingly high data rate and reduced power consumption. In this paper, challenges and features of the THz hybrid beamforming design are investigated, in light of the distinctive THz peculiarities. Specifically, we demonstrate that the spatial degree-of-freedom (SDoF) is less than 5, which is caused by the extreme sparsity of the THz channel. The blockage problem caused by the huge reflection and scattering losses, as high as 15 dB or over, is studied. Moreover, we analyze the challenges led by the array containing 1024 or more antennas, including the requirement for intelligent subarray architecture, strict energy efficiency, and propagation characterization based on spherical-wave propagation mechanisms. Owning up to hundreds of GHz bandwidth, beam squint effect could cause over 5~dB array gain loss, when the fractional bandwidth exceeds 10%. Inspired by these facts, three novel THz-specific hybrid beamforming architectures are presented, including widely-spaced multi-subarray, dynamic array-of-subarrays, and true-time-delay-based architectures. We also demonstrate the potential data rate, power consumption, and array gain capabilities for THz communications. As a roadmap of THz hybrid beamforming design, multiple open problems and potential research directions are elaborated.

cs.IT↗

arXiv2021

Off-grid Channel Estimation with Sparse Bayesian Learning for OTFS Systems

This paper proposes an off-grid channel estimation scheme for orthogonal time-frequency space (OTFS) systems adopting the sparse Bayesian learning (SBL) framework. To avoid channel spreading caused by the fractional delay and Doppler shifts and to fully exploit the channel sparsity in the delay-Doppler (DD) domain, we estimate the original DD domain channel response rather than the effective DD domain channel response as commonly adopted in the literature. OTFS channel estimation is first formulated as a one-dimensional (1D) off-grid sparse signal recovery (SSR) problem based on a virtual sampling grid defined in the DD space, where the on-grid and off-grid components of the delay and Doppler shifts are separated for estimation. In particular, the on-grid components of the delay and Doppler shifts are jointly determined by the entry indices with significant values in the recovered sparse vector. Then, the corresponding off-grid components are modeled as hyper-parameters in the proposed SBL framework, which can be estimated via the expectation-maximization method. To strike a balance between channel estimation performance and computational complexity, we further propose a two-dimensional (2D) off-grid SSR problem via decoupling the delay and Doppler shift estimations. In our developed 1D and 2D off-grid SBL-based channel estimation algorithms, the hyper-parameters are updated alternatively for computing the conditional posterior distribution of channels, which can be exploited to reconstruct the effective DD domain channel. Compared with the 1D method, the proposed 2D method enjoys a much lower computational complexity while only suffers slight performance degradation. Simulation results verify the superior performance of the proposed channel estimation schemes over state-of-the-art schemes.

cs.IT↗

arXiv2021

Is NOMA Efficient in Multi-Antenna Networks? A Critical Look at Next Generation Multiple Access Techniques

In this paper, we take a critical and fresh look at the downlink multi-antenna NOMA literature. Instead of contrasting NOMA with OMA, we contrast NOMA with two other baselines. The first is conventional Multi-User Linear Precoding (MULP). The second is Rate-Splitting Multiple Access (RSMA) based on multi-antenna Rate-Splitting (RS) and SIC. We show that there is some confusion about the benefits of NOMA, and we dispel the associated misconceptions. First, we highlight why NOMA is inefficient in multi-antenna settings based on basic multiplexing gain analysis. We stress that the issue lies in how the NOMA literature has been hastily applied to multi-antenna setups, resulting in a misuse of spatial dimensions and therefore loss in multiplexing gains and rate. Second, we show that NOMA incurs a severe multiplexing gain loss despite an increased receiver complexity due to an inefficient use of SIC receivers. Third, we emphasize that much of the merits of NOMA are due to the constant comparison to OMA instead of comparing it to MULP and RS baselines. We then expose the pivotal design constraint that multi-antenna NOMA requires one user to fully decode the messages of the other users. This design constraint is responsible for the multiplexing gain erosion, rate loss, and inefficient use of SIC receivers in multi-antenna settings. Our results confirm that NOMA should not be applied blindly to multi-antenna settings, highlight the scenarios where MULP outperforms NOMA and vice versa, and demonstrate the inefficiency, performance loss and complexity disadvantages of NOMA compared to RS. The first takeaway message is that, while NOMA is not beneficial in most multi-antenna deployments. The second takeaway message is that other non-orthogonal transmission frameworks, such as RS, exist which fully exploit the multiplexing gain and the benefits of SIC to boost the rate in multi-antenna settings.

cs.IT↗

arXiv2021

Cross Domain Iterative Detection for Orthogonal Time Frequency Space Modulation

Recently proposed orthogonal time frequency space (OTFS) modulation has been considered as a promising candidate for accommodating various emerging communication and sensing applications in high-mobility environments. In this paper, we propose a novel cross domain iterative detection algorithm to enhance the error performance of OTFS modulation. Different from conventional OTFS detection methods, the proposed algorithm applies basic estimation/detection approaches to both the time domain and delay-Doppler (DD) domain and iteratively updates the extrinsic information from two domains with the unitary transformation. In doing so, the proposed algorithm exploits the time domain channel sparsity and the DD domain symbol constellation constraints. We evaluate the estimation/detection error variance in each domain for each iteration and derive the state evolution to investigate the detection error performance. We show that the performance gain due to iterations comes from the non-Gaussian constellation constraint in the DD domain. More importantly, we prove the proposed algorithm can indeed converge and, in the convergence, the proposed algorithm can achieve almost the same error performance as the maximum-likelihood sequence detection even in the presence of fractional Doppler shifts. Furthermore, the computational complexity associated with the domain transformation is low, thanks to the structure of the discrete Fourier transform (DFT) kernel. Simulation results are consistent with our analysis and demonstrate a significant performance improvement compared to conventional OTFS detection methods.

cs.IT↗

arXiv2020

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

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

cs.IT↗

arXiv2020

A Novel Sum-Product Detection Algorithm for Faster-than-Nyquist Signaling: A Deep Learning Approach

A deep learning assisted sum-product detection algorithm (DL-SPDA) for faster-than-Nyquist (FTN) signaling is proposed in this paper. The proposed detection algorithm works on a modified factor graph which concatenates a neural network function node to the variable nodes of the conventional FTN factor graph to approach the maximum a posterior probabilities (MAP) error performance. In specific, the neural network performs as a function node in the modified factor graph to deal with the residual intersymbol interference (ISI) that is not considered by the conventional detector with a limited complexity. We modify the updating rule in the conventional sum-product algorithm so that the neural network assisted detector can be complemented to a Turbo equalization receiver. Furthermore, we propose a compatible training technique to improve the detection performance of the proposed DL-SPDA with Turbo equalization. In particular, the neural network is optimized in terms of the mutual information between the transmitted sequence and the extrinsic information. We also investigate the maximum-likelihood bit error rate (BER) performance of a finite length coded FTN system. Simulation results show that the error performance of the proposed algorithm approaches the MAP performance, which is consistent with the analytical BER.

cs.IT↗