Now showing items 1-10 of 17
Optimal Detection of Discrete Markov Sources Over Discrete Memoryless Channels - Applications to Combined Sources-Channel Coding
We consider the problem of detecting a discrete Markov source which is transmitted across a discrete memoryless channel. The detection is based upon the maximum a posteriori (MAP) criterion which yields the minimum probability ...
A Distributed, Object-Oriented Communication Network Simulation Testbed
The Distributed Network Simulation Testbed is a research tool designed to aid users in the modeling and performance analysis of communication protocols. The testbed can be used to model communication networks consisting ...
Feedback Does Not Increase the Capacity of Discrete Channels with Additive Noise
We consider discrete channels with stationary additive noise. We show that output feedback does not increase the capacity of such channels. This is shown for both ergodic and non-ergodic additive stationary channels.
On Optimal Shaping of Multidimensional Constellations - An Alternative Approach to Lattice-Bounded (Voronoi) Constellations
A scheme for the optimal shaping of multidimensional constellations is proposed. This scheme uses some of the ideas from a type of structured vector quantizer originally proposed for the quantization of memoryless sources, ...
The Performance of Focused Error Control Codes
Consider an additive noise channel with inputs and outputs in the field GF (q ) where q > 2; every time a symbol is transmitted over such a channel, there are q - 1 different errors that can occur, corresponding to the q ...
LAN Interconnection by Satellite --- A Literature Review
In this report we give an overview on experiments interconnecting LANs by satellite, which are reported in the technical literature. Most reported scientific experiments have been performed in Europe and Japan, whereas in ...
New Codes and New Approaches for Code Division Multiple Access on Optical Fiber Networks
This thesis concerns the use of optical fiber in a multi-user communication networks. specifically, it considers the use of code-division multiple access (CDMA) techniques that permit many users to share a single optical ...
A Generalized Gilbert-Varshamov Bound Derived via Analysis of a Code-Search Algorithm
This correspondence derives a generalization of the Gilbert- Varshamov bound that is applicable to block codes whose codewords must be drawn from irregular sets; the bound improves by a factor of four a similar result ...
Estimation and Blind Deconvolution of AR Systems with Nonstationary Binary Inputs
The problem of parameter estimation and blind deconvolution of AR systems with independent nonstationary binary inputs is considered. The estimation procedure consists of applying an MA filter (equalizer) to the observed ...
A Communication Channel Modeled on Contagion
We introduce a binary additive communication channel with memory. The noise process of the channel is generated according to the contagion model of George Polya; our motivation is the empirical observation of Stapper et. ...