Search

In this work the multiantenna bidirectional broadcast channel under channel uncertainty is studied. This problem is motivated by the broadcast phase of the decode-and-forward bidirectional relaying protocol, where a relay node establishes a bidirectional communication between two other nodes while having only imperfect channel state information available. Different uncertainty models are investigated, where the nominal channels experience either a multiplicative or additive perturbation based on a spectral norm constraint. For these uncertainty models the corresponding capacity regions of the multiantenna bidirectional broadcast channel are analyzed. Further, robust transmit strategies are characterized and worst-case perturbations are identified., QC 20120625

A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between the users. The secret key agreement is established using the correlated sources and the GDMMAC. In this setup, inner and outer bounds of the secret key capacity region are investigated. Moreover, for a special case where the channel inputs and outputs and the sources form Markov chains in some order, the secret key capacity region is derived. Also a Gaussian case is considered in this setup., QC 20130115

We consider the source coding problem of computing functions of correlated sources, which is an extension of the Slepian - Wolf coding problem. We observe that all the discrete functions are in fact restrictions of polynomial functions over some finite field. Based on this observation, we demonstrate how to use Elias' Lemma to enlarge the coding rate region (compared to the Slepian - Wolf region) for a certain class of polynomial functions. We present a classification result about polynomial functions regarding this coding problem. The result is conclusive in the two-sources scenario and, in fact, gives another interpretation of a result by Han and Kobayashi [1, Theorem 1]., QC 20121115

We study secret-key agreement over a non-coherent block-fading multiple input multiple output (MIMO) wiretap channel. We give an achievable scheme based on training and source emulation and analyze the rate in the high SNR regime. Based on this analysis we find the optimal number of antennas to use for training. Our main result is that if the sum of the number of antennas at Alice and Bob is larger than the coherence time of the channel, the achievable rate does not depend on the number of antennas at Eve. In this case source emulation is not needed, and using only training is optimal. We also consider the case when there is no public channel available. In this case we show that secret-key agreement is still possible by using the wireless channel for discussion, giving the same number of secure degrees of freedom as in the case with a public channel., QC 20130220

For compressive sensing, we endeavor to improve the atom selection strategy of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlying support set progressively through iterations, we use a least squares solution based atom selection method. From a set of promising atoms, the choice of an atom is performed through a new method that uses orthogonal projection along-with a standard matched filter. Through experimental evaluations, the effect of projection based atom selection strategy is shown to provide a significant improvement for the support set recovery performance, in turn, the compressive sensing recovery., QC 20120803

We consider a problem of constrained multi-stage coding for channels with a rewrite option. It is a natural extension of Weissman's channels with action-dependent states to the multistage coding case where an encoder in each stage observes its own message as well as all previous-stage messages, inputs, and outputs. In addition to decoding all messages at the final stage, the new reconstruction constraint introduced in Sumszyk and Steinberg's information embedding with reversible stegotext is imposed on the problem such that the decoder is required to be able to reconstruct all channel input sequences reliably. The complete characterization of the channel capacity region is given for the two-stage case, while the inner and outer bounds to the capacity regions for the cases of three or more stages are provided. For the two-stage case, a discussion regarding the rate constraint of the message in the second stage is also given in which we can draw a connection to the two-stage coding condition which appears in our previous study on channel with action-dependent state and reversible input., QC 20121119

We consider a pair of secondary nodes (SU) coupled, in Z-topology, with multiple pairs of primary nodes (PU). The secondary (cognitive) transmitter is combining beamforming with orthogonal space-time block coding (BOSTBC) and operates under Quality-of-Service (QoS) constraints that must be guaranteed for the primary receivers (PURx). The cognitive link is designed assuming imperfect channel state information (CSI) for all links, available at the SU transmitter (SUTx). Under this premise we characterize the optimal design in terms of CSI quality and interference and evaluate their impact on the performance of BOSTBC transmission in underlay cognitive networks., QC 20130116

We investigate the design of optimized input distributions for the two-hop Gaussian relay channel under an average power constraint. In our study, the relay is confined to implement an estimate-and-forward strategy. We demonstrate that the rate achievable by an optimized discrete input distribution can significantly outperform that achievable by a Gaussian codebook. The lower bound obtained by the optimized EF scheme is also used to establish an improved lower bound on the rates achievable by compress-and-forward., QC 20130122

The remote stabilization of a first order linear plant over a wireless channel is studied. The plant is assumed to have an arbitrary distributed initial state and the wireless channel between the plant's sensor and the controller is modeled as a white Gaussian channel subject to an external interference signal. In order to combat the interference a dedicated sensor (relay) node is deployed adjacent to the interferer, which relays the interference information to both the plant's sensor and the controller. The sensor and the controller utilize this information to mitigate interference. We use delay-free linear sensing and control scheme in order to derive sufficient conditions for mean square stability. The achievable stability region significantly enlarges with the relay assisted interference cancelation scheme. Moreover the effect of interference can be completely eliminated if the encoder knows all the future values of the interference., QC 20130218

We investigate the design and performance of spatially-coupled rateless codes. A modified encoding process is introduced for spatially-coupled Luby Transform (SCLT) codes which leads to an almost regular variable-node degree distribution at the encoding graph. The proposed SCLT codes outperform its counterparts significantly over binary erasure channels, particularly in the erasure floor region. To further improve the erasure floor performance, the approach of spatial coupling is then extended to Raptor codes by concatenating a high-rate pre-coder to the SCLT codes. It is shown that the spatial coupling improves the convergence threshold of Raptor codes. Different ensembles of spatially-coupled Raptor codes are constructed depending on whether pre-coders and/or LT codes are spatially-coupled. The performance of different ensembles of spatially-coupled Raptor codes is then evaluated and compared based on density evolution, leading to an improved spatially-coupled Raptor code in terms of convergence threshold and lower complexity., QC 20130115

We propose a LDPC Convolutional Code ensemble together with an expanding-window message-passing decoder that asymptotically have anytime properties when used for streaming transmission on the binary erasure channel. We show analytically that the decoding erasure probability of these codes decays exponentially over decoding delay and determine the corresponding anytime exponents., QC 20130118

The two-user discrete memoryless state-dependent multiple-access channel with cooperating encoders is considered. It is assumed that the channel is controlled with two independent states such that each of the channel state information is noncausally available at one encoder. Moreover, based on the intrinsic characteristic of wireless networks, it is assumed that each encoder strictly causally receive a noisy version of the transmitted signal of the other encoder. Hence, the encoders can cooperate in transmitting the message to the receiver. An achievable rate region for the channel is derived by use of rate splitting, block Markov encoding and Gelfand-Pinsker multilevel encoding along with partial decoding at the encoders and backward decoding at the receiver. Finally, for a Gaussian channel model the proposed achievable rate region is evaluated and discussed., QC 20130118

We propose a new unequal error protection (UEP) scheme for Luby Transform (LT) codes over additive white Gaussian noise (AWGN) channels. In contrast to the state-of-the-art UEP scheme for LT codes where the effective code rates are exploited for UEP, we characterize the variable-node degree distribution to achieve UEP for LT codes. For performance analysis, we compare the lower bounds on bit error rate for our proposed scheme and a conventional UEP-based LT codes over AWGN channels for various parameters. Moreover, it is demonstrated through numerical examples that our proposed UEP scheme has better performance than the conventional UEP-based LT codes over a wide range of code rates and channel conditions., QC 20130116

We propose Gaussian process dynamical models (GPDMs) as a new, nonparametric paradigm in acoustic models of speech. These use multidimensional, continuous state-spaces to overcome familiar issues with discrete-state, HMM-based speech models. The added dimensions allow the state to represent and describe more than just temporal structure as systematic differences in mean, rather than as mere correlations in a residual (which dynamic features or AR-HMMs do). Being based on Gaussian processes, the models avoid restrictive parametric or linearity assumptions on signal structure. We outline GPDM theory, and describe model setup and initialization schemes relevant to speech applications. Experiments demonstrate subjectively better quality of synthesized speech than from comparable HMMs. In addition, there is evidence for unsupervised discovery of salient speech structure., QC 20120308, LISTA

We propose Gaussian process dynamical models (GPDMs) as a new, nonparametric paradigm in acoustic models of speech. These use multidimensional, continuous state-spaces to overcome familiar issues with discrete-state, HMM-based speech models. The added dimensions allow the state to represent and describe more than just temporal structure as systematic differences in mean, rather than as mere correlations in a residual (which dynamic features or AR-HMMs do). Being based on Gaussian processes, the models avoid restrictive parametric or linearity assumptions on signal structure. We outline GPDM theory, and describe model setup and initialization schemes relevant to speech applications. Experiments demonstrate subjectively better quality of synthesized speech than from comparable HMMs. In addition, there is evidence for unsupervised discovery of salient speech structure., QC 20120308, LISTA

We propose Gaussian process dynamical models (GPDMs) as a new, nonparametric paradigm in acoustic models of speech. These use multidimensional, continuous state-spaces to overcome familiar issues with discrete-state, HMM-based speech models. The added dimensions allow the state to represent and describe more than just temporal structure as systematic differences in mean, rather than as mere correlations in a residual (which dynamic features or AR-HMMs do). Being based on Gaussian processes, the models avoid restrictive parametric or linearity assumptions on signal structure. We outline GPDM theory, and describe model setup and initialization schemes relevant to speech applications. Experiments demonstrate subjectively better quality of synthesized speech than from comparable HMMs. In addition, there is evidence for unsupervised discovery of salient speech structure., QC 20120308, LISTA

We propose Gaussian process dynamical models (GPDMs) as a new, nonparametric paradigm in acoustic models of speech. These use multidimensional, continuous state-spaces to overcome familiar issues with discrete-state, HMM-based speech models. The added dimensions allow the state to represent and describe more than just temporal structure as systematic differences in mean, rather than as mere correlations in a residual (which dynamic features or AR-HMMs do). Being based on Gaussian processes, the models avoid restrictive parametric or linearity assumptions on signal structure. We outline GPDM theory, and describe model setup and initialization schemes relevant to speech applications. Experiments demonstrate subjectively better quality of synthesized speech than from comparable HMMs. In addition, there is evidence for unsupervised discovery of salient speech structure., QC 20120308, LISTA

We investigate the error floor performance of Luby Transform (LT) codes over the additive white Gaussian noise channel. We first derive a lower bound on the bit error rate for an LT code, which we subsequently use to show that the corresponding error floor is predominantly caused by low-degree variable nodes. Based on this observation, we propose a modified encoding scheme for LT codes that provides a lower error floor with no increase in encoding and decoding complexities. The convergence behavior of the proposed scheme is analyzed using extrinsic information transfer charts, and shown to be similar to the original LT code. Numerical examples demonstrate the improvements of the modified LT code as a stand-alone code and as a component code of a Raptor code., QC 20120206

We consider a base-station broadcasting a set of order-insensitive packets to a user population over packet-erasure channels. To improve efficiency we propose a relay-aided transmission scheme using instantaneously-decodable binary network coding. Our proposed scheme ensures that a coded packet can be immediately decoded at the user side without delay. Moreover, only binary operations are required in the encoding and decoding processes, which decrease the computational complex. We further analyze the performance of the resulting broadcast scheme, and show that significant improvements in transmission efficiency are obtained as compared to previously proposed ARQ and network-coding-based schemes., QC 20120228

We study network coding for wireless networks with finite channel state information (CSI) at intermediate nodes (relays). Based on the CSI of the relay-sink channels, we adapt the network codes at the relays. For a specific network with two sources, four relays and two sinks, the analytic results show that one bit CSI of all relay-sink channels (global CSI) can reduce complexity (field size), and simultaneously decrease the erasure probability. Then, we generalize the results to relay networks with M users, N relays and J sinks. We show that fixed network codes without CSI cannot achieve instantaneous min-cut, i.e., min-cut under current channel state. We also show that with one bit global CSI, we can achieve instantaneous min-cut by adapting the network codes using an alphabet size L, where L is the number of sinks connecting to a relay. Yet, the fixed MDS network codes use an alphabet size L(M-1N-1). For the networks with perfect or imperfect source-relay channels, adaptive network codes with one bit global CSI have lower erasure probability than the codes without CSI. Thus, one bit global CSI can reduce the erasure probability, and simultaneously reduce coding complexity., QC 20120416

In distributed storage systems reliability is achieved through redundant storage nodes distributed in the network. Then a data collector can recover source information even if some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to reconstruct the failed node. Therepairprocess causes traffic in the network. Recent results in e.g., [1], [2] found the optimal traffic-storage tradeoff, and proposed regenerating codes to achieve the optimality. We investigate the link costs and the impact of network topologies during therepairprocess. We formulate the minimum costrepairproblem in joint and decoupled methods. We investigate the required field size for the joint method. For the decoupled method, we show that the optimization problem is linear for the linear cost. We further show that the cooperation of surviving nodes could efficiently exploit the network topology and reduce therepaircost. The numerical results in tandem, star and grid networks show the benefits of our methods in term of the repair cost., QC 20120208

A class of semi-deterministic relay channels is introduced and it is shown that for channels in the class capacity can be achieved using an instantaneous relaying scheme. Applications to Gaussian channels are then discussed., QC 20120203

In this work, we study the MIMO Gaussian bidirectional broadcast channel (BBC) with common message and characterize the capacity region. Moreover, we show that the transmit covariance matrix optimization problem has the same structure as the corresponding optimization problem of the BBC without common message which leads to the comfortable position to transfer results from one scenario to the other. This problem is motivated by the concept of bidirectional relaying in a three-node network, where a half-duplex relay node establishes a bidirectional communication between two other nodes and thereby adds an own multicast message to the communication., QC 20111219

We determine the rate region of a source coding problem with common reconstruction and action-dependent side information where an action sequence is taken by an encoder over a rate-limited link. We show that the rate region depends only on the sum-rate and the sum-rate distortion and cost function is characterized. The result serves as a fundamental limit in transmission scenarios where the encoder wants to control and monitor the quality of the decoder's reconstruction via the respective uses of action sequences and a common reconstruction constraint., QC 20111117

We design non-codebook-based Multiple-Input Multiple-Output (MIMO) precoding schemes using multiple cell-specific reference signals patterns for the time division duplex (TDD) mode of LTE, where channel reciprocity can be exploited. Previously proposed non-codebook-based precoding schemes typically use UE specific reference signals for demodulation. Cell specific reference signals are however always allocated for the transmission of common control signalling, mobility measurements and downlink channel quality measurements. In order to save the resources occupied by UE specific reference signals, and to simplify UE implementation, a precoder-estimation scheme and a codebook-assisted scheme are designed. The codebook-assisted scheme has the novelty of using a codebook in equalization. Link throughput simulations indicate that the codebook-assisted scheme is preferable compared to the precoder-estimation scheme and the scheme using UE specific reference signals in scenarios with moderate UE velocity., QC 20140901

We study the effect of power adaptation on the outage diversity of Incremental-redundancy automatic-repeat-request (INR-ARQ) transmission over the multi-input multi-output (MIMO) block-fading channel. In particular, we derive the optimal outage diversity achieved by power adaptation in INR-ARQ systems, and show that power adaptation provides significant gains in outage diversity. We also prove that the optimal outage diversity is achievable with random coding schemes., QC 20120216

We consider multi-constrained power, rate and channelallocation crafted for low power consumption, delaytolerant traffic, and under interfering link conditions thatmay be used in a cognitive radio system. Specifically, aniterative distributed algorithm, based on a sum-powerconstrained sum-rate maximization with upper (andlower) per user and channel power and rate constraints,as well as upper per user sum-power and sum-rateconstraints is developed. The feasibility and performanceof the algorithm is demonstrated by simulation in acellular system. Simulations show that the multipleconstraints are handled while improving the sum-rate vs. sum-power relative an “equal power adaptive rate” RRM approach., © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Qc 20120203

We consider multi-constrained power, rate and channelallocation crafted for low power consumption, delaytolerant traffic, and under interfering link conditions thatmay be used in a cognitive radio system. Specifically, aniterative distributed algorithm, based on a sum-powerconstrained sum-rate maximization with upper (andlower) per user and channel power and rate constraints,as well as upper per user sum-power and sum-rateconstraints is developed. The feasibility and performanceof the algorithm is demonstrated by simulation in acellular system. Simulations show that the multipleconstraints are handled while improving the sum-rate vs. sum-power relative an “equal power adaptive rate” RRM approach., © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Qc 20120203

We consider multi-constrained power, rate and channelallocation crafted for low power consumption, delaytolerant traffic, and under interfering link conditions thatmay be used in a cognitive radio system. Specifically, aniterative distributed algorithm, based on a sum-powerconstrained sum-rate maximization with upper (andlower) per user and channel power and rate constraints,as well as upper per user sum-power and sum-rateconstraints is developed. The feasibility and performanceof the algorithm is demonstrated by simulation in acellular system. Simulations show that the multipleconstraints are handled while improving the sum-rate vs. sum-power relative an “equal power adaptive rate” RRM approach., © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Qc 20120203

We consider multi-constrained power, rate and channelallocation crafted for low power consumption, delaytolerant traffic, and under interfering link conditions thatmay be used in a cognitive radio system. Specifically, aniterative distributed algorithm, based on a sum-powerconstrained sum-rate maximization with upper (andlower) per user and channel power and rate constraints,as well as upper per user sum-power and sum-rateconstraints is developed. The feasibility and performanceof the algorithm is demonstrated by simulation in acellular system. Simulations show that the multipleconstraints are handled while improving the sum-rate vs. sum-power relative an “equal power adaptive rate” RRM approach., © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Qc 20120203

We consider multi-constrained power, rate and channelallocation crafted for low power consumption, delaytolerant traffic, and under interfering link conditions thatmay be used in a cognitive radio system. Specifically, aniterative distributed algorithm, based on a sum-powerconstrained sum-rate maximization with upper (andlower) per user and channel power and rate constraints,as well as upper per user sum-power and sum-rateconstraints is developed. The feasibility and performanceof the algorithm is demonstrated by simulation in acellular system. Simulations show that the multipleconstraints are handled while improving the sum-rate vs. sum-power relative an “equal power adaptive rate” RRM approach., © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Qc 20120203

We consider block length optimization for collaborative transmit diversity using a decode-and-forward protocol assuming that the source and the relay have access to the magnitudes of all path gains. Moreover, we propose a simple scheme which requires only one bit of channel state information (CSI) feedback. We analyze the outage probabilities of all schemes for both selection combining and maximum ratio combining (MRC) at the destination. Analytical results show that even one bit of CSI feedback can provide a significant gain over conventional (non-adaptive) collaborative schemes., QC 20101118

We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm., © 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We present a symbol-by- symbol approach to the problem of canceling known interference at the transmitter in a communication system. In the envisioned system, the modulator maps an information symbol (taken from a finite alphabet) and an interference symbol (from the complex field) onto a transmitted constellation point. The demodulator picks the information symbol (as a function of the received symbol) which minimizes the average error probability. We find the optimal modulator-demodulator pair, in the minimum-probability-of-symbol-error sense, via an iterative optimization procedure, for fixed average transmit power. We illustrate that the new scheme can perform close to the no-interference bound, and in particular that it outperforms Tomlinson-Harashima precoding, which is a classical but suboptimal solution to the problem under study., QC 20110207

In recent analyses of multiuser MIMO systems and their capacity achieving transmit strategies, Gaussian codebooks; are usually used. For the case in which the input signals are constrained to belong to a finite constellation, we study and explain two effects, namely Multiuser Gaussianity (MuG) and constellation randomization (CoRa). MuG means that the more users transmit simultaneously, the higher is the similarity of the received density to the optimal Gaussian one. Hence, the instantaneous mutual information is increased by MuG. This leads to a tradeoff between multiuser diversity and MuG. On the other hand, CoRa is done by linear precoding by random unitary matrices. Based on the observations from MuG, we explain why the outage capacity is increased by CoRa. The effects are illustrated by various numerical simulations., QC 20141028

We study the maximum a posteriori probability model order selection algorithm for linear regression models, assuming Gaussian distributed noise and coefficient vectors. For the same data model, we also derive the minimum mean-square error coefficient vector estimate. The approaches are denoted BOSS (Bayesian Order Selection Strategy) and BPM (Bayesian Parameter estimation Method), respectively. Both BOSS and BPM require a priori knowledge on the distribution of the coefficients. However, under the assumption that the coefficient variance profile is smooth, we derive "empirical Bayesian" versions of our algorithms, which require little or no information from the user. We show in numerical examples that the estimators can outperform several classical methods, including the well-known AIC and BIC for order selection., QC 20141121

We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm., © 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm., © 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm., © 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm., © 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216