In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

This paper addresses the problem of efficiently transmitting the LSF speech parameters over a noisy channel using vector quantization (VQ). A comparison of some traditional memory VQ methods is performed, where we investigate what gains can be achieved by exploiting interframe correlation. By combining a predictive VQ with a fixed memoryless VQ, called the safety-net, further improvements in pe...

The form of Dueck and Körner’s exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner’s exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and...

In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memory...

We consider the discrete memoryless two-sendertwo-receiver interference channel in the setting where received Channel Encoders ~~~~~~~~~~Decoders signals are sent back to their respective senders. The feedback Encoders xi Yi ~~~~~~~~~~~~U) signals enable each sender to crossly observe certain information j 111 traiismitted by the othelr, add thus facilitate the senders to cooperate in resolving...

There are simple service disciplines where the system time of a tagged customer depends only on the customers arrived to the system earlier (e.g. FIFO) or later (e.g. LIFO) than the tagged one. In this paper we consider single server queueing system with two infinite queues in which the system time of a tagged customer may depend on both the customers arrived to the system earlier and later tha...

The problems of robust stability and stabilization via memoryless state feedback for a class of discrete-time switched singular systems with time-varying delays and linear fractional uncertainties are investigated. By constructing a novel switched Lyapunov–Krasovskii functional, a delay-dependent criterion for the unforced system to be regular, causal and uniformly asymptotically stable is esta...