MétaCan
Menu
Back to cohort
Record W2129166049 · doi:10.1109/ccece.2004.1347727

A low-power 5 Mb/s turbo decoder for third-generation wireless terminals

2004· article· en· W2129166049 on OpenAlexaff
I. Ai-Mohandes, M. Elmasry

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSoft-decision decoderComputer scienceTurbo equalizerTurbo codeViterbi decoderVHDLDecoding methodsThroughputTurboCMOSComputer hardwareWirelessReal-time computingElectronic engineeringAlgorithmField-programmable gate arrayTelecommunicationsEngineeringConcatenated error correction codeBlock code

Abstract

fetched live from OpenAlex

In this work, a rate-1/3 8-state log-MAP turbo decoder architecture for third-generation (3G) wireless high-speed data terminals is designed. The simplified log-MAP algorithm is used for the component soft-in soft-out (SISO) decoder. Several architectural and logic level techniques are applied through the design process to reduce area, power consumption, and increase throughput of the turbo decoder. The design is done in stages, each one applying different design techniques. The turbo decoder is written in VHDL, mapped and optimized into 0.18 /spl mu/m CMOS technology. The synthesized decoder has a core area of about 0.6 mm/sup 2/. It works at a maximum clock frequency of 100 MHz achieving data rates of up to 5 Mbit/s with 5 decoding iterations. The decoder consumes about 63 mW of power, hence, it has an energy efficiency of about 2.5 nJ/b/iteration.

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.

How this classification was reachedexpand

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.765
Threshold uncertainty score0.579

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.017
GPT teacher head0.267
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations7
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207