Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931504
T. Bensouici, A. Charef
In this paper the design method of the digital fractional lead operator zα for 0 < α < 0.5, in a given frequency band of interest, using digital Infinite Impulse Response (IIR) filters is presented. In this technique, the coefficients of the closed form digital IIR filter derived for the approximation of the fractional lead operator, in a given frequency band, are based on the approximation of fractional order systems. First, analog rational function approximation, for a given frequency band, of the fractional power zero (FPZ) is given. Then the Tustin (bilinear) generating function is used to digitize the FPZ to obtain a closed form IIR digital filter which approximates the digital fractional lead operator zα for (0 < α < 0.5). Finally, an example has been presented to illustrate the effectiveness of the proposed design technique.
{"title":"An efficient design of fractional lead filter via fractional order system","authors":"T. Bensouici, A. Charef","doi":"10.1109/WOSSPA.2011.5931504","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931504","url":null,"abstract":"In this paper the design method of the digital fractional lead operator zα for 0 < α < 0.5, in a given frequency band of interest, using digital Infinite Impulse Response (IIR) filters is presented. In this technique, the coefficients of the closed form digital IIR filter derived for the approximation of the fractional lead operator, in a given frequency band, are based on the approximation of fractional order systems. First, analog rational function approximation, for a given frequency band, of the fractional power zero (FPZ) is given. Then the Tustin (bilinear) generating function is used to digitize the FPZ to obtain a closed form IIR digital filter which approximates the digital fractional lead operator zα for (0 < α < 0.5). Finally, an example has been presented to illustrate the effectiveness of the proposed design technique.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"1 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":"129482030","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.5931444
H. Ait Saadi, A. Guessoum, J. Chouinard
Orthogonal Frequency Division Multiplexing (OFDM) is is a sophisticated multicarrier modulation technique. It's known by its robustness against frequency selective fading channels. In return, the major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This feature makes the OFDM signals very sensitive to non-linearities of the High Power Amplifier (HPA). Partial transmit sequence (PTS), is one of the most attractive method to reduce the PAPR in OFDM systems. It achieves considerable PAPR reduction without distortion, but it requires an exhaustive search over all the combinations of the given phase factors, which results in a computational complexity increases exponentially with the number of partitions. We propose in this paper, a sub-optimal PTS method based on Differential Evolution optimization method (DE), reducing efficiently the computational complexity.
{"title":"Differential evolution algorithm for PAPR reduction in OFDM systems","authors":"H. Ait Saadi, A. Guessoum, J. Chouinard","doi":"10.1109/WOSSPA.2011.5931444","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931444","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is is a sophisticated multicarrier modulation technique. It's known by its robustness against frequency selective fading channels. In return, the major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This feature makes the OFDM signals very sensitive to non-linearities of the High Power Amplifier (HPA). Partial transmit sequence (PTS), is one of the most attractive method to reduce the PAPR in OFDM systems. It achieves considerable PAPR reduction without distortion, but it requires an exhaustive search over all the combinations of the given phase factors, which results in a computational complexity increases exponentially with the number of partitions. We propose in this paper, a sub-optimal PTS method based on Differential Evolution optimization method (DE), reducing efficiently the computational complexity.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"10 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":"128988571","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.5931446
M. H. Shariat, M. Neinavaie, M. Derakhtian, S. Gazor
Texture classification is of utmost importance in the image processing. In this paper the problem of texture classification is considered based on testing the covariance matrices and mean vectors. This allows us to determine the class of different images without the necessity of the training data. The generalized likelihood ratio (GLR) test is derived in order to classify several images. To make the classification robust to illuminance changes, we assume that the means of different images in one group, could differ by a constant value. Consequently the proposed test is invariant to the constant difference in the means of observations in each group. Computer simulations also confirm the efficiency of the classifier in dealing with the images with different illumination conditions.
{"title":"Texture classification in different illumination conditions via testing the covariance matrices and mean vectors","authors":"M. H. Shariat, M. Neinavaie, M. Derakhtian, S. Gazor","doi":"10.1109/WOSSPA.2011.5931446","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931446","url":null,"abstract":"Texture classification is of utmost importance in the image processing. In this paper the problem of texture classification is considered based on testing the covariance matrices and mean vectors. This allows us to determine the class of different images without the necessity of the training data. The generalized likelihood ratio (GLR) test is derived in order to classify several images. To make the classification robust to illuminance changes, we assume that the means of different images in one group, could differ by a constant value. Consequently the proposed test is invariant to the constant difference in the means of observations in each group. Computer simulations also confirm the efficiency of the classifier in dealing with the images with different illumination conditions.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"36 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":"125466448","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.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.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.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.5931510
D. Cherifi, M. Doghmane, A. Nait-Ali, Zakia Aici, Salim Bouzelha
This study is a comparison between two image segmentation's methods; the first method is based on normal brain's tissue recognition then tumor extraction using thresholding method. The second method is classification based on EM segmentation which is used for both brain recognition and tumor extraction. The goal of these methods is to detect, segment, extract, classify and measure properties of the brain normal and abnormal (tumor) tissues
{"title":"Abnormal tissus extraction in MRI brain medical images","authors":"D. Cherifi, M. Doghmane, A. Nait-Ali, Zakia Aici, Salim Bouzelha","doi":"10.1109/WOSSPA.2011.5931510","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931510","url":null,"abstract":"This study is a comparison between two image segmentation's methods; the first method is based on normal brain's tissue recognition then tumor extraction using thresholding method. The second method is classification based on EM segmentation which is used for both brain recognition and tumor extraction. The goal of these methods is to detect, segment, extract, classify and measure properties of the brain normal and abnormal (tumor) tissues","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"104 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":"127250956","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.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.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
扫码关注我们
求助内容：
应助结果提醒方式：