#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and the output sequences. For the deletion channel, we consider two different models: i.i.d. deletion-substitution channel… (More)

— We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound,… (More)

Memoryless channels with deletion errors as defined by a stochastic channel matrix allowing for bit drop outs are considered in which transmitted bits are either independently deleted with probability d or unchanged with probability 1 − d. Such channels are information stable, hence their Shannon capacity exists. However, computation of the channel capacity… (More)

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN) etc. More precisely, we show that if the channel with synchronization errors can be decomposed into a cascade of two… (More)

— We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. We offer a different look at these channels by considering equivalent models by fragmenting the input sequence where different… (More)

—A relay communication system with two amplify and forward (AF) relays under flat fading channel conditions is considered where the signals received from the relays are not necessarily time aligned. We propose a new time-reversal (TR)-based scheme providing an Alamouti code structure which needs a smaller overhead in transmitting every pair of data blocks… (More)

—In cooperative UWA systems, due to the low speed of sound, a node can experience significant time delays among the signals received from geographically separated nodes. One way to combat the asynchronism issues is to employ orthogonal frequency division multiplexing (OFDM)-based transmissions at the source node by preceding every OFDM block with an… (More)