Related papers: Power-Balanced Orthogonal Space-Time Block Code
In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…
We present a fixed point architecture (source VHDL code is provided) for powering computation. The fully customized architecture, based on the expanded hyperbolic CORDIC algorithm, allows for design space exploration to establish trade-offs…
A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…
The combination of space-time coding (STC) and continuous phase modulation (CPM) is an attractive field of research because both STC and CPM bring many advantages for wireless communications. Zhang and Fitz [1] were the first to apply this…
Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…
To combine the power efficiency of Continuous Phase Modulation (CPM) with enhanced performance in fading environments, some authors have suggested to use CPM in combination with Space-Time Codes (STC). Recently, we have proposed a CPM…
Individual modules of programmable matter participate in their system's collective behavior by expending energy to perform actions. However, not all modules may have access to the external energy source powering the system, necessitating a…
We present a systematic method to design ubiquitous continuous fast-acting distributed load control for primary frequency regulation in power networks, by formulating an optimal load control (OLC) problem where the objective is to minimize…
This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The…
Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using…
$\renewcommand{\Re}{\mathbb{R}}$We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of $n$ points in $\Re^d$. In the new construction each point participates in a few pairs, and it extends…
In this paper, we propose a novel approach to the problem of augmenting distance-based formation controllers with a secondary constraint for the purpose of preventing 3D formation ambiguities. Specifically, we introduce three controlled…
Spatially-coupled (SC) codes is a class of convolutional LDPC codes that has been well investigated in classical coding theory thanks to their high performance and compatibility with low-latency decoders. We describe toric codes as quantum…
Let $K/F$ and $K/L$ be two cyclic Galois field extensions and $D=(K/F,\sigma,c)$ a cyclic algebra. Given an invertible element $d\in D$, we present three families of unital nonassociative algebras over $L\cap F$ defined on the direct sum of…
Ensuring the safety of real-world systems is challenging, especially when they rely on learned perception modules to infer the system state from high-dimensional sensor data. These perception modules are vulnerable to epistemic uncertainty,…
The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…
Constellation shaping is an energy-efficient strategy involving the transmission of lower-energy signals more frequently than higher-energy signals. Previous work has shown that shaping is particularly effective when used with coded…
In this work, we present a collection of new results on two fundamental problems in geometric data structures: orthogonal point location and rectangle stabbing. -We give the first linear-space data structure that supports 3-d point location…
Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean $1$-Steiner trees. The theoretical time complexity of construction methods exploiting the OOVD is $O(n^2)$, but a…
The choice of molecular orbitals is decisive in configuration interaction calculations. In this letter, a democratic description of the ground and excited states follows an orthogonally constrained orbitals optimization to produce…