Hardware implementation of Max-Log-MAP algorithm based on MacLaurin series for turbo decoder

Shrestha, Rahul; Paily, Roy

doi:10.1109/iccsp.2011.5739373

Search citation statements

Order By: Relevance

Paper Sections

Select...

Performance Analysis Of Turbo Decoder For Different Map Algo1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2018

Publication Types

Select...

Article1

Other1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, the computation of state metrics for log-MAP [4,23] MAP algorithm based on Maclaurin series-based algorithm [24] can be computed as shown in (8) and 9, respectively A = max A1 ′ , A2 ′ + ln 1 + e −|A1 ′ −A2 ′ | (8)…”

Section: Performance Analysis Of Turbo Decoder For Different Map Algomentioning

confidence: 99%

Performance and throughput analysis of turbo decoder for the physical layer of digital‐video‐broadcasting‐satellite‐services‐to‐handhelds standard

Shrestha

Paily

2013

IET Communications

Self Cite

View full text Add to dashboard Cite

Section: Performance Analysis Of Turbo Decoder For Different Map Algomentioning

confidence: 99%

Performance and throughput analysis of turbo decoder for the physical layer of digital‐video‐broadcasting‐satellite‐services‐to‐handhelds standard

Shrestha

Paily

2013

IET Communications

Self Cite

View full text Add to dashboard Cite

“…In hardware applications, the max-log approximation of the ML demapper is commonly used [12]. The number of mathematical computations is reduced w.r.t.…”

mentioning

confidence: 99%

Low-Complexity Lattice Reduction Demapper for Massive Order One-Dimensional Non-Uniform Constellations

Barrueco

Montalbán

Angueira

et al. 2018

2018 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

View full text Add to dashboard Cite

This paper presents a low-complexity demapping method for demodulating M-ary one-dimensional non-uniform constellations. For uniform constellations, there are several algorithms for searching the closest point to the received observation. However, for non-uniform constellations these techniques are not valid. We propose a novel technique based on dividing the non-uniform constellation into lattices of identical dimensions. The value of the received symbol is modified in order to provide an entry to a look-up table where the closest point is stored. This solution provides low complexity for demodulation of the in-phase and quadrature PAMs of the nonuniform constellation. The complexity is O(+ √) while the exhaustive search is O(√). The complexity implications in terms of memory and computations and the system performance are analyzed.

show abstract

Hardware implementation of Max-Log-MAP algorithm based on MacLaurin series for turbo decoder

Cited by 2 publications

References 4 publications

Performance and throughput analysis of turbo decoder for the physical layer of digital‐video‐broadcasting‐satellite‐services‐to‐handhelds standard

Performance and throughput analysis of turbo decoder for the physical layer of digital‐video‐broadcasting‐satellite‐services‐to‐handhelds standard

Low-Complexity Lattice Reduction Demapper for Massive Order One-Dimensional Non-Uniform Constellations

Contact Info

Product

Resources

About