Synchronous Bounded Delay Coding for Input Restricted Channels

نویسنده

  • Peter A. Franaszek
چکیده

Consider the class of input restricted channels whose constraints can be modelled by$nite state machines. This paper treats the problem o f constructing3xed rate (synchronous) codes for such channels subject to a constraint that the coding delay be bounded by a parameter M. M is the maximum number o f information symbols required by the coder in choosing a word during transmission. 1. Introduction In many digital transmission and recording systems, considerations such as spectral shaping, self-timing, and limitations on intersymbol interference require that, before modulation, the data be mapped onto a sequence with special properties. Such suitable sequences often define discrete noiseless channels of the type considered by Shannon [l] in which restrictions are represented by finite state sequential machines. In practice, a common additional requirement is that the encoding of the binary data onto the channel sequence must be synchronous. By this is meant that the bit per symbol ratio (the coding rate) is constant over each word.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control

In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...

متن کامل

Multi-input multi-output fading channel tracking and equalization using Kalman estimation

This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-variant frequencyselective channels. These channels model the corrupting effects of intersymbol interference (ISI), co-channel interference (CCI), and noise. A firstorder autoregressive model describes the MIMO channel variation, and tracking is performed by a Kalman filter. Hard decis...

متن کامل

Gaussian Z Channel with Intersymbol Interference

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...

متن کامل

Implementing Diamond P with Bounded Messages on a Network of ADD Channels

We present an implementation of the eventually perfect failure detector (♦P ) from the original hierarchy of the Chandra-Toueg [4] oracles on an arbitrary partitionable network composed of unreliable channels that can lose and reorder messages. Prior implementations of ♦P have assumed different partially synchronous models ranging from bounded point-to-point message delay and reliable communica...

متن کامل

An implementation of Elias coding for input-restricted channels

An implementation of Elias coding for input-restricted channels is presented and analyzed. This is a variable-to-fixed length coding method that uses finite-precision arithmetic and can work at rates arbitrarily close to channel capacity as the precision is increased. The method offers a favorable tradeoff between complexity and coding efficiency. For example, in experiments with the [2, 71 run...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IBM Journal of Research and Development

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1980