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

被引:0
|
作者
Roychowdhury, JS
Feldmann, P
机构
关键词
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 条
  • [41] Linear-time algorithm to find modules of fault trees
    Universite Bordeaux I, Talence, France
    IEEE Trans Reliab, 3 (422-425):
  • [42] A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
    Damaschke, Peter
    Journal of Graph Algorithms and Applications, 2024, 28 (01) : 385 - 388
  • [43] A linear-time algorithm for computing the multinomial stochastic complexity
    Kontkanen, Petri
    Myllymaki, Petri
    INFORMATION PROCESSING LETTERS, 2007, 103 (06) : 227 - 233
  • [44] Identifying hierarchical structure in sequences: A linear-time algorithm
    NevillManning, CG
    Witten, IH
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1997, 7 : 67 - 82
  • [45] A linear-time algorithm to find modules of fault trees
    Dutuit, Y
    Rauzy, A
    IEEE TRANSACTIONS ON RELIABILITY, 1996, 45 (03) : 422 - 425
  • [46] A linear-time algorithm for generalized trust region subproblems
    Jiang, Rujun
    Li, Duan
    SIAM Journal on Optimization, 2020, 30 (01): : 915 - 932
  • [47] A LINEAR-TIME ALGORITHM FOR THE MAXIMUM MATCHING PROBLEM ON COGRAPHS
    YU, MS
    YANG, CH
    BIT, 1993, 33 (03): : 420 - 433
  • [48] A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees
    V. Auletta
    A. Monti
    M. Parente
    P. Persiano
    Algorithmica, 1999, 23 : 223 - 245
  • [49] An almost linear-time algorithm for trapezoidation of GIS polygons
    Lorenzetto, GP
    Datta, A
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2004, 20 (07): : 1145 - 1155
  • [50] Linear-time algorithm for drawing a planar graph on a grid
    Chrobak, M.
    Payne, T.H.
    Information Processing Letters, 1995, 54 (04):