Research Reports from the Department of Operations
Document Type
Report
Publication Date
3-1-1980
Abstract
This paper describes the results of a computational study using a particular enumeration procedure, called a backtrack algorithm, to find the lowest order of radio frequency intermodulation. The average lowest order and its standard deviation, the average computer time and its standard deviation, along with other relevant statistics are obtained for a series of randomly generated problems with sets of 5 to 75 threat or source frequencies. Other parameters, such as the guard band, the maximum number of concurrent threats, and the size of the frequency band on the lowest order of intermodulation are varied during the computations. Statistics for these computer runs along with those relating to terminating the algorithm when the lowest "acceptable" order is reached are presented in some detail. Brief conclusions follow a listing of the results.
Keywords
Operations research, Algorithms, Radio--Interference, Computational complexity, Computer simulation, Radio frequency allocation, Backtrack programming
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 462
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Morito, Susumu; Salkin, Harvey M.; and Mathur, Kamlesh, "Computational Experience with a Dual Backtrack Algorithm for Identifying Frequencies Likely to Create Intermodulation Problems" (1980). Research Reports from the Department of Operations. 84.
https://commons.case.edu/wsom-ops-reports/84