A new linear-time harmonic balance algorithm for cyclostationary noise analysis in RF circuits

被引:0
|
作者
Roychowdhury, JS
Feldmann, P
机构
来源
PROCEEDINGS OF THE ASP-DAC '97 - ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 1997 | 1996年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new technique is presented for computing noise in nonlinear circuits. The method is based on a formulation that uses harmonic power spectral densities (HPSDs), using which a block-structured matrix relation between the second-order statistics of noise within a circuit is derived. The HPSD formulation is used to devise a harmonic-balance-based noise algorithm that requires O(nN log N). time and O(nN) memory, where n represents circuit size and N the number of harmonics of the large-signal steady state. The method treats device noise sources with arbitrarily shaped PSDs (including thermal, shot and flicker noises), handles noise input correlations and computes correlations between different outputs. The HPSD formulation is also used to establish the non-intuitive result that bandpass filtering of cyclostationary noise can result in stationary noise. The new technique is illustrated using an example that exhibits noise folding and interaction between harmonic PSD components. The results are validated against Monte-Carlo simulations. The noise performance of a large industrial integrated RF circuit (with >300 nodes) is also analyzed in less than 2 hours using tile new method.
引用
收藏
页码:483 / 492
页数:10
相关论文
共 50 条
  • [31] ON THE CORRECTNESS OF A LINEAR-TIME VISIBILITY POLYGON ALGORITHM
    JOE, B
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 32 (3-4) : 155 - 172
  • [32] A Linear-Time Algorithm for Broadcast Domination in a Tree
    Dabney, John
    Dean, Brian C.
    Hedetniemi, Stephen T.
    NETWORKS, 2009, 53 (02) : 160 - 169
  • [33] A Linear-time Algorithm for Optimal Tree Completion
    Aiemvaravutigul, Chawin
    Wongwattanakij, Nonthaphat
    2019 16TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2019), 2019, : 11 - 16
  • [34] A linear-time nearest point algorithm for the lattice An*
    McKilliam, Robby G.
    Clarkson, I. Vaughan L.
    Smith, Warren D.
    Quinn, Barry G.
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1239 - +
  • [35] A linear-time algorithm for trust region problems
    Elad Hazan
    Tomer Koren
    Mathematical Programming, 2016, 158 : 363 - 381
  • [36] AN ADAPTIVE ALGORITHM FOR THE ANALYSIS OF LINEAR CIRCUITS IN A TIME DOMAIN
    DMITRIYEVZDOROV, VB
    POPOV, VP
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1983, 26 (06): : 5 - 8
  • [37] NEW LINEAR-TIME ONLINE ALGORITHM FOR FINDING SMALLEST INITIAL PALINDROME OF A STRING
    MANACHER, G
    JOURNAL OF THE ACM, 1975, 22 (03) : 346 - 351
  • [38] A linear-time algorithm for finding a maximal planar subgraph
    Djidjev, Hristo N.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
  • [39] Linear-time general decoding algorithm for the surface code
    Darmawan, Andrew S.
    Poulin, David
    PHYSICAL REVIEW E, 2018, 97 (05)
  • [40] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
    GABOW, HN
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263