Search

Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals,each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance., QC 20140103

Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals,each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance., QC 20140103

Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals,each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance., QC 20140103

Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals,each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance., QC 20140103

Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals,each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance., QC 20140103

Serially concatenated continuous phase modulation (SCCPM) systems with ring convolutional codes (CC) are investigated. Both EXIT chart and union bound techniques are used to compare with the simulation results and are used as analysis tools. The latter is for the first time generalized to a non-binary interleaver for a serially concatenated system, where both the order and position of the permuted non-zero symbols have to be considered., QC 20110202

Serially concatenated continuous phase modulation (SCCPM) systems with symbol interleavers are investigated. The transmitted signals are disturbed by additive white Gaussian noise (AWGN). Iterative detection with extrinsic information is used at the receiver side. Compared to bit interleaved SCCPM systems, this scheme shows a substantial improvement in convergence threshold at the price of a higher error floor. In addition to showing this property, we also investigate the underlying reason by error event analysis. In order to estimate bit error rate performance, we generalize traditional union bounds for a bit interleaver to the non-binary interleaver. For the latter, both the order and the position of permuted non-zero symbols have to be considered. From the analysis, some principal properties are presented. Finally some design principles are proposed. The paper concentrates on SCCPM, but the proposed analysis methods and conclusions can be widely used in many other systems such as serially concatenated trellis coded modulation etcetera., QC 200110304 QC 20111108

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the arrival of data is highly variable for most applications. This calls for schemes that exploit both sources of variation. In the homogeneous traffic scenario, dynamic subcarrier scheduling in combination with semantic queueing mechanisms can significantly increase the capacity of an OFDM cell. In a heterogeneous traffic scenario, however, these mechanisms do not simply carry over. Therefore, in this work we study first the performance increase achieved for heterogeneous flows by purely switching from static to dynamic subcarrier scheduling and then introduce a semantic traffic management scheme that improves the achieved performance further by sacrificing the transmission of semantically unimportant video packets for important video packets and for packets related to HTTP., QC 20131213

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the arrival of data is highly variable for most applications. This calls for schemes that exploit both sources of variation. In the homogeneous traffic scenario, dynamic subcarrier scheduling in combination with semantic queueing mechanisms can significantly increase the capacity of an OFDM cell. In a heterogeneous traffic scenario, however, these mechanisms do not simply carry over. Therefore, in this work we study first the performance increase achieved for heterogeneous flows by purely switching from static to dynamic subcarrier scheduling and then introduce a semantic traffic management scheme that improves the achieved performance further by sacrificing the transmission of semantically unimportant video packets for important video packets and for packets related to HTTP., QC 20131213

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the arrival of data is highly variable for most applications. This calls for schemes that exploit both sources of variation. In the homogeneous traffic scenario, dynamic subcarrier scheduling in combination with semantic queueing mechanisms can significantly increase the capacity of an OFDM cell. In a heterogeneous traffic scenario, however, these mechanisms do not simply carry over. Therefore, in this work we study first the performance increase achieved for heterogeneous flows by purely switching from static to dynamic subcarrier scheduling and then introduce a semantic traffic management scheme that improves the achieved performance further by sacrificing the transmission of semantically unimportant video packets for important video packets and for packets related to HTTP., QC 20131213

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the arrival of data is highly variable for most applications. This calls for schemes that exploit both sources of variation. In the homogeneous traffic scenario, dynamic subcarrier scheduling in combination with semantic queueing mechanisms can significantly increase the capacity of an OFDM cell. In a heterogeneous traffic scenario, however, these mechanisms do not simply carry over. Therefore, in this work we study first the performance increase achieved for heterogeneous flows by purely switching from static to dynamic subcarrier scheduling and then introduce a semantic traffic management scheme that improves the achieved performance further by sacrificing the transmission of semantically unimportant video packets for important video packets and for packets related to HTTP., QC 20131213

In this paper we study the performance gain achieved by introducing dynamic subcarrier scheduling schemes to OFDM systems in the presence of heterogeneous traffic streams. Dynamic subcarrier scheduling copes with channel state variation by dynamically assigning different subcarriers to terminals, e.g. in the downlink of a cellular system. In addition to the channel state variations, also the arrival of data is highly variable for most applications. This calls for schemes that exploit both sources of variation. In the homogeneous traffic scenario, dynamic subcarrier scheduling in combination with semantic queueing mechanisms can significantly increase the capacity of an OFDM cell. In a heterogeneous traffic scenario, however, these mechanisms do not simply carry over. Therefore, in this work we study first the performance increase achieved for heterogeneous flows by purely switching from static to dynamic subcarrier scheduling and then introduce a semantic traffic management scheme that improves the achieved performance further by sacrificing the transmission of semantically unimportant video packets for important video packets and for packets related to HTTP., QC 20131213

Analog-to-digital converter additive post-correction using look-up-tables is considered. In a practical post-correction system, the correction values must be stored using limited (fixed-point) precision. In this paper the effects of limited precision in the correction values is investigated. A theory for approximating the SINAD after correction using fixed-point values is presented. The theory shows good agreement when compared with simulation results., NQC

We propose a new strategy for cooperative transmit diversity based on superposition modulation and multiuser detection. The new scheme can outperform "classical" cooperative diversity based on decode-and-forward by about 1.5-2 dB in the SNR range of interest, and at the same computational complexity., QC 20111017

We investigate the low density generator matrix (LDGM) codes for continuous phase modulation (CPM). The nonsystematic version of LDGM codes is used in the scheme. The overall system has linear encoding complexity due to the low complexity of the LDGM codes. A property of the check node degree of the LDGM code is shown. We use the EXIT chart/function to optimize the LDGM codes. The EXIT function of CPM with a fixed SNR (Signal-to-Noise-Ratio) is shown. We derive the union bound to analyze the error floor performance. Design approaches for lowering error floors are suggested from the analysis process. Numerical results show that this scheme converges earlier (lower SNR) than best found serially concatenated CPM (SCCPM) for iterative decoding while maintaining comparable error floors., QC 20110207

A new design approach for multiple description vector quantizers over more than two channels is presented. The design is inspired by the concept of channel optimized vector quantization. While most previous works have split the decoder into several independent entities, identifying the appropriate channel model makes it straightforward to implement the multiple description design problem using only one decoder. Our simulation results compare systems with 2, 4 and 8 channels. We demonstrate significant gains over previous designs, as well as over a benchmark scheme based on separate quantization and forward erasure-correcting error control., QC 20110207

In this paper, we present a computationally efficient sliding window time updating of the Capon and amplitude and phase,estimation (APES) matched filterbank spectral estimators based on the time-variant displacement structure of the data covariance matrix. The presented algorithm forms a natural extension of the most computationally efficient algorithm to date, and offers a significant computational gain as compared to the computational complexity associated with the batch re-evaluation of the spectral estimates for each time-update. Furthermore, via simulations, the algorithm is found to be numerically superior to the time-updated spectral estimate formed from directly updating the data covariance matrix.

Different antenna placements in nonuniform linear arrays for the joint estimation of the range and direction-of-arrival (DOA) of one source are considered. It is shown that the Cramér-Rao bound (CRB) for the range and DOA estimates can be expressed as a function of the angles at which the source sees the antennas. This new formulation of the CRB easily reveals the geometrical properties that the array should have in order to minimise the CRB. Based on the new representation of the CRB, a result found in the literature (which was concerned with the special case of a number of antennas that is divisible by four) is generalised to include the case of an arbitrary number of antennas. Furthermore, it is shown that symmetric arrays are close to uniformly optimal for different DOAs when the range is much larger than the aperture of the arrays., QC 20141203

We investigate the union bound for symbol interleaved serially concatenated codes (SCC) with non-uniform error properties. We calculate the distance spectrum of the SCC using the input difference symbol sequence spectrum (DSSS) of the inner code. Then we modify the trellis search algorithm for general codes to calculate the DSSS. We also show the mapping approach between difference symbols with the different alphabet size. For the symbol interleaver, we use the multinomial coefficient to calculate the probability of the permuted sequence. Numerical results for symbol interleaved serially concatenated continuous phase modulation (SCCPM) show that the bound is tight in the medium to high signal-to-noise ratio (SNR) region., QC 20110207

Designing a communication system using joint source-channel coding in general makes it possible to achieve a better performance than when the source and channel codes are designed separately, especially under strict delay-constraints. The majority of work done in joint source-channel coding uses a discrete channel model, corresponding to an analog channel in conjunction with a hard decision modulation scheme. The performance of such a system can however be improved by using soft decision modulation. The main cost is a higher decoding complexity. An alternative is to quantize the soft information and store the pre-calculated soft decision values in a lookup table. In this paper we propose new methods for quantizing soft channel information, to be used in conjunction with soft-decision source decoding. We achieve a performance close to that of a system using unquantized soft information., QC 20100920

We consider the problem of estimating the optimal reconstruction levels of a quantizer, such as an analog-to-digital converter. A probabilistic transfer function model is applied for the quantizer. Two different assumptions are made for the transfer function, and an estimator based on order statistics is applied. The estimator turns out to give give better results in terms of mean square error than the commonly applied sample mean. The Cramer-Rao lower bound for the estimation problem is also considered, and simulation results indicate that the derived estimator is asymptotically efficient., QC 20110224

A multiple-layer variable-rate system employing quantized feedback to maximize the expected rate over slowly fading channels is studied. The transmitter utilizes partial channel-state information, obtained via an optimized resolution-constrained feedback link, to adapt the power and to assign code layer rates, under different power constraints. We develop an iterative algorithm to optimize the system parameters, which successfully exploits results from the study of parallel broadcast channels. Unlike in the ergodic case, even coarsely quantized feedback improves the expected rate considerably. Our results indicate that with as few as one bit of feedback information, the role of multi-layer coding reduces significantly., QC 20110204

In this article we derive the optimal (soft) RAKE MRC (maximum ratio combiner) under a sparse channel model. In contrast to many previous approaches, we do not separate the problem of channel estimation and symbol detection. Instead we treat the problem of symbol detection given data and a training sequence together. We illustrate the performance of our approach by numerical examples., QC 20141201

We propose a new scheme of serially concatenated continuous phase modulation (SCCPM) by using nonsysternatic low, density. generator matrix (LDGM) codes as the outer code. We use the EXIT chart/function to optimize the LDGM codes. We also show the EXIT function for CPM when the SNR (Signal-to-Noise-Ratio) is fixed. A property of the LDGM code degree is investigated. The union bound is used to analyze the error floor. Numerical results show that this scheme converges earlier (lower SNR) than previous considered SCCPM schemes for iterative decoding., CQ 20110204

We propose a new scheme of serially concatenated continuous phase modulation (SCCPM) by using nonsystematic low density generator matrix (LDGM) codes as the outer code. A property of the LDGM code degree is investigated. We use the EXIT chart/function to optimize the LDGM codes. The EXIT function of CPM with a fixed SNR (Signal-to-Noise-Ratio) is shown. We derive the union bound to analyze the error floor performance. Design principles are proposed from the analysis process. Numerical results show that this scheme converges earlier (lower SNR) than previous SCCPM for iterative decoding., QC 20110207

—In this paper we give a brief introduction to some issues and results regarding ADC post-correction. The emphasis is on signal process-ing aspects of post-correction, including dynamics, estimation and round-off effects., NQC

We consider the design of space-time constellations when the channel state information that is available at the receiver is an estimate of the channel coefficients with known error covariance. This setup encompasses the well-studied scenarios of perfect and no channel knowledge and allows a smooth transition between these two cases. We perform an asymptotic pairwise error probability analysis and derive a criterion to design constellations matched to the level of channel knowledge available at the receiver. Moreover, we use the criterion to assess the power tradeoff between data transmission and channel coefficient acquisition for any given specific set of constellations. Simulation results illustrate the benefit of the proposed criterion., QC 20110207

We consider the design of space-time constellations when the channel state information (CSI) that is available at the receiver is an estimate of the channel coefficients with known error covariance. This setup encompasses the well-studied scenarios of perfect and no channel knowledge and allows a smooth transition between these two cases. We design constellations adapted to the error covariance of the receiver CSI by a suitable combination of constellations proposed for perfectly known and unknown channel at the receiver. Simulations confirm the benefits of the presented design., QC 20110204

We investigate the physical layer bit error probability (BEP) of a network using network coding (coded network). The network consists of statistically independent noisy channels. Thus, transmitted bits are subject to the noise disturbance. An error marking algorithm is given to calculate the error weight (the number of erroneous bits) in the sinks. Then we can calculate the sink BEP of a coded network from the channel BEPs. We formulate the minimizing BEP problem. We show that coding schemes with the same flow may have different sink BEPs. Two approaches are suggested to reduce the complexity., QC 20110224

Analog-to-digital converter additive post-correction using look-up-tables is considered. An accurate expression is provided that predicts the ADC performance after correction. The expression depends on differential nonlinearity, random noise variance, and the numerical precisionof the correction terms. The theory shows good agreement when compared with simulations and experimental converter data., QC 20130610

A simple structure to exploit both long-term and partial short-term channel state information at the transmitter (CSIT) over a family of correlated multiple-antenna channels is proposed. Partial short-term CSIT in the form of a weighting matrix is obtained via a resolution-constrained feedback link, combined with a unitary transformation based on the long-term channel statistics. The feedback link is optimized to maximize the expected achievable rate under different power constraints, using vector quantization techniques. Simulations indicate the benefits of the proposed scheme in all scenarios considered., QC 20110207

The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems. Particular examples are systems comprised of multiple agents. When it comes to coordinately control a group of autonomous mobile agents in order to achieve a common task, communications constraints impose limits on the achievable control performance. Starting from an emerging problem, studied in the robotics and control communities, called consensus or state agreement problem, we characterize the relationship between the amount of information exchanged by the agents and the rate of convergence to the agreement. In particular we show that communication networks that exhibit particular symmetries yield slow convergence, if the amount of information exchanged does not scale with the number of agents. On the other hand, if we allow exchange of logarithmic quantized data, the control performance significantly improves with little growth of the required communication effort., QC 20141112

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant., QC 20110207

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant., QC 20110207

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant., QC 20110207

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant., QC 20110207

We design an optimum modulator for the Costa (dirty-paper) precoding problem under the constraint of a binary signaling alphabet, and assuming the interference symbols belong to a binary constellation. We evaluate the performance of our technique in terms of the mutual information between the channel input and output, and compare it to that of Tomlinson-Harashima precoding (THP) with optimized parameters. We show that our optimal modulator is always better than THP. In many relevant scenarios, the performance difference is significant., QC 20110207

The tradeoff between the diversity and multiplexing gains that can be simultaneously achieved over a slowly fading multiple-antenna channel with partial transmit side information is characterized in a recursive manner. It is assumed that the information rate grows as the long-term average transmit power increases, but does not adapt to the channel state. Partial power control is shown to be instrumental in achieving the optimal tradeoff over such a system. Our results indicate that the diversity gain can be increased considerably even with coarsely quantized channel state information, especially at low multiplexing gains., QC 20101117

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 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 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 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 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 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 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 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 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 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 20101221

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