Pub Date : 2005-12-13DOI: 10.1109/CAMAP.2005.1574181
S. Yiu, R. Schober, L. Lampe
In this paper, we present an extension to our previous work on distributed space-time block coding where we considered cooperative networks with a large set of single-antenna decode-and-forward relays N. Here, we consider the general case where each relay node is equipped with N/sub T/ antennas and the destination node has N/sub R/ antennas. It is assumed that at any given time only a small, a priori unknown subset of nodes S C N is active. In the proposed scheme, the signal transmitted by an active node is the product of an information-carrying space-time block code (STBC) matrix, which is identical for all nodes, and a unique node signature matrix. It is shown that existing STBCs designed for N/sub c/ /spl ges/ 2 co-located antennas are a favorable choice for the code matrix guaranteeing a diversity order of d = min {N/sub c/N/sub R/, N/sub T/N/sub S/N/sub R/} if ns nodes are active. Simulation results show that a considerable gain can be achieved by using multiple-antenna nodes even if the antennas are highly correlated.
在本文中，我们对之前的分布式空时分组编码工作进行了扩展，其中我们考虑了具有大量单天线译码转发中继N的协作网络，这里我们考虑了每个中继节点配备N/sub T/天线，目的节点配备N/sub R/天线的一般情况。假设在任何给定的时间，只有一个小的，先验未知的节点S C N子集是活动的。在该方案中，活动节点传输的信号是一个携带信息的空时分组码矩阵(STBC)和一个唯一的节点签名矩阵的乘积，该矩阵对所有节点都是相同的。结果表明，在N/sub / /spl / 2共定位天线下设计的现有stbc是保证码矩阵分集阶数d = min {N/sub c/N/sub R/， N/sub T/N/sub S/N/sub R/}的较好选择。仿真结果表明，即使天线高度相关，使用多天线节点也能获得可观的增益。
{"title":"Distributed space-time block coding for cooperative networks with multiple-antenna nodes","authors":"S. Yiu, R. Schober, L. Lampe","doi":"10.1109/CAMAP.2005.1574181","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574181","url":null,"abstract":"In this paper, we present an extension to our previous work on distributed space-time block coding where we considered cooperative networks with a large set of single-antenna decode-and-forward relays N. Here, we consider the general case where each relay node is equipped with N/sub T/ antennas and the destination node has N/sub R/ antennas. It is assumed that at any given time only a small, a priori unknown subset of nodes S C N is active. In the proposed scheme, the signal transmitted by an active node is the product of an information-carrying space-time block code (STBC) matrix, which is identical for all nodes, and a unique node signature matrix. It is shown that existing STBCs designed for N/sub c/ /spl ges/ 2 co-located antennas are a favorable choice for the code matrix guaranteeing a diversity order of d = min {N/sub c/N/sub R/, N/sub T/N/sub S/N/sub R/} if ns nodes are active. Simulation results show that a considerable gain can be achieved by using multiple-antenna nodes even if the antennas are highly correlated.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115897280","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574219
V. Golikov, O. Lebedeva, A. Castillejos
We conduct a simulation analysis for assessing the constant false alarm rate (CFAR) behavior of three coherent radar detectors in the presence of correlated Gaussian clutter with unknown covariance. We establish the conditions a detector must fulfil in order to ensure the CFAR property. We discuss several detectors with quasi CFAR property. The analysis of CFAR property and the performance analysis, which has been carried out in the presence of correlated Gaussian clutter with unknown covariance, show that the proposed detectors exhibit a quite acceptable loss with respect to optimum Neyman-Pearson detector
{"title":"Robust CFAR detection in clutter with unknown covariance matrix","authors":"V. Golikov, O. Lebedeva, A. Castillejos","doi":"10.1109/CAMAP.2005.1574219","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574219","url":null,"abstract":"We conduct a simulation analysis for assessing the constant false alarm rate (CFAR) behavior of three coherent radar detectors in the presence of correlated Gaussian clutter with unknown covariance. We establish the conditions a detector must fulfil in order to ensure the CFAR property. We discuss several detectors with quasi CFAR property. The analysis of CFAR property and the performance analysis, which has been carried out in the presence of correlated Gaussian clutter with unknown covariance, show that the proposed detectors exhibit a quite acceptable loss with respect to optimum Neyman-Pearson detector","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126483629","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574226
R. Wu, T. Ristaniemi
A large number of signal processing researches consider estimating the parameters of unknown signal from sensor arrays. In this paper, the parameter estimation problem is focused on time delay and direction-of-arrival (DOA) in DS-CDMA arrays, here called two-dimensional code acquisition. A new subspace based estimator is introduced with a rigorous statistical analysis. We assume the training sequence corresponding to the desired user is known. Through the performance comparison with traditional MUSIC, we see the proposed method can be used for parameter estimation in highly correlated multipath propagation environment without knowing the number of correlated signals. Meanwhile, it is a powerful estimator with larger number of antenna elements, and an effective estimator to resist high MAI
{"title":"The performance analysis of EV-T method for two-dimensional code acquisition","authors":"R. Wu, T. Ristaniemi","doi":"10.1109/CAMAP.2005.1574226","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574226","url":null,"abstract":"A large number of signal processing researches consider estimating the parameters of unknown signal from sensor arrays. In this paper, the parameter estimation problem is focused on time delay and direction-of-arrival (DOA) in DS-CDMA arrays, here called two-dimensional code acquisition. A new subspace based estimator is introduced with a rigorous statistical analysis. We assume the training sequence corresponding to the desired user is known. Through the performance comparison with traditional MUSIC, we see the proposed method can be used for parameter estimation in highly correlated multipath propagation environment without knowing the number of correlated signals. Meanwhile, it is a powerful estimator with larger number of antenna elements, and an effective estimator to resist high MAI","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791455","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574209
T. Gulrez, S. Challa, T. Yaqub, J. Katupitiya
Determining the output of the most relevant sensor is of crucial importance when heterogeneous sensors are available for measuring a given process in an environment. In this paper, we describe an IEEE 1451 TEDS (transducer electronic data sheets) compliant sensor model for heterogeneous sensor networks. The proposed model uses the relevance feedback method to understand the context of a sensor learning application. We present results of a real time implementation of heterogeneous sensor networks using distributed multi-sensing 3D real-time robotics software player/gazebo on an autonomous mobile robot's navigation problem. The results show that the proposed model can be utilised in the real-time scenario and can help reduce the computational cost of a system
{"title":"Relevant opportunistic information extraction and scheduling in heterogeneous sensor networks","authors":"T. Gulrez, S. Challa, T. Yaqub, J. Katupitiya","doi":"10.1109/CAMAP.2005.1574209","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574209","url":null,"abstract":"Determining the output of the most relevant sensor is of crucial importance when heterogeneous sensors are available for measuring a given process in an environment. In this paper, we describe an IEEE 1451 TEDS (transducer electronic data sheets) compliant sensor model for heterogeneous sensor networks. The proposed model uses the relevance feedback method to understand the context of a sensor learning application. We present results of a real time implementation of heterogeneous sensor networks using distributed multi-sensing 3D real-time robotics software player/gazebo on an autonomous mobile robot's navigation problem. The results show that the proposed model can be utilised in the real-time scenario and can help reduce the computational cost of a system","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117026771","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574206
Yanwu Ding, Jian-Kang Zhang, K. Wong
In this paper, we derive the exact asymptotic pairwise error probability (PEP) of an AF half-duplex cooperative system in which the maximum likelihood detector is used. Based on our analysis and observations, we propose a unitary precoder design to improve the system performance. We first design a precoder to achieve the full diversity gain function. Then for the case of a 4-QAM signal being transmitted, we further optimize the coding gain, and arrived at a closed-form optimum precoder. Simulations indicate that our proposed precoder design greatly improves the performance of the system
{"title":"The pairwise error probability and precoder design for amplify-and-forward half-duplex cooperative system","authors":"Yanwu Ding, Jian-Kang Zhang, K. Wong","doi":"10.1109/CAMAP.2005.1574206","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574206","url":null,"abstract":"In this paper, we derive the exact asymptotic pairwise error probability (PEP) of an AF half-duplex cooperative system in which the maximum likelihood detector is used. Based on our analysis and observations, we propose a unitary precoder design to improve the system performance. We first design a precoder to achieve the full diversity gain function. Then for the case of a 4-QAM signal being transmitted, we further optimize the coding gain, and arrived at a closed-form optimum precoder. Simulations indicate that our proposed precoder design greatly improves the performance of the system","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121402440","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574204
C. Peng, Chia-Chin Lin, Tsung-Hui Chang, Chong-Yung Chi
In this paper, Chi and Chen's computationally efficient fast kurtosis maximization algorithm (FKMA) for blind beamforming and equalization is applied to the design of the conventional cascade space-time receiver (CSTR) for blind co-channel interference and inter-symbol interference (ISI) reduction in cellular wireless communications using antenna arrays. However, the receiver performance is limited as the normalized kurtosis magnitude of the ISI-distorted signal of interest, denoted as gamma, is small. Then a blind turbo space-time receiver (TSTR) is further proposed that applies spatial and temporal processing using FKMA in a cyclic fashion to estimate the desired data sequence. The performance of the proposed blind TSTR is insensitive to the value of gamma, and therefore is superior to that of the blind CSTR. Finally, some simulation results are provided to support the efficacy of the proposed blind TSTR
{"title":"Turbo space-time receiver by kurtosis maximization for CCI/ISI reduction in cellular wireless communications","authors":"C. Peng, Chia-Chin Lin, Tsung-Hui Chang, Chong-Yung Chi","doi":"10.1109/CAMAP.2005.1574204","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574204","url":null,"abstract":"In this paper, Chi and Chen's computationally efficient fast kurtosis maximization algorithm (FKMA) for blind beamforming and equalization is applied to the design of the conventional cascade space-time receiver (CSTR) for blind co-channel interference and inter-symbol interference (ISI) reduction in cellular wireless communications using antenna arrays. However, the receiver performance is limited as the normalized kurtosis magnitude of the ISI-distorted signal of interest, denoted as gamma, is small. Then a blind turbo space-time receiver (TSTR) is further proposed that applies spatial and temporal processing using FKMA in a cyclic fashion to estimate the desired data sequence. The performance of the proposed blind TSTR is insensitive to the value of gamma, and therefore is superior to that of the blind CSTR. Finally, some simulation results are provided to support the efficacy of the proposed blind TSTR","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"24 24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128463946","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574221
Pei-Jung Chung, J. Bohme, C. Mecklenbrauker, A. Hero
We treat the detection problem for multiple signals embedded in noisy observations from a sensor array as a multiple hypothesis test based on log-likelihood ratios. To control the global level of the multiple test, we apply the false discovery rate (FDR) criterion proposed by Benjamini and Hochberg. The power of this multiple test has been investigated through narrow band simulations in previous studies. Here we extend the proposed method to broadband signals. Unlike the narrow band case where the test statistics are characterized by F-distribution, in the broadband case the test statistics have no closed form distribution function. We apply the bootstrap technique to overcome this difficulty. Simulations show that the FDR-controlling procedure always provides more powerful results than the FWE controlling procedure. Furthermore, the reliability of the proposed test is not affected by the gain in power
{"title":"Multiple signal detection using the Benjamini-Hochberg procedure","authors":"Pei-Jung Chung, J. Bohme, C. Mecklenbrauker, A. Hero","doi":"10.1109/CAMAP.2005.1574221","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574221","url":null,"abstract":"We treat the detection problem for multiple signals embedded in noisy observations from a sensor array as a multiple hypothesis test based on log-likelihood ratios. To control the global level of the multiple test, we apply the false discovery rate (FDR) criterion proposed by Benjamini and Hochberg. The power of this multiple test has been investigated through narrow band simulations in previous studies. Here we extend the proposed method to broadband signals. Unlike the narrow band case where the test statistics are characterized by F-distribution, in the broadband case the test statistics have no closed form distribution function. We apply the bootstrap technique to overcome this difficulty. Simulations show that the FDR-controlling procedure always provides more powerful results than the FWE controlling procedure. Furthermore, the reliability of the proposed test is not affected by the gain in power","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116230814","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574216
S. Narieda, K. Yamashita
In this paper, we propose an eigenmode SNR increasing method for a maximum likelihood (ML) criterion based space-time linear precoder (ML-STLP). In the proposed method, several ML-STLPs are employed for one frame whereas only one ML-STLP is employed in the conventional method. When over two ML-STLPs are employed, the same ML-STLPs, which have short preceded symbol length, are arranged in parallel. Also, a length of preceded symbol for one frame and a data rate are same between the proposed method and the conventional method. We investigate the effect of the preceded symbol length on the resulting eigenmode SNR and show that the eigenmode SNR increasing can be achieved by selecting the preceded symbol length with higher eigenmode SNR depending on the channel condition. Also, the applicability of the proposed method is demonstrated by a computer simulation
{"title":"Eigenmode SNR increasing method for ML criterion based space-time linear precoder","authors":"S. Narieda, K. Yamashita","doi":"10.1109/CAMAP.2005.1574216","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574216","url":null,"abstract":"In this paper, we propose an eigenmode SNR increasing method for a maximum likelihood (ML) criterion based space-time linear precoder (ML-STLP). In the proposed method, several ML-STLPs are employed for one frame whereas only one ML-STLP is employed in the conventional method. When over two ML-STLPs are employed, the same ML-STLPs, which have short preceded symbol length, are arranged in parallel. Also, a length of preceded symbol for one frame and a data rate are same between the proposed method and the conventional method. We investigate the effect of the preceded symbol length on the resulting eigenmode SNR and show that the eigenmode SNR increasing can be achieved by selecting the preceded symbol length with higher eigenmode SNR depending on the channel condition. Also, the applicability of the proposed method is demonstrated by a computer simulation","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125939372","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574169
R. Linnehan, D. Brady, J. Schindler, L. Perlovsky, M. Rangaswamy
We are applying the Cramer-Rao theorem to synthetic aperture radar (SAR) processing in order to establish flight paths that permit height estimation and minimize errors in reflectivity measurements. The Cramer-Rao bound (CRB) establishes a lower bound on the error variance of unbiased estimates. Error bounds are developed for multi-dimensional synthetic apertures that improve the overall performance and efficiency of monostatic, single-pass SAR missions. A computationally efficient means for the design and analysis of SAR waveforms is proposed using simulated scattering models that are limited in size. A comparison made with the error bounds for standard SAR show that estimates of scatterer range and cross-range positions are sufficiently accurate for multi-dimensional aperture SAR, even with the additional estimator for height.
{"title":"Multi-dimensional aperture design and analysis for SAR using the Cramer-Rao theorem","authors":"R. Linnehan, D. Brady, J. Schindler, L. Perlovsky, M. Rangaswamy","doi":"10.1109/CAMAP.2005.1574169","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574169","url":null,"abstract":"We are applying the Cramer-Rao theorem to synthetic aperture radar (SAR) processing in order to establish flight paths that permit height estimation and minimize errors in reflectivity measurements. The Cramer-Rao bound (CRB) establishes a lower bound on the error variance of unbiased estimates. Error bounds are developed for multi-dimensional synthetic apertures that improve the overall performance and efficiency of monostatic, single-pass SAR missions. A computationally efficient means for the design and analysis of SAR waveforms is proposed using simulated scattering models that are limited in size. A comparison made with the error bounds for standard SAR show that estimates of scatterer range and cross-range positions are sufficiently accurate for multi-dimensional aperture SAR, even with the additional estimator for height.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124383075","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574215
J.P. Stralka, T. D. Tran
Continuing improvements in analog and digital technology has made elemental digital beamforming (DBF) for sensor arrays a reality. Weak signal reception enhancement can be achieved through the adaptive suppression of potentially time-varying interference in operational environments. Utilizing all the degrees of freedom (DoF's) of an adaptive elemental DBF array with a large number of elements is often prohibitive in terms of computational complexity and speed of adaptation. Partially adaptive suboptimal architectures which reduce the DoF's with minimal performance degradation are required. One such architecture based on the generalized sidelobe canceller (GSC) with a wavelet-based spatial blocking matrix utilizing minimal length M-band K-regular wavelets has been previously proposed. The work presented in Y. Chu and W. Fang (2003) improves upon the wavelet-based GSC in terms of cancellation performance and computational efficiency by using the modulated lapped transform (MLT) to implement the blocking matrix
{"title":"Modulated lapped transform generalized sidelobe canceller","authors":"J.P. Stralka, T. D. Tran","doi":"10.1109/CAMAP.2005.1574215","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574215","url":null,"abstract":"Continuing improvements in analog and digital technology has made elemental digital beamforming (DBF) for sensor arrays a reality. Weak signal reception enhancement can be achieved through the adaptive suppression of potentially time-varying interference in operational environments. Utilizing all the degrees of freedom (DoF's) of an adaptive elemental DBF array with a large number of elements is often prohibitive in terms of computational complexity and speed of adaptation. Partially adaptive suboptimal architectures which reduce the DoF's with minimal performance degradation are required. One such architecture based on the generalized sidelobe canceller (GSC) with a wavelet-based spatial blocking matrix utilizing minimal length M-band K-regular wavelets has been previously proposed. The work presented in Y. Chu and W. Fang (2003) improves upon the wavelet-based GSC in terms of cancellation performance and computational efficiency by using the modulated lapped transform (MLT) to implement the blocking matrix","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132048526","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
扫码关注我们
求助内容：
应助结果提醒方式：