Name
Abstract | ||
|---|---|---|
Massive MIMO-systems have received considerable attention in recent years as an enabler in future wireless communication systems. As the idea is based on having a large number of antennas at the base station it is important to have both a scalable and distributed realization of such a system to ease deployment. Most work so far have focused on the theoretical aspects although a few demonstrators have been reported.In this work, we propose a base station architecture based on connecting the processing nodes in a K-ary tree, allowing simple scalability. Furthermore, it is shown that most of the processing can be performed locally in each node. Further analysis of the node processing shows that it should be enough that each node contains one or two complex multipliers and a few complex adders/subtracters operating at some hundred MHz. It is also shown that a communication link of some Gbps is required between the nodes, and, hence, it is fully feasible to have one or a few links between the nodes to cope with the communication requirements. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 50TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS | Base station,Computer science,Communications system,MIMO,Electronic engineering,Decoding methods,Orthogonal frequency-division multiplexing,Precoding,Scalability,Distributed computing,Telecommunications link |
DocType | ISSN | Citations |
Conference | 1058-6393 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Bertilsson | 1 | 0 | 0.68 |
| Oscar Gustafsson | 2 | 294 | 43.00 |
| Erik G. Larsson | 3 | 10189 | 605.81 |