default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndre Tkacenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c9]Andre Tkacenko:
Approximate eigenvalue decomposition of para-Hermitian systems through successive FIR paraunitary transformations. ICASSP 2010: 4074-4077
2000 – 2009
- 2007
- [c8]Andre Tkacenko:
Spectral Properties and Interpolation Error Analysis for Variable Sample Rate Conversion Systems. GLOBECOM 2007: 3123-3127 - 2006
- [j7]Marvin K. Simon, Andre Tkacenko:
Noncoherent Data Transition Tracking Loops for Symbol Synchronization in Digital Communications Receivers. IEEE Trans. Commun. 54(4): 760-760 (2006) - [j6]Marvin K. Simon, Andre Tkacenko:
Noncoherent data transition tracking loops for symbol synchronization in digital communication receivers. IEEE Trans. Commun. 54(5): 889-899 (2006) - [j5]Andre Tkacenko, P. P. Vaidyanathan:
Iterative greedy algorithm for solving the FIR paraunitary approximation problem. IEEE Trans. Signal Process. 54(1): 146-160 (2006) - [j4]Andre Tkacenko, P. P. Vaidyanathan:
On the spectral factor ambiguity of FIR energy compaction filter Banks. IEEE Trans. Signal Process. 54(1): 380-385 (2006) - 2004
- [c7]Andre Tkacenko, Palghat P. Vaidyanathan:
Iterative gradient technique for the design of least squares optimal FIR magnitude squared Nyquist filters. ICASSP (2) 2004: 981-984 - [c6]Andre Tkacenko, Palghat P. Vaidyanathan:
Iterative algorithm for the design of optimal FIR analysis/synthesis filters for overdecimated filter banks. ISCAS (3) 2004: 325-328 - 2003
- [j3]Andre Tkacenko, P. P. Vaidyanathan, T. Q. Nguyen:
On the eigenfilter design method and its applications: a tutorial. IEEE Trans. Circuits Syst. II Express Briefs 50(9): 497-517 (2003) - [j2]Andre Tkacenko, Palghat P. Vaidyanathan:
A low-complexity eigenfilter design method for channel shortening equalizers for DMT systems. IEEE Trans. Commun. 51(7): 1069-1072 (2003) - [c5]Andre Tkacenko, Palghat P. Vaidyanathan:
On the least squares signal approximation model for overdecimated rational nonuniform filter banks and applications. ICASSP (6) 2003: 481-484 - [c4]Andre Tkacenko, Palghat P. Vaidyanathan:
On the least squares signal approximation model for overdecimated rational nonuniform filter banks and applications. ICME 2003: 857-860 - 2002
- [c3]Andre Tkacenko, P. P. Vaidyanathan:
Eigenfilter design of MIMO equalizers for channel shortening. ICASSP 2002: 2361-2364 - [c2]Andre Tkacenko, Palghat P. Vaidyanathan:
Noise optimized eigenfilter design of time-domain equalizers for DMT systems. ICC 2002: 54-58 - 2001
- [j1]Andre Tkacenko, P. P. Vaidyanathan:
The role of filter banks in sinusoidal frequency estimation. J. Frankl. Inst. 338(5): 517-547 (2001) - [c1]Andre Tkacenko, P. P. Vaidyanathan:
Sinusoidal frequency estimation using filter banks. ICASSP 2001: 3089-3092
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
