Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238459
R. Adityan, Phaniram Sayapaneni, V. Elamaran, Ritesh Agarwal
The Current Telecom Industry faces a steady competition of providing new technologies to its customers and to meet the challenges of the up-gradation of the existing technologies. The more the number of operators, the more is the need for spectrum resources as well as new infrastructure keeping in mind the scarce resources available. This report provides a technical analysis of how 3rd Generation (3G) Intra Circle Roaming agreement is done between two operators under a licensed circle subjected to the conditions of the government and the telecom regulatory. Intra Circle Roaming (ICR) is a service which enables a mobile station of a given public land mobile network (PLMN) to offer services from an another PLMN in the same country on a location area basis, with automatic return to the home PLMN. The general idea of this report includes how a basic call, Short Message Service (SMS) and Packet Data Protocol (PDP) activation is made while the subscriber is roaming under ICR considerations with certain requirements from the roaming partner.
{"title":"3G Intra circle roaming implementation techniques","authors":"R. Adityan, Phaniram Sayapaneni, V. Elamaran, Ritesh Agarwal","doi":"10.1109/ICCIC.2014.7238459","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238459","url":null,"abstract":"The Current Telecom Industry faces a steady competition of providing new technologies to its customers and to meet the challenges of the up-gradation of the existing technologies. The more the number of operators, the more is the need for spectrum resources as well as new infrastructure keeping in mind the scarce resources available. This report provides a technical analysis of how 3rd Generation (3G) Intra Circle Roaming agreement is done between two operators under a licensed circle subjected to the conditions of the government and the telecom regulatory. Intra Circle Roaming (ICR) is a service which enables a mobile station of a given public land mobile network (PLMN) to offer services from an another PLMN in the same country on a location area basis, with automatic return to the home PLMN. The general idea of this report includes how a basic call, Short Message Service (SMS) and Packet Data Protocol (PDP) activation is made while the subscriber is roaming under ICR considerations with certain requirements from the roaming partner.","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":"129451266","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.7238481
A. Geetha, G. M. Nasira
Prediction is a challenging task and that too for weather is even more complex, dynamic and mind-boggling. Weather prediction poses right from the ancient times as a big herculean task, because it depends on various parameters to predict the dependent variables like temperature, rainfall, humidity, wind speed and direction, which are changing from time to time and weather calculation varies with the geographical location along with its atmospheric variables. There are many data mining techniques employed for weather prediction, but decision tree evaluation can be quantified. This paper highlights a model using decision tree to predict weather phenomena like fog, rainfall, cyclones and thunderstorms, which can be a life saving information and used by peoples of all walks of life in making wise and intelligent decisions. This model may be used in machine learning and further promises the scope for improvement as more and more relevant attributes can be used in predicting the dependent variables. The proposed model is implemented using the open source data mining tool Rapidminer.
{"title":"Data mining for meteorological applications: Decision trees for modeling rainfall prediction","authors":"A. Geetha, G. M. Nasira","doi":"10.1109/ICCIC.2014.7238481","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238481","url":null,"abstract":"Prediction is a challenging task and that too for weather is even more complex, dynamic and mind-boggling. Weather prediction poses right from the ancient times as a big herculean task, because it depends on various parameters to predict the dependent variables like temperature, rainfall, humidity, wind speed and direction, which are changing from time to time and weather calculation varies with the geographical location along with its atmospheric variables. There are many data mining techniques employed for weather prediction, but decision tree evaluation can be quantified. This paper highlights a model using decision tree to predict weather phenomena like fog, rainfall, cyclones and thunderstorms, which can be a life saving information and used by peoples of all walks of life in making wise and intelligent decisions. This model may be used in machine learning and further promises the scope for improvement as more and more relevant attributes can be used in predicting the dependent variables. The proposed model is implemented using the open source data mining tool Rapidminer.","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":"129852571","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.7238545
Z. Livinsa
Recent technological developments in Micro-Electro-Mechanical System (MEMS) and communication system have made the wireless sensor networks (WSNs) with emerging applications. Localization is the essential research problem in WSNs. In this paper, I have projected Received Signal Strength Indicator (RSSI) and improved Distance vector (DV) localization algorithms for accurate position estimation. The localization error is premeditated for a diverse range of anchor population, communication range and degree of irregularity (DOI). In the simulation, I compare these two localization algorithms and the result shows that the performance of improved DV-Hop algorithm has high position accuracy as compared to the RSSI algorithm.
{"title":"Recital analysis of localization algorithm in wireless sensor networks","authors":"Z. Livinsa","doi":"10.1109/ICCIC.2014.7238545","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238545","url":null,"abstract":"Recent technological developments in Micro-Electro-Mechanical System (MEMS) and communication system have made the wireless sensor networks (WSNs) with emerging applications. Localization is the essential research problem in WSNs. In this paper, I have projected Received Signal Strength Indicator (RSSI) and improved Distance vector (DV) localization algorithms for accurate position estimation. The localization error is premeditated for a diverse range of anchor population, communication range and degree of irregularity (DOI). In the simulation, I compare these two localization algorithms and the result shows that the performance of improved DV-Hop algorithm has high position accuracy as compared to the RSSI algorithm.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"31 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":"126617488","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.7238371
S. V. Viraktamath, Preeya H. Patil, G. V. Attimarad
The most of the modern hand held communicating devices rely on forward error correction techniques for their proper functioning. Convolutional coding and Viterbi decoding is one of the forward error correction technique used in most of the communication applications. This paper investigates the impact of code rates on the performance of hard decision Viterbi decoder. In this paper different rates such as 1/2, 2/3 and 3/5 have been simulated using different constraint lengths from 5 to 10 as well as different generator polynomials. All the simulations are conducted in MATLAB over AWGN channel. The paper also investigates the impact of trace back length on the performance of Viterbi decoder. The decoding time for different constraint lengths have also been observed.
{"title":"Impact of code rate on the performance of Viterbi decoder in AWGN channel","authors":"S. V. Viraktamath, Preeya H. Patil, G. V. Attimarad","doi":"10.1109/ICCIC.2014.7238371","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238371","url":null,"abstract":"The most of the modern hand held communicating devices rely on forward error correction techniques for their proper functioning. Convolutional coding and Viterbi decoding is one of the forward error correction technique used in most of the communication applications. This paper investigates the impact of code rates on the performance of hard decision Viterbi decoder. In this paper different rates such as 1/2, 2/3 and 3/5 have been simulated using different constraint lengths from 5 to 10 as well as different generator polynomials. All the simulations are conducted in MATLAB over AWGN channel. The paper also investigates the impact of trace back length on the performance of Viterbi decoder. The decoding time for different constraint lengths have also been observed.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"58 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":"127257846","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.7238437
J. Goel, B. Mehtre
IPv6 router advertisement flooding is one of the severe DoS attack. It leads to denial of service attack on entire Local Area Network. As a result all system connected to that LAN get frozen and unresponsive. Whole LAN and its systems stop working. Hence it is very important to protect our LANs from IPv6 RA flood attack. In this paper, we described IPv6 RA flood attack in virtual LAN using KALI Linux. We showed its effects on the victim's computer. We proposed a new approach to defend from Ipv6 RA flooding DoS attack by dynamic ipv6 activation. Such a system would detect the attack and raise a warning alarm. It deactivates IPv6 temporarily. When host recovers from the attack, the proposed system reactivates IPv6 again. So by using this approach user can use both IPv6 and IPv4 services even under attack. We have also provided pseudo code and experimental results in this paper.
{"title":"Dynamic IPv6 activation based defense for IPv6 router advertisement flooding (DoS) attack","authors":"J. Goel, B. Mehtre","doi":"10.1109/ICCIC.2014.7238437","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238437","url":null,"abstract":"IPv6 router advertisement flooding is one of the severe DoS attack. It leads to denial of service attack on entire Local Area Network. As a result all system connected to that LAN get frozen and unresponsive. Whole LAN and its systems stop working. Hence it is very important to protect our LANs from IPv6 RA flood attack. In this paper, we described IPv6 RA flood attack in virtual LAN using KALI Linux. We showed its effects on the victim's computer. We proposed a new approach to defend from Ipv6 RA flooding DoS attack by dynamic ipv6 activation. Such a system would detect the attack and raise a warning alarm. It deactivates IPv6 temporarily. When host recovers from the attack, the proposed system reactivates IPv6 again. So by using this approach user can use both IPv6 and IPv4 services even under attack. We have also provided pseudo code and experimental results in this paper.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"36 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":"122727178","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.7238457
Phaniram Sayapaneni, V. Elamaran
From the past few years a variety of low power adders have been proposed to reduce the overall power consumption of micro-electronic systems. The role of adders are important in almost all fields of engineering and applied sciences. With the help of low power adders, all the other systems which make use of adders may dissipate less power. This study presents a detailed comparison between various low power 1-bit full adders. This study focuses mainly on the comparisons among conventional Complementary Metal Oxide Semiconductor (CMOS) adder, bridge style adder, transmission gate adder, square root based adder and static energy recovery full adder, etc. All the simulation results are done using Digital Schematic (DSCH) editor and the functionality is verified using the Microwind layout editor tool. The sole objective of this study to conclude with a better estimate and ease in selecting a low power adder for the required application.
{"title":"A comparative study on low power adders using microwind EDA tool","authors":"Phaniram Sayapaneni, V. Elamaran","doi":"10.1109/ICCIC.2014.7238457","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238457","url":null,"abstract":"From the past few years a variety of low power adders have been proposed to reduce the overall power consumption of micro-electronic systems. The role of adders are important in almost all fields of engineering and applied sciences. With the help of low power adders, all the other systems which make use of adders may dissipate less power. This study presents a detailed comparison between various low power 1-bit full adders. This study focuses mainly on the comparisons among conventional Complementary Metal Oxide Semiconductor (CMOS) adder, bridge style adder, transmission gate adder, square root based adder and static energy recovery full adder, etc. All the simulation results are done using Digital Schematic (DSCH) editor and the functionality is verified using the Microwind layout editor tool. The sole objective of this study to conclude with a better estimate and ease in selecting a low power adder for the required application.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"25 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":"125968293","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
扫码关注我们
求助内容：
应助结果提醒方式：