default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomas Gänsler
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c14]Tomas Gänsler, Eric J. Diethorn:
Inter-channel coherence reduction method for stereophonic acoustic echo cancellation. IWAENC 2016: 1-5- 2013
- [j16]Cristian Lucian Stanciu, Jacob Benesty
, Constantin Paleologu, Tomas Gänsler, Silviu Ciochina:
A widely linear model for stereophonic acoustic echo cancellation. Signal Process. 93(2): 511-516 (2013) - 2012
- [c13]Cristian Lucian Stanciu, Jacob Benesty, Constantin Paleologu, Tomas Gänsler, Silviu Ciochina:
A novel perspective on stereophonic acoustic echo cancellation. ICASSP 2012: 25-28 - 2011
- [c12]Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas Gänsler:
On single-channel noise reduction in the time domain. ICASSP 2011: 277-280 - [c11]Constantin Paleologu, Jacob Benesty, Tomas Gänsler, Silviu Ciochina:
Class of double-talk detectors based on the holder inequality. ICASSP 2011: 425-428
2000 – 2009
- 2006
- [j15]Tomas Gänsler, Jacob Benesty:
The fast normalized cross-correlation double-talk detector. Signal Process. 86(6): 1124-1139 (2006) - [j14]Herbert Buchner, Jacob Benesty, Tomas Gänsler, Walter Kellermann:
Robust extended multidelay filter and double-talk detector for acoustic echo cancellation. IEEE Trans. Speech Audio Process. 14(5): 1633-1644 (2006) - [j13]Jacob Benesty, Tomas Gänsler:
Computation of the condition number of a nonsingular symmetric toeplitz matrix with the Levinson-durbin algorithm. IEEE Trans. Signal Process. 54(6-1): 2362-2364 (2006) - 2005
- [c10]Jacob Benesty, Tomas Gänsler:
A recursive estimation of the condition number in the RLS algorithm [adaptive signal processing applications]. ICASSP (4) 2005: 25-28 - 2004
- [j12]Jacob Benesty, Tomas Gänsler:
New Insights into the RLS Algorithm. EURASIP J. Adv. Signal Process. 2004(3): 331-339 (2004) - 2003
- [j11]Jacob Benesty, Tomas Gänsler:
A Multidelay Double-Talk Detector Combined with the MDF Adaptive Filter. EURASIP J. Adv. Signal Process. 2003(11): 1056-1063 (2003) - 2002
- [j10]Jacob Benesty, Tomas Gänsler:
A multichannel acoustic echo canceler double-talk detector based on a normalized cross-correlation matrix. Eur. Trans. Telecommun. 13(2): 95-101 (2002) - [j9]Tomas Gänsler, Jacob Benesty:
New insights into the stereophonic acoustic echo cancellation problem and an adaptive nonlinearity solution. IEEE Trans. Speech Audio Process. 10(5): 257-267 (2002) - [c9]Tomas Gänsler, Jacob Benesty:
An adaptive nonlinearity solution to the uniqueness problem of stereophonic echo cancellation. ICASSP 2002: 1885-1888 - 2001
- [j8]Tomas Gänsler, Jacob Benesty:
A frequency-domain double-talk detector based on a normalized cross-correlation vector. Signal Process. 81(8): 1783-1787 (2001) - [j7]Peter Eneroth, Steven L. Gay, Tomas Gänsler, Jacob Benesty:
A real-time implementation of a stereophonic acoustic echo canceler. IEEE Trans. Speech Audio Process. 9(5): 513-523 (2001) - [c8]Tomas Gänsler, Jacob Benesty, Man Mohan Sondhi, Steven L. Gay:
Dynamic resource allocation for network echo cancellation. ICASSP 2001: 3233-3236 - [c7]Jacob Benesty, Tomas Gänsler:
A robust fast recursive least squares adaptive algorithm. ICASSP 2001: 3785-3788 - 2000
- [j6]Tomas Gänsler, Steven L. Gay, Man Mohan Sondhi, Jacob Benesty:
Double-talk robust fast converging algorithms for network echo cancellation. IEEE Trans. Speech Audio Process. 8(6): 656-663 (2000) - [c6]Jacob Benesty, Man Mohan Sondhi, Tomas Gänsler:
An augmented iterative method for large linear Toeplitz systems. EUSIPCO 2000: 1-4 - [c5]Peter Eneroth, Jacob Benesty, Tomas Gänsler, Steven L. Gay:
Comparison of different adaptive algorithms for stereophonic acoustic echo cancellation. EUSIPCO 2000: 1-4 - [c4]Tomas Gänsler, Jacob Benesty, Steven L. Gay, Man Mohan Sondhi:
A robust proportionate affine projection algorithm for network echo cancellation. ICASSP 2000: 793-796
1990 – 1999
- 1999
- [j5]Tomas Gänsler, Göran Salomonsson:
Nonintrusive measurements of the telephone channel. IEEE Trans. Commun. 47(1): 158-167 (1999) - 1998
- [j4]Tomas Gänsler:
A double-talk resistant subband echo canceller. Signal Process. 65(1): 89-101 (1998) - [j3]Maria Hansson, Tomas Gänsler, Göran Salomonsson:
A system for tracking changes in the mid-latency evoked potential during anesthesia. IEEE Trans. Biomed. Eng. 45(3): 323-334 (1998) - [c3]Tomas Gänsler, Peter Eneroth:
Influence of audio coding on stereophonic acoustic echo cancellation. ICASSP 1998: 3649-3652 - 1997
- [c2]Tomas Gänsler:
A robust frequency-domain echo canceller. ICASSP 1997: 2317-2320 - 1996
- [j2]Maria Hansson, Tomas Gänsler, Göran Salomonsson:
Estimation of single event-related potentials utilizing the Prony method. IEEE Trans. Biomed. Eng. 43(10): 973-981 (1996) - [j1]Tomas Gänsler, Maria Hansson, Carl-Johan Ivarsson, Göran Salomonsson:
A double-talk detector based on coherence. IEEE Trans. Commun. 44(11): 1421-1427 (1996) - 1995
- [c1]Maria Hansson, Tomas Gänsler, Göran Salomonsson:
A multiple window method for estimation of a peaked spectrum. ICASSP 1995: 1617-1620
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 2024-11-20 21:00 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:
