scispace - formally typeset
D

Daniel W. Bliss

Researcher at Arizona State University

Publications -  229
Citations -  10549

Daniel W. Bliss is an academic researcher from Arizona State University. The author has contributed to research in topics: Radar & MIMO. The author has an hindex of 38, co-authored 212 publications receiving 9054 citations. Previous affiliations of Daniel W. Bliss include University of California, San Diego & Massachusetts Institute of Technology.

Papers
More filters
Journal ArticleDOI

In-Band Full-Duplex Wireless: Challenges and Opportunities

TL;DR: In this article, the authors present a survey of self-interference mitigation techniques for in-band full-duplex (IBFD) wireless systems and discuss the challenges and opportunities in the design and analysis of IBFD wireless systems.
Posted Content

In-Band Full-Duplex Wireless: Challenges and Opportunities

TL;DR: This tutorial surveys a wide range of IBFD self-interference mitigation techniques and discusses numerous other research challenges and opportunities in the design and analysis of IB FD wireless systems.
Proceedings ArticleDOI

Multiple-input multiple-output (MIMO) radar and imaging: degrees of freedom and resolution

TL;DR: In this paper, radar is discussed in the context of a multiple-input multiple-output (MIMO) system model and examples are given showing that many traditional radar approaches can be interpreted within a MIMO context.
Journal ArticleDOI

Survey of RF Communications and Sensing Convergence Research

TL;DR: This work provides a point of departure for future researchers that will be required to solve the problem of wireless convergence by presenting the applications, topologies, levels of system integration, the current state of the art, and outlines of future information-centric systems.
Journal ArticleDOI

Full-Duplex Bidirectional MIMO: Achievable Rates Under Limited Dynamic Range

TL;DR: This paper derives tight upper and lower bounds on the achievable sum-rate, and proposes a transmission scheme based on maximization of the lower bound, which requires us to (numerically) solve a nonconvex optimization problem.