Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911249
Y.H. Cho
Automatic target recognition (ATR) in synthetic aperture radar (SAR) imagery often requires billions of operations per second. This paper describes a compact scalable system developed at Myricom for high-performance implementation of the template-based SAR ATR algorithms developed by Sandia National Laboratories. The Myricom system is mapped on the multiple concurrent field programmable array (FPGA) computing nodes connected by Myrinet. These FPGA nodes achieve high efficiency, through the exploitation of the unique characteristics of the ATR algorithm in FPGA. The contributions of this paper are the descriptions of the architectural designs for the ATR system on the scalable FPGA nodes.
{"title":"Optimized automatic target recognition algorithm on scalable Myrinet/field programmable array nodes","authors":"Y.H. Cho","doi":"10.1109/ACSSC.2000.911249","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911249","url":null,"abstract":"Automatic target recognition (ATR) in synthetic aperture radar (SAR) imagery often requires billions of operations per second. This paper describes a compact scalable system developed at Myricom for high-performance implementation of the template-based SAR ATR algorithms developed by Sandia National Laboratories. The Myricom system is mapped on the multiple concurrent field programmable array (FPGA) computing nodes connected by Myrinet. These FPGA nodes achieve high efficiency, through the exploitation of the unique characteristics of the ATR algorithm in FPGA. The contributions of this paper are the descriptions of the architectural designs for the ATR system on the scalable FPGA nodes.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"56 1","pages":"1545-1549 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82887172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.910910
S. Marple
This paper replaces the quadratic-based time-frequency Wigner analysis technique with a linear-based new high-resolution 2-D time-frequency analysis technique with all the good behavior of the quadratic techniques and none of the bad behavior.
{"title":"Time-frequency signal analysis via transformed windowed data array with application to 2-D and 3-D high-resolution radar processing","authors":"S. Marple","doi":"10.1109/ACSSC.2000.910910","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910910","url":null,"abstract":"This paper replaces the quadratic-based time-frequency Wigner analysis technique with a linear-based new high-resolution 2-D time-frequency analysis technique with all the good behavior of the quadratic techniques and none of the bad behavior.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"5 2 1","pages":"16-20 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90060388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.910759
G. Dimić, N. Sidiropoulos
We propose a multicode multicarrier random access protocol for wireless LANs that builds upon earlier work in blind network-diversity multiple access (B-NDMA) for packet radio. B-NDMA guarantees blind separation of users' packets with virtually no throughput penalty. The proposed scheme allows users to transmit multiple packets per channel slot, each modulated by a random digital "retransmission carrier". This incurs no throughput penalty and attains significantly lower delay, while maintaining the blind collision resolution capability of B-NDMA.
{"title":"Multicode multicarrier random access","authors":"G. Dimić, N. Sidiropoulos","doi":"10.1109/ACSSC.2000.910759","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910759","url":null,"abstract":"We propose a multicode multicarrier random access protocol for wireless LANs that builds upon earlier work in blind network-diversity multiple access (B-NDMA) for packet radio. B-NDMA guarantees blind separation of users' packets with virtually no throughput penalty. The proposed scheme allows users to transmit multiple packets per channel slot, each modulated by a random digital \"retransmission carrier\". This incurs no throughput penalty and attains significantly lower delay, while maintaining the blind collision resolution capability of B-NDMA.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"10 1","pages":"1230-1234 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89630010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911288
D. Sworder, J. E. Boyd, R. Eliott, R. Hutchins
Multiple model fusion is useful in applications in which the model of the signal processes is not known with certainty. This paper compares two current fusion algorithms with a novel alternative. The new fusion approach is shown to give improved performance when the observation rate is slow as compared with the important time constants of the signal.
{"title":"Data fusion using multiple models","authors":"D. Sworder, J. E. Boyd, R. Eliott, R. Hutchins","doi":"10.1109/ACSSC.2000.911288","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911288","url":null,"abstract":"Multiple model fusion is useful in applications in which the model of the signal processes is not known with certainty. This paper compares two current fusion algorithms with a novel alternative. The new fusion approach is shown to give improved performance when the observation rate is slow as compared with the important time constants of the signal.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"14 1","pages":"1749-1753 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89535116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911227
H. Trigui, C. Fischer, D. Slock
We address the problem of downlink interference rejection in a DS-CDMA system. Periodic orthogonal Walsh-Hadamard sequences spread different users' symbols followed by scrambling by a symbol aperiodic base-station specific overlay sequence. The point-to-point propagation channel from the cell-site to a certain mobile station is the same for all downlink signals (desired user as well as the intracell interference). The intercell interference (which can be seen as co-channel interference) degrades significantly the performance of the receiver when the mobile approaches the edge of its cell and the situation becomes more critical at the soft handover. We propose to simultaneously equalize the user of interest while cancelling (or reducing) the intercell interferers by the interference cancelling matched filter (ICMF) receiver which we introduced previously. We can get rid of the intracell interference by the maximum SINR receiver following the ICMF. The ICMF depends on the common channel for the cell of interest, to be estimated with a pilot sequence, and contains a blind interference cancellation part. The critical part is the channel estimation. The usual correlation method may lead to poor estimates in high interference environments. Significant improvements result from the exploitation of the sparceness of the propagation channel model.
{"title":"Semi-blind downlink inter-cell interference cancellation for FDD DS-CDMA systems","authors":"H. Trigui, C. Fischer, D. Slock","doi":"10.1109/ACSSC.2000.911227","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911227","url":null,"abstract":"We address the problem of downlink interference rejection in a DS-CDMA system. Periodic orthogonal Walsh-Hadamard sequences spread different users' symbols followed by scrambling by a symbol aperiodic base-station specific overlay sequence. The point-to-point propagation channel from the cell-site to a certain mobile station is the same for all downlink signals (desired user as well as the intracell interference). The intercell interference (which can be seen as co-channel interference) degrades significantly the performance of the receiver when the mobile approaches the edge of its cell and the situation becomes more critical at the soft handover. We propose to simultaneously equalize the user of interest while cancelling (or reducing) the intercell interferers by the interference cancelling matched filter (ICMF) receiver which we introduced previously. We can get rid of the intracell interference by the maximum SINR receiver following the ICMF. The ICMF depends on the common channel for the cell of interest, to be estimated with a pilot sequence, and contains a blind interference cancellation part. The critical part is the channel estimation. The usual correlation method may lead to poor estimates in high interference environments. Significant improvements result from the exploitation of the sparceness of the propagation channel model.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"12 1","pages":"1431-1435 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89822280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911034
K. McDonald, R. Blum
Adaptive algorithms for receivers employing antenna arrays have received significant attention for radar systems applications. We present exact expressions for the space-time adaptive processing (STAP) algorithm performance when the covariance matrix of the test cell is different from the average covariance matrix of the surrounding range cells. Numerical evaluation of these expressions illustrates the probability of detection and the probability of false alarm for various cases of interest. The equations are utilized to determine an upper bound on the performance of a class of STAP algorithms.
{"title":"Performance characterization of STAP algorithms with mismatched steering and clutter statistics","authors":"K. McDonald, R. Blum","doi":"10.1109/ACSSC.2000.911034","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911034","url":null,"abstract":"Adaptive algorithms for receivers employing antenna arrays have received significant attention for radar systems applications. We present exact expressions for the space-time adaptive processing (STAP) algorithm performance when the covariance matrix of the test cell is different from the average covariance matrix of the surrounding range cells. Numerical evaluation of these expressions illustrates the probability of detection and the probability of false alarm for various cases of interest. The equations are utilized to determine an upper bound on the performance of a class of STAP algorithms.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"18 1","pages":"646-650 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88084227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.910686
L. Scharf, M. McCloud
In much of modern radar, sonar and wireless communication it seems more reasonable to model measurements as signal-plus-subspace interference-plus-broadband noise, than as signal-plus-colored noise. This observation leads naturally to a variety of detection and estimation problems in the linear statistical model. To solve these problems, one requires oblique pseudo-inverses, oblique projections, and zero-forcing orthogonal projections. The problem is that these operators depend on knowledge of signal and interference subspaces, and this information is often not at hand. More typically the signal subspace is known, but the interference subspace is unknown. In this paper we prove a theorem which allows these operators to be estimated directly from experimental data, without knowledge of the interference subspace. As a by-product, the theorem shows how signal subspace covariance and power may be estimated. The results of this paper form the foundation for the rapid adaptation of receivers which are then used for detection and estimation. They may be applied to detection and estimation in radar and sonar and to data decoding in multiuser communication receivers.
{"title":"Matched and adaptive subspace detectors when interference dominates noise","authors":"L. Scharf, M. McCloud","doi":"10.1109/ACSSC.2000.910686","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910686","url":null,"abstract":"In much of modern radar, sonar and wireless communication it seems more reasonable to model measurements as signal-plus-subspace interference-plus-broadband noise, than as signal-plus-colored noise. This observation leads naturally to a variety of detection and estimation problems in the linear statistical model. To solve these problems, one requires oblique pseudo-inverses, oblique projections, and zero-forcing orthogonal projections. The problem is that these operators depend on knowledge of signal and interference subspaces, and this information is often not at hand. More typically the signal subspace is known, but the interference subspace is unknown. In this paper we prove a theorem which allows these operators to be estimated directly from experimental data, without knowledge of the interference subspace. As a by-product, the theorem shows how signal subspace covariance and power may be estimated. The results of this paper form the foundation for the rapid adaptation of receivers which are then used for detection and estimation. They may be applied to detection and estimation in radar and sonar and to data decoding in multiuser communication receivers.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"12 1","pages":"1105-1108 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78658751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911011
Z. Tian, K. Bell, H. van Trees
This paper provides a comprehensive treatment of space-time blind minimum output energy (MOE) detection in multipath CDMA channels with receiver antenna arrays. Different constrained MOE detection schemes are derived using both the centralized and decentralized space-time receiver structures. Under each structure, the detection design is based on a generic constraint design framework that illustrates the tradeoffs between performance and computational complexity in a unified manner.
{"title":"Space-time blind MOE detection for CDMA wireless systems","authors":"Z. Tian, K. Bell, H. van Trees","doi":"10.1109/ACSSC.2000.911011","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911011","url":null,"abstract":"This paper provides a comprehensive treatment of space-time blind minimum output energy (MOE) detection in multipath CDMA channels with receiver antenna arrays. Different constrained MOE detection schemes are derived using both the centralized and decentralized space-time receiver structures. Under each structure, the detection design is based on a generic constraint design framework that illustrates the tradeoffs between performance and computational complexity in a unified manner.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"56 1","pages":"526-531 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81490408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911275
A. Faroqui, V. Oklobdzija
Media signal processing requires high computing power and the algorithms exhibit a great deal of parallelism on low precision data. The basic components of multi-media objects are usually simple integers with 8, 12, or 16 bits of precision. In order to support efficient processing of media signals, instructions set architecture (ISA) of the traditional processors requires modifications. In this paper, we present the quantitative analysis and the computational complexity required to perform media processing. Main classes of instructions that are needed for the required level of performance of the Media Processor are identified. Their efficient implementation and effect on the processor datapath is discussed. The main operations required in media processing are Addition (with or without saturation), Multiplication (with or without rounding), Sum of Products, and Average of two numbers.
{"title":"Impact of architecture extensions for media signal processing on data-path organization","authors":"A. Faroqui, V. Oklobdzija","doi":"10.1109/ACSSC.2000.911275","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911275","url":null,"abstract":"Media signal processing requires high computing power and the algorithms exhibit a great deal of parallelism on low precision data. The basic components of multi-media objects are usually simple integers with 8, 12, or 16 bits of precision. In order to support efficient processing of media signals, instructions set architecture (ISA) of the traditional processors requires modifications. In this paper, we present the quantitative analysis and the computational complexity required to perform media processing. Main classes of instructions that are needed for the required level of performance of the Media Processor are identified. Their efficient implementation and effect on the processor datapath is discussed. The main operations required in media processing are Addition (with or without saturation), Multiplication (with or without rounding), Sum of Products, and Average of two numbers.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"1 1","pages":"1679-1683 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83544957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-29DOI: 10.1109/ACSSC.2000.911220
Y. Vasavada, T. Biedka, J. Reed
This paper describes a blind beamforming algorithm based on maximum SINR criterion applied to the reverse link of the W-CDMA system. The maximum SINR weight vector is derived by exploiting the separation of the frequency band of the desired signal from the frequency band of the interference and noise after a despreading operation on the received CDMA signal. Thus, the algorithm applies the concept of the frequency gating to the CDMA beamforming. We call this algorithm a code gated algorithm or CGA to distinguish the use of CDMA spreading code in separating the desired signal from the interference and noise.
{"title":"Code gated algorithm: a blind adaptive antenna array beamforming scheme for the wideband CDMA system","authors":"Y. Vasavada, T. Biedka, J. Reed","doi":"10.1109/ACSSC.2000.911220","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911220","url":null,"abstract":"This paper describes a blind beamforming algorithm based on maximum SINR criterion applied to the reverse link of the W-CDMA system. The maximum SINR weight vector is derived by exploiting the separation of the frequency band of the desired signal from the frequency band of the interference and noise after a despreading operation on the received CDMA signal. Thus, the algorithm applies the concept of the frequency gating to the CDMA beamforming. We call this algorithm a code gated algorithm or CGA to distinguish the use of CDMA spreading code in separating the desired signal from the interference and noise.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"40 1","pages":"1397-1402 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88263808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：