Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931517
Pu Wang, Hongbin Li, B. Himed
Previously, we studied moving target detection (MTD) using a distributed MIMO radar, where the multi-static transmit-receive configuration causes non-homogeneous clutter. By representing the non-homogeneous clutter in a low-rank subspace with different subspace coefficients for different transmit-receive pairs, a generalized likelihood ratio test (GLRT), which is referred to as the MIMO-GLRT, was introduced. The MIMO-GLRT, however, is a centralized detector requiring the distributed receivers to send their local observations to a fusion center, which performs parameter estimation and computes a global test variable. In this paper, we consider distributed detection for the moving target problem. The goal is to reduce the communication overhead as well as power/bandwidth consumptions from the receivers to the fusion center. We consider two distributed implementations of the MIMO-GLRT, with or without local data aggregation. Specifically, the one that performs local aggregation computes a single local test statistic at each receive antenna, by using the outputs of all matched filters (each matched to a waveform unique to one transmit antenna); meanwhile, the one that does not perform local aggregation computes multiple local test statistics, one for each matched filter output. In both cases, the local unquantized test statistics from all receive antennas are forwarded to the fusion center and non-coherently combined to form a final test variable. Simulation results are provided to illustrate the performance loss with respect to the centralized MIMO-GLRT and compare with another distributed MIMO moving target detector based on a homogeneous assumption.
{"title":"Distributed detection of moving target using MIMO radar in clutter with non-homogeneous power","authors":"Pu Wang, Hongbin Li, B. Himed","doi":"10.1109/WOSSPA.2011.5931517","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931517","url":null,"abstract":"Previously, we studied moving target detection (MTD) using a distributed MIMO radar, where the multi-static transmit-receive configuration causes non-homogeneous clutter. By representing the non-homogeneous clutter in a low-rank subspace with different subspace coefficients for different transmit-receive pairs, a generalized likelihood ratio test (GLRT), which is referred to as the MIMO-GLRT, was introduced. The MIMO-GLRT, however, is a centralized detector requiring the distributed receivers to send their local observations to a fusion center, which performs parameter estimation and computes a global test variable. In this paper, we consider distributed detection for the moving target problem. The goal is to reduce the communication overhead as well as power/bandwidth consumptions from the receivers to the fusion center. We consider two distributed implementations of the MIMO-GLRT, with or without local data aggregation. Specifically, the one that performs local aggregation computes a single local test statistic at each receive antenna, by using the outputs of all matched filters (each matched to a waveform unique to one transmit antenna); meanwhile, the one that does not perform local aggregation computes multiple local test statistics, one for each matched filter output. In both cases, the local unquantized test statistics from all receive antennas are forwarded to the fusion center and non-coherently combined to form a final test variable. Simulation results are provided to illustrate the performance loss with respect to the centralized MIMO-GLRT and compare with another distributed MIMO moving target detector based on a homogeneous assumption.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107708","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931496
D. Gingras, Evangeline Pollard, D. Gruyer
Accurate and reliable vehicle localization is a key component to numerous applications, including active vehicle safety systems, real time estimation of traffic conditions, and high occupancy tolling. Up to now, most of the localization techniques rely on a given set of sensors embedded in a single vehicle. In this paper, we survey the issues considered in designing collaborative methods for localizing vehicles on roads using information coming from neighbor vehicles as well as from fixed infrastructures. We will in particular examine the signal processing issues and uncertainty modeling in estimating the relative ranges and angles of vehicles and the vehicles' position from noisy measurements.
{"title":"Signal processing requirements and uncertainty modeling issues in cooperative vehicular positioning","authors":"D. Gingras, Evangeline Pollard, D. Gruyer","doi":"10.1109/WOSSPA.2011.5931496","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931496","url":null,"abstract":"Accurate and reliable vehicle localization is a key component to numerous applications, including active vehicle safety systems, real time estimation of traffic conditions, and high occupancy tolling. Up to now, most of the localization techniques rely on a given set of sensors embedded in a single vehicle. In this paper, we survey the issues considered in designing collaborative methods for localizing vehicles on roads using information coming from neighbor vehicles as well as from fixed infrastructures. We will in particular examine the signal processing issues and uncertainty modeling in estimating the relative ranges and angles of vehicles and the vehicles' position from noisy measurements.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133714091","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931506
C. Tsimenidis, S. Aliesawi, B. Sharif
In this paper, turbo multiuser detectors in Interleave Division Multiple Access (IDMA) based systems are considered for short range underwater acoustic channels (UACs). In such long reverberant channels that demand high computational complexity, turbo detectors based on minimum mean square error (MMSE) criterion are an attractive solution to achieve a good balance between performance and complexity. Two different synchronous IDMA structures are studied and applied to signals acquired during sea trials in the North Sea; firstly, a channel estimation (CE) based IDMA with Rake reception, and secondly, an adaptive interference canceller (IC-IDMA). Both schemes include phase tracking, channel coding and are based on a chip-rate equalization and detection, which are fed in by a composite multiuser signal of the users' feedback soft information. Experimental results of three different channel ranges demonstrate that the direct adaptive receiver has better performance and additionally mitigates the errors associated with the CE based IDMA receiver while maintaining lower complexity.
{"title":"Turbo multiuser detectors for IDMA-based underwater communications","authors":"C. Tsimenidis, S. Aliesawi, B. Sharif","doi":"10.1109/WOSSPA.2011.5931506","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931506","url":null,"abstract":"In this paper, turbo multiuser detectors in Interleave Division Multiple Access (IDMA) based systems are considered for short range underwater acoustic channels (UACs). In such long reverberant channels that demand high computational complexity, turbo detectors based on minimum mean square error (MMSE) criterion are an attractive solution to achieve a good balance between performance and complexity. Two different synchronous IDMA structures are studied and applied to signals acquired during sea trials in the North Sea; firstly, a channel estimation (CE) based IDMA with Rake reception, and secondly, an adaptive interference canceller (IC-IDMA). Both schemes include phase tracking, channel coding and are based on a chip-rate equalization and detection, which are fed in by a composite multiuser signal of the users' feedback soft information. Experimental results of three different channel ranges demonstrate that the direct adaptive receiver has better performance and additionally mitigates the errors associated with the CE based IDMA receiver while maintaining lower complexity.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132356913","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931415
Nabila Brahimi, S. Bouguezel
A new fast matrix is introduced for the discrete cosine transform (DCT), an important transform that is of particular interest in image compression. For an 8-point DCT only 16 additions are required by appropriately introducing some zeros in the 8×8 Signed DCT (SDCT) matrix taking into account the orthogonality conditions. The second originality of this work is the development of a suitable quantization matrix suitable for our proposed transform matrix. This quantization matrix improves the peak signal to noise ratio (PSNR) by about 0.7 dB compared to the JPEG quantization matrix.
{"title":"An efficient fast integer DCT transform for images compression with 16 additions only","authors":"Nabila Brahimi, S. Bouguezel","doi":"10.1109/WOSSPA.2011.5931415","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931415","url":null,"abstract":"A new fast matrix is introduced for the discrete cosine transform (DCT), an important transform that is of particular interest in image compression. For an 8-point DCT only 16 additions are required by appropriately introducing some zeros in the 8×8 Signed DCT (SDCT) matrix taking into account the orthogonality conditions. The second originality of this work is the development of a suitable quantization matrix suitable for our proposed transform matrix. This quantization matrix improves the peak signal to noise ratio (PSNR) by about 0.7 dB compared to the JPEG quantization matrix.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780867","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931478
G. Bouleux, Thameur Kidar, F. Guillet
The problem of estimating the frequencies of a complex signal corrupted by noise is addressed in this paper. Solving the problem by a subspace approach induce an inevitable maximum overlap between windowed observation vectors. It appears therefore that traditional second order statistics do not describe totally the second order behavior and the notion of improper random vector is recommended. Based on this, we analyze an ESPRIT and a Unitary ESPRIT-based methods established with improper random vectors assumption. Numerical simulations and a real application are brought for embellishing the discussion.
{"title":"An improper random vector approach for ESPRIT and unitary ESPRIT frequency estimation","authors":"G. Bouleux, Thameur Kidar, F. Guillet","doi":"10.1109/WOSSPA.2011.5931478","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931478","url":null,"abstract":"The problem of estimating the frequencies of a complex signal corrupted by noise is addressed in this paper. Solving the problem by a subspace approach induce an inevitable maximum overlap between windowed observation vectors. It appears therefore that traditional second order statistics do not describe totally the second order behavior and the notion of improper random vector is recommended. Based on this, we analyze an ESPRIT and a Unitary ESPRIT-based methods established with improper random vectors assumption. Numerical simulations and a real application are brought for embellishing the discussion.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964478","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931464
M. Amara, Amar Siad
The idea of Elliptic Curve Cryptography (ECC), and how it's a better promise for a faster and more secure method of encryption in comparison to the current standards in the Public-Key Cryptographic algorithms of RSA is discussed in this paper. The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. The function used for this purpose is the scalar multiplication k.P which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. This article explains the role of ECC in the network security. ECC's uses with smaller keys to provide high security and high speed.
{"title":"Elliptic Curve Cryptography and its applications","authors":"M. Amara, Amar Siad","doi":"10.1109/WOSSPA.2011.5931464","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931464","url":null,"abstract":"The idea of Elliptic Curve Cryptography (ECC), and how it's a better promise for a faster and more secure method of encryption in comparison to the current standards in the Public-Key Cryptographic algorithms of RSA is discussed in this paper. The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. The function used for this purpose is the scalar multiplication k.P which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. This article explains the role of ECC in the network security. ECC's uses with smaller keys to provide high security and high speed.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114874323","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931452
A. B. Djebbar
In this paper, a new blind equalization for multiuser multi-carrier code division multiple access (MC-CDMA) systems under Rayleigh multipath fading channel is proposed. The later causes the ICI and ISI that destroy the relationship of the guard interval (GI) redundancy. Through exploiting the structural properties of MC-CDMA transmitted signal, the estimation can be resolved using least square fitting (LSF) and subspace approaches. Indeed, GI redundancy together with excess codes (EC) are used to restore the MC-CDMA properties. In addition, we propose the use of the previous algorithms in conjunction with a constant modulus algorithm (CMA) to improve the performance gain. Our simulation results show the robustness and effectiveness of the proposed algorithms.
{"title":"LSF-CMA based blind equalization algorithms for MC-CDMA systems","authors":"A. B. Djebbar","doi":"10.1109/WOSSPA.2011.5931452","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931452","url":null,"abstract":"In this paper, a new blind equalization for multiuser multi-carrier code division multiple access (MC-CDMA) systems under Rayleigh multipath fading channel is proposed. The later causes the ICI and ISI that destroy the relationship of the guard interval (GI) redundancy. Through exploiting the structural properties of MC-CDMA transmitted signal, the estimation can be resolved using least square fitting (LSF) and subspace approaches. Indeed, GI redundancy together with excess codes (EC) are used to restore the MC-CDMA properties. In addition, we propose the use of the previous algorithms in conjunction with a constant modulus algorithm (CMA) to improve the performance gain. Our simulation results show the robustness and effectiveness of the proposed algorithms.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878917","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931423
A. Ouamri
This paper presents a temporal method for direction of arrival (DOA) estimation for wideband sources by using an antenna array. Existing DOA estimation algorithms treat the problem in frequency domain by decomposing the wide spectrum of these signals in several narrowband signals, and use a narrowband DOA estimation methods to solve the problem. These methods suffer from high computational complexity. This paper introduces a temporal method based on cross-correlation functions between sensors outputs. The estimation of the propagation delays is the key to find directions of arrival of wideband sources. The method has low cost complexity in terms of computations and sensors number. In this paper we describe the method and we do some comparative simulations to show the performance of the suggested method.
{"title":"Low cost DOA estimation for wideband sources","authors":"A. Ouamri","doi":"10.1109/WOSSPA.2011.5931423","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931423","url":null,"abstract":"This paper presents a temporal method for direction of arrival (DOA) estimation for wideband sources by using an antenna array. Existing DOA estimation algorithms treat the problem in frequency domain by decomposing the wide spectrum of these signals in several narrowband signals, and use a narrowband DOA estimation methods to solve the problem. These methods suffer from high computational complexity. This paper introduces a temporal method based on cross-correlation functions between sensors outputs. The estimation of the propagation delays is the key to find directions of arrival of wideband sources. The method has low cost complexity in terms of computations and sensors number. In this paper we describe the method and we do some comparative simulations to show the performance of the suggested method.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134387445","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931474
K. N. Paracha, A. Zerguine
This work concentrates on the development of a Newton-like algorithm for blind equalization. This algorithm is obtained by applying a complex Taylor series on a recently proposed soft constraint satisfaction multi-modulus blind equalization algorithm of order p (SCS-MMA-p). The proposed algorithm is a generalized version of the SCS-MMA-p. This algorithm is called stochastic Newton-like soft constraint satisfaction multi-modulus algorithm of order p (SNL-SCS-MMA-p). Simulation results carried out, on both baud spaced and fractionally-spaced equalizers, to assess the performance of the prosed algorithm reveal great improvement in performance of the proposed algorithm against that of the SCS-MMA for different values of the parameter p.
{"title":"A Newton-like algorithm for adaptive multi-modulus blind equalization","authors":"K. N. Paracha, A. Zerguine","doi":"10.1109/WOSSPA.2011.5931474","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931474","url":null,"abstract":"This work concentrates on the development of a Newton-like algorithm for blind equalization. This algorithm is obtained by applying a complex Taylor series on a recently proposed soft constraint satisfaction multi-modulus blind equalization algorithm of order p (SCS-MMA-p). The proposed algorithm is a generalized version of the SCS-MMA-p. This algorithm is called stochastic Newton-like soft constraint satisfaction multi-modulus algorithm of order p (SNL-SCS-MMA-p). Simulation results carried out, on both baud spaced and fractionally-spaced equalizers, to assess the performance of the prosed algorithm reveal great improvement in performance of the proposed algorithm against that of the SCS-MMA for different values of the parameter p.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134591814","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 : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931443
S. Hasan, S. Boussakta, Alexandre Yakovlev
Parallel 1-D signal filtering algorithm is implemented as a parameterized efficient FPGA-based architecture using Xilinx System Generator. The implemented algorithm is a linear indirect filters achieved by a parallel FFT/point-by-point complex inner product/ IFFT convolution unit array. The implemented architecture manifests a 38 % higher performance per Watt at maximum frequency. The parameterized implementation provides rapid system-level FPGA prototyping and operating frequency portability. Consequently, the results are obtained independent of the two targeted Virtex-6 FPGA boards, namely xc6vlX240Tl–1lff1759 and xc6vlX130Tl–1lff1156, to achieve lower power consumption of (1.6 W) and down to (0.99 W) respectively at a maximum frequency of up to (216 MHz). A case study of real-time speech filtering shows excellent performance results of power consumption down to (0.99W) at maximum frequency of up to (216 MHz).
采用Xilinx System Generator实现了一种参数化的高效fpga并行一维信号滤波算法。所实现的算法是由并行FFT/逐点复内积/ IFFT卷积单元阵列实现的线性间接滤波器。实现的架构在最高频率下每瓦性能提高38%。参数化实现提供了快速的系统级FPGA原型和工作频率可移植性。因此，结果是独立于两个目标Virtex-6 FPGA板(xc6vlX240Tl-1lff1759和xc6vlX130Tl-1lff1156)获得的，在最高频率高达(216 MHz)的情况下，功耗分别降低到(1.6 W)和(0.99 W)。实时语音滤波的实例研究表明，在最大频率高达(216 MHz)的情况下，功耗低至(0.99W)，具有优异的性能。
{"title":"Parameterized FPGA-based architecture for parallel 1-D filtering algorithms","authors":"S. Hasan, S. Boussakta, Alexandre Yakovlev","doi":"10.1109/WOSSPA.2011.5931443","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931443","url":null,"abstract":"Parallel 1-D signal filtering algorithm is implemented as a parameterized efficient FPGA-based architecture using Xilinx System Generator. The implemented algorithm is a linear indirect filters achieved by a parallel FFT/point-by-point complex inner product/ IFFT convolution unit array. The implemented architecture manifests a 38 % higher performance per Watt at maximum frequency. The parameterized implementation provides rapid system-level FPGA prototyping and operating frequency portability. Consequently, the results are obtained independent of the two targeted Virtex-6 FPGA boards, namely xc6vlX240Tl–1lff1759 and xc6vlX130Tl–1lff1156, to achieve lower power consumption of (1.6 W) and down to (0.99 W) respectively at a maximum frequency of up to (216 MHz). A case study of real-time speech filtering shows excellent performance results of power consumption down to (0.99W) at maximum frequency of up to (216 MHz).","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125054942","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
扫码关注我们
求助内容：
应助结果提醒方式：