1981
DOI: 10.1109/msp.1981.237661
|View full text |Cite
|
Sign up to set email alerts
|

Errors in digital processing of signals (Gold and Rader, 1969)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0

Year Published

1991
1991
2016
2016

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(47 citation statements)
references
References 0 publications
0
47
0
Order By: Relevance
“…8(b) and (c). The corresponding DFT relation is cyclic expander (9) for (This is similar to the periodic extension idea in DFT theory [8]). Since are the -point DFT coefficients of , the -point DFT has the period We can define fractional decimators in a manner analogous to the noncyclic case (for example, as in [23,).…”
Section: B Cyclic Decimators and Expandersmentioning
confidence: 94%
See 2 more Smart Citations
“…8(b) and (c). The corresponding DFT relation is cyclic expander (9) for (This is similar to the periodic extension idea in DFT theory [8]). Since are the -point DFT coefficients of , the -point DFT has the period We can define fractional decimators in a manner analogous to the noncyclic case (for example, as in [23,).…”
Section: B Cyclic Decimators and Expandersmentioning
confidence: 94%
“…Related Literature: Since circular convolution is an integral part of DSP, we can regard cyclic LTI filtering as one of the earliest known DSP techniques [8]. The use of circular filtering in image subband coding (where images have finite size [7]) was motivated by the work of Smith and Eddins on symmetric extension techniques [19].…”
Section: A Motivation and Scopementioning
confidence: 99%
See 1 more Smart Citation
“…Below, additional facts of symmetries also indicate that this is a regular distribution. In digital signal processing, bit-reversal permutations play an important role; they are connected, in particularly, with quasi-holographic models, noise-immunity coding, and with algorithms of fast Fourier transform [12][13][14][15][16]. The bit-reversal permutation is a permutation of a sequence of n items, where n = 2 k , k-positive integer.…”
Section: Black and White Cells Of Genetic Matrices [C A; T G] (2) Amentioning
confidence: 99%
“…The FIR filters involve convolving a time series with a symmetric weight series (which may itself be considered a time series), yielding a filtered time series. Specific steps for constructing such filters (i.e., generating the weight series) have been described by Gold and Rader (1969; see also Ackroyd, 1973;Cook & Miller, 1992;Dumermuth & Molinari, 1987;Oppenheim & Schafer, 1975), and software implementing the weight-generation process is available (e.g., Cook, 1981). Briefly, the technique involves four steps, summarized in Figure 4.…”
Section: Design Of Time Domain Filters In the Frequency Domainmentioning
confidence: 99%