Pub Date : 2018-03-01DOI: 10.1109/WISPNET.2018.8538699
H. R, R. K. Swamy
Unsupervised speech separation refers to the task of separating the individual speaker's speech from the multi- speaker speech without using any apriori information regarding speakers. This paper mainly focuses on unsupervised speech separation for single and multichannel case. State of art speech separation algorithms based on statistical, auditory, and signal processing approaches are evaluated and results are discussed. Algorithms are evaluated for synthetic and real speech mixtures. Experimental results shows that multichannel speech separation algorithms perform better than single channel for artificial speech mixtures and for real speech mixtures the efficacy of signal processing approach compared with other two in terms of subjective evaluation.
{"title":"Unsupervised Speech Separation Using Statistical, Auditory and Signal Processing Approaches","authors":"H. R, R. K. Swamy","doi":"10.1109/WISPNET.2018.8538699","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538699","url":null,"abstract":"Unsupervised speech separation refers to the task of separating the individual speaker's speech from the multi- speaker speech without using any apriori information regarding speakers. This paper mainly focuses on unsupervised speech separation for single and multichannel case. State of art speech separation algorithms based on statistical, auditory, and signal processing approaches are evaluated and results are discussed. Algorithms are evaluated for synthetic and real speech mixtures. Experimental results shows that multichannel speech separation algorithms perform better than single channel for artificial speech mixtures and for real speech mixtures the efficacy of signal processing approach compared with other two in terms of subjective evaluation.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"41 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89816240","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-03-01DOI: 10.1109/WISPNET.2018.8538721
R. Prabha, M. Ramesh, Venkat Rangan
Wireless Sensor Networks acclaimed a wide popularity because of their low cost and their easiness to be deployed in remote areas where human intervention is very minimal. However, these deployments have constrained by the resources such as power, memory, processing power etc. In order to enhance the reliability and life-time of these networks, it is necessary to develop algorithms that minimize the resource usage. In sensor networks, the topology places a key role in optimizing the resources. If we design a proper topology, a large area can be covered with relatively less number of nodes compared to the normal flat/clustering techniques. This research work deals with creating optimum network topologies that minimizes delay and makes efficient use of available buffer size, lesser intermediate nodes and so on. This paper discusses a set of schemes that design suitable networks under the constraints such as varying data rate, varying packet size and so on. This work discusses schemes that find the optimal number of intermediate nodes for a given set of lower level nodes with varying data rates. This work also discusses a set of algorithms that chooses maximum number of lower level nodes for a given set of intermediate nodes with limited buffer.
{"title":"Building Optimal Topologies for Real-Time Wireless Sensor Networks","authors":"R. Prabha, M. Ramesh, Venkat Rangan","doi":"10.1109/WISPNET.2018.8538721","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538721","url":null,"abstract":"Wireless Sensor Networks acclaimed a wide popularity because of their low cost and their easiness to be deployed in remote areas where human intervention is very minimal. However, these deployments have constrained by the resources such as power, memory, processing power etc. In order to enhance the reliability and life-time of these networks, it is necessary to develop algorithms that minimize the resource usage. In sensor networks, the topology places a key role in optimizing the resources. If we design a proper topology, a large area can be covered with relatively less number of nodes compared to the normal flat/clustering techniques. This research work deals with creating optimum network topologies that minimizes delay and makes efficient use of available buffer size, lesser intermediate nodes and so on. This paper discusses a set of schemes that design suitable networks under the constraints such as varying data rate, varying packet size and so on. This work discusses schemes that find the optimal number of intermediate nodes for a given set of lower level nodes with varying data rates. This work also discusses a set of algorithms that chooses maximum number of lower level nodes for a given set of intermediate nodes with limited buffer.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"71 4","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91514620","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-03-01DOI: 10.1109/WISPNET.2018.8538540
Sayantani Ghosh, Lidia Ghosh, A. Konar
The chief objective of this paper is to investigate the differences in Feature Descriptor patterns during mental rotation of five different objects for both healthy as well as brain diseased subjects. Thus, electroencephalographic (EEG) activity was measured during mental rotation of objects by various angles with respect to its present orientation. Source localization using eLORETA inferred an enhanced activation of pre-frontal and frontal lobe regions during mental rotation activity. Experimental analysis also confirmed maximal activation of lower alpha frequency band while performing this cognitive task. Differential Evolutionary (DE) algorithm has been implemented to select the optimal features which are represented using the Feature Descriptor diagrams. These diagrams infer that the feature patterns are distinct and vary from object to object. Moreover, these patterns orient by $45^{mathrm {o}}$ for $90^{mathrm {o}}$ mental rotation and by $75^{mathrm {o}}$ for $180^{mathrm {o}}$ mental rotation of the presented objects. However, there exists an inconsistency in the Feature descriptor diagrams for patients suffering from pre-frontal lobe amnesia and Alzheimer's disease. It is also found that these diagrams remain unaffected during mental rotation which infers their incapability to perform such a cognitive task. Hence, this work can be effectively utilized to detect people suffering from memory related disorder.
{"title":"An Analytical Study of Mental Rotation Activity Based on Feature Descriptor Patterns","authors":"Sayantani Ghosh, Lidia Ghosh, A. Konar","doi":"10.1109/WISPNET.2018.8538540","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538540","url":null,"abstract":"The chief objective of this paper is to investigate the differences in Feature Descriptor patterns during mental rotation of five different objects for both healthy as well as brain diseased subjects. Thus, electroencephalographic (EEG) activity was measured during mental rotation of objects by various angles with respect to its present orientation. Source localization using eLORETA inferred an enhanced activation of pre-frontal and frontal lobe regions during mental rotation activity. Experimental analysis also confirmed maximal activation of lower alpha frequency band while performing this cognitive task. Differential Evolutionary (DE) algorithm has been implemented to select the optimal features which are represented using the Feature Descriptor diagrams. These diagrams infer that the feature patterns are distinct and vary from object to object. Moreover, these patterns orient by $45^{mathrm {o}}$ for $90^{mathrm {o}}$ mental rotation and by $75^{mathrm {o}}$ for $180^{mathrm {o}}$ mental rotation of the presented objects. However, there exists an inconsistency in the Feature descriptor diagrams for patients suffering from pre-frontal lobe amnesia and Alzheimer's disease. It is also found that these diagrams remain unaffected during mental rotation which infers their incapability to perform such a cognitive task. Hence, this work can be effectively utilized to detect people suffering from memory related disorder.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"2000 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86232210","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-03-01DOI: 10.1109/WISPNET.2018.8538597
Saunhita Sapre, S. Mini
Employing mobile sink(s) provide considerable benefits to the deployed Wireless Sensor Network(s) (WSNs) in terms of increased network lifetime, decreased energy consumption, decreased data latency and evenly distributed load on the sensors in the network. A mobile sink is typically a mobile robot or a small vehicle, consisting of a powerful transceiver, high powered battery and a large memory. Typically the sensor nodes are deployed randomly resulting in multiple WSN partitions. Clusters are formed based on these partitions and relay nodes (RNs) are deployed as cluster heads (CHs) using meta heuristic algorithms. The deployed RNs perform the role of single hop data acquisition from the sensor nodes and relaying it to the sink thereby maintaining the data delivery latency. In this paper, three mobile sink traversal techniques are simulated for data collection purpose. The results obtained through extensive simulations demonstrate the superiority of Bat algorithm for relay node placement.
{"title":"Optimized Path for Traversal of Mobile Sink in Heterogeneous Wireless Sensor Networks","authors":"Saunhita Sapre, S. Mini","doi":"10.1109/WISPNET.2018.8538597","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538597","url":null,"abstract":"Employing mobile sink(s) provide considerable benefits to the deployed Wireless Sensor Network(s) (WSNs) in terms of increased network lifetime, decreased energy consumption, decreased data latency and evenly distributed load on the sensors in the network. A mobile sink is typically a mobile robot or a small vehicle, consisting of a powerful transceiver, high powered battery and a large memory. Typically the sensor nodes are deployed randomly resulting in multiple WSN partitions. Clusters are formed based on these partitions and relay nodes (RNs) are deployed as cluster heads (CHs) using meta heuristic algorithms. The deployed RNs perform the role of single hop data acquisition from the sensor nodes and relaying it to the sink thereby maintaining the data delivery latency. In this paper, three mobile sink traversal techniques are simulated for data collection purpose. The results obtained through extensive simulations demonstrate the superiority of Bat algorithm for relay node placement.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"38 3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89148172","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-03-01DOI: 10.1109/WISPNET.2018.8538538
A. Mohan, Rajkumar P. Sreedharan
Polar codes developed by Erdal Arikan are error correction codes which achieve the channel capacity with the added advantage of reduced complexity. Being a breakthrough in the coding theory, a large number of studies are going on in this field. Different schemes have been proposed over these years for the generation, encoding and decoding of polar codes. Any N bits of data can be polar coded and can be transmitted through any channel. An important area of research is the decoder part and one of the widely used methods of decoding is successive cancellation. The reduced complexity is an attractive feature of this trending coding scheme with an overall encoding and decoding complexity of O (NlogN) for a block length of N. The most promising 5G technology finds a great potential in the polar coding scheme. A review on the path of researches till day in this field is presented here.
{"title":"A Review on the Concept of Polar Codes","authors":"A. Mohan, Rajkumar P. Sreedharan","doi":"10.1109/WISPNET.2018.8538538","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538538","url":null,"abstract":"Polar codes developed by Erdal Arikan are error correction codes which achieve the channel capacity with the added advantage of reduced complexity. Being a breakthrough in the coding theory, a large number of studies are going on in this field. Different schemes have been proposed over these years for the generation, encoding and decoding of polar codes. Any N bits of data can be polar coded and can be transmitted through any channel. An important area of research is the decoder part and one of the widely used methods of decoding is successive cancellation. The reduced complexity is an attractive feature of this trending coding scheme with an overall encoding and decoding complexity of O (NlogN) for a block length of N. The most promising 5G technology finds a great potential in the polar coding scheme. A review on the path of researches till day in this field is presented here.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"18 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85270035","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-03-01DOI: 10.1109/WISPNET.2018.8538650
S. Manju, M. Thenmozhi
Recommender Systems use collaborative filtering in order to make recommendations based on similar interest between users or items. In this process, Privacy of users is at severe risk because recommender servers may share user’s private data with third parties to make personalized advertisements and in some cases user privacy may be exposed to the public or attacked by malicious users. The existing works are based on encryption-based and randomization-based techniques, but they compromise accuracy for privacy and privacy for accuracy. In this project, Privacy Preserving Collaborative Filtering approach has been proposed which solves the limitations in the existing works. This work adopts fuzzy logic to deal with uncertainty among user’s interest ratings. The fuzzified data is then perturbated by applying random rotation perturbation technique, thus the user’s interest is not directly available for the recommendation server or the third-party. Using the perturbated data, item clusters are formed by utilizing ant-based clustering algorithm. These clusters help the recommendation server to apply item-collaborative filtering for the recommendation process. In order to refine the cluster center provided by ant-based clustering process K-Means clustering algorithm is applied. The pheromone values obtained during the ant-based clustering is further utilized by the recommender server in order to provide accurate recommendation to the active user.
{"title":"Privacy Preserving Collaborative Filtering Approach for Recommendation System","authors":"S. Manju, M. Thenmozhi","doi":"10.1109/WISPNET.2018.8538650","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538650","url":null,"abstract":"Recommender Systems use collaborative filtering in order to make recommendations based on similar interest between users or items. In this process, Privacy of users is at severe risk because recommender servers may share user’s private data with third parties to make personalized advertisements and in some cases user privacy may be exposed to the public or attacked by malicious users. The existing works are based on encryption-based and randomization-based techniques, but they compromise accuracy for privacy and privacy for accuracy. In this project, Privacy Preserving Collaborative Filtering approach has been proposed which solves the limitations in the existing works. This work adopts fuzzy logic to deal with uncertainty among user’s interest ratings. The fuzzified data is then perturbated by applying random rotation perturbation technique, thus the user’s interest is not directly available for the recommendation server or the third-party. Using the perturbated data, item clusters are formed by utilizing ant-based clustering algorithm. These clusters help the recommendation server to apply item-collaborative filtering for the recommendation process. In order to refine the cluster center provided by ant-based clustering process K-Means clustering algorithm is applied. The pheromone values obtained during the ant-based clustering is further utilized by the recommender server in order to provide accurate recommendation to the active user.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"215 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74838665","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-03-01DOI: 10.1109/WISPNET.2018.8538548
Gunjanbhai Patel, R. Ojha, S. Sujatha
Gait analysis is an important clinical tool in the management of locomotion disability arising from orthopedic and neurological conditions and is an active area of research particularly in rehabilitation and sports medicine. The procedure demands dedicated space, thus limiting its usage to indoor environments. In this paper, we present a novel wearable wireless inertial sensor (i-Sens)-based design for estimation of joint angle in the sagittal plane. The i-Sens hardware comprises of triaxial accelerometer, gyroscope sensors, microcontroller and Bluetooth module. It is portable and can be readily used in indoor and outdoor settings. A novel simplified complementary filter algorithm was incorporated in the design for sensor data fusion. Four normal volunteers were chosen to test the sensor; they wore the sensor at knee level on one side, and assessed its performance while walking in both outdoor and indoor environments. The data was transmitted wirelessly through Bluetooth to the data acquisition system. The gait parameters of the subjects were compared with normative reference data. At the initial contact phase of the gait cycle, mean and standard deviation of knee angle was 3.6° ± 3.5°, while the maximum swing phase knee flexion angle was 67.8° ± 4.5°, which is within the normative data range, suggesting accuracy of the joint angle estimation. Hence, i-Sens can be useful for movement analysis of the lower limb. Further clinical trials are required to validate the sensor at different joints (ankle, knee and hip) under various pathological and environmental conditions.
{"title":"Ambulatory Measurement and Estimation of Joint Angle Kinematics in Sagittal Plane Using Body Worn Sensors for Gait Analysis","authors":"Gunjanbhai Patel, R. Ojha, S. Sujatha","doi":"10.1109/WISPNET.2018.8538548","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538548","url":null,"abstract":"Gait analysis is an important clinical tool in the management of locomotion disability arising from orthopedic and neurological conditions and is an active area of research particularly in rehabilitation and sports medicine. The procedure demands dedicated space, thus limiting its usage to indoor environments. In this paper, we present a novel wearable wireless inertial sensor (i-Sens)-based design for estimation of joint angle in the sagittal plane. The i-Sens hardware comprises of triaxial accelerometer, gyroscope sensors, microcontroller and Bluetooth module. It is portable and can be readily used in indoor and outdoor settings. A novel simplified complementary filter algorithm was incorporated in the design for sensor data fusion. Four normal volunteers were chosen to test the sensor; they wore the sensor at knee level on one side, and assessed its performance while walking in both outdoor and indoor environments. The data was transmitted wirelessly through Bluetooth to the data acquisition system. The gait parameters of the subjects were compared with normative reference data. At the initial contact phase of the gait cycle, mean and standard deviation of knee angle was 3.6° ± 3.5°, while the maximum swing phase knee flexion angle was 67.8° ± 4.5°, which is within the normative data range, suggesting accuracy of the joint angle estimation. Hence, i-Sens can be useful for movement analysis of the lower limb. Further clinical trials are required to validate the sensor at different joints (ankle, knee and hip) under various pathological and environmental conditions.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"19 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75641686","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-03-01DOI: 10.1109/WISPNET.2018.8538664
Erfan Majeed, Z. Youssef, M. Mueck, Ingolf Karls, C. Drewes, G. Bruck, P. Jung
three-dimensional modulation using beam hopping (3DModBH) is a new transmission concept in long term evolution advanced (LTE-A) systems to improve system performance and increase its robustness against interference compared to state-of-the-art transmission scheme (SoAT). However, the presence of high user equipment (UE) density interference scenario in the cluster limits the performance of 3DModBH. The promised benefits of 3DModBH in such interference scenario disappear for the system configuration with four receive antennas, showing poorer performance than SoAT. The analytical and numerical results show that 3DModBH is capable to outperform the SoAT in high UE density interference scenario by increasing the number of receive antennas. Furthermore, it has been shown that the new concept achieves significant performance gain in high UE density interference than in low UE density interference scenario compared to SoAT.
{"title":"Impact of Antenna Configuration in Three-Dimensional Modulation Using Beam Hopping","authors":"Erfan Majeed, Z. Youssef, M. Mueck, Ingolf Karls, C. Drewes, G. Bruck, P. Jung","doi":"10.1109/WISPNET.2018.8538664","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538664","url":null,"abstract":"three-dimensional modulation using beam hopping (3DModBH) is a new transmission concept in long term evolution advanced (LTE-A) systems to improve system performance and increase its robustness against interference compared to state-of-the-art transmission scheme (SoAT). However, the presence of high user equipment (UE) density interference scenario in the cluster limits the performance of 3DModBH. The promised benefits of 3DModBH in such interference scenario disappear for the system configuration with four receive antennas, showing poorer performance than SoAT. The analytical and numerical results show that 3DModBH is capable to outperform the SoAT in high UE density interference scenario by increasing the number of receive antennas. Furthermore, it has been shown that the new concept achieves significant performance gain in high UE density interference than in low UE density interference scenario compared to SoAT.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"136 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90133031","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-03-01DOI: 10.1109/WISPNET.2018.8538460
C. D. Abraham, J. Aravinth
Hyperspectral image data and LIDAR data have found to be complimentary modailities in case of remotely sensed images, which can be fused if both are geo-referenced. Hyperspectral images provide the spectral response of each object in the area and can be used to identify the material composition of the image which can be used for the object classification. LIDAR data provides the elevation and geometrical information of the objects in the scene. Pixel-level fusion ensures no loss of information because there is no dimensionality reduction. This paper assesses the different methods of pixel fusion like wavelet transform, IHS transform and linear pixel fusion.
{"title":"Fusion Methods for Hyperspectral Image and LIDAR Data at Pixel-Level","authors":"C. D. Abraham, J. Aravinth","doi":"10.1109/WISPNET.2018.8538460","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538460","url":null,"abstract":"Hyperspectral image data and LIDAR data have found to be complimentary modailities in case of remotely sensed images, which can be fused if both are geo-referenced. Hyperspectral images provide the spectral response of each object in the area and can be used to identify the material composition of the image which can be used for the object classification. LIDAR data provides the elevation and geometrical information of the objects in the scene. Pixel-level fusion ensures no loss of information because there is no dimensionality reduction. This paper assesses the different methods of pixel fusion like wavelet transform, IHS transform and linear pixel fusion.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"1 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89895277","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-03-01DOI: 10.1109/WISPNET.2018.8538739
G. Aruna, M. Barman
In this paper, the performance analysis of two different diversity models in presence of multiple interferers and co-channel interference is presented. Arbitrary number of received signals are examined and processed using these diversity techniques. The performance analysis is presented for a Partitioned Selection Diversity Combiner (PSDC) which is an Advanced Diversity Combiner (ADC) consisting of $L$ Selection Combiners (SC) followed by a Maximal Ratio Combiner (MRC). The results are also presented for another ADC consisting of a Generalized Selection Combiner (GSC) followed by an MRC. Both the models are analyzed in the presence of co-channel interference (CCI) over Nakagami-m fading channels. The signal to interference plus noise ratio (SINR) is derived. Using the obtained expressions of SINR, the Average bit error rate (ABER) expression for differential phase shift keying (DPSK) and non-coherent frequency shift keying (NCFSK) modulation techniques are derived. The ABER results are plotted and comparison is made between the two diversity models. Numerical and simulation results are done.
{"title":"Performance Analysis of Advanced Diversity Receivers in the Presence of Multiple Interferers","authors":"G. Aruna, M. Barman","doi":"10.1109/WISPNET.2018.8538739","DOIUrl":"https://doi.org/10.1109/WISPNET.2018.8538739","url":null,"abstract":"In this paper, the performance analysis of two different diversity models in presence of multiple interferers and co-channel interference is presented. Arbitrary number of received signals are examined and processed using these diversity techniques. The performance analysis is presented for a Partitioned Selection Diversity Combiner (PSDC) which is an Advanced Diversity Combiner (ADC) consisting of $L$ Selection Combiners (SC) followed by a Maximal Ratio Combiner (MRC). The results are also presented for another ADC consisting of a Generalized Selection Combiner (GSC) followed by an MRC. Both the models are analyzed in the presence of co-channel interference (CCI) over Nakagami-m fading channels. The signal to interference plus noise ratio (SINR) is derived. Using the obtained expressions of SINR, the Average bit error rate (ABER) expression for differential phase shift keying (DPSK) and non-coherent frequency shift keying (NCFSK) modulation techniques are derived. The ABER results are plotted and comparison is made between the two diversity models. Numerical and simulation results are done.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"72 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87743056","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
扫码关注我们
求助内容：
应助结果提醒方式：