Manufacturing Engineer
DOI: 10.1109/itw.2004.1405304
|View full text |Cite
|
Sign up to set email alerts
|

Generalized belief propagation receiver for near-optimal detection of two-dimensional channels with memory

Abstract: -We propose a generalized belief propagation (GBP) receiver for two-dimensional (2-D) channels with memory, which is applicative to 2-D intersymbol interference (ISI) equalization and multi-user detection (MUD). Our experimental study demonstrates that under non-trivial interference conditions, the performance of this fully tractable GBP receiver is almost identical to the performance of the optimal maximum a-posteriori (MAP) receiver.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

3
63
0
3

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 45 publications
(69 citation statements)
references
References 9 publications
3
63
0
3
Order By: Relevance
“…Many researchers have proposed 2-D ISI channel detection schemes models, [34,35,[37][38][39][40][41][42]. Singla et al have proposed joint equalization and decoding schemes for 2-D ISI discrete channels, and this is the channel model used in this paper for where the input to this channel is 2-D matrix of size (L 1 × L 2 ).…”
Section: Two-dimensional Channel Modelmentioning
confidence: 99%
“…Many researchers have proposed 2-D ISI channel detection schemes models, [34,35,[37][38][39][40][41][42]. Singla et al have proposed joint equalization and decoding schemes for 2-D ISI discrete channels, and this is the channel model used in this paper for where the input to this channel is 2-D matrix of size (L 1 × L 2 ).…”
Section: Two-dimensional Channel Modelmentioning
confidence: 99%
“…In its implementation, the sum-product algorithm carries out a forward recursion through the chain computing a set of forward messages M k ki→ki+1 x ki+1 for i = 1, ..., n t − 1, and a backward recursion through the chain computing a set of backward messages M k ki+1→ki x ki for i = n t − 1, ..., 1. The formulae for these forward-backward recursions are given below in (10) and (11). Note that from here onwards, for brevity of presentation, we usually choose not to indicate the arguments 1 using the terminology of [18] of functions such as the potentials, beliefs and messages.…”
Section: A the Trp Mimo Detectormentioning
confidence: 99%
“…In this work, since the problem of calculating the APPs is a one of calculating the node beliefs on a graphical model [11], we exploit recently developed sub-optimal algorithms which avoid the combinatorial complexity described above. In this paper, the probability distributions of concern are represented by undirected graphical models (UGM) [12].…”
mentioning
confidence: 99%
“…BP is a simple, yet highly effective, technique that has been successfully employed in a variety of applications including computational biology, statistical signal/image processing, etc. BP is well suited in several communication problems as well [9]; e.g., decoding of turbo codes and LDPC codes [10], [11], multiuser detection [12], [13], signal detection in ISI channels [14], [15], and MIMO detection [16], [17]. Recently, in [18], Wo and Hoeher has adopted BP for equalization in severely delayspread MIMO-ISI channels, using message passing on factor graphs.…”
Section: Introductionmentioning
confidence: 99%