Pub Date : 2011-03-24DOI: 10.1109/ICCSP.2011.5739356
Sudhanshu Baghel, R. Shaik
This paper proposes a design and implementation of high throughput adaptive digital filter using Fast Block Least Mean Squares (FBLMS) adaptive algorithm. The filter structure is based on Distributed Arithmetic (DA), which is able to calculate the inner product by shifting, and accumulating of partial products and storing in look-up table, also the desired adaptive digital filter will be multiplierless. Thus a DA based implementation of adaptive filter is highly computational and area efficient. Furthermore, the fundamental building blocks in the DA architecture map well to the architecture of todays Field Programmable Gate Arrays (FPGA). FPGA implementation results conforms that the proposed DA based adaptive filter can implement with significantly smaller area usage, (about 45%) less than that of the existing FBLMS algorithm based adaptive filter.
{"title":"FPGA implementation of Fast Block LMS adaptive filter using Distributed Arithmetic for high throughput","authors":"Sudhanshu Baghel, R. Shaik","doi":"10.1109/ICCSP.2011.5739356","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739356","url":null,"abstract":"This paper proposes a design and implementation of high throughput adaptive digital filter using Fast Block Least Mean Squares (FBLMS) adaptive algorithm. The filter structure is based on Distributed Arithmetic (DA), which is able to calculate the inner product by shifting, and accumulating of partial products and storing in look-up table, also the desired adaptive digital filter will be multiplierless. Thus a DA based implementation of adaptive filter is highly computational and area efficient. Furthermore, the fundamental building blocks in the DA architecture map well to the architecture of todays Field Programmable Gate Arrays (FPGA). FPGA implementation results conforms that the proposed DA based adaptive filter can implement with significantly smaller area usage, (about 45%) less than that of the existing FBLMS algorithm based adaptive filter.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804118","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-03-24DOI: 10.1109/ICCSP.2011.5739385
N. Pandey, R. Bazaz, R. Manocha
This paper presents a comparison between various RLC-ladder filter simulation techniques using a recently proposed active building block, that is the multiple output current controlled current conveyer transconductance amplifier (MO-CCCCTA). The well known leap frog technique of RLC ladder filter simulation has been used to design the proposed circuits. The active block is used because of following advantages i) it is a current controlled device so parasitic resistance at current input port can be controlled by an input bias current. (ii) the circuit operation is temperature insensitive (iii) it has high frequency potential (iv) it performs tuning over a wide current range. These simulated filters retain minimum requirement of passive and active elements and provide the filter corner frequency tunability. PSPICE simulation of various ladders has been done and included to ensure the validity of the approach.
{"title":"Active RLC ladder filter simulation using newly proposed CCCCTA block","authors":"N. Pandey, R. Bazaz, R. Manocha","doi":"10.1109/ICCSP.2011.5739385","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739385","url":null,"abstract":"This paper presents a comparison between various RLC-ladder filter simulation techniques using a recently proposed active building block, that is the multiple output current controlled current conveyer transconductance amplifier (MO-CCCCTA). The well known leap frog technique of RLC ladder filter simulation has been used to design the proposed circuits. The active block is used because of following advantages i) it is a current controlled device so parasitic resistance at current input port can be controlled by an input bias current. (ii) the circuit operation is temperature insensitive (iii) it has high frequency potential (iv) it performs tuning over a wide current range. These simulated filters retain minimum requirement of passive and active elements and provide the filter corner frequency tunability. PSPICE simulation of various ladders has been done and included to ensure the validity of the approach.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121145806","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-03-24DOI: 10.1109/ICCSP.2011.5739309
R. Patachaianand, K. Sandrasegaran
Proportional fair (PF) scheduling can maximise the net throughput of multiuser systems with high fairness. Typically, the scheduling requires that knowledge of channel state information (CSI) from all users be made available to the transmitter. In this paper, a feedback reporting technique in which the feedback is limited to two bits per CSI command for multiuser systems with PF scheduling is proposed. Simulation results show that the proposed scheme can achieve the same net throughput as full-CSI case and significantly outperforms one-bit feedback scheme when the feedback thresholds are optimally selected to suit the system conditions while the feedback load is dramatically reduced compared with the full-CSI.
{"title":"Opportunistic feedback for proportional fair scheduling","authors":"R. Patachaianand, K. Sandrasegaran","doi":"10.1109/ICCSP.2011.5739309","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739309","url":null,"abstract":"Proportional fair (PF) scheduling can maximise the net throughput of multiuser systems with high fairness. Typically, the scheduling requires that knowledge of channel state information (CSI) from all users be made available to the transmitter. In this paper, a feedback reporting technique in which the feedback is limited to two bits per CSI command for multiuser systems with PF scheduling is proposed. Simulation results show that the proposed scheme can achieve the same net throughput as full-CSI case and significantly outperforms one-bit feedback scheme when the feedback thresholds are optimally selected to suit the system conditions while the feedback load is dramatically reduced compared with the full-CSI.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124396452","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-03-24DOI: 10.1109/ICCSP.2011.5739384
C. Gopakumar, K. T. Mathew
The paper presents an experimental study on a compact Isosceles Trapezoidal Dielectric Resonator Antenna (ITDRA) excited by microstrip line. It is observed that the DRA exhibits a 2∶1 VSWR bandwidth of ∼11.6 %, a gain of as high as 7.22 dBi and broad radiation patterns with good cross-polar levels that are consistent over the operating band. The antenna covers important application band of ISM: Bluetooth/ WLAN 2.4/Wibree ( 802.11 b/g/n )/ ZigBee. Details of the design along with experimental and simulation results are presented and discussed
{"title":"Compact Isosceles Trapezoidal Dielectric Resonator Antenna for 2.4 GHz WLAN application","authors":"C. Gopakumar, K. T. Mathew","doi":"10.1109/ICCSP.2011.5739384","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739384","url":null,"abstract":"The paper presents an experimental study on a compact Isosceles Trapezoidal Dielectric Resonator Antenna (ITDRA) excited by microstrip line. It is observed that the DRA exhibits a 2∶1 VSWR bandwidth of ∼11.6 %, a gain of as high as 7.22 dBi and broad radiation patterns with good cross-polar levels that are consistent over the operating band. The antenna covers important application band of ISM: Bluetooth/ WLAN 2.4/Wibree ( 802.11 b/g/n )/ ZigBee. Details of the design along with experimental and simulation results are presented and discussed","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778623","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-03-24DOI: 10.1109/ICCSP.2011.5739308
P. Vardhan, K. Majumdar
Automatic detection of seizure in a continuous multichannel recording of EEG and ECoG has remained a challenging task even after more than three decades of research. Here we report that differential operator significantly accentuates the seizure part of depth electrode recordings (ECoG) relative to the non-seizure part. The success rate of detection by windowed variance method goes up considerably if the signal is treated with differential operator beforehand. In order to keep the false positive rate at the minimum a number of statistical checks have been introduced. Altogether they take only linear time and therefore well suited for real time applications. Detection on the same data with the same windowed variance method has also been performed using DB4 wavelet filtering instead of the differential operator (DB4 has been chosen from among Haar, DB1, DB2, DB3, DB4, DB5 and Morlet based on comparative study). It showed almost equal success but with higher time complexity.
{"title":"Automatic seizure detection in ECoG by DB4 wavelets and windowed variance: A comparison","authors":"P. Vardhan, K. Majumdar","doi":"10.1109/ICCSP.2011.5739308","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739308","url":null,"abstract":"Automatic detection of seizure in a continuous multichannel recording of EEG and ECoG has remained a challenging task even after more than three decades of research. Here we report that differential operator significantly accentuates the seizure part of depth electrode recordings (ECoG) relative to the non-seizure part. The success rate of detection by windowed variance method goes up considerably if the signal is treated with differential operator beforehand. In order to keep the false positive rate at the minimum a number of statistical checks have been introduced. Altogether they take only linear time and therefore well suited for real time applications. Detection on the same data with the same windowed variance method has also been performed using DB4 wavelet filtering instead of the differential operator (DB4 has been chosen from among Haar, DB1, DB2, DB3, DB4, DB5 and Morlet based on comparative study). It showed almost equal success but with higher time complexity.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129099294","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-03-24DOI: 10.1109/ICCSP.2011.5739298
N. Aravind, Abhinandan K, Vineeth V. Acharya, S. David
In this paper, we present a novel method for the acquisition and compression of hyperspectral images based on two concepts - distributed source coding and compressive sensing. Compressive sensing (CS) is a signal acquisition method that samples at sub Nyquist rates which is possible for signals that are sparse in some transform domain. Distributed source coding (DSC) is a method to encode correlated sources separately and decode them together in an attempt to shift complexity from the encoder to the decoder. Distributed compressive sensing (DCS) is a new framework suggested for jointly sparse signals which we apply to the correlated bands of hyperspectral images. We compressively sense each band of the hyperspectral image individually and can then recover the bands separately or using a joint recovery method. We use the Orthogonal Matching Pursuit (OMP) for individual recovery and Simultaneous Orthogonal Matching Pursuit (SOMP) for joint decoding and compare the two methods. The latter is shown to perform consistently better showing that the Distributed Compressive Sensing method that exploits the joint sparsity of the hyperspectral image is much better than individual recovery.
{"title":"Comparison of OMP and SOMP in the reconstruction of compressively sensed hyperspectral images","authors":"N. Aravind, Abhinandan K, Vineeth V. Acharya, S. David","doi":"10.1109/ICCSP.2011.5739298","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739298","url":null,"abstract":"In this paper, we present a novel method for the acquisition and compression of hyperspectral images based on two concepts - distributed source coding and compressive sensing. Compressive sensing (CS) is a signal acquisition method that samples at sub Nyquist rates which is possible for signals that are sparse in some transform domain. Distributed source coding (DSC) is a method to encode correlated sources separately and decode them together in an attempt to shift complexity from the encoder to the decoder. Distributed compressive sensing (DCS) is a new framework suggested for jointly sparse signals which we apply to the correlated bands of hyperspectral images. We compressively sense each band of the hyperspectral image individually and can then recover the bands separately or using a joint recovery method. We use the Orthogonal Matching Pursuit (OMP) for individual recovery and Simultaneous Orthogonal Matching Pursuit (SOMP) for joint decoding and compare the two methods. The latter is shown to perform consistently better showing that the Distributed Compressive Sensing method that exploits the joint sparsity of the hyperspectral image is much better than individual recovery.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114920511","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-03-24DOI: 10.1109/ICCSP.2011.5739329
F. Mianji, Ye Zhang, A. Babakhani
Hughes phenomenon is a serious problem in supervised classification of hyperspectral images in particular for small land-cover patches. A solution for this problem through integrating the capabilities of a nonlinear discriminating analysis with relevance vector machine (RVM) is proposed in this paper. It first transforms the hyperdimensional data to a new space with a better class separability. Then, a multiclass RVM classifier processes the transformed data for precise labeling of the classes. The results show that the proposed approach outperforms both RVM as well as support vector machine (SVM), when they are applied to the original hyperdimensional data space. Indeed, it is an advantage for key information detection in the classification context.
{"title":"Nonlinear discriminant analysis and RVM for efficient classification of small land-cover patches","authors":"F. Mianji, Ye Zhang, A. Babakhani","doi":"10.1109/ICCSP.2011.5739329","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739329","url":null,"abstract":"Hughes phenomenon is a serious problem in supervised classification of hyperspectral images in particular for small land-cover patches. A solution for this problem through integrating the capabilities of a nonlinear discriminating analysis with relevance vector machine (RVM) is proposed in this paper. It first transforms the hyperdimensional data to a new space with a better class separability. Then, a multiclass RVM classifier processes the transformed data for precise labeling of the classes. The results show that the proposed approach outperforms both RVM as well as support vector machine (SVM), when they are applied to the original hyperdimensional data space. Indeed, it is an advantage for key information detection in the classification context.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497104","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-03-24DOI: 10.1109/ICCSP.2011.5739389
S. Kanade, P. Patil
Representative frames are vital and attractive key components in providing Internet users a way to swiftly browse a video clip in different levels of detail, without the need to view entire video clip. Past study reveals that several schemes have been developed for representative frame extraction however all schemes are not decorating the key frames. This paper proposes a new concept called Representative Frame Decoration (RFD), in which the essential operation is to enhance the key frame of a video shot. Our approach employs an unsharp mask filter to enhance contrast and sharpen edges of the elements without increasing noise or blemish. Experimental results of representative frames existing on internet illustrate the high performance of the proposed schemata.
{"title":"Representative Frame Decoration using unsharp filter in video summarization","authors":"S. Kanade, P. Patil","doi":"10.1109/ICCSP.2011.5739389","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739389","url":null,"abstract":"Representative frames are vital and attractive key components in providing Internet users a way to swiftly browse a video clip in different levels of detail, without the need to view entire video clip. Past study reveals that several schemes have been developed for representative frame extraction however all schemes are not decorating the key frames. This paper proposes a new concept called Representative Frame Decoration (RFD), in which the essential operation is to enhance the key frame of a video shot. Our approach employs an unsharp mask filter to enhance contrast and sharpen edges of the elements without increasing noise or blemish. Experimental results of representative frames existing on internet illustrate the high performance of the proposed schemata.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207528","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-03-24DOI: 10.1109/ICCSP.2011.5739285
A. K. Roy, S. Koteswara Rao
This paper emphasizes nearest neighbourhood approach for data association, which is carried out after target motion analysis (TMA) solution stabilizes. Parameterized Modified Gain Extended Kalman Filter (PMGEKF) has been used to carry out TMA. Having done, association, fusion with state vectors is carried out.
{"title":"Multi-track association and fusion","authors":"A. K. Roy, S. Koteswara Rao","doi":"10.1109/ICCSP.2011.5739285","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739285","url":null,"abstract":"This paper emphasizes nearest neighbourhood approach for data association, which is carried out after target motion analysis (TMA) solution stabilizes. Parameterized Modified Gain Extended Kalman Filter (PMGEKF) has been used to carry out TMA. Having done, association, fusion with state vectors is carried out.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128124709","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-03-24DOI: 10.1109/ICCSP.2011.5739378
Binoy Pinto, P. R. Anurenjan
Video stabilization is one of the most important enhancement techniques used to remove undesired motion in a video. Combination of global camera motion estimation along with motion separation determines the undesired motion, which is to be compensated to produce a stable video sequence. In this paper a novel method for robust video stabilization is proposed which uses Speeded Up Robust Features(SURF) as stable feature points to be tracked between frames for global motion estimation. Different measures are taken to select the most appropriate feature point trajectories. A discrete kalman filter is used to smoothen so estimated motion vectors and the resultant stabilized video is obtained by compensating the unstable motion.
{"title":"Video stabilization using Speeded Up Robust Features","authors":"Binoy Pinto, P. R. Anurenjan","doi":"10.1109/ICCSP.2011.5739378","DOIUrl":"https://doi.org/10.1109/ICCSP.2011.5739378","url":null,"abstract":"Video stabilization is one of the most important enhancement techniques used to remove undesired motion in a video. Combination of global camera motion estimation along with motion separation determines the undesired motion, which is to be compensated to produce a stable video sequence. In this paper a novel method for robust video stabilization is proposed which uses Speeded Up Robust Features(SURF) as stable feature points to be tracked between frames for global motion estimation. Different measures are taken to select the most appropriate feature point trajectories. A discrete kalman filter is used to smoothen so estimated motion vectors and the resultant stabilized video is obtained by compensating the unstable motion.","PeriodicalId":408736,"journal":{"name":"2011 International Conference on Communications and Signal Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128333491","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
扫码关注我们
求助内容：
应助结果提醒方式：