arXiv subjects

Mohaned Chraiti

Publications and source records attributed to Mohaned Chraiti.

16 recordsLinked to original sources

arXiv2026

LO-Free Joint Communication and Sensing via Inter-Antenna Cross-Correlation and Graph-Based Spatial Phase Inference

Joint communication and sensing (JCAS) typically rely on coherent downconversion to recover the phase relationships required for array processing. Meanwhile, Local Oscillators (LOs) are a major source of cost, power consumption, and implementation complexity in millimeter-wave (mmWave) and sub-THz receivers. Existing LO-free receiver designs are typically based on envelope detection or related non-coherent operations that do not preserve inter-branch phase information, which limits their applicability to JCAS. This work proposes an LO-free JCAS receiver architecture that leverages pairwise inter-branch correlation processing to suppress the common carrier component and to synthesize relative-phase observables across the antenna array, enabling both data communication and Direction-of-Arrival (DoA) estimation. The transmitted symbols are designed to induce distinct phase-difference patterns, such that the resulting correlation phases contain both a data-dependent component and a DoA-dependent component. We formulate recovery as inference over a correlation graph, where branches are nodes and pairwise correlations are edges, and show that the resulting cycle-consistent redundancy enables robust relative-phase recovery under noise and perturbations. We further derive a topology-aware Cram\'er-Rao lower bound for DoA estimation under a locally unwrapped approximation. Numerical results confirm that increasing graph connectivity improves both bit-error rate and DoA accuracy, with sensing performance approaching the derived bound.

eess.SP↗

arXiv2026

Perceptual-Quality based AMC for Enhanced mmWave Spectral Efficiency: Concept and Experiment

For high-throughput applications such as ultra-high-definition video streaming and immersive extended-reality, perceptual quality rather than bit-level accuracy defines the primary performance criterion and provides a more informative and spectrally efficient objective than strict bitwise reconstruction. This is particularly relevant in millimeter-wave (mmWave) and sub-Terahertz (sub-THz) systems, where path loss, short channel coherence times and phase noise introduce severe fluctuations that degrade link spectral efficiency. We propose an extension to conventional Adaptive Modulation and Coding (AMC) framework that incorporates perceptual quality awareness into link adaptation. In this framework, the decision metric is a Perceptual Quality Indicator (PQI) derived from the Structural Similarity Index Measure (SSIM). The receiver employs a Denoising Convolutional Neural Network (DnCNN) denoiser to enhance post-decoding image quality before feedback estimation. The resulting perceptual metric replaces the standard Channel Quality Indicator (CQI) in the AMC loop, enabling adaptation to maximize spectral efficiency while satisfying a perceptual-fidelity constraint. Experiments on a 5G-compliant mmWave testbed demonstrate up to a twofold gain in spectral efficiency while maintaining perceptual fidelity, underscoring the potential of perception-optimized link adaptation.

eess.SP↗

arXiv2026

LO-Free Receiver: Next-Gen Low-Power Joint Communication and Sensing

This paper introduces and analyzes Spatial Phase Manifold Communications (SPMC), a paradigm that facilitates joint communication and sensing (JCAS) over Local Oscillator (LO) free receiver. Information is embedded in, and recovered from, the relative spatial phase between antennas. In contrast to conventional coherent receivers that rely on LOs and on channel estimation/equalization, SPMC exploits antenna-domain correlation to form a baseband observable that is a function of inter-antenna phase differences. Since these phase differences are fundamentally tied to Direction-of-Arrival (DoA) and vice-versa, the formulation recasts communication and sensing as inference over the unit-circle manifold and thus naturally supports JCAS decomposition, i.e., data and spatial sensing are encoded and recovered through DoA signatures. We develop a comprehensive framework comprising: (i) a manifold-domain signal model and corresponding phase-alphabet design; (ii) an LO-free quadrature spatial-correlator receiver architecture that resolves the phase-sign ambiguity without requiring an LO; and (iii) an analysis of error probability and sensing precision, including robustness to phase noise. The proposed paradigm is particularly suited to massive Internet-of-Things (IoT) deployments, for which hardware simplicity, LO distribution cost, power consumption, and seamless sensing integration are critical, especially at millimeter-wave and higher carrier frequencies.

eess.SP↗

arXiv2026

High-Fidelity Network Management for Federated AI-as-a-Service: Cross-Domain Orchestration

To support the emergence of AI-as-a-Service (AIaaS), communication service providers (CSPs) are on the verge of a radical transformation-from pure connectivity providers to AIaaS a managed network service (control-and-orchestration plane that exposes AI models). In this model, the CSP is responsible not only for transport/communications, but also for intent-to-model resolution and joint network-compute orchestration, i.e., reliable and timely end-to-end delivery. The resulting end-to-end AIaaS service thus becomes governed by communications impairments (delay, loss) and inference impairments (latency, error). A central open problem is an operational AIaaS control-and-orchestration framework that enforces high fidelity, particularly under multi-domain federation. This paper introduces an assurance-oriented AIaaS management plane based on Tail-Risk Envelopes (TREs): signed, composable per-domain descriptors that combine deterministic guardrails with stochastic rate-latency-impairment models. Using stochastic network calculus, we derive bounds on end-to-end delay violation probabilities across tandem domains and obtain an optimization-ready risk-budget decomposition. We show that tenant-level reservations prevent bursty traffic from inflating tail latency under TRE contracts. An auditing layer then uses runtime telemetry to estimate extreme-percentile performance, quantify uncertainty, and attribute tail-risk to each domain for accountability. Packet-level Monte-Carlo simulations demonstrate improved p99.9 compliance under overload via admission control and robust tenant isolation under correlated burstiness.

cs.NI↗

arXiv2026

AI-Paging: Lease-Based Execution Anchoring for Network-Exposed AI-as-a-Service

With AI-as-a-Service (AIaaS) now deployed across multiple providers and model tiers, selecting the appropriate model instance at run time is increasingly outside the end user's knowledge and operational control. Accordingly, the 6G service providers are envisioned to play a crucial role in exposing AIaaS in a setting where users submit only an intent while the network helps in the intent-to-model matching (resolution) and execution placement under policy, trust, and Quality of Service (QoS) constraints. The network role becomes to discover candidate execution endpoints and selects a suitable model/anchor under policy and QoS constraints in a process referred here to as AI-paging (by analogy to cellular call paging). In the proposed architecture, AI-paging is a control-plane transaction that resolves an intent into an AI service identity (AISI), a scoped session token (AIST), and an expiring admission lease (COMMIT) that authorizes user-plane steering to a selected AI execution anchor (AEXF) under a QoS binding. AI-Paging enforces two invariants: (i) lease-gated steering (without COMMIT, no steering state is installed) and (ii) make-before-break anchoring to support continuity and reliability of AIaaS services under dynamic network conditions. We prototype AI-Paging using existing control- and user-plane mechanisms (service-based control, QoS flows, and policy-based steering) with no new packet headers, ensuring compatibility with existing 3GPP-based exposure and management architectures, and evaluate transaction latency, relocation interruption, enforcement correctness under lease expiry, and audit-evidence overhead under mobility and failures.

cs.NI↗

arXiv2026

AI Sessions for Network-Exposed AI-as-a-Service

Cloud-based Artificial Intelligence (AI) inference is increasingly latency- and context-sensitive, yet today's AI-as-a-Service is typically consumed as an application-chosen endpoint, leaving the network to provide only best-effort transport. This decoupling prevents enforceable tail-latency guarantees, compute-aware admission control, and continuity under mobility. This paper proposes Network-Exposed AI-as-a-Service (NE-AIaaS) built around a new service primitive: the AI Session (AIS)-a contractual object that binds model identity, execution placement, transport Quality-of-Service (QoS), and consent/charging scope into a single lifecycle with explicit failure semantics. We introduce the AI Service Profile (ASP), a compact contract that expresses task modality and measurable service objectives (e.g., time-to-first-response/token, p99 latency, success probability) alongside privacy and mobility constraints. On this basis, we specify protocol-grade procedures for (i) DISCOVER (model/site discovery), (ii) AI PAGING (context-aware selection of execution anchor), (iii) two-phase PREPARE/COMMIT that atomically co-reserves compute and QoS resources, and (iv) make-before-break MIGRATION for session continuity. The design is standard-mappable to Common API Framework (CAPIF) style northbound exposure, ETSI Multi-access Edge Computing (MEC) execution substrates, 5G QoS flows for transport enforcement, and Network Data Analytics Function (NWDAF) style analytics for closed-loop paging/migration triggers.

cs.NI↗

arXiv2026

Predictive-State Communication: Innovation Coding and Reconciliation under Delay

Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and related generative priors -- literal symbol transport is no longer the only operational regime. We propose predictive-state communication (PSC), in which the transmitter and receiver maintain an explicit shared predictive state, and the physical channel is used primarily to convey innovations, i.e., corrective information that reconciles the receiver's provisional trajectory with the transmitter's realized trajectory. This viewpoint replaces entropy-rate accounting by cross-entropy accounting under model mismatch, and it introduces feasibility constraints that depend jointly on capacity, delay, and perceptual continuity requirements; the resulting operating set is typically a bounded perception-capacity band rather than a one-sided threshold. We outline the protocol and architectural implications (state identifiers, anchors, bounded rollback, and patch-based updates) and provide a stylized illustrative example to visualize the induced feasibility region and its dependence on predictive quality.

cs.IT↗

arXiv2026

On the Structure of the Optimal Detector for Sub-THz Multi-Hop Relays with Unknown Prior: Over-the-Air Diffusion

Amplify and forward (AF) relaying is a viable strategy to extend the coverage of sub-terahertz (sub-THz) links, but inevitably propagates noise, leading to cumulative degradation across multiple hops. At the receiver, optimal decoding is desirable, yet challenging under non-Gaussian input distributions (video, voice, etc), for which neither the Minimum Mean Square Error (MMSE) estimator nor the mutual information admits a closed form. A further open question is whether knowledge of Channel State Information (CSI) and noise statistics at the intermediate relays is necessary for optimal detection. Aiming for an optimal decoder, this paper introduces a new framework that interprets the AF relay chain as a variance-preserving diffusion process and employs denoising diffusion implicit models (DDIMs) for signal recovery. We show that each AF hop is mathematically equivalent to a diffusion step with hop-dependent attenuation and noise injection. Consequently, the entire multi-hop chain collapses to an equivalent Gaussian channel fully described by only three real scalars per block: the cumulative complex gain and the effective noise variance. At the receiver, these end-to-end sufficient statistics define a matched reverse schedule that guides the DDIM-based denoiser, enabling near-optimal Bayesian decoding without per-hop CSI. We establish the information-theoretic foundation of this equivalence, proving that decoding performance depends solely on the final effective Signal-to-Noise-Ratio (SNR), regardless of intermediate noise/channel allocation or prior distribution. Simulations under AWGN and Rician fading confirm that the proposed AF-DDIM decoder reduces mean-squared error, symbol error rate, and bit error rate, particularly at moderate SNRs and for higher-order constellations.

cs.IT↗

arXiv2025

On the Performance of ISAC over the D-Band in a Phase-Noise Aware OFDM Systems

Phase noise (PN) is a critical impairment at D-band frequencies (110 to 170 GHz), which are widely investigated as promising candidates for beyond 5G/6G ISAC systems. This paper evaluates OFDM based ISAC sensing performance under realistic oscillator impairments using a hardware-tuned 3GPP PN model at 130 GHz and FFT based radar processing. With a numerology of 480 kHz, results show that PN introduces range RMSE floors of 0.04 to 0.05 m and velocity RMSE floors of 0.12 to 0.18 m/s. Doppler sidelobe metrics also saturate, with PSLR around minus 6 dB and ISLR around minus 4 dB. These findings confirm that range accuracy remains bandwidth limited, while velocity estimation and sidelobe suppression are strongly PN-sensitive. The study highlights the importance of PN-aware waveform and numerology design for sub-THz ISAC and provides insights for future multi-band transceivers. Communication metrics and PN mitigation strategies such as PTRS and CPE tracking are left for future work.

eess.SP↗

arXiv2025

On the Resilience of Direction-Shift Keying Against Phase Noise and Short Channel Coherence Time at mmWave Frequencies

The rapid variation of the wireless channel (short channel coherence time) and the phase noise are two prominent concerns in Millimeter-wave (mmWave) and sub-Terahertz systems communication systems. Equalizing the channel effect and tracking the phase noise necessitate dense pilot insertion. Direction-Shift Keying (DSK), a recent variant of Spatial Modulation (SM), addresses these challenges by encoding information in the Direction-of-Arrival (DoA) using a distributed antenna system (DAS), rather than relying on amplitude or phase. DSK has been shown to extend coherence time by up to four orders of magnitude. Despite its promise, existing DSK studies are largely simulation-based and limited to simplified roadside unit scenarios and mobile device (MD) equipped with only two antennas. DSK's performance in general settings, along with the fundamental laws governing its behavior, such as coherence time and resilience to phase noise, remain open problems. In this paper, we derive the structure of the optimal detector for the case of $M$-antenna MD. Then, we establish the governing law for DSK's coherence time, termed the Direction Coherence Time (DCT), defining the the temporal duration over which the DoA remains approximately invariant. We analytically establish that DCT scales with $d/v$ (transmitter-receiver distance over velocity), while the Channel Coherence Time (CCT) scales with $λ/v$, revealing a coherence time gain on the order of $d/λ$ (equivalent to more than four orders of magnitude.) Furthermore, we prove that DSK inherently cancels the phase noise, requiring no additional compensation. Analytical predictions are validated through simulations, confirming the robustness and scalability of DSK in high-frequency mobile environments.

cs.IT↗

arXiv2025

Theoretical and Experimental Assessment of Large Beam Codebook at mmWave Devices: How Much is Enough?

Modern millimeter wave (mmWave) transceivers come with a large number of antennas, each of which can support thousands of phase shifter configurations. This capability enables beam sweeping with fine angular resolution, but results in large codebook sizes that can span more than six orders of magnitude. On the other hand, the mobility of user terminals and their randomly changing orientations require constantly adjusting the beam direction. A key focus of recent research has been on the design of beam sweeping codebooks that balance a trade-off between the achievable gain and the beam search time, governed by the codebook size. In this paper, we investigate the extent to which a large codebook can be reduced to fewer steering vectors while covering the entire angular space and maintaining performance close to the maximum array gain. We derive a closed-form expression for the angular coverage range of a steering vector, subject to maintaining a gain loss within $γ$ dB (e.g., 2\, dB) with respect to the maximum gain achieved by an infinitely large codebook. We demonstrate, both theoretically and experimentally, that a large beam-steering codebooks (such as the $1024^{16}$ set considered in our experiment) can be reduced to just a few steering vectors. This framework serves as a proof that only a few steering vectors are sufficient to achieve near-maximum gain, challenging the common belief that a large codebook with fine angular resolution is essential to fully reap the benefits of an antenna array.

cs.IT↗

arXiv2024

Beam Codebook Refinement for mmWave Devices with Random Orientations: Concept and Experimental Validation

There is a growing interest in codebook-based beam-steering for millimeter-wave (mmWave) systems due to its potential for low complexity and rapid beam search. A key focus of recent research has been the design of codebooks that strike a trade-off between achievable gain and codebook size, which directly impacts beam search time. Statistical approaches have shown promise by leveraging the likelihood that certain beam directions (equivalently, sets of phase-shifter configurations) are more probable than others. Such approaches are shown to be valid for static, non-rotating transmission stations such as base stations. However, for the case of user terminals that are constantly changing orientation, the possible phase-shifter configurations become equally probable, rendering statistical methods less relevant. On the other hand, user terminals come with a large number of possible steering vector configurations, which can span up to six orders of magnitude. Therefore, efficient solutions to reduce the codebook size (set of possible steering vectors) without compromising array gain are needed. We address this challenge by proposing a novel and practical codebook refinement technique, aiming to reduce the codebook size while maintaining array gain within $γ$ dB of the maximum achievable gain at any random orientation of the user terminal. We project that a steering vector at a given angle could effectively cover adjacent angles with a small gain loss compared to the maximum achievable gain. We demonstrate experimentally that it is possible to reduce the codebook size from $1024^{16}$ to just a few configurations (e.g., less than ten), covering all angles while maintaining the gain within $γ=3$ dB of the maximum achievable gain.

cs.IT↗

arXiv2023

Consolidate Viability and Information Theories for Task-Oriented Communications: A Homeostasis Solution

The next generation of cellular networks, 6G, is expected to offer a range of exciting applications and services, including holographic communication, machine-to-machine communication, and data sensing from millions of devices. There is an incremental exhaustion of the spectral resources. It is crucial to efficiently manage these resources through value-driven approaches that eliminate waste and continually enhance the communication process. These management principles align with the Task-Oriented Communications (TOC) philosophy. The aim is to allocate the minimum necessary communication resource according to the receiver's objective and continuously improve the communication process. However, it is currently unclear how to build knowledge of the receiver's goal and operate accordingly for efficient-resource utilization. Our management approach combines viability theory and transfer entropy to ensure that the actor remains within a viable space as per their goal and to gradually reduce the information exchange through knowledge accumulation. We discuss these theories in the context of TOC and examine their application in the plant process control case. Finally, we provide insights into future research directions from computational, performance, and protocol perspectives.

cs.IT↗

arXiv2020

A Downlink Puncturing Scheme for Simultaneous Transmission of URLLC and eMBB Traffic by Exploiting Data Similarity

Ultra Reliable and Low Latency Communications (URLLC) is deemed to be an essential service in 5G systems and beyond to accommodate a wide range of emerging applications with stringent latency and reliability requirements. Coexistence of URLLC alongside other service categories calls for developing spectrally efficient multiplexing techniques. Specifically, coupling URLLC and conventional enhanced Mobile BroadBand (eMBB) through superposition/puncturing naturally arises as a promising option due to the tolerance of the latter in terms of latency and reliability. The idea here is to transmit URLLC packets over resources occupied by ongoing eMBB transmissions while minimizing the impact on the eMBB transmissions. In this paper, we propose a novel downlink URLLC-eMBB multiplexing technique that exploits possible similarities among URLLC and eMBB symbols, with the objective of reducing the size of the punctured eMBB symbols. We propose that the base station scans the eMBB traffic' symbol sequences and punctures those that have the highest symbol similarity with that of the URLLC users to be served. As the eMBB and URLLC may use different constellation sizes, we introduce the concept of symbol region similarity to accommodate the different constellations. We assess the performance of the proposed scheme analytically, where we derive closed-form expressions for the symbol error rate (SER) of the eMBB and URLLC services. {We also derive an expression for the eMBB loss function due to puncturing in terms of the eMBB SER}. We demonstrate through numerical and simulation results the efficacy of the proposed scheme where we show that 1) the eMBB spectral efficiency is improved by puncturing fewer symbols, 2) the SER and reliability performance of eMBB are improved, and 3) the URLLC data is accommodated within the specified delay constraint while maintaining its reliability.

eess.SP↗

arXiv2017

On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays

Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N-antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario where there is no relation between N and K, and therefore K can be larger than N. Alice and Bob are assumed to be far away from each other, and all communication is done through the relays, i.e., there is no direct link. Providing secure communication while enhancing the diversity order has been shown to be very challenging. In fact, it has been shown in the literature that the maximum achievable secrecy diversity order for the adopted system model is one (while using artificial noise jamming). In this paper, we adopt a nonlinear interference alignment scheme that we have proposed recently to transmit the signals from Alice to Bob. We analyze the proposed scheme in terms of the achievable secrecy rate and secrecy diversity order. Assuming Gaussian inputs, we derive an explicit expression for the achievable secrecy rate and show analytically that a secrecy diversity order of up to min(N,K)-1 can be achieved using the proposed technique. We provide several numerical examples to validate the obtained analytical results and demonstrate the superiority of the proposed technique to its counterparts that exist in the literature.

cs.CR↗

arXiv2016

Nonlinear Interference Alignment in a One-dimensional Space

Real interference alignment is efficient in breaking-up a one-dimensional space over time-invariant channels into fractional dimensions. As such, multiple symbols can be simultaneously transmitted with fractional degrees-of-freedom (DoF). Of particular interest is when the one dimensional space is partitioned into two fractional dimensions. In such scenario, the interfering signals are confined to one sub-space and the intended signal is confined to the other sub-space. Existing real interference alignment schemes achieve near-capacity performance at high SNR for time-invariant channels. However, such techniques yield poor achievable rate at finite SNR, which is of interest from a practical point of view. In this paper, we propose a radically novel nonlinear interference alignment technique, which we refer to as Interference Dissolution (ID). ID allows to break-up a one-dimensional space into two fractional dimensions while achieving near-capacity performance for the entire SNR range. This is achieved by aligning signals by signals, as opposed to aligning signals by the channel. We introduce ID by considering a time-invariant MISO channel. This channel has a one-dimensional space and offers one DoF. We show that, by breaking-up the one dimensional space into two sub-spaces, ID achieves a rate of two symbols per channel use while providing $\frac{1}{2}$ DoF for each symbol. We analyze the performance of the proposed ID scheme in terms of the achievable rate and the symbol error rate. In characterizing the achievable rate of ID for the entire SNR range, we prove that, assuming Gaussian signals, the sum achievable rate is at most one bit away from the capacity. We present numerical examples to validate the theoretical analysis. We also compare the performance of ID in terms of the achievable rate performance to that of existing schemes and demonstrate ID's superiority.

cs.IT↗