MétaCan
Menu
Back to cohort
Record W2073350441 · doi:10.1002/ett.1169

Vector quantisation for finite‐state Markov channels and application to wireless communications

2007· article· en· W2073350441 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueEuropean Transactions on Telecommunications · 2007
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Manitoba
FundersUniversity of Manitoba
KeywordsDecoding methodsAlgorithmFadingChannel (broadcasting)Maximum a posteriori estimationComputer scienceMarkov chainChannel state informationMarkov processMarkov modelWirelessHidden Markov modelElectronic engineeringSpeech recognitionMathematicsTelecommunicationsEngineeringStatisticsMaximum likelihood

Abstract

fetched live from OpenAlex

Abstract Vector quantisation for joint source‐channel (JSC) coding over a finite‐state Markov channel (FSMC) is studied. In particular, minimum mean square error (MMSE) decoding of a vector quantised source in the absence of channel state information (CSI) is considered. Based on hidden Markov modelling of the channel output, two decoding strategies are proposed. The first one is a soft‐decoder which estimates the source reconstruction vectors directly from a sequence of channel output samples. The second one is a hard‐decoder based on joint maximum a posteriori (MAP) probability estimation of channel symbols and channel states. An iterative procedure for designing JSC optimised vector quantisers (VQs) is also proposed. Finally, the design of VQs for wireless channels using a finite‐state model is examined. Experimental results are provided for a Gauss‐Markov source and flat‐fading wireless channels. A comparison with an idealised tandem source‐channel coding system is also provided to demonstrate the advantage of the proposed JSC coding approach. Copyright © 2007 John Wiley & Sons, Ltd.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.961
Threshold uncertainty score0.991

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0030.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.026
GPT teacher head0.303
Teacher spread0.277 · 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