Molecular communication in fluid media: The additive inverse Gaussian noise channel

KV Srinivas, AW Eckford… - IEEE transactions on …, 2012 - ieeexplore.ieee.org
In this paper, we consider molecular communication, with information conveyed in the time
of release of molecules. These molecules propagate to the transmitter through a fluid …

Finite-state Markov modeling of fading channels-a survey of principles and applications

P Sadeghi, RA Kennedy, PB Rapajic… - IEEE Signal …, 2008 - ieeexplore.ieee.org
This article's goal is to provide an in-depth understanding of the principles of FSMC
modeling of fading channels with its applications in wireless communication systems. While …

[HTML][HTML] Decoding of linear codes for single error bursts correction based on the determination of certain events

AA Ovchinnikov, AM Veresova… - Информационно …, 2022 - cyberleninka.ru
Introduction: In modern systems for communication, data storage and processing the error-
correction capability of codes are estimated for memoryless channels. In real channels the …

Contention-free interleavers for high-throughput turbo decoding

A Nimbalker, TK Blankenship, B Classon… - IEEE Transactions …, 2008 - ieeexplore.ieee.org
This paper presents a low-complexity interleaver design that facilitates the high throughput
turbo decoding required for next generation wireless systems. Specifically, it addresses the …

Convolutionally coded transmission over Markov-Gaussian channels: Analysis and decoding metrics

J Mitra, L Lampe - IEEE Transactions on Communications, 2010 - ieeexplore.ieee.org
It has been widely acknowledged that the aggregate interference at the receiver for various
practical communication channels can often deviate markedly from the classical additive …

On designing good LDPC codes for Markov channels

AW Eckford, FR Kschischang… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
This paper presents a reduced-complexity approximate density evolution (DE) scheme for
low-density parity-check (LDPC) codes in channels with memory in the form of a hidden …

Universal algorithms for channel decoding of uncompressed sources

E Ordentlich, G Seroussi, S Verdú… - IEEE transactions on …, 2008 - ieeexplore.ieee.org
In many applications, an uncompressed source stream is systematically encoded by a
channel code (which ignores the source redundancy) for transmission over a discrete …

Modeling fading channels with binary erasure finite-state Markov channels

I Moreira, C Pimentel, FP Barros… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Finite-state Markov channels (FSMCs) are commonly used to characterize the memory of
binary (binary-input, binary-output) discrete fading channels (DFCs). This paper proposes a …

Comparison of the probability of Reed–Solomon and LDPC codes decoding error in the Gilbert–Elliott channel

AM Veresova, AA Ovchinnikov - 2022 Wave Electronics and its …, 2022 - ieeexplore.ieee.org
Channels with memory can be described using the Gilbert–Elliott model. To correct errors in
such channels, non–binary Reed-Solomon codes are used, as well as low-density parity …

A binary communication channel with memory based on a finite queue

L Zhong, F Alajaji, G Takahara - IEEE transactions on …, 2007 - ieeexplore.ieee.org
A model for a binary additive noise communication channel with memory is introduced. The
channel noise process, which is generated according to a ball sampling mechanism …