Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238398
Baibhav Bishal, B. Soni, Akash Saxena, Vikas Gupta
This paper presents design of Power System Stabilizer (PSS) by using Simplified Swarm Optimization (SSO). PSS is a useful device to enhance the system damping and small signal stability of the power system. PSS design problem is an optimization problem. From the optimization process proper set of gain and time constants are calculated. Proper tuning of the parameters provides adequate amount of damping to the system. This paper presents a swarm based algorithm to address the above said optimization process. Objective function based on speed deviations is employed to calculate the parameters of PSSs of New England System (10 Generator & 39 Bus). To present a meaningful analysis the comparison of SSO is done with conventional optimization algorithms namely Particle Swarm optimization (PSO) and Genetic Algorithm (GA). Robustness of proposed method is tested over different type of perturbations, fault locations and loading conditions.
{"title":"Design of damping controller for multimachine power system by using simplified swarm optimization","authors":"Baibhav Bishal, B. Soni, Akash Saxena, Vikas Gupta","doi":"10.1109/ICCIC.2014.7238398","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238398","url":null,"abstract":"This paper presents design of Power System Stabilizer (PSS) by using Simplified Swarm Optimization (SSO). PSS is a useful device to enhance the system damping and small signal stability of the power system. PSS design problem is an optimization problem. From the optimization process proper set of gain and time constants are calculated. Proper tuning of the parameters provides adequate amount of damping to the system. This paper presents a swarm based algorithm to address the above said optimization process. Objective function based on speed deviations is employed to calculate the parameters of PSSs of New England System (10 Generator & 39 Bus). To present a meaningful analysis the comparison of SSO is done with conventional optimization algorithms namely Particle Swarm optimization (PSO) and Genetic Algorithm (GA). Robustness of proposed method is tested over different type of perturbations, fault locations and loading conditions.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745982","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238566
D. Saravanapriya, Dr M Karthikeyan
Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.
{"title":"Clustering sentences to discover events from multiple news articles using Buckshot and Fractionation","authors":"D. Saravanapriya, Dr M Karthikeyan","doi":"10.1109/ICCIC.2014.7238566","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238566","url":null,"abstract":"Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131616559","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238419
S. Saravanan
This paper demonstrates the automated traffic surveillance without any human intervention. The aim of this paper is to detect the traffic density and to work according to the traffic density. The traffic signal is structured with the camera which takes the snap of the road and the density is identified. Hence by this method the traffic is analyzed and the lights are transferred according to the traffic density. The number of objects present in the roads will be identified and those numbers are transmitted to the micro controller. The micro controller controls the traffic signal and the varied time is displayed in the 7 segment display. By this a dynamic approach is being followed to minimize the traffic delay and effectively commute even in heavy traffic scenarios. The primary aim is to eliminate waiting time, during peak hours. Some added advantage that are to be implemented are dealing at the time of unusual situation such as emergency vehicles like ambulances, patrol vehicles, fire engines etc., Time is varied in propotional to the traffic density. Using this model will eliminate unwanted waiting time in peak traffic hours. Single camera is used in determining density of the traffic which will reduce the cost of implementing.
{"title":"Implementation of efficient automatic traffic surveillance using digital image processing","authors":"S. Saravanan","doi":"10.1109/ICCIC.2014.7238419","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238419","url":null,"abstract":"This paper demonstrates the automated traffic surveillance without any human intervention. The aim of this paper is to detect the traffic density and to work according to the traffic density. The traffic signal is structured with the camera which takes the snap of the road and the density is identified. Hence by this method the traffic is analyzed and the lights are transferred according to the traffic density. The number of objects present in the roads will be identified and those numbers are transmitted to the micro controller. The micro controller controls the traffic signal and the varied time is displayed in the 7 segment display. By this a dynamic approach is being followed to minimize the traffic delay and effectively commute even in heavy traffic scenarios. The primary aim is to eliminate waiting time, during peak hours. Some added advantage that are to be implemented are dealing at the time of unusual situation such as emergency vehicles like ambulances, patrol vehicles, fire engines etc., Time is varied in propotional to the traffic density. Using this model will eliminate unwanted waiting time in peak traffic hours. Single camera is used in determining density of the traffic which will reduce the cost of implementing.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560550","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238559
W. Alsharafat
Encryption is a fundamental mechanism for protecting information since the significant of security is increasing nowadays. Different evolutionary methods have been adapted to satisfy high level of security. Genetic algorithm is an exploration and evolutionary algorithm which based on natural selection which optimizing problem solution and to be away from producing one ciphertext for the same plaintext. Therefore, the attempts of attack, as ciphertext attack, will be reduced if not eliminated. In this paper, GA as evolutionary algorithm will be employed in a symmetric encryption and decryption where the user's message which represents plaintext and user secret data, key, will be transferred into ciphertext by applying crossover and mutation beside substitution function.
{"title":"Evolutionary genetic algorithm for encryption","authors":"W. Alsharafat","doi":"10.1109/ICCIC.2014.7238559","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238559","url":null,"abstract":"Encryption is a fundamental mechanism for protecting information since the significant of security is increasing nowadays. Different evolutionary methods have been adapted to satisfy high level of security. Genetic algorithm is an exploration and evolutionary algorithm which based on natural selection which optimizing problem solution and to be away from producing one ciphertext for the same plaintext. Therefore, the attempts of attack, as ciphertext attack, will be reduced if not eliminated. In this paper, GA as evolutionary algorithm will be employed in a symmetric encryption and decryption where the user's message which represents plaintext and user secret data, key, will be transferred into ciphertext by applying crossover and mutation beside substitution function.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133354966","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238327
M. Praveen, T. Senthil
Wireless Sensor Networks is a Wireless network consists of a Base Station (BS) and more number of wireless sensors inorder to monitor temperature, pressure, motion etc., in different environment conditions. Number of sensor nodes located geographically nearer to form a group called cluster to co-operately processing the data. LEACH (Low Energy Adaptive Clustering Hierarchy) is a routing protocol for clusters which is used to lower the energy consumption and also to improve the lifetime of the wireless sensor networks. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for sensor networks. The proposed system is to maximize the lifetime of the wireless sensor networks by selecting the farthest cluster head instead of the closest cluster head and forming the cluster by considering the following metrices such as Residual-Energy, Intra-Cluster Distance and Node Density. We use ABC (Artificial Bees Colony) Optimization Technique to enhance the network lifetime and energy consumption of the network.
无线传感器网络是由一个基站(BS)和多个无线传感器组成的无线网络，用于监测不同环境条件下的温度、压力、运动等。地理位置较近的传感器节点组成一组，称为集群，共同处理数据。LEACH (Low Energy Adaptive Clustering Hierarchy)是一种用于集群的路由协议，用于降低无线传感器网络的能量消耗并提高其生存期。最小化能量消耗和最大化网络寿命是传感器网络应用和协议设计中的重要问题。该系统通过选择最远的簇头而不是最近的簇头，并考虑剩余能量、簇内距离和节点密度等指标来组成簇，从而最大化无线传感器网络的生存期。我们采用人工蜂群优化技术来提高网络的生存期和能量消耗。
{"title":"Lifetime maximization of wireless sensor networks using energy-efficient cluster formation strategy","authors":"M. Praveen, T. Senthil","doi":"10.1109/ICCIC.2014.7238327","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238327","url":null,"abstract":"Wireless Sensor Networks is a Wireless network consists of a Base Station (BS) and more number of wireless sensors inorder to monitor temperature, pressure, motion etc., in different environment conditions. Number of sensor nodes located geographically nearer to form a group called cluster to co-operately processing the data. LEACH (Low Energy Adaptive Clustering Hierarchy) is a routing protocol for clusters which is used to lower the energy consumption and also to improve the lifetime of the wireless sensor networks. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for sensor networks. The proposed system is to maximize the lifetime of the wireless sensor networks by selecting the farthest cluster head instead of the closest cluster head and forming the cluster by considering the following metrices such as Residual-Energy, Intra-Cluster Distance and Node Density. We use ABC (Artificial Bees Colony) Optimization Technique to enhance the network lifetime and energy consumption of the network.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132173115","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238394
S. Sheela, M. Sumathi
Poly Cystic Ovary Syndrome (PCOS) is an endocrine disorder affecting many women in their reproductive age groups related with these problems of infertility, diabetes mellitus and cardiovascular disease. Diagnosis of the condition is mostly done by imaging parameters. Ultrasound imaging has become a very important technology in diagnosis of PCOS. Due to overlapping of the follicles, inherent noise of the equipment and lack of operator knowledge as it is largely an experience dependent procedure, the characteristic appearance of the image becomes more challenging and making the diagnosis process time consuming. Due to the above factors, accuracy in detection of cysts is affected. Therefore, the Early as well as Accurate Detection of Abnormalities in Women's Reproductive System is required before the treatment process, to avoid Infertility. This paper overviews various methodologies proposed so far in terms of removal of speckle noise, extraction of region of interest using segmentation, classification of images so as to achieve maximum accuracy in detection of cyst in short period of time.
{"title":"Study and theoretical investigations on PCOS","authors":"S. Sheela, M. Sumathi","doi":"10.1109/ICCIC.2014.7238394","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238394","url":null,"abstract":"Poly Cystic Ovary Syndrome (PCOS) is an endocrine disorder affecting many women in their reproductive age groups related with these problems of infertility, diabetes mellitus and cardiovascular disease. Diagnosis of the condition is mostly done by imaging parameters. Ultrasound imaging has become a very important technology in diagnosis of PCOS. Due to overlapping of the follicles, inherent noise of the equipment and lack of operator knowledge as it is largely an experience dependent procedure, the characteristic appearance of the image becomes more challenging and making the diagnosis process time consuming. Due to the above factors, accuracy in detection of cysts is affected. Therefore, the Early as well as Accurate Detection of Abnormalities in Women's Reproductive System is required before the treatment process, to avoid Infertility. This paper overviews various methodologies proposed so far in terms of removal of speckle noise, extraction of region of interest using segmentation, classification of images so as to achieve maximum accuracy in detection of cyst in short period of time.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133957920","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238396
P. Dash, S. Bisoy
Queue management is an important part to provide better service of buffer at the Internet router. Active Queue Management (AQM) technique is used to improve the network performance like link utilization, delay, fairness and packet loss rate. In this paper we explore the impact of buffer size and round trip time (RTT) on AQM router where TCP Reno is used as transport protocol in single bottleneck dumbbell topology. Among many AQM techniques, we have considered random early detection (RED), random exponential marking (REM), proportional integral (PI) and adaptive virtual queue (AVQ). Through the extensive simulation, we found that the RED and AVQ obtain better stability than REM and PI by regulating queue length around its expected value. However RED and AVQ techniques drop more packets than REM and PI.
{"title":"Analysis of AQM router of network supporting multiple TCP flows","authors":"P. Dash, S. Bisoy","doi":"10.1109/ICCIC.2014.7238396","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238396","url":null,"abstract":"Queue management is an important part to provide better service of buffer at the Internet router. Active Queue Management (AQM) technique is used to improve the network performance like link utilization, delay, fairness and packet loss rate. In this paper we explore the impact of buffer size and round trip time (RTT) on AQM router where TCP Reno is used as transport protocol in single bottleneck dumbbell topology. Among many AQM techniques, we have considered random early detection (RED), random exponential marking (REM), proportional integral (PI) and adaptive virtual queue (AVQ). Through the extensive simulation, we found that the RED and AVQ obtain better stability than REM and PI by regulating queue length around its expected value. However RED and AVQ techniques drop more packets than REM and PI.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114065365","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238486
Nanda Kishora Holla, S. Yellampalli
Network Interface Module (NIM) is a front-end receiver block, which interfaces incoming signals from outside world in to the High Definition (HD) Radio Frequency (RF) receivers. In most of the cases, NIM receives only one type of signal and down converts RF in to Intermediate Frequency (IF). In modern receivers there could be a separate block for Tuner and demodulator or there could be a single integrated block which acts as network interface module. The flexibility of the design and the cost impact are the two major components need to be taken in to consideration while finalizing the architecture of the HD receivers. This research paper explores the modularity concept in the front-end block of receivers which will helps to enhance the performance of the receivers as and when required. Capability to perform multiple tasks at NIM and there by enhancing the performance of HD receivers is discussed in this research paper.
网络接口模块(Network Interface Module, NIM)是一个前端接收模块，它将来自外界的输入信号连接到高清晰度射频(High Definition Radio Frequency，简称RF)接收器。在大多数情况下，NIM只接收一种类型的信号，并将RF向下转换为中频(IF)。在现代接收机中，可以有一个单独的块用于调谐器和解调器，也可以有一个单独的集成块作为网络接口模块。设计的灵活性和成本影响是确定高清接收器架构时需要考虑的两个主要组成部分。本文探讨了接收器前端模块的模块化概念，这将有助于在需要时提高接收器的性能。本文讨论了通过提高高清接收机的性能来实现在NIM和那里执行多项任务的能力。
{"title":"Performance enhancement of network interface module in high definition receivers","authors":"Nanda Kishora Holla, S. Yellampalli","doi":"10.1109/ICCIC.2014.7238486","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238486","url":null,"abstract":"Network Interface Module (NIM) is a front-end receiver block, which interfaces incoming signals from outside world in to the High Definition (HD) Radio Frequency (RF) receivers. In most of the cases, NIM receives only one type of signal and down converts RF in to Intermediate Frequency (IF). In modern receivers there could be a separate block for Tuner and demodulator or there could be a single integrated block which acts as network interface module. The flexibility of the design and the cost impact are the two major components need to be taken in to consideration while finalizing the architecture of the HD receivers. This research paper explores the modularity concept in the front-end block of receivers which will helps to enhance the performance of the receivers as and when required. Capability to perform multiple tasks at NIM and there by enhancing the performance of HD receivers is discussed in this research paper.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122927674","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238421
B. Gowridevi, B. Gangadevi, A. V. Geethamani, T. Pavithra, S. Ravi Kumar
Multipliers are considered to be an important component in DSP applications like filters. Designing high-speed multipliers with low power have substantial research interest. Modified Booth Multiprecision Multiplier (MBMP) reduces the power consumption by selecting the small precision multipliers in accordance with the selection of input operands selector. The large area overhead can be reduced by reusing 9 bit and 17 bit multipliers to perform a higher precision multiplication such as 16 × 16, 32 × 32 respectively. The design of multiplier is done using modified booth algorithm which reduces total number partial products from N to N/2 so that the computational complexity is reduced. The dynamic frequency scaling and voltage scaling units provide the required frequency and supply voltage based on the run time workload. Finally we can yield the improved power performance while comparing the proposed MBMP multiplier with the conventional fixed width multiplier.
{"title":"Modified booth multiprecision multiplier with scalable voltage and frequency units","authors":"B. Gowridevi, B. Gangadevi, A. V. Geethamani, T. Pavithra, S. Ravi Kumar","doi":"10.1109/ICCIC.2014.7238421","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238421","url":null,"abstract":"Multipliers are considered to be an important component in DSP applications like filters. Designing high-speed multipliers with low power have substantial research interest. Modified Booth Multiprecision Multiplier (MBMP) reduces the power consumption by selecting the small precision multipliers in accordance with the selection of input operands selector. The large area overhead can be reduced by reusing 9 bit and 17 bit multipliers to perform a higher precision multiplication such as 16 × 16, 32 × 32 respectively. The design of multiplier is done using modified booth algorithm which reduces total number partial products from N to N/2 so that the computational complexity is reduced. The dynamic frequency scaling and voltage scaling units provide the required frequency and supply voltage based on the run time workload. Finally we can yield the improved power performance while comparing the proposed MBMP multiplier with the conventional fixed width multiplier.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121353231","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 : 2014-12-01DOI: 10.1109/ICCIC.2014.7238317
B. Priyanka, K. Rajeswari, S. Thiruvengadam
This paper proposes a method of sparse channel estimation using compressed sensing for MIMO-OFDM system. The channel estimation is formulated as a sparse recovery problem because of the maximum delay spread in the high data rate OFDM communication systems. The proposed Distributed Compressed Sensing (DCS) algorithm for channel estimation in MIMO-OFDM system exploits the join sparsity of the MIMO channel. It takes less number of iterations in solving the channel estimation problem and runs much faster than the existing Compressive Sampling Matching Pursuit (CoSaMP). Simulation results demonstrate the validity of the algorithm. For the MIMO channels of unknown sparse degrees, the proposed DCS algorithm gives good channel estimation performance with less number of subcarriers reducing the complexity of the system.
{"title":"MIMO-OFDM channel estimation using distributed compressed sensing","authors":"B. Priyanka, K. Rajeswari, S. Thiruvengadam","doi":"10.1109/ICCIC.2014.7238317","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238317","url":null,"abstract":"This paper proposes a method of sparse channel estimation using compressed sensing for MIMO-OFDM system. The channel estimation is formulated as a sparse recovery problem because of the maximum delay spread in the high data rate OFDM communication systems. The proposed Distributed Compressed Sensing (DCS) algorithm for channel estimation in MIMO-OFDM system exploits the join sparsity of the MIMO channel. It takes less number of iterations in solving the channel estimation problem and runs much faster than the existing Compressive Sampling Matching Pursuit (CoSaMP). Simulation results demonstrate the validity of the algorithm. For the MIMO channels of unknown sparse degrees, the proposed DCS algorithm gives good channel estimation performance with less number of subcarriers reducing the complexity of the system.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121454195","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
扫码关注我们
求助内容：
应助结果提醒方式：