Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/62540
DC Field | Value | |
---|---|---|
dc.title | On the stationary points of the output power versus response zero performance surface in power inversion arrays | |
dc.contributor.author | Ko, C.C. | |
dc.contributor.author | Balabhaskar, G. | |
dc.contributor.author | Chin, F. | |
dc.date.accessioned | 2014-06-17T06:52:10Z | |
dc.date.available | 2014-06-17T06:52:10Z | |
dc.date.issued | 1992-06 | |
dc.identifier.citation | Ko, C.C.,Balabhaskar, G.,Chin, F. (1992-06). On the stationary points of the output power versus response zero performance surface in power inversion arrays. IEE Proceedings, Part F: Radar and Signal Processing 139 (3) : 199-206. ScholarBank@NUS Repository. | |
dc.identifier.issn | 0956375X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/62540 | |
dc.description.abstract | The stationary points and transient behaviour of using zero tracking based techniques in a power inversion array are investigated in this paper. As a function of the response zeros, the output power performance surface has been found to possess no local minimum, although saddle points may exist at positions where some of the zeros are identical. Since the saddle points are unstable and the inputs are stochastic in nature, steepest descent based zero tracking algorithms will always converge to the global minimum, even though the zeros being adjusted may wander close to the saddle points for an appreciable amount of time. Nevertheless, with only a single asymptotic time constant, the use of zero tracking as discussed has been found to have a transient convergence which, when compared with the LMS algorithm of about the same implementation complexity, is generally much faster and more uniform with respect to the starting positions and the environment. Together with the advantages that the zeros are directly available and that the tracking behaviour is determined by the asymptotic time constant only, zero tracking is an attractive viable alternative for algorithms whose complexity is proportional to the size of the array. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | IEE Proceedings, Part F: Radar and Signal Processing | |
dc.description.volume | 139 | |
dc.description.issue | 3 | |
dc.description.page | 199-206 | |
dc.description.coden | IPFPE | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.