Published October 1, 2019 | Version v1
Journal article

K-means clustering algorithm in antenna selection for Massive MIMO

  • 1. School of optoelectronics and communication engineering, Xiamen university of Technology, Xiamen 361024, China. (China)
  • 2. School of electronic engineering, Beijing university of posts and telecommunications, Beijing 100876, China. (China)

Description

Massive multiple-input multiple-output (MIMO) is considered as the promising technique in next generation of wireless communication system. It has high spectral efficiency and energy efficiency. In addition, it can mitigate the interferences among users as the amount of antennas at base station (BS) grows. But, the high complexity and cost of hardware pose huge challenges to massive MIMO. In future, antenna selection (AS) is still a choice to decrease the burden of BS. In this letter, the AS algorithm based on K-means clustering is proposed to maximizing the capacity with low computational complexity. Finally, the simulated results are presented to validate the proposed method. (paper)

Availability note (English)

Available from http://dx.doi.org/10.1088/1742-6596/1314/1/012061

Additional details

Publishing Information

Journal Title
Journal of Physics. Conference Series (Online)
Journal Volume
1314
Journal Issue
1
Journal Page Range
[5 p.]
ISSN
1742-6596

Conference

Title
3. International Conference on Electrical, Mechanical and Computer Engineering
Dates
9-11 Aug 2019
Place
Guizhou (China)

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
53047758
Subject category
S47: OTHER INSTRUMENTATION; S42: ENGINEERING;
Resource subtype / Literary indicator
Conference
Descriptors DEI
ALGORITHMS; ANTENNAS; CAPACITY; COMPUTERIZED SIMULATION; ENERGY EFFICIENCY; INTERFERENCE
Descriptors DEC
EFFICIENCY; ELECTRICAL EQUIPMENT; EQUIPMENT; MATHEMATICAL LOGIC; SIMULATION