Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-26T15:34:11.459Z Has data issue: false hasContentIssue false

10 - Precoding in large MIMO systems

Published online by Cambridge University Press:  18 December 2013

A. Chockalingam
Affiliation:
Indian Institute of Science, Bangalore
B. Sundar Rajan
Affiliation:
Indian Institute of Science, Bangalore
Get access

Summary

Channel state information at the transmitter (CSIT) can be exploited to improve performance in MIMO wireless systems through a precoding operation at the transmitter. Precoding techniques use CSIT to encode the information symbols into transmit vectors. Typically, an information symbol vector u is encoded into a transmit vector x using the transformation x = Tu, where T is referred to as the precoding matrix. The precoding matrix T is chosen based on the available CSIT. Precoding on point-to-point MIMO links and multiuser MIMO links is common. In addition, multiuser MIMO precoding in multicell scenarios is of interest. In this chapter, precoding schemes for large MIMO systems are considered.

Precoding in point-to-point MIMO

In point-to-point MIMO links, precoding techniques can achieve improved performance in terms of enhanced communication reliability, which is typically quantified in terms of the diversity gain/order achieved by the precoding scheme. In addition to performance, precoding/decoding complexities are also of interest. Often, one encounters a tradeoff between performance (diversity gain) and precoding/decoding complexity. Well-known precoders for point-to-point MIMO are presented in the following subsections.

System model

Consider an nt × nr point-to-point MIMO system (nrnt), where nt and nr denote the number of transmit and receive antennas, respectively. Assume CSI to be known perfectly at both the transmitter and the receiver. Let x = (x1,…,xnt)T be the vector of symbols transmitted by the nt transmit antennas in one channel use.

Type
Chapter
Information
Large MIMO Systems , pp. 219 - 250
Publisher: Cambridge University Press
Print publication year: 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] G., Raleigh and J., Cioffi, “Spatio-temporal coding for wireless communication,” IEEE Trans. Commun., vol. 44, no. 3, pp. 357–366, Mar. 1998.Google Scholar
[2] L. G., Ordonez, D. P., Palomar, A. P., Zamora, and J. R., Fonollosa, “High-SNR analytical performance of spatial multiplexing MIMO systems with CSI,” IEEE Trans. Signal Process., vol. 55, no. 11, pp. 5447–5463, Nov. 2007.Google Scholar
[3] Z., Wang and G. B., Giannakis, “A simple and general parametrization quantifying performance in fading channels,” IEEE Trans. Commun., vol. 51, no. 8, pp. 1389–1398, Aug. 2003.Google Scholar
[4] B., Vrigneau, J., Letessier, P., Rostaing, L., Collin, and G., Burel, “Extension of the MIMO precoder based on the minimum euclidean distance: a cross-form matrix,” IEEE J. Select. Topics Signal Process., vol. 2, no. 2, pp. 135–146, Apr. 2008.Google Scholar
[5] S. K., Mohammed, E., Viterbo, Y., Hong, and A., Chockalingam, “MIMO precoding with X- and Y-codes,” IEEE Trans. Inform. Theory, vol. 57, no. 6, pp. 3542–3566, Jun. 2011.Google Scholar
[6] K. P., Srinath and B. S., Rajan, “A low ML-decoding complexity, full-diversity, full-rate MIMO precoder,” IEEE Trans. Signal Process., vol. 59, no. 11, pp. 5485–5498, Nov. 2011.Google Scholar
[7] D., Tse and P., Viswanath, Fundamentals of Wireless Communication. Cambridge, UK: Cambridge University Press, 2005.
[8] H., Weingarten, Y., Steinberg, and S., Shamai, “The capacity region of the Gaussian multiple-input multiple-output broadcast channel,” IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 3936–3964, Sep. 2006.Google Scholar
[9] Q. H., Spencer, C. B., Peel, A. L., Swindlehurst, and M., Haardt, “An introduction to the multi-user MIMO downlink,” IEEE Commun. Mag., vol. 42, no. 10, pp. 60–67, Oct. 2004.Google Scholar
[10] D., Gesbert, R., Kountouris, R. W., Heath, C.-B., Chae, and T., Salzer, “Shifting the MIMO paradigm,” IEEE Signal Process. Mag., vol. 24, no. 5, pp. 36–46, Sep. 2007.Google Scholar
[11] N., Jindal and A., Goldsmith, “Dirty paper coding vs. TDMA for MIMO broadcast channels,” IEEE Trans. Inform. Theory, vol. 51, no. 5, pp. 1783–1794, May 2005.Google Scholar
[12] G., Caire and S., Shamai, “On the achievable throughput of a multiantenna Gaussian broadcast channel,” IEEE Trans. Inform. Theory, vol. 49, no. 7, pp. 16911706, Jul. 2003.Google Scholar
[13] M. H. M., Costa, “Writing on dirty-paper,” IEEE Trans. Inform. Theory, vol. 29, no. 3, pp. 439–441, May 1983.Google Scholar
[14] C. B., Peel, “On dirty-paper coding,” IEEE Signal Process. Mag., vol. 20, no. 3, pp. 112–113, May 2003.Google Scholar
[15] S., Vishwanath, N., Jindal, and A., Goldsmith, “Duality, achievable rates and sum-rate capacity of MIMO broadcast channels,” IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2658–2668, Oct. 2003.Google Scholar
[16] P., Viswanath and D., Tse, “Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality,” IEEE Trans. Inform. Theory, vol. 49, no. 8, pp. 1912–1921, Aug. 2003.Google Scholar
[17] M., Vu and A., Paulraj, “MIMO wireless linear precoding,” IEEE Signal Process. Mag., vol. 24, no. 5, pp. 86–105, Sep. 2007.Google Scholar
[18] Q. H., Spencer, A. L., Swindlehurst, and M., Haardt, “Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels,” IEEE Trans. Signal Process., vol. 52, no. 2, pp. 461–471, Feb. 2004.Google Scholar
[19] Z., Pan, K.-K., Wong, and T.-S., Ng, “Generalized multiuser orthogonal space division multiplexing,” IEEE Trans. Wireless Commun., vol. 3, no. 2, pp. 1969–1973, Nov. 2004.Google Scholar
[20] C.-B., Chae, D., Mazzarese, and R. W., Heath Jr., “Coordinated beamforming for multiuser MIMO systems with limited feedforward,” in Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, CH, Oct.-Nov. 2006, pp. 1511–1515.
[21] L., Choi and D., Murch, “A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach,” IEEE Trans. Wireless Commun., vol. 3, no. 1, pp. 20–24, Jan. 2004.Google Scholar
[22] B., Bandemer, M., Haardt, and S., Visuri, “Linear MMSE multi-user MIMO downlink precoding for users with multiple antennas,” in IEEE PIMRC'2006, Helsinki, Sep. 2006, pp. 1–5.
[23] J., Zhang, Y., Wu, S., Zhou, and J., Wang, “Joint linear transmitter and receiver design for the downlink of multiuser MIMO systems,” IEEE Commun. Lett., vol. 9, no. 11, pp. 991–993, Nov. 2005.Google Scholar
[24] S., Shi, M., Schubert, and H., Boche, “Downlink MMSE transceiver optimization for multiuser MIMO systems: duality and sum-MSE minimization,” IEEE Trans. Signal Process., vol. 55, no. 11, pp. 5436–5446, Nov. 2007.Google Scholar
[25] A., Mezghani, M., Joham, R., Hunger, and W., Utschick, “Transceiver design for multi-user MIMO systems,” in WSA2006, Schtoss Reisenburg, Mar. 2006.
[26] A. M., Khachan, A. J., Tenenbaum, and R. S., Adve, “Linear processing for the downlink in multiuser MIMO systems with multiple data streams,” in IEEE ICC'2008, Beijing, Jun. 2008, pp. 4113–4118.
[27] A. J., Tenenbaum and R. S., Adve, “Linear processing and sum throughput in the multiuser MIMO downlink,” IEEE Trans. Wireless Commun., vol. 8, no. 5, pp. 2652–2661, May 2009.Google Scholar
[28] M., Tomlinson, “New automatic equaliser employing modulo arithmetic,” Electron. Lett., vol. 7, no. 5/6, pp. 138–139, Mar. 1971.Google Scholar
[29] H., Harashima and H., Miyakawa, “Matched transmission technique for channels with inter-symbol interference,” IEEE Trans. Commun., vol. 20, no. 8, pp. 774–780, Aug. 1972.Google Scholar
[30] A., Mezghani, R., Hunger, M., Joham, and W., Utschick, “Iterative THP transceiver optimization for multi-user MIMO systems based on weighted sum-mse minimization,” in IEEE SPAWC'2006, Cannes, Jul. 2005, pp. 1–5.
[31] K., Kusume, M., Joham, W., Utschick, and G., Bauch, “Efficient Tomlinson-Harashima precoding for spatial multiplexing on flat MIMO channel,” in IEEE IEEE ICC'2005, Seoul, May 2005, pp. 2021–2025.
[32] C. B., Peel, B. M., Hochwald, and A. L., Swindlehurst, “A vector-perturbation technique for near-capacity multi-antenna multiuser communication – Part I: Channel inversion and regularization,” IEEE Trans. Commun., vol. 53, no. 1, pp. 195–202, Jan. 2005.Google Scholar
[33] C. B., Peel, B. M., Hochwald, and A. L., Swindlehurst, “A vector-perturbation technique for near-capacity multi-antenna multiuser communication – Part II: Vector perturbation,” IEEE Trans. Commun., vol. 53, no. 3, pp. 537–544, Mar. 2005.Google Scholar
[34] D., Seethaler and G., Matz, “Efficient vector perturbation in multiantenna multiuser systems based on approximate integer relations,” in EUSIPCO'2006, Florence, Sep. 2004.
[35] S. K., Mohammed, A., Chockalingam, and B. S., Rajan, “A low-complexity precoder for large multiuser MISO systems,” in IEEE VTC'2008, Singapore, May 2008, pp. 797–801.
[36] T. L., Marzetta, “How much training is required for multiuser MIMO?” in 40th Asilomar Conf. on Signals, Systems and Computers, Pacific Grove, CA, Oct.-Nov. 2006, pp. 359–363.
[37] J., Jose, A., Ashikhmin, T., Marzetta, and S., Vishwanath, “Pilot contamination and precoding in multi-cell TDD systems,” IEEE Trans. Wireless Commun., vol. 10, no. 8, pp. 2640–2651, Aug. 2011.Google Scholar
[38] T. L., Marzetta, “Noncooperative cellular wireless with unlimited numbers of base station antennas,” IEEE Trans. Wireless Commun., vol. 9, no. 11, pp. 3590–3600, Nov. 2010.Google Scholar
[39] B., Gopalakrishnan and N., Jindal, “An analysis of pilot contamination on multiuser MIMO cellular systems with many antennas,” in IEEE SPAWC'2011, San Francisco, CA, Jun. 2011, pp. 381–385.
[40] K., Appaiah, A., Ashikhmin, and T. L., Marzetta, “Pilot contamination reduction in multi-user TDD systems,” in IEEE ICC'2010, Cape Town, May 2010, pp. 1–5.
[41] B., Hassibi and B. M., Hochwald, “How much training is needed in multiple-antenna wireless links?IEEE Trans. Inform. Theory, vol. 49, no. 4, pp. 951–963, Apr. 2003.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×