MétaCan
Menu
Back to cohort
Record W1982530805 · doi:10.4236/ijcns.2010.36070

Nonlinear Blind Equalizers: NCMA and NMCMA

2010· article· en· W1982530805 on OpenAlexaff
Donglin Wang, Sandeep Chandana

Bibliographic record

VenueInternational Journal of Communications Network and System Sciences · 2010
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsNonlinear systemQuadrature amplitude modulationConstant (computer programming)MathematicsAlgorithmMean squared errorModulusSquare (algebra)Control theory (sociology)Mathematical optimizationApplied mathematicsComputer scienceBit error rateStatisticsGeometryArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

This paper proposes two nonlinear blind equalizers: the nonlinear constant modulus algorithm (NCMA) and the nonlinear modified constant modulus algorithm (NCMA) by applying a nonlinear transfer function (NTF) into constant modulus algorithm (CMA) and modified constant modulus algorithm (MCMA), respectively. The effect of the NTF on CMA and MCMA is theoretically analyzed, which implies that the NTF can make their decision regions much sharper so that the proposed two nonlinear blind equalizers are more robust against the convergency error compared to their linear counterparts. The embedded single layer in NCMA and NMCMA simultaneously guarantees a comparably speedy convergency. On 16-quadrature amplitude modulation (QAM) symbols, computer simulations show that NCMA achieves an 8dB lower convergency mean square error (MSE) than CMA, and NMCMA achieves a 15dB lower convergency MSE than MCMA.

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.002
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.911
Threshold uncertainty score0.611

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0030.001
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.040
GPT teacher head0.346
Teacher spread0.306 · 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 designTheoretical or conceptual
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

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Communications Network and System SciencesSame topicBlind Source Separation TechniquesFrench-language works237,207