default search action
Albert M. Chan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j10]Oh-Soon Shin, Albert M. Chan, H. T. Kung, Vahid Tarokh:
Design of an OFDM Cooperative Space-Time Diversity System. IEEE Trans. Veh. Technol. 56(4): 2203-2215 (2007) - 2005
- [j9]Yonina C. Eldar, Albert M. Chan:
Correction to "On the Asymptotic Performance of the Decorrelator" and "An Optimal Whitening Approach to Linear Multiuser Detection". IEEE Trans. Inf. Theory 51(1): 421- (2005) - 2004
- [b1]Albert M. Chan:
A framework for low-complexity iterative interference cancellation in communication systems. Massachusetts Institute of Technology, Cambridge, MA, USA, 2004 - [j8]Inkyu Lee, Albert M. Chan, Carl-Erik W. Sundberg:
Space-time bit-interleaved coded modulation for OFDM systems. IEEE Trans. Signal Process. 52(3): 820-825 (2004) - 2003
- [j7]Yonina C. Eldar, Albert M. Chan:
An optimal whitening approach to linear multiuser detection. IEEE Trans. Inf. Theory 49(9): 2156-2171 (2003) - [j6]Yonina C. Eldar, Albert M. Chan:
On the asymptotic performance of the decorrelator. IEEE Trans. Inf. Theory 49(9): 2309-2313 (2003) - [c6]Inkyu Lee, Albert M. Chan, Carl-Erik W. Sundberg:
Space-time bit-interleaved coded modulation for OFDM systems in wireless LAN applications. ICC 2003: 3413-3417 - 2002
- [j5]Albert M. Chan, Gregory W. Wornell:
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers. J. VLSI Signal Process. 30(1-3): 197-215 (2002) - [c5]Albert M. Chan, Gregory W. Wornell:
Approaching the matched-filter bound using iterated-decision equalization with frequency-interleaved encoding. GLOBECOM 2002: 297-301 - [c4]Albert M. Chan, Inkyu Lee:
A new reduced-complexity sphere decoder for multiple antenna systems. ICC 2002: 460-464 - 2001
- [j4]Albert M. Chan, Gregory W. Wornell:
A class of block-iterative equalizers for intersymbol interference channels: fixed channel results. IEEE Trans. Commun. 49(11): 1966-1976 (2001) - [c3]Albert M. Chan, Gregory W. Wornell:
A class of asymptotically optimum iterated-decision multiuser detectors. ICASSP 2001: 2265-2268 - 2000
- [j3]Henry Leung, Sichun Wang, Albert M. Chan:
Blind identification of an autoregressive system using a nonlinear dynamical approach. IEEE Trans. Signal Process. 48(11): 3017-3027 (2000) - [c2]Albert M. Chan, Gregory W. Wornell:
A Class of Block-Iterative Equalizers for Intersymbol Interference Channels. ICC (1) 2000: 31-35
1990 – 1999
- 1999
- [j2]Albert M. Chan, Henry Leung:
Equalization of speech and audio signals using a nonlinear dynamical approach. IEEE Trans. Speech Audio Process. 7(3): 356-360 (1999) - 1998
- [j1]Albert M. Chan, Frank R. Kschischang:
A simple taboo-based soft-decision decoding algorithm for expander codes. IEEE Commun. Lett. 2(7): 183-185 (1998) - 1997
- [c1]Albert M. Chan, Henry Leung:
Inverse Filtering of Room Acoustics Using a Nonlinear Dynamical Approach. ICC (2) 1997: 1110-1114
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-07 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint