MétaCan
Menu
Back to cohort
Record W2170373566 · doi:10.1109/acssc.2009.5470207

CORDIC instruction set extensions for matrix decompositions on Software Defined Radio processors

2009· article· en· W2170373566 on OpenAlexaff
Murugappan Senthilvelan, Mihai Sima, Daniel Iancu, Javier Hormigo, Michael Schulte

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCORDICComputer scienceSoftware-defined radioSingular value decompositionDigital signal processingWirelessOverhead (engineering)Digital signal processorQR decompositionSoftwareSet (abstract data type)Instruction setMatrix decompositionDecompositionEmbedded systemParallel computingComputer engineeringComputer architectureComputer hardwareAlgorithmField-programmable gate arrayTelecommunicationsOperating system

Abstract

fetched live from OpenAlex

Software Defined Radio (SDR) is favored by the wireless industry as the platform of choice for implementing physical layers of wireless protocols due to its significant benefits of reduced development costs and accelerated time-to-market. However, to attain high spectral efficiency, emerging wireless protocols use increasingly complex two-dimensional techniques that are extremely expensive to implement using conventional Digital Signal Processor (DSP) instruction sets. In this paper, we present COordinate Rotation DIgital Computer (CORDIC) instruction set extensions that speed up the QR Decomposition (QRD) and Singular Value Decomposition (SVD) of complex matrices that are used in several important communication algorithms. The performance benefits are evaluated on the Sandbridge Sandblaster SB3000 low-power, multithreaded SDR processor. The proposed instructions provide significant performance improvements with little hardware overhead, while improving the accuracy of the wireless algorithms under investigation.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.014
Threshold uncertainty score0.047

Distilled classifier scores by category (both heads)

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

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.330
Teacher spread0.304 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations1
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207