default search action
Harry L. Van Trees
Person information
- affiliation: George Mason University, Fairfax VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2002
- [b1]Harry L. Van Trees:
Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory. Wiley 2002, ISBN 978-0-47109390-9, pp. 1-1433
Journal Articles
- 2001
- [j11]Zhi Tian, Kristine L. Bell, Harry L. Van Trees:
A recursive least squares implementation for LCMP beamforming under quadratic constraint. IEEE Trans. Signal Process. 49(6): 1138-1145 (2001) - [j10]Zhi Tian, Kristine L. Bell, Harry L. Van Trees:
Robust constrained linear receivers for CDMA wireless systems. IEEE Trans. Signal Process. 49(7): 1510-1522 (2001) - [j9]Robert E. Zarnich, Kristine L. Bell, Harry L. Van Trees:
A unified method for measurement and tracking of contacts from an array of sensors. IEEE Trans. Signal Process. 49(12): 2950-2961 (2001) - 2000
- [j8]Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees:
A Bayesian approach to robust adaptive beamforming. IEEE Trans. Signal Process. 48(2): 386-398 (2000) - 1998
- [j7]Yariv Ephraim, Neri Merhav, Harry L. Van Trees:
Authors' reply to "Comments on 'Min-Norm interpretations and consistency of MUSIC, MODE, and ML'". IEEE Trans. Signal Process. 46(11): 3104 (1998) - 1997
- [j6]Kristine L. Bell, Yossef Steinberg, Yariv Ephraim, Harry L. Van Trees:
Extended Ziv-Zakai lower bound for vector parameter estimation. IEEE Trans. Inf. Theory 43(2): 624-637 (1997) - 1996
- [j5]Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees:
Explicit Ziv-Zakai lower bound for bearing estimation. IEEE Trans. Signal Process. 44(11): 2810-2824 (1996) - 1995
- [j4]Yariv Ephraim, Harry L. Van Trees:
A signal subspace approach for speech enhancement. IEEE Trans. Speech Audio Process. 3(4): 251-266 (1995) - [j3]Yariv Ephraim, Neri Merhav, Harry L. Van Trees:
Min-norm interpretations and consistency of MUSIC, MODE and ML. IEEE Trans. Signal Process. 43(12): 2937-2942 (1995) - 1966
- [j2]Harry L. Van Trees:
Analog communication over randomly-time-varying channels. IEEE Trans. Inf. Theory 12(1): 51-63 (1966) - [j1]Harry L. Van Trees:
Bounds on the accuracy attainable in the estimation of continuous random processes. IEEE Trans. Inf. Theory 12(3): 298-305 (1966)
Conference and Workshop Papers
- 2002
- [c8]Russell Jeffers, Kristine L. Bell, Harry L. Van Trees:
Broadband passive range estimation using music. ICASSP 2002: 2921-2924 - 2001
- [c7]Zhi Tian, Kristine L. Bell, Harry L. Van Trees:
Robust measures for decision feedback equalization in CDMA systems. GLOBECOM 2001: 1361-1365 - 1998
- [c6]Zhi Tian, Harry L. Van Trees:
DOA estimation with hexagonal arrays. ICASSP 1998: 2053-2056 - 1997
- [c5]Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees:
Robust adaptive beamforming using data dependent constraints. ICASSP 1997: 3513-3516 - 1996
- [c4]Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees:
Explicit Ziv-Zakai lower bound for bearing estimation. ICASSP 1996: 2852-2855 - 1995
- [c3]Yariv Ephraim, Harry L. Van Trees:
A spectrally-based signal subspace approach for speech enhancement. ICASSP 1995: 804-807 - [c2]Kristine L. Bell, Yariv Ephraim, Harry L. Van Trees:
Ziv-Zakai lower bounds in bearing estimation. ICASSP 1995: 1649-1652 - 1993
- [c1]Yariv Ephraim, Harry L. Van Trees:
A signal subspace approach for speech enhancement. ICASSP (2) 1993: 355-358
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-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint