Related papers: Quantized Compute and Forward: A Low-Complexity Ar…
We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…
In this paper, we propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized…
We present a modified compute-and-forward scheme which utilizes Channel State Information at the Transmitters (CSIT) in a natural way. The modified scheme allows different users to have different coding rates, and use CSIT to achieve larger…
We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…
The limited number of qubits per chip remains a critical bottleneck in quantum computing, motivating the use of distributed architectures that interconnect multiple quantum processing units (QPUs). However, executing quantum algorithms…
This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error…
We propose composite decode-forward (DF) schemes for the two-way relay channel in both the full- and half-duplex modes by combining coherent relaying, independent relaying and partial relaying strategies. For the full-duplex mode, the relay…
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as an LDPC code tailored specifically to obtain…
Quantum computing is presently undergoing rapid development to achieve a significant speedup promised in certain applications. Nonetheless, scaling quantum computers remains a formidable engineering challenge, prompting exploration of…
The scalability of quantum computing is currently limited by physical, technological, and architectural constraints that hinder the integration of a large number of qubits within a single quantum processor. Distributed quantum computing…
This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…
We propose a novel low-complexity receiver design for multicarrier continuous aperture array (CAPA) systems operating over doubly-dispersive (DD) channels. The receiver leverages a Gaussian Belief Propagation (GaBP)-based framework that…
Existing distributed ledger protocols either incur a high communication complexity and are thus suited to systems with a small number of processes (e.g., PBFT), or rely on committee-sampling-based approaches that only work for a very large…
We consider "virtual" full-duplex relaying by means of half-duplex relays. In this configuration, each relay stage in a multi-hop relaying network is formed by at least two relays, used alternatively in transmit and receive modes, such that…
Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel…
A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay's "assistance". The nested LDGM (Low-density generator-matrix) -LDPC (low-density…
In this paper we propose a new framework for distributed source coding of structured sources, such as sparse signals. Our framework capitalizes on recent advances in the theory of linear inverse problems and signal representations using…
We consider wireless communication systems with compact planar arrays having densely spaced antenna elements in conjunction with one-bit analog-to-digital and digital-to-analog converters (ADCs/DACs). We provide closed-form expressions for…
Rate splitting (RS) is a potentially powerful and flexible technique for multi-antenna downlink transmission. In this paper, we address several technical challenges towards its practical implementation for beyond 5G systems. To this end, we…
Computation is currently seen as a forward propagator that evolves (retards) a completely defined initial vector into a corresponding final vector. Initial and final vectors map the (logical) input and output of a reversible Boolean network…