This paper provides the necessary conditions to design precoding matrices for massive MIMO systems with a sub-connected architecture, RF power constraints and per-antenna power constraints. The system is configured such that each RFchain serves a group of antennas. The necessary condition to design the digital precoder is established based on a generalized water-filling and joint sum and per-antenna optimal power allocation solution, while the analog precoder is based on a per-antenna power allocation solution only. We study the analytically most interesting case where the power constraint on the RF chain is smaller than the sum of the corresponding per-antenna power constraints. For this, the optimal power is allocated based on two properties: Each RF chain uses full power and if the optimal power allocation of the unconstraint problem violates a per-antenna power constraint then it is optimal to allocate the maximal power for that antenna.

Consider a hidden Markov model describing a system with two types of states: a monitored state and a private state. The two types of states are dependent and evolve jointly according to a Markov process with a stationary transition probability. It is desired to reveal the monitored states to a receiver but hide the private states. For this purpose, a privacy filter is necessary which suitably perturbs the monitored states before communication with the receiver. Our objective is to design the privacy filter to optimize the tradeoff between the monitoring accuracy and privacy, measured through a time-invariant distortion measure and Shannon's equivocation, respectively. As the optimal privacy filter is difficult to compute using the dynamic programming, we adopt a suboptimal greedy approach through which the privacy filter can be computed efficiently. Here, the greedy approach has the additional advantage of not being restricted to the finite time horizon setups. Simulations show the superiority of the approach compared to a privacy filter which only adds independent noise to the observations.

Consider a hidden Markov model describing a system with two types of states: a monitored state and a private state. The two types of states are dependent and evolve jointly according to a Markov process with a stationary transition probability. It is desired to reveal the monitored states to a receiver but hide the private states. For this purpose, a privacy filter is necessary which suitably perturbs the monitored states before communication with the receiver. Our objective is to design the privacy filter to optimize the tradeoff between the monitoring accuracy and privacy, measured through a time-invariant distortion measure and Shannon's equivocation, respectively. As the optimal privacy filter is difficult to compute using the dynamic programming, we adopt a suboptimal greedy approach through which the privacy filter can be computed efficiently. Here, the greedy approach has the additional advantage of not being restricted to the finite time horizon setups. Simulations show the superiority of the approach compared to a privacy filter which only adds independent noise to the observations.

We study a two-stage identification problem with pre-processing to enable efficient data retrieval and reconstruction. The first stage outputs a list of compatible users to the second stage which uses it to return the exact user identity with a corresponding reconstruction sequence. The rate distortion region is characterized. A connection to a two observer identification problem is also studied.

This letter proposes anti-jamming strategies based on pilot retransmission for a single user uplink massive MIMO under jamming attack. A jammer is assumed to attack the system both in the training and data transmission phases. We first derive an achievable rate which enables us to analyze the effect of jamming attacks on the system performance. Counter-attack strategies are then proposed to mitigate this effect under two different scenarios: random and deterministic jamming attacks. Numerical results illustrate our analysis and benefit of the proposed schemes.

A two-dimensional linear time-invariant system is considered. The two dimensions of its states are observed by one sensor each. Every sensor quantizes its observations into a finite number of messages, using also the other sensor's past decisions. The combined sensor outputs should allow for a bounded estimation error (reliability). For a natural quantizer, we identify the cases where a price in the quantizer sum rate has to be paid for the fact that observations are distributed. At the same time, an eavesdropper should not be able to track the system state (security). Using the same quantizer as before, security is shown to be possible if the eavesdropper has less information than the estimator in that it for each sensor message pair obtains a larger set of indistinguishable message pairs.

This paper investigates the capacity limit of an uplink waveform channel assuming imperfect channel state information at the receiver (CSIR). Various realistic assumptions are incorporated into the problem, which make the study valuable for performance assessment of real cellular networks to identify potentials for performance improvements in practical receiver designs. We assume that the continuous-time received signal is first discretized by mismatched filtering based on the imperfect CSIR. The resulting discrete-time signals are then decoded considering two different decoding strategies, i.e., an optimal decoding strategy based on specific statistics of channel estimation errors and a sub-optimal decoding strategy treating the estimation error signal as additive Gaussian noise. Motivated by the proposed decoding strategies, we study the performance of the decision feedback equalizer for finite constellation inputs, in which inter-stream interferences are treated either using their true statistics or as Gaussian noise. Numerical results are provided to exemplify the benefit of exploiting the knowledge on the statistics of the channel estimation errors and inter-stream interferences. Simulations also assess the effect of the CSI imperfectness on the achievable rate, which reveal that finite constellation inputs are less sensitive to the estimation accuracy than Gaussian input, especially in the high SNR regime.

In this paper, we consider stabilization of multi-dimensional linear systems driven by Gaussian noise controlled over parallel Gaussian channels. For such systems, it has been recognized that for stabilization in the sense of asymptotic stationarity or stability in probability, Shannon capacity of a channel is an appropriate measure on characterizing whether a system can be made stable when controlled over the channel. However, this is in general not the case for quadratic stabilization. On a related problem of joint-source channel coding, in the information theory literature, the source-channel matching principle has been shown to lead to optimality of uncoded or analog transmission and when such matching conditions occur, it has been shown that capacity is also a relevant figure of merit for quadratic stabilization. A special case of this result is applicable to a scalar LQG system controlled over a scalar Gaussian channel. In this paper, we show that even in the absence of source-channel matching, to achieve quadratic stability, it may suffice that information capacity (in Shannon’s sense) is greater than the sum of the logarithm of unstable eigenvalue magnitudes. In particular, we show that periodic linear time varying coding policies are optimal in the sense of obtaining a finite second moment for the state of the system with minimum transmit power requirements for a large class of vector Gaussian channels. Our findings also extend the literature which has considered noise-free systems.

In this paper, we study an optimal transmit strategy for multiple-input single-output (MISO) Gaussian channels with joint sum and per-antenna power constraints. We study in detail the interesting case where the sum of the per-antenna power constraints is larger than sum power constraint. A closed-form characterization of an optimal beamforming strategy is derived.It is shown that we can always find an optimal beamforming transmit strategy that allocates the maximal sum power with phases matched to the complex channel coefficients. The main result is a simple recursive algorithm to compute the optimal power allocation. Whenever the optimal power allocation of the corresponding problem with sum power constraint only exceeds per-antenna power constraints, it is optimal to allocate maximal per-antenna power to those antennas to satisfy the per-antenna power constraints. The remaining power is divided amongst the other antennas whose optimal allocation follows from a reduced joint sum and per-antenna power constraints problem of smaller channel coefficient dimension and reduced sum power constraint. Finally, the theoretical results are illustrated by numerical examples.

In this paper, an energy flow control strategy to reduce the smart meter privacy leakage is studied. The considered smart grid is equipped with an energy storage device. The privacy leakage is modeled as optimal Bayesian detections on the behaviors of the consumer made by an authorized adversary. To evaluate the privacy risk, a Bayesian detection-operational privacy leakage metric is proposed. The design of an optimal privacy-preserving energy control strategy can be formulated as a belief state MDP problem. Therefore, standard methods and algorithms can be utilized to obtain or to approximate the optimal control strategy. A simplified problem to design an instantaneous optimal privacy-preserving control strategy is also considered. It is shown that the problem of the instantaneous optimal control strategy design can be formulated as a set of linear programmings.