Cameron D. Patterson

Cameron D. Patterson

Auto-generated profile, based on publicly available information

Cameron D. Patterson

Virginia Tech

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MYMiao Yao
Miao Yao
MCMatt Carrick
Matt Carrick
MSMunawwar M. Sohul
Munawwar M. Sohul
VMVuk Marojevic
Vuk Marojevic
CPCameron D. Patterson
Cameron D. Patterson
JRJeffrey H. Reed
Jeffrey H. Reed
Massive MIMO requires a large number of antennas and the same amount of power amplifiers (PAs), one per antenna. As opposed to 4G base stations, which could afford highly linear PAs, next-generation base stations will need to use inexpensive PAs, which have a limited region of linear amplification. One of the research challenges is effectively handling signals which have high peak-to-average power ratios (PAPRs), such as orthogonal frequency division multiplexing (OFDM). This paper introduces a PAPR-aware precoding scheme that exploits the excessive spatial degrees-of-freedom of large scale multiple-input multiple-output (MIMO) antenna systems. This typically requires finding a solution to a nonconvex optimization problem. Instead of relaxing the problem to minimize the peak power, we introduce a practical semidefinite relaxation (SDR) framework that enables accurately and efficiently approximating the theoretical PAPR-aware precoding performance for OFDM-based massive MIMO systems. The framework allows incorporating channel uncertainties and intercell coordination. Numerical results show that several orders of magnitude improvements can be achieved w.r.t. state of the art techniques, such as instantaneous power consumption reduction and multiuser interference cancellation. The proposed PAPR-aware precoding can be effectively handled along with the multicell signal processing by the centralized baseband processing platforms of next-generation radio access networks. Performance can be traded for the computing efficiency for other platforms.


1 December 2007
Verified
Conference Paper
Closed access
CPC. Patterson
C. Patterson
BMB. Martin
B. Martin
SES. Ellingson
S. Ellingson
JSJ. Simonetti
J. Simonetti
SCS. Cutchin
S. Cutchin
Array-based, direct-sampling radio telescopes have computational and communication requirements unsuited to conventional computer and cluster architectures. Synchronization must be strictly maintained across a large number of parallel data streams, from A/D conversion, through operations such as beamforming, to dataset recording. FPGAs supporting multi-gigabit serial I/O are ideally suited to this application. We describe a recently-constructed radio telescope called ETA having all-sky observing capability for detecting low frequency pulses from transient events such as gamma ray bursts and exploding primordial black holes. Signals from 24 dipole antennas are processed by a tiered arrangement of 28 commercial FPGA boards and 4 PCs with FPGA-based data acquisition cards, connected with custom I/O adapter boards supporting InfiniBand and LVDS physical links. ETA is designed for unattended operation, allowing configuration and recording to be controlled remotely.

1 July 2008
Verified
Conference Paper
Closed access
JSJorge Suris
Jorge Suris
MSMatthew Shelburne
Matthew Shelburne
CPCameron Patterson
Cameron Patterson
PAPeter Athanas
Peter Athanas
JBJohn Bowen
John Bowen
JRJustin Rice
Justin Rice
In systems typified by software defined radio, existing flows for run-time FPGA reconfiguration limit resource efficiency when constructing datapaths. We present the wires-on-demand framework that allocates a sandbox region in which modules from a library are flexibly placed and interconnected rapidly and autonomously in an embedded platform without vendor tools.

1 August 2007
Verified
Conference Paper
Closed access
ABAric D. Blumer
Aric D. Blumer
HMHenning Mortveit
Henning Mortveit
CPCameron D. Patterson
Cameron D. Patterson
This paper develops a formal model of process migration that describes programs, processes, and the migration of those processes within a migration realm. A migration realm is a group of processors modeled as finite state machines. The model is motivated by a migration application between software and field programmable gate array (FPGA) hardware, and the theorems of the model guide the use of FPGA resources while guaranteeing complete and correct execution of a process. By defining different types of migration realms this paper also develops a migration realm taxonomy.