Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

3.5 GHz Federal Incumbent Protection Algorithms

Published

Author(s)

Michael R. Souryal, Thao T. Nguyen, Nickolas J. LaSorte

Abstract

The current standardized algorithm for U.S. federal incumbent protection in the 3.5 GHz band is sub-optimum in that it moves more commercial transmissions out of the protected channel than necessary, in most cases. This paper proposes a more efficient algorithm that packs transmissions in the allowed interference budget jointly across incumbent receiver azimuths rather than independently, resulting in 7% to 40% fewer commercial transmissions affected.
Proceedings Title
IEEE International Symposium on Dynamic Spectrum Access Networks
Conference Dates
October 22-25, 2018
Conference Location
Seoul, KR

Keywords

3.5 GHz, incumbent protection, interference, spectrum sharing

Citation

Souryal, M. , Nguyen, T. and LaSorte, N. (2018), 3.5 GHz Federal Incumbent Protection Algorithms, IEEE International Symposium on Dynamic Spectrum Access Networks, Seoul, KR, [online], https://doi.org/10.1109/DySPAN.2018.8610480, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=926121 (Accessed October 9, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created October 21, 2018, Updated April 13, 2022
Was this page helpful?