MétaCan
Menu
Back to cohort
Record W2159616897 · doi:10.1109/imtc.2005.1604435

A Simplified Log-MAP Algorithm for Turbo Equalization

2006· article· en· W2159616897 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue2005 IEEE Instrumentationand Measurement Technology Conference Proceedings · 2006
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsTurbo equalizerAlgorithmTurboLogarithmIntersymbol interferenceComputer scienceEqualization (audio)Difference-map algorithmTurbo codeTaylor seriesMathematicsDecoding methodsEngineeringConcatenated error correction code

Abstract

fetched live from OpenAlex

A simplification of the Log-MAP algorithm for turbo equalization is presented. The simplified algorithm is based on the MacLaurin series expansion of the logarithmic term in the Jacobian logarithmic function used in the Log-MAP algorithm. In terms of complexity the proposed algorithm can easily be implemented using adders and comparators as this is the case for the Max-Log-MAP algorithm. Also, simulation results show that the proposed algorithm has performance very close to the Log-MAP algorithm for turbo equalization, even in a high loss intersymbol interference (LSI) channel where there is a wide gap between the performance of the Log-MAP and the Max Log-MAP turbo equalizers

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.857
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.030
GPT teacher head0.255
Teacher spread0.225 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it