Searcharxiv⌕ Search

arXiv subjects

Jinhong Yuan

Publications and source records attributed to Jinhong Yuan.

At least 37 records · Page 2Linked to original sources

Channel Knowledge Map-assisted Dual-domain Tracking and Predictive Beamforming for High-Mobility Wireless Networks

This paper introduces a novel channel knowledge map (CKM)-assisted dual-domain tracking and predictive beamforming scheme for high-mobility wireless networks. The central premise is that the CKM integrates both the coordinate and beam domains, thereby enabling tracking in one domain via treating the other domain's input as priors or measurements. In the coordinate domain (C-Domain), an extended Kalman filter (EKF) is employed to predict and track the state (i.e., location and velocity) of a moving communication receiver across time slots under both line-of-sight (LoS)-present and LoS-absent conditions, where the CKM provides a prior mapping from multipath channel parameters to potential target locations. In the beam domain (B-Domain), the updated location of the receiver is fed back to CKM to offer a priori information of angle of arrival (AoA) variations, which are incorporated to establish beam transition models for effective beam tracking, depending on the angular variation situation of each path. Then, we analyze the Cramér-Rao Bound (CRB) for AoA estimation for each path in the considered system and propose a jointly predictive beamforming and power allocation design to minimize AoA estimation errors, directly enhancing multipath beam tracking accuracy and indirectly improving target tracking performance. Simulation results demonstrate that the proposed scheme achieves significant improvements in both target and beam tracking performance compared to the state-of-the-art approaches, particularly in AoA tracking of non-line-of-sight (NLoS) paths, highlighting the potential gain of CKM in facilitating both target and beam tracking in high-mobility communications.

eess.SP↗

Faster-than-Nyquist Signaling for Next-Generation Wireless: Principles, Applications, and Challenges

Future wireless networks are expected to deliver ultra-high throughput for supporting emerging applications. In such scenarios, conventional Nyquist signaling may falter. As a remedy, faster-than-Nyquist (FTN) signaling facilitates the transmission of more symbols than Nyquist signaling without expanding the time-frequency resources. We provide an accessible and structured introduction to FTN signaling, covering its core principles, theoretical foundations, unique advantages, open facets, and its road map. Specifically, we present promising coded FTN results and highlight its compelling advantages in integrated sensing and communications (ISAC), an increasingly critical function in future networks. We conclude with a discussion of open research challenges and promising directions.

cs.IT↗

Dual-IRS Aided Near-/Hybrid-Field SWIPT: Passive Beamforming and Independent Antenna Power Splitting Design

This paper proposes a novel dual-intelligent reflecting surface (IRS) aided interference-limited simultaneous wireless information and power transfer (SWIPT) system with independent power splitting (PS), where each receiving antenna applies different PS factors to offer an advantageous trade-off between the useful information and harvested energy. We separately establish the near- and hybrid-field channel models for IRS-reflected links to evaluate the performance gain more precisely and practically. Specifically, we formulate an optimization problem of maximizing the harvested power by jointly optimizing dual-IRS phase shifts, independent PS ratio, and receive beamforming vector in both near- and hybrid-field cases. In the near-field case, the alternating optimization algorithm is proposed to solve the non-convex problem by applying the Lagrange duality method and the difference-of-convex (DC) programming. In the hybrid-field case, we first present an interesting result that the AP-IRS-user channel gains are invariant to the phase shifts of dual-IRS, which allows the optimization problem to be transformed into a convex one. Then, we derive the asymptotic performance of the combined channel gains in closed-form and analyze the characteristics of the dual-IRS. Numerical results validate our analysis and indicate the performance gains of the proposed scheme that dual-IRS-aided SWIPT with independent PS over other benchmark schemes.

eess.SP↗

Spectrum and Orthogonality of Orthogonal Delay-Doppler Division Multiplexing Modulation Waveforms

Orthogonal delay-Doppler (DD) division multiplexing (ODDM) modulation has recently emerged as a promising paradigm for ensuring reliable communications in doubly-selective channels. This work investigates the spectra and orthogonality characteristics of analog (direct) and approximate digital implementations of ODDM systems. We first determine the time and frequency domain representations of the basis functions for waveform in analog and approximate digital ODDM systems. Thereafter, we derive their power spectral densities and show that while the spectrum of analog ODDM waveforms exhibits a step-wise behavior in its transition regions, the spectrum of approximate digital ODDM waveforms is confined to that of the ODDM sub-pulse. Next, we prove the orthogonality characteristics of approximate digital ODDM waveforms and show that, unlike analog ODDM waveforms, the approximate digital ODDM waveforms satisfy orthogonality without the need of additional time domain resources. Additionally, we examine the similarities and differences that implementations of approximate digital ODDM share with the other variants of DD modulations, focusing on the domain changes the symbols undergo, the type of pulse shaping and windowing used, and the domains and the sequence in which they are performed. Finally, we present numerical results to validate our findings and draw further insights.

eess.SP↗

Sum-Rate Maximization for Pinching Antenna-assisted NOMA Systems with Multiple Dielectric Waveguides

This paper investigates the resource allocation design for a pinching antenna (PA)-assisted multiuser multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system featuring multiple dielectric waveguides. To enhance model accuracy, we propose a novel frequency-dependent power attenuation model for the dielectric waveguides in PA-assisted systems. By jointly optimizing the precoder vector and the PA placement, we aim to maximize the system's sum-rate while accounting for the power attenuation across the dielectric waveguides. The design is formulated as a non-convex optimization problem. To effectively address the problem at hand, we introduce an alternating optimization-based algorithm to obtain a suboptimal solution in polynomial time. Our results demonstrate that the proposed PA-assisted system not only significantly outperforms the conventional system but also surpasses a naive PA-assisted system that disregards power attenuation. The performance gain compared to the naive PA-assisted system becomes more pronounced at high carrier frequencies, emphasizing the importance of considering power attenuation in system design.

eess.SP↗

On the Characterization and Evaluation of Doppler Squint in Wideband ODDM Systems

The recently proposed orthogonal delay-Doppler division multiplexing (ODDM) modulation has been demonstrated to enjoy excellent reliability over doubly-dispersive channels. However, most of the prior analysis tends to ignore the interactive dispersion caused by the wideband property of ODDM signal, which possibly leads to performance degradation. To solve this problem, we investigate the input-output relation of ODDM systems considering the wideband effect, which is also known as the Doppler squint effect (DSE) in the literature. The extra delay-Doppler (DD) dispersion caused by the DSE is first explicitly explained by employing the time-variant frequency response of multipath channels. Its characterization is then derived for both reduced cyclic prefix (RCP) and zero padded (ZP)-based wideband ODDM systems, where the extra DD spread and more complicated power leakage outside the peak region are presented theoretically. Numerical results are finally provided to confirm the significance of DSE. The derivations in this paper are beneficial for developing accurate signal processing techniques in ODDM-based integrated sensing and communication systems.

eess.SP↗

Half Spatially Coupled Turbo-Like Codes

This paper presents a new class of spatially coupled turbo-like codes (SC-TCs), namely half spatially coupled braided convolutional codes (HSC-BCCs) and half spatially coupled parallel concatenated codes (HSC-PCCs). Different from the conventional SC-TCs, the proposed codes have simpler and deterministic coupling structures. Most notably, the coupling of HSC-BCCs is performed by re-encoding the whole coupling sequence in the component encoder of one time instant, rather than spreading the coupling bits to component encoders of multiple time instants. This simplification not only addresses the window decoding threshold loss issue in existing BCCs, but also allows the proposed codes to attain very close-to-capacity performance with a coupling memory as small as 2. Both theoretical and numerical results are provided to demonstrate the performance advantages of the proposed codes over existing spatially coupled codes.

cs.IT↗

Hybrid Beamforming with Widely-spaced-array for Multi-user Cross-Near-and-Far-Field Communications

With multi-GHz bandwidth, Terahertz (THz) beamforming has drawn increasing attention in the sixth generation (6G) and beyond communications. Existing beamforming designs mainly focus on a compact antenna array where typical communication occurs in the far-field. However, in dense multi-user scenarios, only relying on far-field angle domain fails to distinguish users at similar angles. Therefore, a multi-user widely-spaced array (MU-WSA) is exploited in this paper, which enlarges the near-field region to introduce the additional distance domain, leading to a new paradigm of cross-near-and-far-field (CNFF) communication. Under this paradigm, the CNFF channel model is investigated, based on which the subarray spacing $d_s$ and the number of subarrays $K$ in MU-WSA are optimized to maximize the channel capacity. Then, in sub-connected systems, an alternating optimization (AO) beamforming algorithm is proposed to deal with the special block-diagonal format of the analog precoder. For fully-connected systems, a low-complexity steering-vector reconstruction (SVR)-based algorithm is proposed by constructing specialized steering vectors of MU-WSA. Numerical evaluations show that due to distance domain resolutions, the MU-WSA can improve the SE by over $60$% at a power of $20$dBm compared to the compact array. Additionally, the proposed AO algorithm in the SC system can achieve over 80% of the sum (SE) of the FC system while reducing the number of phase shifters by $K^2$, thereby lowering power consumption. The SVR algorithm in the FC system can achieve over 95% of the upper bound of SE but takes only 10% of the running time of the singular vector decomposition (SVD)-based algorithms.

cs.IT↗

Scaling Law Tradeoff Between Throughput and Sensing Distance in Large ISAC Networks

In this paper, we investigate the fundamental tradeoff between communication and sensing performance of \emph{ad hoc} integrated sensing and communication (ISAC) wireless networks. Specifically, we consider that $n$ nodes are randomly located in an extended network with area $n$ and transmit ISAC signals. Under the pure path loss channel gain model and the condition that the transmission power scales according to the communication distance, we fully characterize the optimal scaling law tradeoff between throughput and sensing distance by proposing an achievable scheme and proving its converse. Our results can be interpreted as follows: by reducing the throughput by a factor of a function of $n$, the sensing range order improves according to the same function of $n$, raised to the power of the ratio between the path loss factors in communication and sensing. We prove that the same result also holds true for ISAC networks with random fading, despite the uncertainty on the connectivity and power level created by random fading. In addition, we show that the scaling law tradeoff cannot be improved by allowing the transmission power and communication distance to scale freely. To the best of our knowledge, this is the first work formally formulating and characterizing the communication and sensing performance scaling law tradeoff of \emph{ad hoc} ISAC networks.

cs.IT↗

PAC Codes Meet CRC-Polar Codes

CRC-Polar codes under SC list decoding are well-regarded for their competitive error performance. This paper examines these codes by focusing on minimum weight codewords, breaking them down into the rows of the polar transform. Inspired by the significant impact of parity check bits and their positions, we apply a shifted rate-profile for polarization-adjusted convolutional (PS-PAC) codes, thereby achieving similar improvements in the weight distribution of polar codes through precoding. The results demonstrate a significant improvement in error performance, achieving up to a 0.5 dB power gain with short PS-PAC codes. Additionally, leveraging convolutional precoding in PAC codes, we adopt a continuous deployment (masking) of parity check bits derived from the remainder of continuous division of the partial message polynomial and the CRC polynomial over frozen positions in the rate-profile. This approach enhances performance for medium-length codes, with an overall improvement of 0.12 dB.

cs.IT↗

Segmented GRAND: Complexity Reduction through Sub-Pattern Combination

The ordered-reliability bits (ORB) variant of guessing random additive noise decoding (GRAND), known as ORBGRAND, achieves remarkably low time complexity at high code rates compared to other GRAND variants. However, its computational complexity remains higher than other near-ML universal decoders like ordered-statistics decoding (OSD). To address this, we propose segmented ORBGRAND, which partitions the error pattern search space based on code properties, generates syndrome-consistent sub-patterns (reducing invalid error patterns), and combines them in a near-ML order using sub-weights derived from two-level integer partitions of logistic weight. Numerical results show that segmented ORBGRAND reduces the average number of queries by at least 66\% across all SNRs and cuts basic operations by over an order of magnitude, depending on segmentation and code rate. Further efficiency gains come from leveraging pre-generated shared sub-patterns, reducing average decoding time. Furthermore, with abandonment ($b=10^{5}$ or smaller), segmented ORBGRAND provides a 0.2 dB power gain over ORBGRAND. Additionally, we provide an analytical justification for why the logistic weight-based ordering of error patterns in ORBGRAND closely approximates the ML order and discuss the underlying assumptions of ORBGRAND.

cs.IT↗

Parallel Coding for Orthogonal Delay-Doppler Division Multiplexing

This paper proposes a novel parallel coding transmission strategy and an iterative detection and decoding receiver signal processing technique for orthogonal delay-Doppler division multiplexing (ODDM) modulation. Specifically, the proposed approach employs a parallel channel encoding (PCE) scheme that consists of multiple short-length codewords for each delay-Doppler multicarrier (DDMC) symbol. Building upon such a PCE transmission framework, we then introduce an iterative detection and decoding algorithm incorporating a successive decoding feedback (SDF) technique, which enables instant information exchange between the detector and decoder for each DDMC symbol. To characterize the error performance of the proposed scheme, we perform density evolution analysis considering the finite blocklength effects. Our analysis results, coupled with extensive simulations, demonstrate that the proposed PCE scheme with the SDF algorithm not only showcases a better overall performance but also requires much less decoding complexity to implement, compared to the conventional benchmark scheme that relies on a single long channel code for coding the entire ODDM frame.

cs.IT↗

Orthogonal Delay-Doppler Division Multiplexing Modulation with Hierarchical Mode-Based Index Modulation

The orthogonal time frequency space with index modulation (OTFS-IM) offers flexible tradeoffs between spectral efficiency (SE) and bit error rate (BER) in doubly selective fading channels. While OTFS-IM schemes demonstrated such potential, a persistent challenge lies in the detection complexity. To address this problem, we propose the hierarchical mode-based index modulation (HMIM). HMIM introduces a novel approach to modulate information bits by IM patterns, significantly simplifying the complexity of maximum a posteriori (MAP) estimation with Gaussian noise. Further, we incorporate HMIM with the recently proposed orthogonal delay-Doppler division multiplexing (ODDM) modulation, namely ODDM-HMIM, to exploit the full diversity of the delay-Doppler (DD) channel. The BER performance of ODDM-HMIM is analyzed considering a maximum likelihood (ML) detector. Our numerical results reveal that, with the same SE, HMIM can outperform conventional IM in terms of both BER and computational complexity. In addition, we propose a successive interference cancellation-based minimum mean square error (SIC-MMSE) detector for ODDM-HMIM, which enables low-complexity detection with large frame sizes.

eess.SP↗

On the Time-Frequency Localization Characteristics of the Delay-Doppler Plane Orthogonal Pulse

In this work, we study the time-frequency (TF) localization characteristics of the prototype pulse of orthogonal delay-Doppler (DD) division multiplexing modulation, namely, the DD plane orthogonal pulse (DDOP). The TF localization characteristics examine how concentrated or spread out the energy of a pulse is in the joint TF domain, the time domain (TD), and the frequency domain (FD). We first derive the TF localization metrics of the DDOP, including its TF area, its time and frequency dispersions, and its direction parameter. Based on these results, we demonstrate that the DDOP exhibits a high energy spread in the TD, FD, and the joint TF domain, while adhering to the Heisenberg uncertainty principle. Thereafter, we discuss the potential advantages brought by the energy spread of the DDOP, especially with regard to harnessing both time and frequency diversities and enabling fine-resolution sensing. Subsequently, we examine the relationships between the time and frequency dispersions of the DDOP and those of the envelope functions of DDOP's TD and FD representations, paving the way for simplified determination of the TF localization metrics for more generalized variants of the DDOP and the pulses used in other DD domain modulation schemes. Finally, using numerical results, we validate our analysis and find further insights.

eess.SP↗

Orthogonal Delay-Doppler Division Multiplexing Modulation with Tomlinson-Harashima Precoding

The orthogonal delay-Doppler (DD) division multiplexing(ODDM) modulation has been recently proposed as a promising modulation scheme for next-generation communication systems with high mobility. Despite its benefits, ODDM modulation and other DD domain modulation schemes face the challenge of excessive equalization complexity. To address this challenge, we propose time domain Tomlinson-Harashima precoding (THP) for the ODDM transmitter, to make the DD domain single-tap equalizer feasible, thereby reducing the equalization complexity. In our design, we first pre-cancel the inter-symbolinterference (ISI) using the linear time-varying (LTV) channel information. Second, different from classical THP designs, we introduce a modified modulo operation with an adaptive modulus, by which the joint DD domain data multiplexing and timedomain ISI pre-cancellation can be realized without excessively increasing the bit errors. We then analytically study the losses encountered in this design, namely the power loss, the modulo noise loss, and the modulo signal loss. Based on this analysis, BER lower bounds of the ODDM system with time domain THP are derived when 4-QAM or 16-QAM modulations are adopted for symbol mapping in the DD domain. Finally, through numerical results, we validate our analysis and then demonstrate that the ODDM system with time domain THP is a promising solution to realize better BER performance over LTV channels compared to orthogonal frequency division multiplexing systems with single-tap equalizer and ODDM systems with maximum ratio combining.

eess.SP↗

Channel Spreading Function-Inspired Channel Transfer Function Estimation for OFDM Systems with High-Mobility

In this letter, we propose a novel channel transfer function (CTF) estimation approach for orthogonal frequency division multiplexing (OFDM) systems in high-mobility scenarios, that leverages the stationary properties of the delay-Doppler domain channel spreading function (CSF). First, we develop a CSF estimation model for OFDM systems that relies solely on discrete pilot symbols in the time-frequency (TF) domain, positioned at predefined resource elements. We then present theorems to elucidate the relationship between CSF compactness and pilot spacing in the TF domain for accurate CSF acquisition. Based on the estimated CSF, we finally estimate the CTF for data symbols. Numerical results show that, in high-mobility scenarios, the proposed approach outperforms traditional interpolation-based methods and closely matches the optimal estimator in terms of estimation accuracy. This work may pave the way for CSF estimation in commercial OFDM systems, benefiting high-mobility communications, integrated sensing and communications, and related applications.

eess.SP↗

Uplink Multiple Access with Heterogeneous Blocklength and Reliability Constraints: Discrete Signaling with Treating Interference as Noise

We consider the uplink multiple access of heterogeneous users, e.g., ultra-reliable low-latency communications (URLLC) and enhanced mobile broadband (eMBB) users. Each user has its own reliability requirement and blocklength constraint, and users transmitting longer blocks suffer from heterogeneous interference. On top of that, the decoding of URLLC messages cannot leverage successive interference cancellation (SIC) owing to the stringent latency requirements. This can significantly degrade the spectral efficiency of all URLLC users when the interference is strong. To overcome this issue, we propose a new multiple access scheme employing discrete signaling and treating interference as noise (TIN) decoding, i.e., without SIC. Specifically, to handle heterogeneous interference while maintaining the single-user encoding and decoding complexities, each user uses a single channel code and maps its coded bits onto sub-blocks of symbols, where the underlying constellations can be different. We demonstrate theoretically and numerically that the proposed scheme employing quadrature amplitude modulations and TIN decoding can perform very close to the benchmark scheme based on Gaussian signaling with perfect SIC decoding. Interestingly, we show that the proposed scheme does not need to use all the transmit power budget, but also can sometimes even outperform the benchmark scheme.

cs.IT↗

Wireless Communications in Doubly Selective Channels with Domain Adaptivity

Wireless communications are significantly impacted by the propagation environment, particularly in doubly selective channels with variations in both time and frequency domains. Orthogonal Time Frequency Space (OTFS) modulation has emerged as a promising solution; however, its high equalization complexity, if performed in the delay-Doppler domain, limits its universal application. This article explores domain-adaptive system design, with an emphasis on adaptive equalization, while also discussing modulation and pilot placement strategies. It investigates the dynamic selection of best-fit domains based on channel conditions to enhance performance across diverse environments. We examine channel domain connections, signal designs, and equalization techniques with domain adaptivity, and highlight future research opportunities.

eess.SP↗