COMPUTATIONAL EXPERIENCE WITH A DUAL BACKTRACK ALGORITHM FOR IDENTIFYING FREQUENCIES LIKELY TO CREATE INTERMODULATION PROBLEMS.

Susumu Morito*, Harvey M. Salkin, Kamlesh Mathur

*この研究の対応する著者

    研究成果: Article査読

    5 被引用数 (Scopus)

    抄録

    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 five 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 comptutations. Statistics for these computs 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.

    本文言語English
    ページ(範囲)32-36
    ページ数5
    ジャーナルIEEE Transactions on Electromagnetic Compatibility
    EMC-23
    1
    出版ステータスPublished - 1981 2

    ASJC Scopus subject areas

    • コンピュータ ネットワークおよび通信
    • 電子工学および電気工学

    フィンガープリント

    「COMPUTATIONAL EXPERIENCE WITH A DUAL BACKTRACK ALGORITHM FOR IDENTIFYING FREQUENCIES LIKELY TO CREATE INTERMODULATION PROBLEMS.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル