Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398194
S. Gupta, A. Dwivedi, R. Issac, S. K. Agrawal
Nowadays, crucial task in data mining field in large multidimensional data has always been the similarity search problems. Similarity search involves both subsequences matching and whole sequence matching. In this paper, we present an approach which consider on how many dimensions the data point is similiar to the query point, the average distance of these dimensions of data point to the query point as well as efficiency with respect to time and space required with the dramatic increment of data size. The proposed approach involves dynamic selection of input parameters, covering both subsequences matching and whole sequence matching, suppressing the impact of high dissimilarities in few dimensions. Thus our proposed approach can help improving performance of existing data analysis technologies, such as financial market analysis, medical diagnosis and scientific and engineering database analysis as tremendous amount of data is generated in these disciplines.
{"title":"EKSS: An efficient approach for similarity search","authors":"S. Gupta, A. Dwivedi, R. Issac, S. K. Agrawal","doi":"10.1109/ICCICT.2012.6398194","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398194","url":null,"abstract":"Nowadays, crucial task in data mining field in large multidimensional data has always been the similarity search problems. Similarity search involves both subsequences matching and whole sequence matching. In this paper, we present an approach which consider on how many dimensions the data point is similiar to the query point, the average distance of these dimensions of data point to the query point as well as efficiency with respect to time and space required with the dramatic increment of data size. The proposed approach involves dynamic selection of input parameters, covering both subsequences matching and whole sequence matching, suppressing the impact of high dissimilarities in few dimensions. Thus our proposed approach can help improving performance of existing data analysis technologies, such as financial market analysis, medical diagnosis and scientific and engineering database analysis as tremendous amount of data is generated in these disciplines.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239650","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398190
D. Rathod, R. Awale
Low-density Parity check codes (LDPC) are gaining interest for high data rate application in both terrestrial and spatial communications which requires low bit error rate. This paper proposes an algorithm through which the best parity check matrix is obtained for irregular low density parity check codes, which reduces the Bit Error Rate ,Frame Error Rate and computational complexity. Tanner graph also called a bipartite graph format in an Low Density Parity Check (LDPC) code design contains many short cycles; it will produce a computational complexity in a code design process and it degrades the code performance. To overcome this effect, we proposed an new algorithm which obtains a best final parity check matrix. Throughout the paper we will give the detailed description of an efficient algorithm proposed. The complexity is studied graphically and analytically. Using proposed algorithm, cycles of length four observed in corresponding matrix are removed. Each matrix is evaluated over a noisy Additive White Gaussian Noise (AWGN) channel. Bit Error rate and Frame error rate is calculated. The results are compared with randomly generated best parity check matrix. Simulation results shows that proposed method successfully overcomes the computational complexity and meets the near Shannon limit.
{"title":"An efficient algorithm for irregular Low density Parity Check code with reduced computational complexity and error floor","authors":"D. Rathod, R. Awale","doi":"10.1109/ICCICT.2012.6398190","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398190","url":null,"abstract":"Low-density Parity check codes (LDPC) are gaining interest for high data rate application in both terrestrial and spatial communications which requires low bit error rate. This paper proposes an algorithm through which the best parity check matrix is obtained for irregular low density parity check codes, which reduces the Bit Error Rate ,Frame Error Rate and computational complexity. Tanner graph also called a bipartite graph format in an Low Density Parity Check (LDPC) code design contains many short cycles; it will produce a computational complexity in a code design process and it degrades the code performance. To overcome this effect, we proposed an new algorithm which obtains a best final parity check matrix. Throughout the paper we will give the detailed description of an efficient algorithm proposed. The complexity is studied graphically and analytically. Using proposed algorithm, cycles of length four observed in corresponding matrix are removed. Each matrix is evaluated over a noisy Additive White Gaussian Noise (AWGN) channel. Bit Error rate and Frame error rate is calculated. The results are compared with randomly generated best parity check matrix. Simulation results shows that proposed method successfully overcomes the computational complexity and meets the near Shannon limit.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130305616","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398143
M. Samadder, S. Chatterjee, J. K. Bag
In wireless & mobile communication the mobility management technique is an important issue of research. To fulfill the criteria of the all time connectivity, the mobile station (MS) should be connected with a base station (BS) during its operating mode, irrespective of its mobility. When a MS travels within the cell, no special technique is required to maintain its connectivity. But when a MS travels out of the coverage area of its current BS and tries to associate with another BS, a delay occurs during the handover of connection which leads to a failure of connection. Throughout the last few years plenty of researches had been done to reduce this handover delay by reducing the scanning delay as the scanning process causes ninety percent of the total handover delay. In this paper, we propose a new scanning technique where the hexagonal cell is divided in three angular segments and for each segment two neighbour BSs are reserved for handover. MS will measure its distance from the reserved BSs at fixed time intervals and the handover of connection will be performed to the nearest BS when the handover will be required. Our simulation results show the effectiveness of our proposed scheme in practical field.
{"title":"A fast scanning technique for mobility management by optimized angular segmentation method","authors":"M. Samadder, S. Chatterjee, J. K. Bag","doi":"10.1109/ICCICT.2012.6398143","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398143","url":null,"abstract":"In wireless & mobile communication the mobility management technique is an important issue of research. To fulfill the criteria of the all time connectivity, the mobile station (MS) should be connected with a base station (BS) during its operating mode, irrespective of its mobility. When a MS travels within the cell, no special technique is required to maintain its connectivity. But when a MS travels out of the coverage area of its current BS and tries to associate with another BS, a delay occurs during the handover of connection which leads to a failure of connection. Throughout the last few years plenty of researches had been done to reduce this handover delay by reducing the scanning delay as the scanning process causes ninety percent of the total handover delay. In this paper, we propose a new scanning technique where the hexagonal cell is divided in three angular segments and for each segment two neighbour BSs are reserved for handover. MS will measure its distance from the reserved BSs at fixed time intervals and the handover of connection will be performed to the nearest BS when the handover will be required. Our simulation results show the effectiveness of our proposed scheme in practical field.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130460519","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398125
A. Deshpande, S. Patnaik
Restoration of a single degraded image from uniform velocity motion blurring is recently being studied in number of machine vision based applications including astronomy, medical imaging, consumer level photography, microscopy etc. Identification of motion blur parameters from single blurred image is truly an ill-posed problem, as there results multiple solutions in terms of estimated blur kernel and blurred image combinations, amongst which actual combination is hardly any, that will result into a faithful quality of restored image. The quality of restoration is also highly dependent on the accuracy of point spread function (PSF) kernel estimation. In this paper, we present a Radon transform based motion blur parameter estimation method under both spatial-invariant and variant blur consideration. The experiments performed on simulated motion blurred images show that taking Radon transform of the spectral gradients of blurred images improve estimation accuracy even in presence of noise. Compared with already existing Radon transform based PSF estimation schemes, our method successfully performs PSF estimation even for typical non-uniform motion blurred imagery.
{"title":"Radon transform based uniform and non-uniform motion blur parameter estimation","authors":"A. Deshpande, S. Patnaik","doi":"10.1109/ICCICT.2012.6398125","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398125","url":null,"abstract":"Restoration of a single degraded image from uniform velocity motion blurring is recently being studied in number of machine vision based applications including astronomy, medical imaging, consumer level photography, microscopy etc. Identification of motion blur parameters from single blurred image is truly an ill-posed problem, as there results multiple solutions in terms of estimated blur kernel and blurred image combinations, amongst which actual combination is hardly any, that will result into a faithful quality of restored image. The quality of restoration is also highly dependent on the accuracy of point spread function (PSF) kernel estimation. In this paper, we present a Radon transform based motion blur parameter estimation method under both spatial-invariant and variant blur consideration. The experiments performed on simulated motion blurred images show that taking Radon transform of the spectral gradients of blurred images improve estimation accuracy even in presence of noise. Compared with already existing Radon transform based PSF estimation schemes, our method successfully performs PSF estimation even for typical non-uniform motion blurred imagery.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130864047","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398136
T. Ghorpade, L. Ragha
The internet revolution has brought about a new way of expressing an individual's opinion. It has become a medium through which people openly express their views on various subjects. These opinions contain useful information which can be utilized in many sectors which require constant customer feedback. Analysis of the opinion and it's classification into different sentiment classes is gradually emerging as a key factor in decision making. There has been extensive research on automatic text analysis for sentiments such as sentiment classifiers, affect analysis, automatic survey analysis, opinion extraction, or recommender systems. These methods typically try to extract the overall sentiment revealed in a sentence or document, either positive or negative, or somewhere in between. However, a drawback of these methods is that the information can be degraded, especially in texts where a loss of information can also occur. The proposed method attempts to overcome the problem of the loss of text information by using well trained training sets. Also, recommendation of a product or request for a product as per the user's requirements have achieved with the proposed method.
{"title":"Featured based sentiment classification for hotel reviews using NLP and Bayesian classification","authors":"T. Ghorpade, L. Ragha","doi":"10.1109/ICCICT.2012.6398136","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398136","url":null,"abstract":"The internet revolution has brought about a new way of expressing an individual's opinion. It has become a medium through which people openly express their views on various subjects. These opinions contain useful information which can be utilized in many sectors which require constant customer feedback. Analysis of the opinion and it's classification into different sentiment classes is gradually emerging as a key factor in decision making. There has been extensive research on automatic text analysis for sentiments such as sentiment classifiers, affect analysis, automatic survey analysis, opinion extraction, or recommender systems. These methods typically try to extract the overall sentiment revealed in a sentence or document, either positive or negative, or somewhere in between. However, a drawback of these methods is that the information can be degraded, especially in texts where a loss of information can also occur. The proposed method attempts to overcome the problem of the loss of text information by using well trained training sets. Also, recommendation of a product or request for a product as per the user's requirements have achieved with the proposed method.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129426925","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398153
A. Deshmukh, D. Vivek, S. Darpan, K. Sagar, K. P. Ray
The broadband microstrip antenna is realized by cutting the slot of different shapes like U-slot, V-slot and pair of rectangular slots inside the patch. The slot is said to introduce a mode near the fundamental resonance frequency of the patch and realizes broadband response. By using thicker substrates in excess of 0.08λ0, the bandwidth of slot cut microstrip antenna is increased by feeding the patch using the simpler proximity feeding technique. In this paper, a half U-slot and rectangular slots cut proximity fed broadband rectangular microstrip antenna is proposed. The analysis to study the effects of slot on the broadband response of slot cut patch is presented. Through the analysis it was observed that the slot modifies the resonance frequencies of higher order modes of the patch and yields broadband response. The bandwidth of more than 550 MHz (>; 45%) is obtained. The antenna gives broadside radiation pattern with a gain more than 5 dBi over the operating bandwidth.
{"title":"Broadband proximity fed modified rectangular microstrip antenna","authors":"A. Deshmukh, D. Vivek, S. Darpan, K. Sagar, K. P. Ray","doi":"10.1109/ICCICT.2012.6398153","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398153","url":null,"abstract":"The broadband microstrip antenna is realized by cutting the slot of different shapes like U-slot, V-slot and pair of rectangular slots inside the patch. The slot is said to introduce a mode near the fundamental resonance frequency of the patch and realizes broadband response. By using thicker substrates in excess of 0.08λ0, the bandwidth of slot cut microstrip antenna is increased by feeding the patch using the simpler proximity feeding technique. In this paper, a half U-slot and rectangular slots cut proximity fed broadband rectangular microstrip antenna is proposed. The analysis to study the effects of slot on the broadband response of slot cut patch is presented. Through the analysis it was observed that the slot modifies the resonance frequencies of higher order modes of the patch and yields broadband response. The bandwidth of more than 550 MHz (>; 45%) is obtained. The antenna gives broadside radiation pattern with a gain more than 5 dBi over the operating bandwidth.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124436063","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398111
T. Dhope, D. Simunic
The complexity of wireless system requires a careful design, especially related to bandwidth and energy efficiency. The energy efficiency is getting more and more on importance, due to increasing penetration of various wireless systems in different battery-oriented applications, as well as due to the more conscious global view on the need for “greening the Earth”. Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Cooperative spectrum sensing has been proposed to combat the multipath fading, shadowing and receiver uncertainty problem improving the detection performance by exploiting spatial diversity but at the cost of increase in cooperation overhead such as extra sensing time, delay, energy and operations devoted to cooperative sensing. Cluster based cooperative sensing can improve the performance and reduce the computational cost. In recent years, many methods of cooperative spectrum sensing have been proposed based on the clustering technique. In this paper, we provide an extensive review of cluster-based cooperative spectrum sensing.
{"title":"Cluster based cooperative sensing:-A survey","authors":"T. Dhope, D. Simunic","doi":"10.1109/ICCICT.2012.6398111","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398111","url":null,"abstract":"The complexity of wireless system requires a careful design, especially related to bandwidth and energy efficiency. The energy efficiency is getting more and more on importance, due to increasing penetration of various wireless systems in different battery-oriented applications, as well as due to the more conscious global view on the need for “greening the Earth”. Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Cooperative spectrum sensing has been proposed to combat the multipath fading, shadowing and receiver uncertainty problem improving the detection performance by exploiting spatial diversity but at the cost of increase in cooperation overhead such as extra sensing time, delay, energy and operations devoted to cooperative sensing. Cluster based cooperative sensing can improve the performance and reduce the computational cost. In recent years, many methods of cooperative spectrum sensing have been proposed based on the clustering technique. In this paper, we provide an extensive review of cluster-based cooperative spectrum sensing.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357643","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398123
T. Dhope, D. Simunic
Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally, limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Conventional sensing methods usually relate to sensing the spectrum in three dimensions viz. frequency, time and space. However, there are other dimensions `Angle' and `Code' that need to be explored further for spectrum opportunity. This paper investigates the performance of Angle of Arrival (AoA) estimation algorithms like Bartlett's, Capon, MUSIC, Root-MUSIC and ESPRIT in cognitive radio networks. The results show that the performance of the algorithms improves with increasing number of array elements, increasing number of snapshots and increasing signal-to-noise ratio. This new approach of AoA estimation of licensed user, improves frequency reuse capability and increases channel capacity by multiplexing multiple users (licensed and unlicensed) into the same channel at the same time in the same geographical area by forming the beam of unlicensed user in the direction other than the licensed users' AoA direction.
{"title":"On the performance of AoA estimation algorithms in cognitive radio networks","authors":"T. Dhope, D. Simunic","doi":"10.1109/ICCICT.2012.6398123","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398123","url":null,"abstract":"Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally, limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Conventional sensing methods usually relate to sensing the spectrum in three dimensions viz. frequency, time and space. However, there are other dimensions `Angle' and `Code' that need to be explored further for spectrum opportunity. This paper investigates the performance of Angle of Arrival (AoA) estimation algorithms like Bartlett's, Capon, MUSIC, Root-MUSIC and ESPRIT in cognitive radio networks. The results show that the performance of the algorithms improves with increasing number of array elements, increasing number of snapshots and increasing signal-to-noise ratio. This new approach of AoA estimation of licensed user, improves frequency reuse capability and increases channel capacity by multiplexing multiple users (licensed and unlicensed) into the same channel at the same time in the same geographical area by forming the beam of unlicensed user in the direction other than the licensed users' AoA direction.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127984181","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398137
V. D. Nimavat, G. R. Kulkarni
Nowadays the Global System for Mobile Communication (originally from Groupe Special Mobile)-GSM technology becomes popular. GSM has potential success in its line-of-sight (LOS) and non line-of-sight (NLOS) conditions which operating in the 900 MHz or 1800 MHz bands. There are going to be a surge all over the world for the deployment of GSM networks. Estimation of path loss is very important in initial deployment of wireless network and cell planning. Numerous path loss (PL) models (e.g. Okumura Model, Hata Model) are available to predict the propagation loss. In this paper we compare and analyze five path loss models (i.e. COST 231 Hata model, SUI model, Ericsson model and COST 231 Walfish-Ikegami model) in different receiver antenna heights in urban, suburban and rural environments in NLOS condition. Our main concentration in this paper is to find out a suitable model for different environments to provide guidelines for cell planning of GSM Network at cellular frequency of 900 MHz.
目前，全球移动通信系统(原Groupe Special Mobile)-GSM技术开始流行。GSM在900 MHz或1800 MHz频段的视距(LOS)和非视距(NLOS)条件下具有潜在的成功。GSM网络的部署将在全世界掀起一股热潮。在无线网络的初始部署和小区规划中，路径损耗的估计是非常重要的。有许多路径损耗模型(如Okumura模型、Hata模型)可用于预测传播损耗。本文对比分析了NLOS条件下城市、郊区和农村环境中不同接收天线高度下的五种路径损耗模型(COST 231 Hata模型、SUI模型、Ericsson模型和COST 231 Walfish-Ikegami模型)。本文的主要工作是寻找适合不同环境的模型，为900 MHz蜂窝频率下GSM网络的小区规划提供指导。
{"title":"Simulation and performance evaluation of GSM propagation channel under the urban, suburban and rural environments","authors":"V. D. Nimavat, G. R. Kulkarni","doi":"10.1109/ICCICT.2012.6398137","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398137","url":null,"abstract":"Nowadays the Global System for Mobile Communication (originally from Groupe Special Mobile)-GSM technology becomes popular. GSM has potential success in its line-of-sight (LOS) and non line-of-sight (NLOS) conditions which operating in the 900 MHz or 1800 MHz bands. There are going to be a surge all over the world for the deployment of GSM networks. Estimation of path loss is very important in initial deployment of wireless network and cell planning. Numerous path loss (PL) models (e.g. Okumura Model, Hata Model) are available to predict the propagation loss. In this paper we compare and analyze five path loss models (i.e. COST 231 Hata model, SUI model, Ericsson model and COST 231 Walfish-Ikegami model) in different receiver antenna heights in urban, suburban and rural environments in NLOS condition. Our main concentration in this paper is to find out a suitable model for different environments to provide guidelines for cell planning of GSM Network at cellular frequency of 900 MHz.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501087","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398141
P. Pisolkar, S. Parmar, C. Poojari, D. Kalbande
A bangbang controller (on off controller), also known as a hysteresis controller, is a feedback controller that switches abruptly between two states. These controllers may be realized in terms of any element that provides hysteresis. They are often used to control a plant that accepts a binary input. With recent development of the space science and technology, higher requirements such as accuracy, robustness and disturbance rejection ability in satellite attitude control system have leaded to the more promising intelligent control methods. In order implement this artificial neural networks are a growing trend. A neural scheme of bang bang controller [1] is efficient in solving satellite orientation problems and also continuous updation of error. In control systems Fuzzy Inference Systems are used for loop control and to obtain desired output.
{"title":"Satellite positioning simulation system","authors":"P. Pisolkar, S. Parmar, C. Poojari, D. Kalbande","doi":"10.1109/ICCICT.2012.6398141","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398141","url":null,"abstract":"A bangbang controller (on off controller), also known as a hysteresis controller, is a feedback controller that switches abruptly between two states. These controllers may be realized in terms of any element that provides hysteresis. They are often used to control a plant that accepts a binary input. With recent development of the space science and technology, higher requirements such as accuracy, robustness and disturbance rejection ability in satellite attitude control system have leaded to the more promising intelligent control methods. In order implement this artificial neural networks are a growing trend. A neural scheme of bang bang controller [1] is efficient in solving satellite orientation problems and also continuous updation of error. In control systems Fuzzy Inference Systems are used for loop control and to obtain desired output.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115910031","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
扫码关注我们
求助内容：
应助结果提醒方式：