Literature Database Entry

levanen2014radio


Toni Levanen, Juho Pirskanen and Mikko Valkama, "Radio interface design for ultra-low latency millimeter-wave communications in 5G Era," Proceedings of IEEE Global Telecommunications Conference (GLOBECOM 2014), Austin, TX, December 2014, pp. 1420-1426.

Abstract

The projected growth of mobile data traffic requires the 5G wireless systems to support at least 1000 x larger area throughput than the existing 4G solutions. This requires ultra-dense local area networks combined with millimeter-wave communications to provide high spatial multiplexing gain and wide bandwidths for multi-gigabit peak data rates. In this paper, we extend our 5GETLA reference design for 5G small cell network radio interface in 3-10 GHz carrier frequencies towards millimeter-wave communications and discuss separate solutions for both line-of-sight and non-line-of-sight scenarios. The non-line-of-sight frame design achieves frame duration equal to 0.1 ms which is one hundredth of the LTE frame duration. The line-of-sight design is also considered as a good candidate especially for small-distance indoor wireless access or inband backhaul and is particularly optimized in terms of ultra-low latency with frame duration equal to 0.05 ms, achieving the strictest physical layer latency requirements set for 5G communications.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Toni Levanen
Juho Pirskanen
Mikko Valkama

BibTeX reference

@inproceedings{levanen2014radio,
    address = {Austin, TX},
    author = {Levanen, Toni and Pirskanen, Juho and Valkama, Mikko},
    booktitle = {IEEE Global Telecommunications Conference (GLOBECOM 2014)},
    doi = {10.1109/GLOCOMW.2014.7063633},
    month = {12},
    pages = {1420-1426},
    publisher = {IEEE},
    title = {{Radio interface design for ultra-low latency millimeter-wave communications in 5G Era}},
    year = {2014},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.