Transformers consuming multi-channel scalar signals must embed $C$ simultaneous values into one $d_{\text{model}}$-dimensional vector per time step. We audit eight input encoders -- a shared-scalar baseline, per-channel linear projections, an orthogonality regulariser, a nonlinear MLP, block-partitioned concatenation, channel-independent and channel-as-token architectures, and a projected positional encoding -- on a synthetic benchmark where channel identity is informative and on ETTh1, scored by next-step negative log-likelihood. The headline is practical near-equivalence within a wide "top tier": the standard per-channel linear projection matches every alternative up to small, statistically real but practically modest differences. A direct geometric probe attributes this to a spontaneous orthogonalisation of the per-channel projections: they end up near-orthogonal with no explicit regulariser, letting the standard linear recover channel identity from the summed embedding. Two encoders lose decisively: the shared-scalar baseline collapses for information-theoretic reasons we make explicit, and the channel-independent PatchTST-spirit baseline overfits universally on the synthetic b
We introduce a new framework for quantum channel discrimination in an adversarial setting, where the tester plays against an adversary. We show that in asymmetric hypothesis testing, the optimal type-II error exponent is precisely characterized by a new notion of quantum channel divergence (termed the minimum output channel divergence). This serves as a direct analog of the quantum Stein's lemma in this new framework, and complements previous studies on ``best-case'' channel discrimination, thereby providing a complete understanding of the ultimate limits of quantum channel discrimination. Notably, the optimal error exponent can be achieved by simple non-adaptive adversarial strategies, and despite the need for regularization, it remains efficiently computable and satisfies the strong converse property in general. Furthermore, we show that entropy accumulation, a powerful tool in quantum cryptography, can be reframed as an adversarial channel discrimination problem, establishing a new connection between quantum information theory and quantum cryptography.
Sparsity in the delay-Doppler (DD) domain enables efficient channel estimation, but the realization-wise sparsity level is rarely known in advance, and it fluctuates. What if we could estimate the channel without ever knowing how many delays or Dopplers are active? This paper answers that question. We propose a sparsity-agnostic structured estimator that requires no prior knowledge of delay or Doppler sparsity budgets. The key idea is to exploit the Cartesian-product structure of DD support (active delays share a common Doppler set) and to select the support dimensions directly from the data via the Bayesian information criterion. We instantiate the framework on an affine frequency division multiplexing system, where the observation model naturally admits an on-grid DD representation. Numerical results demonstrate that it recovers the exact support with high probability and achieves near-oracle channel reconstruction accuracy, consistently outperforming fixed-budget baselines and sparse Bayesian learning. The approach is waveform-agnostic and offers a practical, adaptive solution for DD-domain channel estimation under unknown and time-varying sparsity.
Accurate channel prediction is essential for addressing channel aging caused by user mobility. However, the actual channel variations over time are highly complex in high-mobility scenarios, which makes it difficult for existing predictors to obtain future channels accurately. The low accuracy of channel predictors leads to difficulties in supporting reliable communication. To overcome this challenge, we propose a channel predictor based on spatio-temporal electromagnetic (EM) kernel learning (STEM-KL). Specifically, inspired by recent advancements in EM information theory (EIT), the STEM kernel function is derived. The velocity and the concentration kernel parameters are designed to reflect the time-varying propagation of the wireless signal. We obtain the parameters through kernel learning. Then, the future channels are predicted by computing their Bayesian posterior, with the STEM kernel acting as the prior. To further improve the stability and model expressibility, we propose a grid-based EM mixed kernel learning (GEM-KL) scheme. We design the mixed kernel to be a convex combination of multiple sub-kernels, where each of the sub-kernel corresponds to a grid point in the set of
Non-Markovian noise, arising from memory effects in the environment, poses substantial challenges to conventional quantum noise suppression protocols, including quantum error correction and mitigation. We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel, which translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels. It therefore provides a systematic way to design non-Markovian noise suppression protocols: one can apply existing channel-level error-suppression techniques in the Choi-channel picture and then translate them back to the circuit picture. The performance of the resulting non-Markovian protocols, including their noise-suppression effects and complexity, can often be inherited directly from the corresponding Choi-channel protocols without requiring a separate analysis. With this framework, we devise new protocols using Pauli twirling, probabilistic error cancellation, and virtual channel purification. Pauli twirling reduces non-Markovian noise to noise with only classical temporal correlations; probabilistic error cancellation can fully cancel non-Markovian noise; and virtua
Electromagnetic information theory (EIT) is one of the emerging topics for 6G communication due to its potential to reveal the performance limit of wireless communication systems. For EIT, the research foundation is reasonable and accurate channel modeling. Existing channel modeling works for EIT in non-line-of-sight (NLoS) scenario focus on far-field modeling, which can not accurately capture the characteristics of the channel in near-field. In this paper, we propose the near-field channel model for EIT based on electromagnetic scattering theory. We model the channel by using non-stationary Gaussian random fields and derive the analytical expression of the correlation function of the fields. Furthermore, we analyze the characteristics of the proposed channel model, e.g., channel degrees of freedom (DoF). Finally, we design a channel estimation scheme for near-field scenario by integrating the electromagnetic prior information of the proposed model. Numerical analysis verifies the correctness of the proposed scheme and shows that it can outperform existing schemes like least square (LS) and orthogonal matching pursuit (OMP).
Data representation is a fundamental issue in deep learning. However, as wireless data scales and deeply couples across many physical domains such as time, space, and frequency, existing wireless artificial intelligence (AI) technologies lack dedicated representation solutions. Instead, they mainly rely on stitching general-purpose networks, a tool-driven paradigm that inevitably results in structural redundancy and bottlenecks in information flow. To fill this gap, this paper proposes Coupler, a wireless native-AI neural backbone designed for representation learning of channel state information (CSI)--the pivotal data in wireless systems. Leveraging the revealed physical insights of channel tensors, Coupler decomposes representation learning into individual domains on a layer-by-layer basis, and then couples the learned domain-specific features through a dimension-staggered cascade. This full-domain interleaved learning architecture enables superior parameter efficiency and fine-grained multi-domain feature fusion. Based on this backbone, we use the complex-domain multilayer perceptrons (CMLPs) as spatial and frequency domain learners, while employing three optional mechanisms--co
Intelligent Reflecting Surfaces (IRSs) have potential for significant performance gains in next-generation wireless networks but face key challenges, notably severe double-pathloss and complex multi-user scheduling due to hardware constraints. Active IRSs partially address pathloss but still require efficient scheduling in cell-level multi-IRS multi-user systems, whereby the overhead/delay of channel state acquisition and the scheduling complexity both rise dramatically as the user density and channel dimensions increase. Motivated by these challenges, this paper proposes a novel scheduling framework based on neural Channel Knowledge Map (CKM), designing Transformer-based deep neural networks (DNNs) to predict ergodic spectral efficiency (SE) from historical channel/throughput measurements tagged with user positions. Specifically, two cascaded networks, LPS-Net and SE-Net, are designed to predict link power statistics (LPS) and ergodic SE accurately. We further propose a low-complexity Stable Matching-Iterative Balancing (SM-IB) scheduling algorithm. Numerical evaluations verify that the proposed neural CKM significantly enhances prediction accuracy and computational efficiency, wh
This paper investigates the zero-error capacity of channels with memory. Motivated by the nuanced requirements of semantic communication that incorporate memory, we advance the classical enlightened dictator channel by introducing a new category known as the semantic channel. We analyze the zero-error capacity of the semantic channel using a comprehensive framework that accommodates multiple input and output memories. Our approach reveals a more sophisticated and detailed model compared to the classical memory channels, highlighting the impact of memory on achieving error-free communication.
Artificial intelligence (AI) has emerged as a pivotal enabler for next-generation wireless communication systems. However, conventional AI-based models encounter several limitations, such as heavy reliance on labeled data, limited generalization capability, and task-specific design. To address these challenges, this paper introduces, for the first time, the concept of channel foundation models (CFMs)-a novel and unified framework designed to tackle a wide range of channel-related tasks through a pretrained, universal channel feature extractor. By leveraging advanced AI architectures and self-supervised learning techniques, CFMs are capable of effectively exploiting large-scale unlabeled data without the need for extensive manual annotation. We further analyze the evolution of AI methodologies, from supervised learning and multi-task learning to self-supervised learning, emphasizing the distinct advantages of the latter in facilitating the development of CFMs. Additionally, we provide a comprehensive review of existing studies on self-supervised learning in this domain, categorizing them into generative, discriminative and the combined paradigms. Given that the research on CFMs is s
To achieve the full passive beamforming gains of intelligent reflecting surface (IRS), accurate channel state information (CSI) is indispensable but practically challenging to acquire, due to the excessive amount of channel parameters to be estimated which increases with the number of IRS reflecting elements as well as that of IRS-served users. To tackle this challenge, we propose in this paper two efficient channel estimation schemes for different channel setups in an IRS-assisted multi-user broadband communication system employing the orthogonal frequency division multiple access (OFDMA). The first channel estimation scheme, which estimates the CSI of all users in parallel simultaneously at the access point (AP), is applicable for arbitrary frequency-selective fading channels. In contrast, the second channel estimation scheme, which exploits a key property that all users share the same (common) IRS-AP channel to enhance the training efficiency and support more users, is proposed for the typical scenario with line-of-sight (LoS) dominant user-IRS channels. For the two proposed channel estimation schemes, we further optimize their corresponding training designs (including pilot ton
Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel state information (CSI) is revealed to the encoders in a causal manner. Inner and outer bounds are provided. To establish the inner bound, we investigate coding schemes incorporating wiretap coding and secret key agreement between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are proposed. The first one is a new coding scheme using backward decoding and Wyner-Ziv coding and the secret key is constructed from a lossy description of the CSI. The other one is an extended version of the existing coding scheme for point-to-point wiretap channels with causal CSI. A numerical example shows that the achievable region given by the first coding scheme can be strictly larger than the second one. However, these two schemes do not outperform each other in general and there exists some numerical examples that in different channel models each coding scheme achieves some rate pairs that cannot be achieved by another scheme. Ou
Affine Frequency Division Multiplexing (AFDM) is a brand new chirp-based multi-carrier (MC) waveform for high mobility communications, with promising advantages over Orthogonal Frequency Division Multiplexing (OFDM) and other MC waveforms. Existing AFDM research focuses on wireless communication at high carrier frequency (CF), which typically considers only Doppler frequency shift (DFS) as a result of mobility, while ignoring the accompanied Doppler time scaling (DTS) on waveform. However, for underwater acoustic (UWA) communication at much lower CF and propagating at speed of sound, the DTS effect could not be ignored and poses significant challenges for channel estimation. This paper analyzes the channel frequency response (CFR) of AFDM under multi-scale multi-lag (MSML) channels, where each propagating path could have different delay and DFS/DTS. Based on the newly derived input-output formula and its characteristics, two new channel estimation methods are proposed, i.e., AFDM with iterative multi-index (AFDM-IMI) estimation under low to moderate DTS, and AFDM with orthogonal matching pursuit (AFDM-OMP) estimation under high DTS. Numerical results confirm the effectiveness of th
In this letter, we study efficient channel estimation and passive beamforming designs for a double-intelligent reflecting surface (IRS) aided single-user communication system, where a user communicates with an access point (AP) via the cascaded user-IRS 1-IRS 2-AP double-reflection link. First, a general channel estimation scheme is proposed for the system under any arbitrary inter-IRS channel, where all coefficients of the cascaded channel are estimated. Next, for the typical scenario with a line-of-sight (LoS)-dominant inter-IRS channel, we propose another customized scheme to estimate two signature vectors of the rank-one cascaded channel with significantly less channel training time than the first scheme. For the two proposed channel estimation schemes, we further optimize their corresponding cooperative passive beamforming for data transmission to maximize the achievable rate with the training overhead and channel estimation error taken into account. Numerical results show that deploying two cooperative IRSs with the proposed channel estimation and passive beamforming designs achieves significant rate enhancement as compared to the conventional case of single IRS deployment.
Channel estimation is a practical challenge for intelligent reflecting surface (IRS) aided wireless communication. As the number of IRS reflecting elements or IRS-aided users increases, the channel training overhead becomes excessively high, which results in long delay and low throughput in data transmission. To tackle this challenge, we propose in this paper a new anchor-assisted channel estimation approach, where two anchor nodes, namely A1 and A2, are deployed near the IRS for facilitating its aided base station (BS) in acquiring the cascaded BS-IRS-user channels required for data transmission. Specifically, in the first scheme, the partial channel state information (CSI) on the element-wise channel gain square of the common BS-IRS link for all users is first obtained at the BS via the anchor-assisted training and feedback. Then, by leveraging such partial CSI, the cascaded BS-IRS-user channels are efficiently resolved at the BS with additional training by the users. While in the second scheme, the BS-IRS-A1 and A1-IRS-A2 channels are first estimated via the training by A1. Then, with additional training by A2, all users estimate their individual cascaded A2-IRS-user channels si
Channel estimation in the RIS-aided massive multiuser multiple-input single-output (MU-MISO) wireless communication systems is challenging due to the passive feature of RIS and the large number of reflecting elements that incur high channel estimation overhead. To address this issue, we propose a novel cascaded channel estimation strategy with low pilot overhead by exploiting the sparsity and the correlation of multiuser cascaded channels in millimeter-wave massive MISO systems. Based on the fact that the phsical positions of the BS, the RIS and users may not change in several or even tens of consecutive channel coherence blocks, we first estimate the full channel state information (CSI) including all the angle and gain information in the first coherence block, and then only re-estimate the channel gains in the remaining coherence blocks with much less pilot overhead. In the first coherence block, we propose a two-phase channel estimation method, in which the cascaded channel of one typical user is estimated in Phase I based on the linear correlation among cascaded paths, while the cascaded channels of other users are estimated in Phase II by utilizing the partial CSI of the common
The method of complementary channel for analysis of reversibility (sufficiency) of a quantum channel with respect to families of input states (pure states for the most part) are considered and applied to Bosonic linear (quasi-free) channels, in particular, to Bosonic Gaussian channels. The obtained reversibility conditions for Bosonic linear channels have clear physical interpretation and their sufficiency is also shown by explicit construction of reversing channels. The method of complementary channel gives possibility to prove necessity of these conditions and to describe all reversed families of pure states in the Schrodinger representation. Some applications in quantum information theory are considered. Conditions for existence of discrete classical-quantum subchannels and of completely depolarizing subchannels of a Bosonic linear channel are obtained in the Appendix.
We demonstrate the use of the Lorentz reciprocal theorem in obtaining corrections to the steady flow rate due to flow oscillations in rigid channels. Starting from the unsteady Stokes equations, we derive the suitable reciprocity relation, assuming all quantities can be expressed as time-harmonic phasors. The auxiliary problem is the steady Hagen--Poiseuille flow solution, from which the reciprocal theorem allows us to calculate the first-order correction in the Womersley number to the steady flow rate in a straight rigid channel. We also consider nonuniform channels, specifically with variable height in the flow-wise direction, in which case the flow rate correction provides the leading-order effect of the interplay between the oscillations of the fluid flow and the given shape of the channel.
Reconfigurable intelligent surface (RIS) is envisioned to be an essential component of the paradigm for beyond 5G networks as it can potentially provide similar or higher array gains with much lower hardware cost and energy consumption compared with the massive multiple-input multiple-output (MIMO) technology. In this paper, we focus on one of the fundamental challenges, namely the channel acquisition, in an RIS-assisted multiuser MIMO system. The state-of-the-art channel acquisition approach in such a system with fully passive RIS elements estimates the cascaded transmitter-to-RIS and RIS-to-receiver channels by adopting excessively long training sequences. To estimate the cascaded channels with an affordable training overhead, we formulate the channel estimation problem in the RIS-assisted multiuser MIMO system as a matrix-calibration based matrix factorization task. By exploiting the information on the slow-varying channel components and the hidden channel sparsity, we propose a novel message-passing based algorithm to factorize the cascaded channels. Furthermore, we present an analytical framework to characterize the theoretical performance bound of the proposed estimator in th
The 3GPP suggests to combine dual polarized (DP) antenna arrays with the double directional (DD) channel model for downlink channel estimation. This combination strikes a good balance between high-capacity communications and parsimonious channel modeling, and also brings limited feedback schemes for downlink channel state information within reach---since such channel can be fully characterized by several key parameters. However, most existing channel estimation work under the DD model has not yet considered DP arrays, perhaps because of the complex array manifold and the resulting difficulty in algorithm design. In this paper, we first reveal that the DD channel with DP arrays at the transmitter and receiver can be naturally modeled as a low-rank tensor, and thus the key parameters of the channel can be effectively estimated via tensor decomposition algorithms. On the theory side, we show that the DD-DP parameters are identifiable under very mild conditions, by leveraging identifiability of low-rank tensors. Furthermore, a compressed tensor decomposition algorithm is developed for alleviating the downlink training overhead. We show that, by using judiciously designed pilot structur