Publications
Copyright information: personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the publisher.
A fast counting method for generic order intermodulation products
| Publication type | Conference paper |
|---|---|
| Year of publication | 2002 |
| Authors | Giuseppe Baruffa and Gianluca Reali |
| Title | A fast counting method for generic order intermodulation products |
| Conference name | IEEE International Conference on Global Communications (Globecom 2002) |
| Volume | 3 |
| Issue | |
| Pages | 2036–2040 |
| Editor | |
| Publisher | IEEE |
| Date | November 2002 |
| Place | Taipei, Taiwan |
| ISSN number | |
| ISBN number | 0-7803-7632-3 |
| Key words | |
| Abstract | Non linear devices such as amplifiers and electro-optical transducers introduce spurious signals known as intermodulations, especially when multiple signals at different frequencies access the system. In this paper an extension to the well known Fast Counting Algorithm (FCA) for the intermodulations is presented and a comparison with slow counting algorithms is done. Carrier configuration is represented by means of indicator polynomials, and high-order intermodulation products distribution can be computed in a fast way, extending the results restricted to third order intermodulations. Moreover, no particular assumption is done on the distribution of the carriers (i.e. they are not required to be equispaced). Comparisons are made in terms of accuracy and speed with slow direct counting algorithms. |
| URL | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1188988 |
| DOI | http://dx.doi.org/10.1109/GLOCOM.2002.1188988 |
| Other information | |
| Paper |  (portable document format, 241632 Bytes) |