2,392 research outputs found
Overview of Constrained PARAFAC Models
In this paper, we present an overview of constrained PARAFAC models where the
constraints model linear dependencies among columns of the factor matrices of
the tensor decomposition, or alternatively, the pattern of interactions between
different modes of the tensor which are captured by the equivalent core tensor.
Some tensor prerequisites with a particular emphasis on mode combination using
Kronecker products of canonical vectors that makes easier matricization
operations, are first introduced. This Kronecker product based approach is also
formulated in terms of the index notation, which provides an original and
concise formalism for both matricizing tensors and writing tensor models. Then,
after a brief reminder of PARAFAC and Tucker models, two families of
constrained tensor models, the co-called PARALIND/CONFAC and PARATUCK models,
are described in a unified framework, for order tensors. New tensor
models, called nested Tucker models and block PARALIND/CONFAC models, are also
introduced. A link between PARATUCK models and constrained PARAFAC models is
then established. Finally, new uniqueness properties of PARATUCK models are
deduced from sufficient conditions for essential uniqueness of their associated
constrained PARAFAC models
Why Does a Kronecker Model Result in Misleading Capacity Estimates?
Many recent works that study the performance of multi-input multi-output
(MIMO) systems in practice assume a Kronecker model where the variances of the
channel entries, upon decomposition on to the transmit and the receive
eigen-bases, admit a separable form. Measurement campaigns, however, show that
the Kronecker model results in poor estimates for capacity. Motivated by these
observations, a channel model that does not impose a separable structure has
been recently proposed and shown to fit the capacity of measured channels
better. In this work, we show that this recently proposed modeling framework
can be viewed as a natural consequence of channel decomposition on to its
canonical coordinates, the transmit and/or the receive eigen-bases. Using tools
from random matrix theory, we then establish the theoretical basis behind the
Kronecker mismatch at the low- and the high-SNR extremes: 1) Sparsity of the
dominant statistical degrees of freedom (DoF) in the true channel at the
low-SNR extreme, and 2) Non-regularity of the sparsity structure (disparities
in the distribution of the DoF across the rows and the columns) at the high-SNR
extreme.Comment: 39 pages, 5 figures, under review with IEEE Trans. Inform. Theor
MU-MIMO Communications with MIMO Radar: From Co-existence to Joint Transmission
Beamforming techniques are proposed for a joint multi-input-multi-output
(MIMO) radar-communication (RadCom) system, where a single device acts both as
a radar and a communication base station (BS) by simultaneously communicating
with downlink users and detecting radar targets. Two operational options are
considered, where we first split the antennas into two groups, one for radar
and the other for communication. Under this deployment, the radar signal is
designed to fall into the null-space of the downlink channel. The communication
beamformer is optimized such that the beampattern obtained matches the radar's
beampattern while satisfying the communication performance requirements. To
reduce the optimizations' constraints, we consider a second operational option,
where all the antennas transmit a joint waveform that is shared by both radar
and communications. In this case, we formulate an appropriate probing
beampattern, while guaranteeing the performance of the downlink communications.
By incorporating the SINR constraints into objective functions as penalty
terms, we further simplify the original beamforming designs to weighted
optimizations, and solve them by efficient manifold algorithms. Numerical
results show that the shared deployment outperforms the separated case
significantly, and the proposed weighted optimizations achieve a similar
performance to the original optimizations, despite their significantly lower
computational complexity.Comment: 15 pages, 15 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessibl
- …