Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600072
R. S., Subrat Kar, Dharmaraja Selvamuthu
In the recent past, we have witnessed steep growth in mobile data consumption. To address the capacity requirements resulting from the huge growth in mobile data traffic, the mobile network operators (MNOs) are adding more base stations and allocating more spectrum layers including outdoor and indoor small cells. Since the capacity requirement of the network varies over time, the scaling up of the network may increase the energy consumption of the Radio Access Network (RAN). Hence, we need to optimize the network to reduce the overall power consumption through Cloud based models, and deployment of power-efficient radio nodes. In this paper, we analyze the network evolution towards Cloud based Radio Access Network (CRAN) for a heterogeneous set of base stations such as those with Macro RRUs, Micro RRUs and Pico radio units. We derive the computational complexity using a flexible and ‘future-proof’ power model and apply it for the network. We also compare the computation complexity for various cases of User Equipment (UE) channel conditions, different sub-components within the given base station type and provide the results. We further use the Bin-Packing algorithm to analyze the number of base station cloud servers needed for this network and the power consumption of the base station cloud. We further evaluate whether the newer cloud servers with higher CPU cores are power efficient for a given load. We observe from the simulations, that the currently available base station cloud servers have more capacity and still are more power efficient than the baseline Compute Node servers used with the earlier power model.
{"title":"Analysis of Computational Complexity and Power Consumption in Cloud Based Heterogeneous RAN","authors":"R. S., Subrat Kar, Dharmaraja Selvamuthu","doi":"10.1109/NCC.2018.8600072","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600072","url":null,"abstract":"In the recent past, we have witnessed steep growth in mobile data consumption. To address the capacity requirements resulting from the huge growth in mobile data traffic, the mobile network operators (MNOs) are adding more base stations and allocating more spectrum layers including outdoor and indoor small cells. Since the capacity requirement of the network varies over time, the scaling up of the network may increase the energy consumption of the Radio Access Network (RAN). Hence, we need to optimize the network to reduce the overall power consumption through Cloud based models, and deployment of power-efficient radio nodes. In this paper, we analyze the network evolution towards Cloud based Radio Access Network (CRAN) for a heterogeneous set of base stations such as those with Macro RRUs, Micro RRUs and Pico radio units. We derive the computational complexity using a flexible and ‘future-proof’ power model and apply it for the network. We also compare the computation complexity for various cases of User Equipment (UE) channel conditions, different sub-components within the given base station type and provide the results. We further use the Bin-Packing algorithm to analyze the number of base station cloud servers needed for this network and the power consumption of the base station cloud. We further evaluate whether the newer cloud servers with higher CPU cores are power efficient for a given load. We observe from the simulations, that the currently available base station cloud servers have more capacity and still are more power efficient than the baseline Compute Node servers used with the earlier power model.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126884098","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600121
Karthik Karra, K. Sivalingam
Providing resiliency is an important aspect of network service. Redundancy is one of the major solutions by which resiliency is offered, but it comes with an increase in Capex/Opex costs and usage of resources. This paper utilizes the emerging Software-Defined Networking (SDN) and Network Function Virtualization (NFV) paradigms to provide resilient services with minimal amount of redundancy. Two algorithms are proposed, one for the migration of the functions from the failed to the functioning server(s) and the other to improve the robustness of the failed part of Service Function Chain (SFC). The algorithms have been studied using a simulation model. The results show that the reactive handling of failure is practically feasible while honoring the Service Level Agreement (SLA) and an SFC can be made robust enough with respect to the parameter considered.
{"title":"Providing Resiliency for Service Function Chaining in NFV systems using a SDN-based approach","authors":"Karthik Karra, K. Sivalingam","doi":"10.1109/NCC.2018.8600121","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600121","url":null,"abstract":"Providing resiliency is an important aspect of network service. Redundancy is one of the major solutions by which resiliency is offered, but it comes with an increase in Capex/Opex costs and usage of resources. This paper utilizes the emerging Software-Defined Networking (SDN) and Network Function Virtualization (NFV) paradigms to provide resilient services with minimal amount of redundancy. Two algorithms are proposed, one for the migration of the functions from the failed to the functioning server(s) and the other to improve the robustness of the failed part of Service Function Chain (SFC). The algorithms have been studied using a simulation model. The results show that the reactive handling of failure is practically feasible while honoring the Service Level Agreement (SLA) and an SFC can be made robust enough with respect to the parameter considered.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122593643","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 : 2018-02-01DOI: 10.1109/NCC.2018.8599881
Harsh Sheokand, Gaganpreet Singh, Saptarshi Ghosh, Mondeep Saikia, K. V. Srivastava, J. Ramkumar, S. A. Ramakrishna
In this paper, an optically transparent broadband microwave absorber is presented, which is polarization-insensitive as well as angularly stable. The proposed structure is made of indium tin oxide (ITO) based resistive sheets, which exhibits absorption bandwidth (above 90%) from 3.6 to 15 GHz, thereby covering C, X, and partial Ku bands. The absorption mechanism of the structure has been studied by analyzing several parametric variations. The proposed design has also been fabricated and experimentally verified under normal incidence.
{"title":"An Optically Transparent Microwave Broadband Absorber using Resistive Sheet","authors":"Harsh Sheokand, Gaganpreet Singh, Saptarshi Ghosh, Mondeep Saikia, K. V. Srivastava, J. Ramkumar, S. A. Ramakrishna","doi":"10.1109/NCC.2018.8599881","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599881","url":null,"abstract":"In this paper, an optically transparent broadband microwave absorber is presented, which is polarization-insensitive as well as angularly stable. The proposed structure is made of indium tin oxide (ITO) based resistive sheets, which exhibits absorption bandwidth (above 90%) from 3.6 to 15 GHz, thereby covering C, X, and partial Ku bands. The absorption mechanism of the structure has been studied by analyzing several parametric variations. The proposed design has also been fabricated and experimentally verified under normal incidence.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"589 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131512582","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600243
Athindran Ramesh Kumar, N. P, J. K. Milleth
Spectrum is a scarce and precious resource in a battlefield. Multiple frequencies spread over different bands are available for usage in a battlefield. The frequencies need to be assigned to the nodes/Base Stations(BSs) in a battlefield in such a way as to meet the Signal-to-Interference-Noise Ratio(SINR) and throughput requirements of all the users. Previous attempts for frequency assignment abstract away the notion of SINR and throughput and usually constrain the distance between the frequencies required between pairs of interfering BSs. In this work, the frequency assignment that optimizes the SINR and throughput of all the users in a system while ensuring fairness among the users is found. A genetic algorithm is used to perform the unconstrained optimization and this method is termed as the efficient rate and SINR matcher with hyperbolic cost (ERSMHC). A high SINR initialization algorithm (HSIA) and a high throughput greedy rate matching algorithm (HTGRM) that can be used for quickly initializing the system are also presented. The ERSMHC algorithm is shown to aid in meeting the stipulated rate and throughput requirements of more number of users as compared to HSIA and HTGRM.
{"title":"A Frequency Assignment Technique for Effective SINR and Throughput Management in a Battlefield","authors":"Athindran Ramesh Kumar, N. P, J. K. Milleth","doi":"10.1109/NCC.2018.8600243","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600243","url":null,"abstract":"Spectrum is a scarce and precious resource in a battlefield. Multiple frequencies spread over different bands are available for usage in a battlefield. The frequencies need to be assigned to the nodes/Base Stations(BSs) in a battlefield in such a way as to meet the Signal-to-Interference-Noise Ratio(SINR) and throughput requirements of all the users. Previous attempts for frequency assignment abstract away the notion of SINR and throughput and usually constrain the distance between the frequencies required between pairs of interfering BSs. In this work, the frequency assignment that optimizes the SINR and throughput of all the users in a system while ensuring fairness among the users is found. A genetic algorithm is used to perform the unconstrained optimization and this method is termed as the efficient rate and SINR matcher with hyperbolic cost (ERSMHC). A high SINR initialization algorithm (HSIA) and a high throughput greedy rate matching algorithm (HTGRM) that can be used for quickly initializing the system are also presented. The ERSMHC algorithm is shown to aid in meeting the stipulated rate and throughput requirements of more number of users as compared to HSIA and HTGRM.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131562463","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600175
A. Mazumdar, Jefin Jacob, P. Bora
In image splicing forgery, parts from two or more images are used to create a new composite image. Among the different approaches to expose splicing forgery, lighting environment-based forensics methods are more robust to different post-processing operations. In these methods, the 3D lighting environments are estimated from different parts of the image under investigation. They are later compared with each other to check the authenticity of the image. This paper proposes a novel 3D lighting environment-based image forensics method which can detect splicing forgeries in images containing human faces. The proposed method estimates the lighting environments from facial regions present in the image using shape, illumination, and reflectance from shading or the SIRFS method. SIRFS performs an optimization procedure to get the most likely shape, reflectance and illumination that construct a given image by imposing priors on shape, reflectance and illumination. Once the lighting environments are estimated from all the faces present in the image, they are compared with each other. In case of an authentic image under uniform illumination, the lighting environments estimated from different faces will be similar while there will be at least one pair of faces with different lighting environments in the case of a spliced image. Experimental results on two different datasets show that the proposed method can discriminate different lighting environments better than the state-of-the-art 3D lighting environment-based forensics methods and hence can expose forgeries better.
{"title":"Forgery Detection in Digital Images through Lighting Environment Inconsistencies","authors":"A. Mazumdar, Jefin Jacob, P. Bora","doi":"10.1109/NCC.2018.8600175","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600175","url":null,"abstract":"In image splicing forgery, parts from two or more images are used to create a new composite image. Among the different approaches to expose splicing forgery, lighting environment-based forensics methods are more robust to different post-processing operations. In these methods, the 3D lighting environments are estimated from different parts of the image under investigation. They are later compared with each other to check the authenticity of the image. This paper proposes a novel 3D lighting environment-based image forensics method which can detect splicing forgeries in images containing human faces. The proposed method estimates the lighting environments from facial regions present in the image using shape, illumination, and reflectance from shading or the SIRFS method. SIRFS performs an optimization procedure to get the most likely shape, reflectance and illumination that construct a given image by imposing priors on shape, reflectance and illumination. Once the lighting environments are estimated from all the faces present in the image, they are compared with each other. In case of an authentic image under uniform illumination, the lighting environments estimated from different faces will be similar while there will be at least one pair of faces with different lighting environments in the case of a spliced image. Experimental results on two different datasets show that the proposed method can discriminate different lighting environments better than the state-of-the-art 3D lighting environment-based forensics methods and hence can expose forgeries better.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128055899","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600227
A. B. Varuna, Saptarshi Ghosh, Harsh Sheokand, K. V. Srivastava
In this paper, a polarization-insensitive frequency selective surface (FSS) made of miniaturized elements has been presented. The proposed FSS structure is comprised of convoluted meander line geometries printed on both sides of an ultra-thin dielectric substrate. The design exhibits a bandpass response at 1.25 GHz corresponding to the unit cell dimension of $0.042lambda_{0}times 0.042lambda_{0}$ only, where $lambda_{0}$ represents the free space wavelength at the centre frequency. The novelty of the structure lies in its improved miniaturization performance as compared to the earlier reported spatial filters. Furthermore, the designed FSS is angularly stable upto incident angle of 60°. The proposed structure has also been fabricated and experimentally verified under normal incidence.
{"title":"A Polarization-Insensitive Miniaturized Element Frequency Selective Surface using Meander Lines","authors":"A. B. Varuna, Saptarshi Ghosh, Harsh Sheokand, K. V. Srivastava","doi":"10.1109/NCC.2018.8600227","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600227","url":null,"abstract":"In this paper, a polarization-insensitive frequency selective surface (FSS) made of miniaturized elements has been presented. The proposed FSS structure is comprised of convoluted meander line geometries printed on both sides of an ultra-thin dielectric substrate. The design exhibits a bandpass response at 1.25 GHz corresponding to the unit cell dimension of $0.042lambda_{0}times 0.042lambda_{0}$ only, where $lambda_{0}$ represents the free space wavelength at the centre frequency. The novelty of the structure lies in its improved miniaturization performance as compared to the earlier reported spatial filters. Furthermore, the designed FSS is angularly stable upto incident angle of 60°. The proposed structure has also been fabricated and experimentally verified under normal incidence.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293758","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600089
Ushasi Ghosh, Pranay Agarwal, Abhinav Kumar
In a long term evolution (LTE) based cellular network, the mobility management entity (MME) is responsible for non-data signaling between user equipment of multiple base stations in a geographic region and the core network. Thus, the MME residence time (MRT) is a key parameter required to improve the performance of an LTE based cellular network. The impact of various mobility and network scenarios on cell residence time has been studied in the literature. However, the MRT has not been suitably modeled. Hence, in this paper, we consider diverse mobility and network scenarios. For these scenarios, we model the MRT using various probability distributions. We analyze and evaluate the statistical performance of these distributions in modeling MRT. Finally, we show through exhaustive simulations that the Lognormal and Generalized Pareto distributions are best suited to model the MRT for specific network and mobility scenarios.
{"title":"Modeling MME Residence Time in LTE based Cellular Networks","authors":"Ushasi Ghosh, Pranay Agarwal, Abhinav Kumar","doi":"10.1109/NCC.2018.8600089","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600089","url":null,"abstract":"In a long term evolution (LTE) based cellular network, the mobility management entity (MME) is responsible for non-data signaling between user equipment of multiple base stations in a geographic region and the core network. Thus, the MME residence time (MRT) is a key parameter required to improve the performance of an LTE based cellular network. The impact of various mobility and network scenarios on cell residence time has been studied in the literature. However, the MRT has not been suitably modeled. Hence, in this paper, we consider diverse mobility and network scenarios. For these scenarios, we model the MRT using various probability distributions. We analyze and evaluate the statistical performance of these distributions in modeling MRT. Finally, we show through exhaustive simulations that the Lognormal and Generalized Pareto distributions are best suited to model the MRT for specific network and mobility scenarios.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588800","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600244
Anirudh Agarwal, R. Gangopadhyay
Modeling of spectrum occupancy is important for better channel utilization, accurate spectrum sensing, and enhanced Quality of Service (QoS) to the primary user (PU) in a cognitive radio (CR) system. Existing models are highly dependent on the spatio-temporal variations of the PU activity as the statistical behavior of the PU changes with respect to the location, spectrum band, and the varying load time. In this work, a generalized Gaussian Mixture model (GMM) has been investigated for characterizing the spectrum occupancy of the PU in three spectrally different CR scenarios, viz. VHF/UHF band, GSM band, and ISM band. The goodness of fit performance of GMM is compared with the widely used spectrum occupancy model based on Beta distribution. Further, the robustness of GMM has been validated through learning based prediction via Recurrent Neural Networks (RNN), thereby proposing a hybrid approach of statistical and predictive modeling of spectrum occupancy for enhanced dynamic spectrum access.
{"title":"Generalized Statistical Spectrum Occupancy Modelling and its Learning based Predictive Validation","authors":"Anirudh Agarwal, R. Gangopadhyay","doi":"10.1109/NCC.2018.8600244","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600244","url":null,"abstract":"Modeling of spectrum occupancy is important for better channel utilization, accurate spectrum sensing, and enhanced Quality of Service (QoS) to the primary user (PU) in a cognitive radio (CR) system. Existing models are highly dependent on the spatio-temporal variations of the PU activity as the statistical behavior of the PU changes with respect to the location, spectrum band, and the varying load time. In this work, a generalized Gaussian Mixture model (GMM) has been investigated for characterizing the spectrum occupancy of the PU in three spectrally different CR scenarios, viz. VHF/UHF band, GSM band, and ISM band. The goodness of fit performance of GMM is compared with the widely used spectrum occupancy model based on Beta distribution. Further, the robustness of GMM has been validated through learning based prediction via Recurrent Neural Networks (RNN), thereby proposing a hybrid approach of statistical and predictive modeling of spectrum occupancy for enhanced dynamic spectrum access.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129028333","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 : 2018-02-01DOI: 10.1109/NCC.2018.8599940
Sasmita Dash, A. Patnaik
An ultra-wideband (UWB) terahertz (THz) graphene plasmonic bowtie antenna is investigated in this paper. Because of its unique electronic and plasmonic properties at THz band, graphene plasmonic bowtie antenna shows excellent performance in THz frequency regime in terms of more stable UWB performance, high miniaturization and easy reconfiguration.The proposed antenna provides an ultrawideband of impedance bandwidth of 340% and stable omnidirectional radiation pattern. Graphene plasmonic bowtie antenna has more than 5 times bandwidth and 22 times less size than the gold bowtie antenna of same operational frequency. Moreover, frequency reconfiguration is easily achievable by variation of graphene chemical potential. The proposed graphene plasmonic bowtie THz antenna can be promising for a wide range of UWB THz applications from sensing to communication.
{"title":"Graphene Plasmonic Bowtie Antenna for UWB THz Application","authors":"Sasmita Dash, A. Patnaik","doi":"10.1109/NCC.2018.8599940","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599940","url":null,"abstract":"An ultra-wideband (UWB) terahertz (THz) graphene plasmonic bowtie antenna is investigated in this paper. Because of its unique electronic and plasmonic properties at THz band, graphene plasmonic bowtie antenna shows excellent performance in THz frequency regime in terms of more stable UWB performance, high miniaturization and easy reconfiguration.The proposed antenna provides an ultrawideband of impedance bandwidth of 340% and stable omnidirectional radiation pattern. Graphene plasmonic bowtie antenna has more than 5 times bandwidth and 22 times less size than the gold bowtie antenna of same operational frequency. Moreover, frequency reconfiguration is easily achievable by variation of graphene chemical potential. The proposed graphene plasmonic bowtie THz antenna can be promising for a wide range of UWB THz applications from sensing to communication.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132988074","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600054
Dharmendra Dixit, P. R. Sahu, G. Karagiannidis
We study the performance of multiple-input multiple-output orthogonal space-time block coded systems over mixed Nakagami-m/Rice fading channels. Novel closed-form expression for the exact average bit error rate (ABER) of Gray coded rectangular quadrature amplitude modulation is obtained. This expression include already published formulae for other fading channels as special cases. We further derive simple expression for the asymptotic ABER, the diversity order, and the coding gain, which give useful insights for the system performance at high signal-to-noise ratio values. Extensive numerical and computer simulation results are presented to validate the accuracy of the proposed analysis.
{"title":"Error Rate of MIMO OSTBC Systems over Mixed Nakagami- $m$ / Rice Fading Channels","authors":"Dharmendra Dixit, P. R. Sahu, G. Karagiannidis","doi":"10.1109/NCC.2018.8600054","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600054","url":null,"abstract":"We study the performance of multiple-input multiple-output orthogonal space-time block coded systems over mixed Nakagami-m/Rice fading channels. Novel closed-form expression for the exact average bit error rate (ABER) of Gray coded rectangular quadrature amplitude modulation is obtained. This expression include already published formulae for other fading channels as special cases. We further derive simple expression for the asymptotic ABER, the diversity order, and the coding gain, which give useful insights for the system performance at high signal-to-noise ratio values. Extensive numerical and computer simulation results are presented to validate the accuracy of the proposed analysis.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"54 86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133246815","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
扫码关注我们
求助内容：
应助结果提醒方式：