发布求助
文献互助 智能选刊 最新文献

Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)最新文献

筛选
英文 中文
An N2logN back-projection algorithm for SAR image formation SAR图像生成的N2logN反投影算法
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-12-01 DOI: 10.1109/ACSSC.2000.910908
Shu Xiao, D. Munson, S. Basu, Y. Bresler
{"title":"An N2logN back-projection algorithm for SAR image formation","authors":"Shu Xiao, D. Munson, S. Basu, Y. Bresler","doi":"10.1109/ACSSC.2000.910908","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910908","url":null,"abstract":"We propose a fast algorithm for far-field SAR imaging based on a new fast back-projection algorithm developed for tomography. We also modify the algorithm for the near-field scenario. The fast back-projection algorithm for SAR has a computational complexity O(N/sup 2/logN). Compared to traditional FFT-based methods, our new algorithm has potential advantages: the new algorithm does not need frequency-domain interpolation, which becomes complex for the wide-angle case; the new approach is applicable to the near-field scenario, taking into account wavefront curvature; and the back-projection algorithm can be easily adapted to parallel computing architectures. For some scenarios of interest, the computational cost of the new back-projection approach is similar to or less than that for FFT based algorithms.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"40 1","pages":"3-7 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75885643","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}
引用次数: 49
IFSAR for the rapid terrain visualization demonstration IFSAR用于快速地形可视化演示
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-31 DOI: 10.1109/ACSSC.2000.910909
B. L. Burns, P. Eichel, W. Hensley, T.J. Kim
{"title":"IFSAR for the rapid terrain visualization demonstration","authors":"B. L. Burns, P. Eichel, W. Hensley, T.J. Kim","doi":"10.1109/ACSSC.2000.910909","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910909","url":null,"abstract":"The Rapid Terrain Visualization Advanced Concept Technology Demonstration (RTV-ACTD) is designed to \"demonstrate the technologies and infrastructure to meet the Army requirement for rapid generation of digital topographic data to support emerging crisis or contingencies\". The primary sensor for this mission is an interferometric synthetic aperture radar (IFSAR) designed at Sandia National Laboratories. This paper will outline the design of the system and its performance, and show some flight test results. The RTV IFSAR will meet DTED level III and IV specifications by using a multiple-baseline design and high-accuracy differential and carrier-phase GPS navigation. It includes innovative near-real-time DEM production on-board the aircraft. The system is being flown on a deHavilland DHC-7 Army aircraft.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"153 1","pages":"8-15 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86669382","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}
引用次数: 18
Design and performance of residue number system based multicarrier CDMA in frequency-selective Rayleigh fading channels 基于剩余数系统的多载波CDMA在频率选择瑞利衰落信道中的设计与性能
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910640
A. Madhukumar, F. Chin
{"title":"Design and performance of residue number system based multicarrier CDMA in frequency-selective Rayleigh fading channels","authors":"A. Madhukumar, F. Chin","doi":"10.1109/ACSSC.2000.910640","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910640","url":null,"abstract":"This paper is concerned with a new method to enhance the bandwidth efficiency of an MC-CDMA system by using a residue number based representation for information symbols. The residues are mapped into a set of orthogonal sequences and are transmitted in parallel. A multicarrier modulation scheme is used for both transmission and reception of residue channels. Appropriate error correction methods are employed for enhancing the performance of the system. The aim of this paper is to discuss the issues involved in the design of an RNS based MC-CDMA system and to evaluate the performance of the system in a frequency selective Rayleigh fading channel.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"4 1","pages":"884-888 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74499591","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}
引用次数: 5
Speech spectrum modeling applied to spectrum coding and prediction 语音频谱建模在频谱编码和预测中的应用
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.911241
J. Lindblom, J. Samuelsson
{"title":"Speech spectrum modeling applied to spectrum coding and prediction","authors":"J. Lindblom, J. Samuelsson","doi":"10.1109/ACSSC.2000.911241","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911241","url":null,"abstract":"In this work, the speech spectrum source is modeled. The spectrum is represented by the cepstral coefficients resulting from linear prediction analysis of speech. The models are Gaussian mixture densities, estimated iteratively using two expectation maximization type algorithms. The contribution is an investigation of the algorithms using theoretical measures well as practical applications. The applications are spectrum coding and prediction. Some low-dimensional modeling examples, illustrating the behavior of the two algorithms graphically are given. One of the algorithms has the bounded support issue of the source incorporated in its update equations, resulting in improved modeling accuracy.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"63 5 1","pages":"1502-1506 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77655930","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}
引用次数: 1
Low-memory, fixed-latency Huffman encoder for unbounded-length codes 低内存，固定延迟的哈夫曼编码器的无限长度的代码
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910670
R. Freking, K. Parhi
{"title":"Low-memory, fixed-latency Huffman encoder for unbounded-length codes","authors":"R. Freking, K. Parhi","doi":"10.1109/ACSSC.2000.910670","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910670","url":null,"abstract":"The Huffman compression algorithm makes reference to a binary tree abstraction that can be employed directly as a data structure for decoding. Unfortunately, the same convenient arrangement has heretofore not served the encoding task. In this paper, the tree structure is revived in an enhanced form that allows encoding to progress naturally from root to leaf. Because this solution is tree based, codewords are not subject to length limitation. Yet, in marked contrast with other unbounded encoders, memory outlay is fixed by the size of the alphabet. Moreover this storage expense is low in comparison with non-tree-based solutions. Also unlike previous tree structures, no post-encoding reversal is demanded resulting in constant-latency operation regardless of codeword length. Furthermore, only simple addition operators are required at each step. Despite its advantages, implementation is uncomplicated and codebook formatting is trivial.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"1 1","pages":"1031-1034 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79775911","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}
引用次数: 5
Image reconstruction for a novel Compton scatter tomograph 新型康普顿散射层析成像的图像重建
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910972
A. Hero, A. Sauve, T. Kragh
{"title":"Image reconstruction for a novel Compton scatter tomograph","authors":"A. Hero, A. Sauve, T. Kragh","doi":"10.1109/ACSSC.2000.910972","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910972","url":null,"abstract":"Single photon emission computed tomography (SPECT) is a widespread medical imaging technology which provides images of metabolic tracer distributions within the body by detecting gamma-ray emissions from decaying radioactive isotopes in the tracer The Compton single photon emission tomograph (C-SPECT) is a new imaging technology which promises significantly higher sensitivity than standard mechanically collimated SPECT scanners due its use of fully 3D electronic collimation of Compton scattered gamma-rays. Since the C-SPECT scanner generates extremely large data sets, and since the gamma-ray emission and detection processes are governed by the statistical physics of nuclear interactions, the theory of large scale statistical signal and image processing must play a significant role in the development of this new technology. In this paper we summarize results on the application of estimation theoretic lower bounds and image reconstruction to a C-SPECT system.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"22 1","pages":"328-332 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79334818","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}
引用次数: 1
A constrained asymmetry LMS algorithm for PRML disk drive read channels PRML磁盘驱动器读通道的约束不对称LMS算法
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910992
R. Staszewski, K. Muhammad, P. Balsara
{"title":"A constrained asymmetry LMS algorithm for PRML disk drive read channels","authors":"R. Staszewski, K. Muhammad, P. Balsara","doi":"10.1109/ACSSC.2000.910992","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910992","url":null,"abstract":"We present an implementation of a constrained least mean square (C-LMS) algorithm with application to magnetic disk drive read channels. The main advantage offered by the presented C-LMS algorithm is improved stability of the outer timing recovery loop while the spectral shaping of read-back data is performed in the inner adaptation loop. This eliminates any unstable behavior of the timing recovery loop during C-LMS algorithm adaptation. The proposed algorithm has been implemented and fabricated in a commercial read-channel using a 0.18 /spl mu/m L/sub eff/ CMOS technology. It operates at 550 MHz worst case.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"30 1","pages":"433-437 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81814492","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}
引用次数: 5
Optimal-depth circuits for prefix computation and addition 前缀计算和加法的最优深度电路
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.911212
C. Yeh, Emmanouel Varvarigos, B. Parhami
{"title":"Optimal-depth circuits for prefix computation and addition","authors":"C. Yeh, Emmanouel Varvarigos, B. Parhami","doi":"10.1109/ACSSC.2000.911212","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.911212","url":null,"abstract":"Addition and prefix computation are among the most fundamental problems in arithmetic and algebraic computation. In this paper, we present efficient circuits for performing prefix computation and addition with small depth and size and flexible fan-in (i.e., the maximum fan-in can be selected as a small constant or a larger constant/nonconstant number). In particular, we show that any prefix operation of n inputs can be computed using a circuit of fan-in k, depth log/sub k/n+o(log/sub k/n)+O(1), gate complexity O(n), and edge complexity O(n log/sup d-1**...*d-1/n), for any constant integer d. We show that the sum of two n-bit numbers can be found using an AND-OR circuit of fan-in k, depth log/sub k/n+o(log/sub k/n)+O(1), and edge complexity O(n(log/sup d-1**...*d-1/n)/sup 2/), for any constant integer d. In particular, the depths of our circuits for prefix computation and addition are optimal within a factor of 1+o(1), for any fan-in k=n/sup o(1)/.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"5 1","pages":"1349-1353 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84283632","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}
引用次数: 5
Improved constrained optimization method for CDMA systems 改进的CDMA系统约束优化方法
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910771
Zhengyuan Xu
{"title":"Improved constrained optimization method for CDMA systems","authors":"Zhengyuan Xu","doi":"10.1109/ACSSC.2000.910771","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910771","url":null,"abstract":"The constrained optimization method has been shown to be applicable for direct CDMA receiver design. However, due to the presence of additive noise and multipath distortion, the optimal constraint is a biased estimate for the channel, resulting in some performance loss of the constrained receiver compared with the MMSE receiver. This loss becomes more significant for the lower SNRs. It is shown in this paper that constrained optimization is closely related to the subspace method which can give a good estimate for the channel. Motivated by this result, a modified cost function is proposed to obtain the constraint with less complexity than the subspace method and better performance than the previously proposed constrained method.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"29 1","pages":"1293-1297 vol.2"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85914574","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}
引用次数: 3
Rapid adaptation in subspace leakage environments via covariance matrix tapering 基于协方差矩阵渐变的子空间泄漏环境快速适应
Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI: 10.1109/ACSSC.2000.910960
J. Guerci, J. Bergin
{"title":"Rapid adaptation in subspace leakage environments via covariance matrix tapering","authors":"J. Guerci, J. Bergin","doi":"10.1109/ACSSC.2000.910960","DOIUrl":"https://doi.org/10.1109/ACSSC.2000.910960","url":null,"abstract":"In this paper, a new approach to adaptive interference mitigation is presented which combines the principal components (PC) method with the concept of a covariance matrix taper (CMT). The PC-CMT method is shown to preserve the minimal sample support property of the PC method even when there is significant subspace leakage of the dominant interference subspace. In addition to demonstrating its utility for STAP applications, a more computationally attractive variant based on a combined diagonally loaded SMI and CMT (SMI-CMT) is introduced. The Mountain Top Radar is used as an example.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"6 1","pages":"283-286 vol.1"},"PeriodicalIF":0.0,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81981370","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信