Matthew J. M. Peacock

Learn More
This paper uses an incremental matrix expansion approach to derive asymptotic eigenvalue distributions (a.e.d.'s) of sums and products of large random matrices. We show that the result can be derived directly as a consequence of two common assumptions, and matches the results obtained from using R-and S-transforms in free probability theory. We also give a(More)
—This paper presents an asymptotic analysis of mul-tisignature code-division multiple access (CDMA) in the presence of frequency-selective channels. We characterize the sum spectral efficiency and spectral efficiency regions for both the optimal and linear minimum mean-squared error (MMSE) multiuser receivers. Both independent and identically distributed(More)
—This paper considers a multicarrier (MC) code-division multiple-access system where each user employs multiple signatures. The receiver is linear and minimizes the mean square error of the data estimate. Both multiple-user and single-user systems are considered, as well as single and multiple signatures per user. In each case, an asymptotic analysis is(More)
We present a unified large system analysis of linear receivers for a class of random matrix channels. The technique unifies the analysis of both the minimum-mean-squared-error (MMSE) receiver and the adaptive least-squares (ALS) receiver, and also uses a common approach for both random i.i.d. and random orthogonal precoding. We derive expressions for the(More)
—This paper considers properties of the extrinsic information transfer (EXIT) functions of turbo equalized intersymbol interference channels and finite-impulse response precoders. An analytic expression is derived for the maximum value of the EXIT function of the equalizer. Using this parameter, a design strategy is proposed for allocating redundancy(More)