Multiple-Access via Turbo Joint Equalization

Moon, Todd K.; Gunther, Jacob H.

doi:10.1109/tcomm.2012.070912.110191

Cited by 6 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We first simulate the performance for a scenario in line with the one considered in [12]: two users (U = 2) each employing BPSK modulation (M = 2). ISI results from symbol timing offsets between the users and a transmit pulse with a duration of four symbol periods (L = 4).…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Soft output MAP equalization of an ISI channel may be accomplished via the BCJR algorithm [16]. This algorithm was extended to the case of joint detection of a desired and co-channel signal in ISI by Moon and Gunther [12]. The algorithm relies on the introduction of state variables m 0 , .…”

Section: A Probability Distributionmentioning

confidence: 99%

“…Let the set A index the variables associated with the strongest channel coefficients. These variables remain a part of the local marginalization as given in (12). The number of variables in the set A will depend on the acceptable complexity in implementation.…”

Section: Approximate Map Detection Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Approximate joint MAP detection of co-channel signals

Jakubisin

Buehrer

2015

MILCOM 2015 - 2015 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-We consider joint detection of co-channel signalsspecifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding is a well known approach for utilizing the error correction code to improve detection performance. However, the joint maximum a posteriori probability (MAP) detector may be prohibitively complex, especially in a multipath channel. In this paper, we present an approximation to the joint MAP detector motivated by a factor graph model of the received signal. The proposed algorithm is designed to approximate the joint MAP detector as closely as possible within the computational capability of the receiver.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: A Probability Distributionmentioning

confidence: 99%

See 1 more Smart Citation

Approximate joint MAP detection of co-channel signals

Jakubisin

Buehrer

2015

MILCOM 2015 - 2015 IEEE Military Communications Conference

View full text Add to dashboard Cite

show abstract

“…A practical receiver for the optimal detection of a desired signal in the presence of a symbol asynchronous CCI signal was first considered in [7] assuming uncoded BPSK and rectangular modulation pulses. More recently, a turbo receiver architecture for quasi-optimal joint maximum-a-posteriori (MAP) co-channel detection was studied in [8]; here, the multiuser detector and the single user decoders are treated as separate concatenated blocks that iteratively exchange soft information. In [9], an approximate joint MAP co-channel detector for interfering multipath transmissions was developed using the factor graph (FG) and sum-product algorithm (SPA) framework.…”

Section: Introductionmentioning

confidence: 99%

“…In [9], an approximate joint MAP co-channel detector for interfering multipath transmissions was developed using the factor graph (FG) and sum-product algorithm (SPA) framework. Neither [8] or [9] consider a receiver that is only interested in a subset of the co-channel signals, as is the case with NCRS*. The general term for this concept is non-unique decoding (NUD).…”

Section: Introductionmentioning

confidence: 99%

Non-coherent rate-splitting for multibeam satellite forward link: practical coding and decoding algorithms

Noels

Moeneclaey

Ramírez

et al. 2020

2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)

View full text Add to dashboard Cite

Non-Coherent Rate-Splitting (NCRS) was recently proposed as a practical multiuser coding and decoding scheme to increase the spectral efficiency of multibeam satellite communication systems. In this paper, we further study the practical realization of NCRS. We propose a modified coding scheme (NCRS*) that is robust to a nonzero time offset among beams. In NCRS*, as opposed to NCRS, the beams send independently channel encoded and modulated waveforms. We asses the performance of NCRS* in terms of the achievable rate region. It is shown that NCRS* performs worse than NCRS, but better than or comparable to other competing schemes, which, as opposed to NCRS*, require flexible bandwidth allocation or perfect synchronization at the transmitter. We also propose a new N-MAP algorithm for the practical implementation of NCRS* receivers. Similar to the existing U-MAP algorithm, N-MAP takes into account the modulation used by, and the time offset between, the signals received from the different beams. In most cases, however, N-MAP has a significantly lower complexity than U-MAP.

show abstract

Soft Linear Algebra Over Noisy GF(q) Matrices

Moon

Gunther

2022

2022 56th Asilomar Conference on Signals, Systems, and Computers

View full text Add to dashboard Cite

Multiple-Access via Turbo Joint Equalization

Cited by 6 publications

References 31 publications

Approximate joint MAP detection of co-channel signals

Approximate joint MAP detection of co-channel signals

Non-coherent rate-splitting for multibeam satellite forward link: practical coding and decoding algorithms

Soft Linear Algebra Over Noisy GF(q) Matrices

Contact Info

Product

Resources

About