On the public citation graph

A new bit reversal algorithm

0 signed · 21 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/tassp.1987.1165252openalex-snapshot
An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transforms
inferredcites →https://doi.org/10.1137/0907042openalex-snapshot
Conversion of FFT’s to Fast Hartley Transforms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/0098-3004(94)00078-9openalex-snapshot
Generating bit reversed numbers for calculating Fast Fourier Transform
inferred← citeshttps://doi.org/10.1016/0165-1684(93)90010-8openalex-snapshot
An improved digit-reversal permutation algorithm
inferred← citeshttps://doi.org/10.1080/00207217.2012.713009openalex-snapshot
Implementation of comprehensive address generator for digital signal processor
inferred← citeshttps://doi.org/10.1109/5.272142openalex-snapshot
Aspects of the Hartley transform
inferred← citeshttps://doi.org/10.1109/78.376852openalex-snapshot
New FFT bit-reversal algorithm
inferred← citeshttps://doi.org/10.1109/78.91199openalex-snapshot
A better FFT bit-reversal algorithm without tables
inferred← citeshttps://doi.org/10.1109/icassp.1992.226660openalex-snapshot
A fast input reordering algorithm for the discrete cosine transform
inferred← citeshttps://doi.org/10.1109/iccsp.2011.5739281openalex-snapshot
Address generation for DSP Kernels
inferred← citeshttps://doi.org/10.1109/icdsp.2009.5201151openalex-snapshot
Radix-4 FFT algorithms with ordered input and output data
inferred← citeshttps://doi.org/10.1109/iciinfs.2009.5429841openalex-snapshot
Comprehensive address generator for digital Signal Processing
inferred← citeshttps://doi.org/10.1109/lsp.2004.838211openalex-snapshot
A New Fast Bit-Reversal Permutation Algorithm Based on a Symmetry
inferred← citeshttps://doi.org/10.1109/lsp.2008.2003993openalex-snapshot
Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data
inferred← citeshttps://doi.org/10.1109/lsp.2010.2082530openalex-snapshot
High Speed Progressive Digital-Reversal Algorithm
inferred← citeshttps://doi.org/10.1109/tsp.2004.827148openalex-snapshot
Address Generators for Mapping Arrays in Bit-Reversed Order
inferred← citeshttps://doi.org/10.1109/tsp.2006.887567openalex-snapshot
Efficient Bit and Digital Reversal Algorithm Using Vector Calculation
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2008831openalex-snapshot
A Parallel Pruned Bit-Reversal Interleaver
inferred← citeshttps://doi.org/10.1137/1038001openalex-snapshot
Bit Reversal on Uniprocessors
inferred← citeshttps://doi.org/10.1631/jzus.a0920290openalex-snapshot
Novel algorithm for complex bit reversal: employing vector permutation and branch reduction methods
inferred← citeshttps://doi.org/10.48550/arxiv.1106.3635openalex-snapshot
Bit Reversal through Direct Fourier Permutation Method and Vectorial Digit Reversal Generalization
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.