default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold Artés
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j5]Bertrand M. Hochwald, Harold Artés:
Orthogonalizing beams to train unscheduled terminals. IEEE Trans. Signal Process. 57(8): 3063-3074 (2009)- 2007
- [j4]Klaus Kopsa, Harold Artés, Gerald Matz
, Franz Hlawatsch:
Multiuser Space-Time Algorithms for Synchronization, Channel Estimation, and Data Detection in an Interference Monitoring System for UMTS/TDD Networks. IEEE Trans. Commun. 55(10): 1973-1983 (2007) - 2006
- [j3]Dominik Seethaler, Harold Artés, Franz Hlawatsch:
Dynamic Nulling-and-Canceling for Efficient Near-ML Decoding of MIMO Systems. IEEE Trans. Signal Process. 54(12): 4741-4752 (2006) - 2005
- [c11]Dominik Seethaler, Harold Artés, Franz Hlawatsch:
Dynamic versus conventional layer sorting for nulling-and-cancelling based MIMO detection. EUSIPCO 2005: 1-4 - 2004
- [j2]Harold Artés, Gerald Matz, Franz Hlawatsch:
Unbiased scattering function estimators for underspread channels and extension to data-driven operation. IEEE Trans. Signal Process. 52(5): 1387-1402 (2004) - [c10]Dominik Seethaler, Harold Artés, Franz Hlawatsch:
Dynamic ing-and-cancelling with near-ML performance for MIMO communication systems. ICASSP (4) 2004: 777-780 - [c9]Harold Artés:
Channel dependent tree pruning for the sphere decoder. ISIT 2004: 538 - 2003
- [j1]Harold Artés, Dominik Seethaler, Franz Hlawatsch:
Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection. IEEE Trans. Signal Process. 51(11): 2808-2820 (2003) - [c8]Harold Artés, Klaus Kopsa, Franz Hlawatsch:
A multiantenna detection algorithm for UMTS/TDD receivers in strong interference environments. GLOBECOM 2003: 819-823 - [c7]Dominik Seethaler, Harold Artés, Franz Hlawatsch:
Efficient near-ML detection for MIMO channels: the sphere-projection algorithm. GLOBECOM 2003: 2089-2093 - [c6]Harold Artés, Franz Hlawatsch:
Space-time matrix modulation: extension to unknown doubly selective MIMO channels. ICASSP (4) 2003: 41-44 - [c5]Klaus Kopsa, Harold Artés, Gerald Matz, Franz Hlawatsch:
Space-time algorithms for multiuser channel estimation in the downlink of UMTS/TDD. ICC 2003: 2406-2410 - 2002
- [c4]Klaus Kopsa, Gerald Matz, Harold Artés, Franz Hlawatsch:
Space-time synchronization algorithms for UMTS/TDD systems with strong co-channel interference. GLOBECOM 2002: 254-258 - [c3]Harold Artés, Franz Hlawatsch:
Space-time matrix modulation: Rank-deficient channels and multi-user case. ICASSP 2002: 2225-2228 - 2001
- [c2]Harold Artés, Franz Hlawatsch:
Blind equalization of MIMO channels using deterministic precoding. ICASSP 2001: 2153-2156 - 2000
- [c1]Harold Artés, Franz Hlawatsch, Gerald Matz:
Efficient POCS algorithms for deterministic blind equalization of time-varying channels. GLOBECOM 2000: 1031-1035
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 13:13 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:
