MétaCan
Menu
Back to cohort
Record W2167663961 · doi:10.1109/icspcs.2010.5709748

Trellis-Coded Multiple-Access using chirp signalling

2010· article· en· W2167663961 on OpenAlexaff
Ryan Balsdon, Jacek Ilow

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsDalhousie University
Fundersnot available
KeywordsComputer scienceTrellis modulationChirpDemodulationConvolutional codeNarrowbandViterbi algorithmAlgorithmElectronic engineeringDecoding methodsReal-time computingChannel (broadcasting)TelecommunicationsFadingEngineering

Abstract

fetched live from OpenAlex

This paper introduces a novel Trellis Coded Multiple Access (TCMA) technique which takes advantage of Trellis-Coded Modulation (TCM) and signalling set redundancy to differentiate transmissions from different users. The proposed TCMA scheme exploits modulation with memory principles to provide the flexibility of accommodating an increasing number of users within the fixed time-frequency resource. In the scheme, users are assigned unique, code-based trellises employing distinct subsets of generic signals. This paper focuses on the applicability of chirp signalling to TCMA, even though the proposed system can use other types of narrowband modulations, such as FSK or QAM. Specifically, the MA scheme presented in this paper features the assignment of overlapping, dissimilar signal trellises that efficiently occupy the system bandwidth and allow for (i) user identification and (ii) reliable data recovery. Careful design of a chirp signalling scheme and the trellis arches guiding the frequency hopping patterns is conducted to reduce MAI. An effective demodulation algorithm is developed using the Viterbi decoder incorporated with a parallel, iterative MAI cancellation scheme. It is demonstrated with a theoretical analysis and simulations that the proposed scheme achieves an acceptable bit error rate performance for different system configurations.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.897
Threshold uncertainty score0.745

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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0040.001
Research integrity0.0000.001
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.080
GPT teacher head0.352
Teacher spread0.272 · 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 designSimulation or modeling
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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207