scispace - formally typeset
A

Andreas F. Molisch

Researcher at University of Southern California

Publications -  811
Citations -  54592

Andreas F. Molisch is an academic researcher from University of Southern California. The author has contributed to research in topics: Communication channel & MIMO. The author has an hindex of 96, co-authored 777 publications receiving 47530 citations. Previous affiliations of Andreas F. Molisch include King Abdulaziz City for Science and Technology & Mitsubishi.

Papers
More filters
Journal ArticleDOI

Localization via ultra-wideband radios: a look at positioning aspects for future sensor networks

TL;DR: In this article, theoretical limits for TOA estimation and TOA-based location estimation for UWB systems have been considered and suboptimal but practical alternatives have been emphasized.
Journal ArticleDOI

5G : A tutorial overview of standards, trials, challenges, deployment, and practice

TL;DR: An overview of 5G research, standardization trials, and deployment challenges is provided, with research test beds delivering promising performance but pre-commercial trials lagging behind the desired 5G targets.
Book

Wireless Communications

TL;DR: The Wireless Communications, Second Edition as mentioned in this paper provides an authoritative overview of the principles and applications of mobile communication technology, including wireless propagation channels, transceivers and signal processing, multiple access and advanced transceiver schemes, and standardised wireless systems.
Journal ArticleDOI

Optical communications using orbital angular momentum beams

TL;DR: In this article, the authors review recent progress in OAM beam generation/detection, multiplexing/demultiplexing, and its potential applications in different scenarios including free-space optical communications, fiber-optic communications, and RF communications.
Journal ArticleDOI

FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers

TL;DR: This work shows that the uncoded optimum file assignment is NP-hard, and develops a greedy strategy that is provably within a factor 2 of the optimum, and provides an efficient algorithm achieving a provably better approximation ratio of 1-1/d d, where d is the maximum number of helpers a user can be connected to.