Pub Date : 2022-05-24DOI: 10.1109/NCC55593.2022.9806787
Anju Radhakrishnan, K. Appaiah
The use of channel state information (CSI) at the transmitter significantly enhances the performance of wireless communication systems. However, the requirement of CSI feed-back increases the burden on the reverse link, especially in links that employ multiple-input multiple-output (MIMO), where CSI takes the form of scalar parameters of the Principal Modes (PMs). Typical deployments use quantization and feedback of CSI at certain wavelengths of the dense wavelength division multiplexing (DWDM) grid, with interpolation to fill in missing CSI at the transmitter. Past work has used the Linde-Buzo-Gray algorithm (LBG) algorithm for quantization and interpolation of CSI. This paper includes the parameterization of the PMs into scalar parameters that are subjected to quantization and interpolation. we exploit another degree of flexibility by the ordering of the singular vectors of unitary PMs. This results in significant savings over the previous approaches to quantize PMs without any loss in performance. Further, simulations reveal that the proposed Flag manifold quantization and interpolation effectively enhance achievable rates with limited complexity.
{"title":"Multiplexed Principal Modes in Few-Mode Fiber Links With Limited Delayed Feedback","authors":"Anju Radhakrishnan, K. Appaiah","doi":"10.1109/NCC55593.2022.9806787","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806787","url":null,"abstract":"The use of channel state information (CSI) at the transmitter significantly enhances the performance of wireless communication systems. However, the requirement of CSI feed-back increases the burden on the reverse link, especially in links that employ multiple-input multiple-output (MIMO), where CSI takes the form of scalar parameters of the Principal Modes (PMs). Typical deployments use quantization and feedback of CSI at certain wavelengths of the dense wavelength division multiplexing (DWDM) grid, with interpolation to fill in missing CSI at the transmitter. Past work has used the Linde-Buzo-Gray algorithm (LBG) algorithm for quantization and interpolation of CSI. This paper includes the parameterization of the PMs into scalar parameters that are subjected to quantization and interpolation. we exploit another degree of flexibility by the ordering of the singular vectors of unitary PMs. This results in significant savings over the previous approaches to quantize PMs without any loss in performance. Further, simulations reveal that the proposed Flag manifold quantization and interpolation effectively enhance achievable rates with limited complexity.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125469913","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806794
Sreeram C. Sreenivasan, S. Bhashyam
We study a sequential nonparametric clustering problem to group a finite set of S data streams into K clusters. The data streams are real-valued i.i.d data sequences generated from unknown continuous distributions. The distributions them-selves are organized into clusters according to their proximity to each other based on a certain distance metric. We propose a universal sequential nonparametric clustering test for the case when K is known. We show that the proposed test stops in finite time almost surely and is universally exponentially consistent. We also bound the asymptotic growth rate of the expected stopping time as probability of error goes to zero. Our results generalize earlier work on sequential nonparametric anomaly detection to the more general sequential nonparametric clustering problem, thereby providing a new test for case of anomaly detection where the anomalous data streams can follow distinct probability distributions. Simulations show that our proposed sequential clustering test outperforms the corresponding fixed sample size test.
{"title":"Sequential Nonparametric K-Medoid Clustering of Data Streams","authors":"Sreeram C. Sreenivasan, S. Bhashyam","doi":"10.1109/NCC55593.2022.9806794","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806794","url":null,"abstract":"We study a sequential nonparametric clustering problem to group a finite set of S data streams into K clusters. The data streams are real-valued i.i.d data sequences generated from unknown continuous distributions. The distributions them-selves are organized into clusters according to their proximity to each other based on a certain distance metric. We propose a universal sequential nonparametric clustering test for the case when K is known. We show that the proposed test stops in finite time almost surely and is universally exponentially consistent. We also bound the asymptotic growth rate of the expected stopping time as probability of error goes to zero. Our results generalize earlier work on sequential nonparametric anomaly detection to the more general sequential nonparametric clustering problem, thereby providing a new test for case of anomaly detection where the anomalous data streams can follow distinct probability distributions. Simulations show that our proposed sequential clustering test outperforms the corresponding fixed sample size test.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999003","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806788
Ashok Kumar, S. R. Pillai
Employing transmit only AUX antennas is a rela-tively cheap way of enhancing the communication throughput of lightweight UAVs, nodes in unmanned field expeditions, racing circuits etc, where increased data-rate demands from the nomadic terminals to the base station (BS) may happen intermittently. Asymmetric load demands in the uplink often call for augmented infrastructure at the nomadic terminals or UEs. By omitting multiple receive chains onboard (along with the requirements of oversampling, synchronization and heterodyning), considerable savings in energy, ergonomics and cost is afforded by employing commercially available transmit only AUX antennas, along with the MAIN antenna subsystem possessing its own dedicated receive chain. The absence of AUX receive chains brings new design chal-lenges, for example, estimating the full channel becomes trouble-some at the UE, particularly when the BS has a large number of antennas. On the other hand, the MIMO capacity at high SNRs, effectively the full degrees of freedom, can be achieved even when the channel state information (CSI) is available only at the receiver, for many scattering environments. This motivates us to analyze the situation where the receiving BS has full CSI, however the UE transmitter only knows the CSI from its main antenna system. Channel statistics are assumed to be known at all the terminals. We investigate the uplink ergodic Shannon capacity of the resulting partial CSI MIMO system, and propose transmission schemes which are almost optimal, at all SNRs of interest. Our results show that even using a single additional AUX can provide 60 -70% capacity improvement for a receiver with more than two receive antennas, even at moderate SNRs.
{"title":"Uplink Throughput Enhancement by Employing Transmit-only AUX Antennas at Nomadic Terminals: A Capacity Analysis","authors":"Ashok Kumar, S. R. Pillai","doi":"10.1109/NCC55593.2022.9806788","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806788","url":null,"abstract":"Employing transmit only AUX antennas is a rela-tively cheap way of enhancing the communication throughput of lightweight UAVs, nodes in unmanned field expeditions, racing circuits etc, where increased data-rate demands from the nomadic terminals to the base station (BS) may happen intermittently. Asymmetric load demands in the uplink often call for augmented infrastructure at the nomadic terminals or UEs. By omitting multiple receive chains onboard (along with the requirements of oversampling, synchronization and heterodyning), considerable savings in energy, ergonomics and cost is afforded by employing commercially available transmit only AUX antennas, along with the MAIN antenna subsystem possessing its own dedicated receive chain. The absence of AUX receive chains brings new design chal-lenges, for example, estimating the full channel becomes trouble-some at the UE, particularly when the BS has a large number of antennas. On the other hand, the MIMO capacity at high SNRs, effectively the full degrees of freedom, can be achieved even when the channel state information (CSI) is available only at the receiver, for many scattering environments. This motivates us to analyze the situation where the receiving BS has full CSI, however the UE transmitter only knows the CSI from its main antenna system. Channel statistics are assumed to be known at all the terminals. We investigate the uplink ergodic Shannon capacity of the resulting partial CSI MIMO system, and propose transmission schemes which are almost optimal, at all SNRs of interest. Our results show that even using a single additional AUX can provide 60 -70% capacity improvement for a receiver with more than two receive antennas, even at moderate SNRs.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116641256","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806465
Deborsi Basu, Abhishek Jain, Uttam Ghosh, R. Datta
The inclusion of Network Function Virtualization (NFV) and Software-Defined Networking in next-generation communication networks (e.g., 5G and beyond) influence Telecommunication Service Providers (TSPs) to deploy Virtual Network Functions (VNFs) to improve network performance without in-curring additional usage of network resources. The softwarization and virtualization of network resources uplift the Network Slicing (NS) concept to optimally place the VNF instances over Service Function Chains (SFCs) for superior service delivery. Limited network capacity and storage work as a major hindrance toward better Quality-of-Service (QoS), so optimal VNF embedding over SFCs becomes an obligatory aspect. In this work, we have studied the VNF embedding problem (VNF-EP) over SFC instances for Softwarized 5G Networks. We have proposed a novel approach for dynamic VNF sharing over multiple SFCs, considering the flow requests of SFC for individual Network Slice. The inter-slice co-ordinations are done considering the common service requests among independent and heterogeneous Slices. The mathematical formulation follows a MILP based optimization approach that optimally controls the VNF sharing to increase network efficiency and hardware usage. This flexible and shareable VNF embedding approach (FlexShare-VNF) results in significant energy-efficient service delivery in a low latency environment, and our performance evaluation also supports the claim. This approach will be extremely helpful for smooth network up-gradation in resource-restricted environments for future network advancements.
{"title":"QoS-aware Dynamic Network Slicing and VNF Embedding in Softwarized 5G Networks","authors":"Deborsi Basu, Abhishek Jain, Uttam Ghosh, R. Datta","doi":"10.1109/NCC55593.2022.9806465","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806465","url":null,"abstract":"The inclusion of Network Function Virtualization (NFV) and Software-Defined Networking in next-generation communication networks (e.g., 5G and beyond) influence Telecommunication Service Providers (TSPs) to deploy Virtual Network Functions (VNFs) to improve network performance without in-curring additional usage of network resources. The softwarization and virtualization of network resources uplift the Network Slicing (NS) concept to optimally place the VNF instances over Service Function Chains (SFCs) for superior service delivery. Limited network capacity and storage work as a major hindrance toward better Quality-of-Service (QoS), so optimal VNF embedding over SFCs becomes an obligatory aspect. In this work, we have studied the VNF embedding problem (VNF-EP) over SFC instances for Softwarized 5G Networks. We have proposed a novel approach for dynamic VNF sharing over multiple SFCs, considering the flow requests of SFC for individual Network Slice. The inter-slice co-ordinations are done considering the common service requests among independent and heterogeneous Slices. The mathematical formulation follows a MILP based optimization approach that optimally controls the VNF sharing to increase network efficiency and hardware usage. This flexible and shareable VNF embedding approach (FlexShare-VNF) results in significant energy-efficient service delivery in a low latency environment, and our performance evaluation also supports the claim. This approach will be extremely helpful for smooth network up-gradation in resource-restricted environments for future network advancements.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217901","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806731
Arghyadip Roy, Nilanjan Biswas
In an Internet of Things (IoT) based network, tasks arriving at individual nodes can be processed in-device or at a local Mobile Edge Computing (MEC) server. In this paper, we focus on the optimal resource allocation problem for tasks arriving in an MEC based IoT network. To address the inherent trade-off between the computation time and the power consumption, we aim to minimize the average power consumption subject to a constraint on the deadline violation probability. The problem is formulated as a Constrained Markov Decision Process (CMDP) problem. To address the high complexities of achieving optimality, we propose a low-complexity heuristic task scheduling scheme. Efficacy of our approach is demonstrated using simulations.
{"title":"GoPro: a Low Complexity Task Allocation Algorithm for a Mobile Edge Computing System","authors":"Arghyadip Roy, Nilanjan Biswas","doi":"10.1109/NCC55593.2022.9806731","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806731","url":null,"abstract":"In an Internet of Things (IoT) based network, tasks arriving at individual nodes can be processed in-device or at a local Mobile Edge Computing (MEC) server. In this paper, we focus on the optimal resource allocation problem for tasks arriving in an MEC based IoT network. To address the inherent trade-off between the computation time and the power consumption, we aim to minimize the average power consumption subject to a constraint on the deadline violation probability. The problem is formulated as a Constrained Markov Decision Process (CMDP) problem. To address the high complexities of achieving optimality, we propose a low-complexity heuristic task scheduling scheme. Efficacy of our approach is demonstrated using simulations.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128688586","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806764
Sandesh Sharma, Narendra Vishwakarma, R. Swaminathan
Free space optics (FSO) communication is seen as a cost-effective way to provide higher bandwidth, higher data rates, better link security, higher immunity to interference, etc., compared to radio frequency (RF) communication over short link distances. Despite these advantages, FSO link is severely affected by pointing errors, atmospheric turbulence, and signal loss due to the obstructions caused by buildings, trees, mountains, etc. In this paper, we propose a hybrid communication system model consisting of a FSO subsystem backed by a reliable RF subsystem with the goal to improve the coverage and system reliability. In addition, both the FSO and RF subsystems are assisted by intelligent reflecting surfaces (IRS). Specifically, we carry out the performance analysis of the IRS-assisted hybrid FSO/RF system by deriving approximate closed-form expressions for outage probability, average bit error rate (BER), and ergodic channel capacity assuming intensity modulation/direct detection (IM/DD) technique. The numerical results are shown along with insightful discussions. It is observed from the numerical results that the system performance improves as the number of elements in IRS increases. Further, the IRS-assisted hybrid FSO/RF system performs better in terms of ergodic capacity and average BER than the existing FSO and hybrid FSO/RF systems. Finally, Monte-Carlo simulations are presented to verify the correctness of the analytical results.
{"title":"Performance Analysis of IRS-Assisted Hybrid FSO/RF Communication System","authors":"Sandesh Sharma, Narendra Vishwakarma, R. Swaminathan","doi":"10.1109/NCC55593.2022.9806764","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806764","url":null,"abstract":"Free space optics (FSO) communication is seen as a cost-effective way to provide higher bandwidth, higher data rates, better link security, higher immunity to interference, etc., compared to radio frequency (RF) communication over short link distances. Despite these advantages, FSO link is severely affected by pointing errors, atmospheric turbulence, and signal loss due to the obstructions caused by buildings, trees, mountains, etc. In this paper, we propose a hybrid communication system model consisting of a FSO subsystem backed by a reliable RF subsystem with the goal to improve the coverage and system reliability. In addition, both the FSO and RF subsystems are assisted by intelligent reflecting surfaces (IRS). Specifically, we carry out the performance analysis of the IRS-assisted hybrid FSO/RF system by deriving approximate closed-form expressions for outage probability, average bit error rate (BER), and ergodic channel capacity assuming intensity modulation/direct detection (IM/DD) technique. The numerical results are shown along with insightful discussions. It is observed from the numerical results that the system performance improves as the number of elements in IRS increases. Further, the IRS-assisted hybrid FSO/RF system performs better in terms of ergodic capacity and average BER than the existing FSO and hybrid FSO/RF systems. Finally, Monte-Carlo simulations are presented to verify the correctness of the analytical results.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"375 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772178","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806791
P. Barik, R. Datta
Device-to-Device (D2D) offloading is an emerging technique in 5G where cache-enabled mobile devices receive data from a base station and distribute to the users within its D2D coverage. Storage capacity and battery energy limitation impose additional constraints in implementing such techniques. In this paper, we propose a novel D2D offloading scheme (SVM-D) for multicast transmissions of Scalable High Efficiency Video Coding (SHVC) videos in 5G multimedia mobile wireless networks. Instead of selecting a single cluster head, SVM-D selects multiple users for caching and forwarding scalable video content to the cluster members. A hybrid approach has been adopted for selecting a subset of users as the potential D2D transmitters (cluster heads) depending on their device category, channel quality, and available battery energy. The objective is to reduce the resource utilization at BSs and to increase the cluster lifetime while providing sufficient quality of experience (QoE) to the users. The local servers (i.e., mobile edge computing servers) perform an on-demand SHVC encoding of multimedia content and distribute it to the users via base stations. We evaluate the performance of SVM-D in terms of its overall resource utilization, average battery lifetime, and average QoE of the cluster users. The comparison is made with conventional unicast and multicast schemes in 5G network with and without D2D offloading scheme (where a single cluster head stores and forwards the data). Simulation results show that SVM-D out performs other popular existing schemes from the literature.
{"title":"SVM-D: Efficient SHVC Video Multicast through D2D Offloading over 5G Cellular Networks","authors":"P. Barik, R. Datta","doi":"10.1109/NCC55593.2022.9806791","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806791","url":null,"abstract":"Device-to-Device (D2D) offloading is an emerging technique in 5G where cache-enabled mobile devices receive data from a base station and distribute to the users within its D2D coverage. Storage capacity and battery energy limitation impose additional constraints in implementing such techniques. In this paper, we propose a novel D2D offloading scheme (SVM-D) for multicast transmissions of Scalable High Efficiency Video Coding (SHVC) videos in 5G multimedia mobile wireless networks. Instead of selecting a single cluster head, SVM-D selects multiple users for caching and forwarding scalable video content to the cluster members. A hybrid approach has been adopted for selecting a subset of users as the potential D2D transmitters (cluster heads) depending on their device category, channel quality, and available battery energy. The objective is to reduce the resource utilization at BSs and to increase the cluster lifetime while providing sufficient quality of experience (QoE) to the users. The local servers (i.e., mobile edge computing servers) perform an on-demand SHVC encoding of multimedia content and distribute it to the users via base stations. We evaluate the performance of SVM-D in terms of its overall resource utilization, average battery lifetime, and average QoE of the cluster users. The comparison is made with conventional unicast and multicast schemes in 5G network with and without D2D offloading scheme (where a single cluster head stores and forwards the data). Simulation results show that SVM-D out performs other popular existing schemes from the literature.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131273792","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806808
Moakala Tzudir, Mrinmoy Bhattacharjee, Priyankoo Sarmah, S. Prasanna
This paper presents an automatic dialect identification system in Ao using a deep Convolutional Neural Network with residual connections. Ao is an under-resourced language belonging to the Tibeto-Burman family in the North-East of India. The three distinct dialects of the language are Chungli, Mongsen and Changki. Ao is a tone language and consists of three tones, viz., high, mid, and low. The recognition of tones is said to be influenced by the production process as well as human perception. In this work, the Mean Hilbert Envelope Coefficients (MHEC) feature is explored to identify the three dialects of Ao as this feature is reported to have information of human auditory nerve responses. Mel Frequency Cepstral Coefficients (MFCC) feature is used as the baseline. In addition, the effect of noise in the dialect identification task at various signal-to-noise ratio scenarios is studied. The experiments show that the MHEC feature provides an improvement of almost 10% average F1-score at high noise cases.
{"title":"Low-Resource Dialect Identification in Ao Using Noise Robust Mean Hilbert Envelope Coefficients","authors":"Moakala Tzudir, Mrinmoy Bhattacharjee, Priyankoo Sarmah, S. Prasanna","doi":"10.1109/NCC55593.2022.9806808","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806808","url":null,"abstract":"This paper presents an automatic dialect identification system in Ao using a deep Convolutional Neural Network with residual connections. Ao is an under-resourced language belonging to the Tibeto-Burman family in the North-East of India. The three distinct dialects of the language are Chungli, Mongsen and Changki. Ao is a tone language and consists of three tones, viz., high, mid, and low. The recognition of tones is said to be influenced by the production process as well as human perception. In this work, the Mean Hilbert Envelope Coefficients (MHEC) feature is explored to identify the three dialects of Ao as this feature is reported to have information of human auditory nerve responses. Mel Frequency Cepstral Coefficients (MFCC) feature is used as the baseline. In addition, the effect of noise in the dialect identification task at various signal-to-noise ratio scenarios is studied. The experiments show that the MHEC feature provides an improvement of almost 10% average F1-score at high noise cases.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130662990","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 : 2022-05-24DOI: 10.1109/NCC55593.2022.9806723
Atiquzzaman Mondal, S. Biswas
This paper considers a simultaneous transmission and receive (STAR) communication framework empowered by an in-band full-duplex (IBFD) radio and multiple reconfigurable intelligent surfaces (RISs). We present a mathematical framework for calculating the bit error probability (BEP) of the RIS-aided IBFD STAR communication system. In particular, we first derive the mean and variance of the signal-to-interference-plus-noise ratio followed by its moment generating function, which is used to obtain the BEP. We not only consider the effect of direct line-of-sight self-interference (SI) at the IBFD node but also take into consideration the reflected SI (RSI), which may arise due to misalignment of some of the RIS elements. Numerical results are presented for BEP and bit error rate (BER) of the STAR system with respect to the number of reflecting elements at the RISs, amount of RSI at the IBFD base station, and modulation orders of uplink and downlink transmission, that explicitly illustrate the feasibility and value of deploying RISs to aid future IBFD STAR communication systems.
{"title":"Performance Analysis of RIS Aided IBFD STAR Wireless Networks","authors":"Atiquzzaman Mondal, S. Biswas","doi":"10.1109/NCC55593.2022.9806723","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806723","url":null,"abstract":"This paper considers a simultaneous transmission and receive (STAR) communication framework empowered by an in-band full-duplex (IBFD) radio and multiple reconfigurable intelligent surfaces (RISs). We present a mathematical framework for calculating the bit error probability (BEP) of the RIS-aided IBFD STAR communication system. In particular, we first derive the mean and variance of the signal-to-interference-plus-noise ratio followed by its moment generating function, which is used to obtain the BEP. We not only consider the effect of direct line-of-sight self-interference (SI) at the IBFD node but also take into consideration the reflected SI (RSI), which may arise due to misalignment of some of the RIS elements. Numerical results are presented for BEP and bit error rate (BER) of the STAR system with respect to the number of reflecting elements at the RISs, amount of RSI at the IBFD base station, and modulation orders of uplink and downlink transmission, that explicitly illustrate the feasibility and value of deploying RISs to aid future IBFD STAR communication systems.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873078","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}
The performance of an Automatic Speech Recognition (ASR) engine primarily depends on ($a$) the acoustic model (AM), (b) the language model (LM) and (c) the lexicon (Lx), While the contribution of each block to the overall performance of an ASR cannot be measured separately, a good LM helps in performance improvement in case of a domain specific ASR at a smaller cost. Generally, LM is greener compared to building AM and is much easier to build, for a domain specific ASR because it requires only domain specific text corpora. Traditionally, because of its ready availability, written language text (WLT) corpora has been used to build LM though there is an agreement that there a significant difference between WLT and spoken language text (SLT). In this paper, we explore methods and techniques that can be used to convert WLT into a form that realizes a better LM to support ASR performance.
{"title":"Improved Language Models for ASR using Written Language Text","authors":"Kaustuv Mukherji, Meghna Pandharipande, Sunil Kumar Kopparapu","doi":"10.1109/NCC55593.2022.9806803","DOIUrl":"https://doi.org/10.1109/NCC55593.2022.9806803","url":null,"abstract":"The performance of an Automatic Speech Recognition (ASR) engine primarily depends on ($a$) the acoustic model (AM), (b) the language model (LM) and (c) the lexicon (Lx), While the contribution of each block to the overall performance of an ASR cannot be measured separately, a good LM helps in performance improvement in case of a domain specific ASR at a smaller cost. Generally, LM is greener compared to building AM and is much easier to build, for a domain specific ASR because it requires only domain specific text corpora. Traditionally, because of its ready availability, written language text (WLT) corpora has been used to build LM though there is an agreement that there a significant difference between WLT and spoken language text (SLT). In this paper, we explore methods and techniques that can be used to convert WLT into a form that realizes a better LM to support ASR performance.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193822","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
扫码关注我们
求助内容：
应助结果提醒方式：