Pith. sign in

REVIEW 3 cited by

Comments on "Design of fractional-order variants of complex LMS and NLMS algorithms for adaptive channel equalization"

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1802.09252 v2 pith:UIJYVH6L submitted 2018-02-26 math.OC

classification math.OC
keywords algorithmscomplexfractional-ordernlmsvariantsadaptivechannelclms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The purpose of this note is to discuss some aspects of recently proposed fractional-order variants of complex least mean square (CLMS) and normalized least mean square (NLMS) algorithms in ``Design of Fractional-order Variants of Complex LMS and Normalized LMS Algorithms for Adaptive Channel Equalization'' [Nonlinear Dyn. 88(2), 839-858 (2017)]. It is observed that these algorithms do not always converge whereas they have apparently no advantage over the CLMS and NLMS algorithms whenever they converge. Our claims are based on analytical reasoning and are supported by numerical simulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Calculus-based Volterra LMS for Nonlinear Channel Estimation

    math.OC 2019-08 reject novelty 3.0 of 10

    A q-calculus variant of Volterra LMS is presented, but for equal q it is exactly Volterra LMS with a scaled step size, so the claimed improvement is largely a step-size effect.

  2. Chaotic Time Series Prediction using Spatio-Temporal RBF Neural Networks

    stat.ML 2019-08 reject novelty 2.0 of 10

    The proposed spatio-temporal RBF network reduces, by its own equations, to a standard RBF with reindexed hidden units, making the reported accuracy gain an artifact of hyperparameter choices rather than a new architecture.

  3. Spatio-Temporal RBF Neural Networks

    stat.ML 2019-08 reject novelty 2.0 of 10

    A spatio-temporal RBF network, mathematically equivalent to a standard RBF with more hidden units, is reported to identify a nonlinear system with lower MSE, but the comparison uses unequal hyperparameters.

Pith tools