On the public citation graph
Order of N complexity transform domain adaptive filters
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1049/el:19880514openalex-snapshot
Running DHT and real-time dht analyser
inferredcites →https://doi.org/10.1049/ip-f-2.1992.0046openalex-snapshot
Selection of orthonormal transforms for improving the performance of the transform domain normalised LMS algorithm
inferredcites →https://doi.org/10.1109/31.92880openalex-snapshot
The use of orthogonal transforms for improving performance of adaptive filters
inferredcites →https://doi.org/10.1109/78.277845openalex-snapshot
Generalized sliding FFT and its application to implementation of block LMS adaptive filters
inferredcites →https://doi.org/10.1109/82.204105openalex-snapshot
Quantization effects in transform-domain normalized LMS algorithm
inferredcites →https://doi.org/10.1109/82.208583openalex-snapshot
A comment on the computational complexity of sliding FFT
inferredcites →https://doi.org/10.1109/iscas.1994.408899openalex-snapshot
Order of N complexity transform domain adaptive filters
inferredcites →https://doi.org/10.1109/proc.1985.13175openalex-snapshot
FAST TRANSFORMS, algorithms, analysis, applications
inferredcites →https://doi.org/10.1109/tassp.1983.1164121openalex-snapshot
Transform domain LMS algorithm
inferredcites →https://doi.org/10.1109/tcom.1976.1093409openalex-snapshot
A Fast Karhunen-Loeve Transform for a Class of Random Processes
inferredcites →https://doi.org/10.1137/1031127openalex-snapshot
Kronecker Products, Unitary Matrices and Signal Processing Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-81007-8_111openalex-snapshot
v-Twin SVR Based OFDM System Wireless Channel Estimation
inferred← citeshttps://doi.org/10.1016/0165-1684(96)00064-3openalex-snapshot
Sliding transforms for efficient implementation of transform domain adaptive filters
inferred← citeshttps://doi.org/10.1016/j.sigpro.2005.11.015openalex-snapshot
Complexity of pruning strategies for the frequency domain LMS algorithm
inferred← citeshttps://doi.org/10.1016/s0165-1684(03)00038-0openalex-snapshot
Complexity considerations for transform-domain adaptive filters
inferred← citeshttps://doi.org/10.1109/82.826747openalex-snapshot
The wavelet transform-domain LMS algorithm: a more practical approach
inferred← citeshttps://doi.org/10.1109/82.943335openalex-snapshot
Analysis of DCTLMS algorithm with a selective coefficient updating
inferred← citeshttps://doi.org/10.1109/access.2018.2871885openalex-snapshot
Fast Gray Code Kernel Algorithm for the Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform
inferred← citeshttps://doi.org/10.1109/asspcc.2000.882474openalex-snapshot
DCTLMS algorithm employing partial coefficient updates
inferred← citeshttps://doi.org/10.1109/tcsi.2011.2173386openalex-snapshot
Sliding Conjugate Symmetric Sequency-Ordered Complex Hadamard Transform: Fast Algorithm and Applications
inferred← citeshttps://doi.org/10.1109/tsp.2010.2063026openalex-snapshot
Fast Algorithms for the Computation of Sliding Sequency-Ordered Complex Hadamard Transform
inferred← citeshttps://doi.org/10.1109/ut.1998.670153openalex-snapshot
Compensation of multipath fading in underwater spread-spectrum communication systems
inferred← citeshttps://doi.org/10.1142/s0218126605002441openalex-snapshot
ANALYSIS OF THE TRANSFORM DOMAIN LMS ALGORITHM WITH INSUFFICIENT LENGTH ADAPTIVE FILTER
inferred← citeshttps://doi.org/10.5281/zenodo.39705openalex-snapshot
On The Equivalence Of A Reduced-Complexity Recursive Power Normalization Algorithm And The Exponential Window Power Estimation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.