Related papers: Maximal Orders in the Design of Dense Space-Time L…
Efficient constellation design is important for improving performance in communication systems. The problem of multidimensional constellation design has been studied extensively in the literature in the context of multidimensional coded…
Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. The design of lattices for BF channels offers a challenging problem, which differs greatly from its…
Let $\Sigma_d^{++}$ be the set of positive definite matrices with determinant 1 in dimension $d\ge 2$. Identifying any two $SL_d(\mathbb{Z})$-congruent elements in $\Sigma_d^{++}$ gives rise to the space of reduced quadratic forms of…
In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
Many powerful data detection algorithms employed in multiple-input multiple-output (MIMO) communication systems, such as sphere decoding (SD) and lattice-reduction (LR)-aided detection, were initially designed for infinite lattices.…
Antenna selection in Massive MIMO (Multiple Input Multiple Output) communication systems enables reduction of complexity, cost and power while keeping the channel capacity high and retaining the diversity, interference reduction, spatial…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of…
Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…
Millimeter-wave links are of a line-of-sight nature. Hence, multiple-input multiple-output (MIMO) systems operating in the millimeter-wave band may not achieve full spatial diversity or multiplexing. In this paper, we utilize reconfigurable…
We propose a novel approach for channel state information (CSI) compression in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems, where the frequency-domain channel matrix is treated as a…
The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of…
We consider large MIMO systems, where by `{\em large}' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense interest because of the very high spectral efficiencies…
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in…
For MIMO systems, due to the deployment of multiple antennas at both the transmitter and the receiver, the design variables e.g., precoders, equalizers, training sequences, etc. are usually matrices. It is well known that matrix operations…
Consider a MIMO interference channel whereby each transmitter and receiver are equipped with multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can maximize system throughput. The recent work…