2007
DOI: 10.1109/tcsii.2007.896801
|View full text |Cite
|
Sign up to set email alerts
|

Reconstruction of Two-Periodic Nonuniformly Sampled Band-Limited Signals Using a Discrete-Time Differentiator and a Time-Varying Multiplier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 33 publications
(36 citation statements)
references
References 6 publications
0
36
0
Order By: Relevance
“…In our previous work [19], we derived one such special scheme consisting of an FIR filter designed as differentiator and a time-varying multiplier. The main advantage of that system is that designing the optimal reconstruction filters reduces to designing a simple FIR differentiator.…”
Section: A Contribution Of This Paper and Relation To Other Workmentioning
confidence: 99%
“…In our previous work [19], we derived one such special scheme consisting of an FIR filter designed as differentiator and a time-varying multiplier. The main advantage of that system is that designing the optimal reconstruction filters reduces to designing a simple FIR differentiator.…”
Section: A Contribution Of This Paper and Relation To Other Workmentioning
confidence: 99%
“…In Paper A of Part II, we propose a two-rate based reconstructor for twochannel TI-ADCs which is a popular TI-ADC configuration [76][77][78][79]. The basic two-rate based approach in Paper A is extended to a general M -channel TI-ADC reconstruction scheme in Paper B.…”
Section: 7(b)mentioning
confidence: 99%
“…This section describes how a filter design for the time instant n can be obtained without performing the computationally intensive calculation of the generalized inverse A K n † as given in (13) and (14). Instead, this generalized inverse is determined by resorting to results from the previous filter design without explicitly performing a matrix inversion.…”
Section: Order Recursive Least-squares Design Of a Time-varying Fmentioning
confidence: 99%
“…In comparison, the computationally most expensive operation of the well-known least-squares filter design algorithm, as presented in Section III, is the inversion of the matrix product A * K n A K n in (14). This matrix multiplication has a complexity of O K 2 R [19] with K< R, and the inversion of the resulting K-by-K matrix has a complexity of O K 3 , when applying the Gaussian elimination.…”
Section: Summary Of the Filter Design Algorithmmentioning
confidence: 99%