default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew J. M. Peacock
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b1]Matthew J. M. Peacock:
Random Matrix Theory Analysis of Fixed and Adaptive Linear Receivers. University of Sydney, Australia, 2006
Journal Articles
- 2008
- [j5]Matthew J. M. Peacock, Iain B. Collings
, Michael L. Honig:
Eigenvalue Distributions of Sums and Products of Large Random Matrices Via Incremental Matrix Expansions. IEEE Trans. Inf. Theory 54(5): 2123-2138 (2008) - 2006
- [j4]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Asymptotic spectral efficiency of multiuser multisignature CDMA in frequency-selective channels. IEEE Trans. Inf. Theory 52(3): 1113-1129 (2006) - [j3]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Unified Large-System Analysis of MMSE and Adaptive Least Squares Receivers for a Class of Random Matrix Channels. IEEE Trans. Inf. Theory 52(8): 3567-3600 (2006) - 2005
- [j2]Matthew J. M. Peacock, Iain B. Collings:
Redundancy allocation in turbo-equalizer design. IEEE Trans. Commun. 53(2): 263-268 (2005) - 2004
- [j1]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Asymptotic analysis of LMMSE multiuser receivers for multi-signature multicarrier CDMA in Rayleigh fading. IEEE Trans. Commun. 52(6): 964-972 (2004)
Conference and Workshop Papers
- 2005
- [c8]Michael L. Honig, Matthew J. M. Peacock, Iain B. Collings:
An overview of large system analysis for multi-input/multi-output channels. ICASSP (5) 2005: 809-812 - [c7]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
A relationship between the SINR of MMSE and ALS receivers. ISIT 2005: 327-331 - 2004
- [c6]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Asymptotic spectral efficiency regions of two-user MC-CDMA systems in frequency-selective Rayleigh fading. ICC 2004: 957-961 - [c5]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Analysis of multiuser peer-to-peer MC-CDMA with limited feedback. ICC 2004: 968-972 - [c4]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Isometric multisignature multiuser MC-CDMA in frequency-selective fading. ISIT 2004: 433 - 2003
- [c3]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Asymptotic spectral efficiency of LMMSE multi-user multi-signature MC-CDMA in frequency-selective Rayleigh fading. GLOBECOM 2003: 1882-1886 - [c2]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Asymptotic SINR analysis of multi-user MC-CDMA in Rayleigh fading. ICC 2003: 2795-2799 - [c1]Matthew J. M. Peacock, Iain B. Collings:
Mutual information analysis of turbo equalizers for fixed and fading channels. ICC 2003: 2938-2942
Informal and Other Publications
- 2005
- [i2]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Unified Large System Analysis of MMSE and Adaptive Least Squares Receivers for a class of Random Matrix Channels. CoRR abs/cs/0502042 (2005) - [i1]Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
Eigenvalue Distributions of Sums and Products of Large Random Matrices via Incremental Matrix Expansions. CoRR abs/cs/0511054 (2005)
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 22:56 CEST 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:
