Pub Date : 2020-07-01DOI: 10.1109/spcom50965.2020.9179538
{"title":"SPCOM 2020 Copyright Page","authors":"","doi":"10.1109/spcom50965.2020.9179538","DOIUrl":"https://doi.org/10.1109/spcom50965.2020.9179538","url":null,"abstract":"","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129064406","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179529
P. VijithKumarK., B. K. Rai, T. Jacob
The notion of coded caching was introduced by Maddah-Ali and Niesen when they demonstrated the utility of coding in caching systems. Since their seminal work, several schemes have been proposed to characterize optimal memory rate tradeoff to the caching problems. In this paper, we consider the (4, 5) cache network where the server has four files, each of size F bits, and five users are connected to the server through a common shared link. We consider the demands where each file in the server is requested by at least one user. For this cache network, we derive an improved lower bound for the small cache region, where the cache size in the range of $displaystyle frac{1}{5}F$ bits to $displaystyle frac{4}{5}F$ bits. We also introduce a new caching scheme to achieve the memory rate pair $left(displaystyle frac{61}{20},frac{1}{4}right)$. We then derive a new lower bound for the cache region where cache size in the range of $displaystyle frac{61}{20}F$ bits to $displaystyle frac{16}{5}F$ bits to prove the optimality of the proposed scheme.
{"title":"Towards the Exact Memory Rate Tradeoff for the (4,5) Cache Network","authors":"P. VijithKumarK., B. K. Rai, T. Jacob","doi":"10.1109/SPCOM50965.2020.9179529","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179529","url":null,"abstract":"The notion of coded caching was introduced by Maddah-Ali and Niesen when they demonstrated the utility of coding in caching systems. Since their seminal work, several schemes have been proposed to characterize optimal memory rate tradeoff to the caching problems. In this paper, we consider the (4, 5) cache network where the server has four files, each of size F bits, and five users are connected to the server through a common shared link. We consider the demands where each file in the server is requested by at least one user. For this cache network, we derive an improved lower bound for the small cache region, where the cache size in the range of $displaystyle frac{1}{5}F$ bits to $displaystyle frac{4}{5}F$ bits. We also introduce a new caching scheme to achieve the memory rate pair $left(displaystyle frac{61}{20},frac{1}{4}right)$. We then derive a new lower bound for the cache region where cache size in the range of $displaystyle frac{61}{20}F$ bits to $displaystyle frac{16}{5}F$ bits to prove the optimality of the proposed scheme.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124062742","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179509
Apoorva Chawla, R. Singh, Adarsh Patel, A. Jagannatham
This paper considers a distributed detection framework for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) wireless sensor networks (WSNs). A hybrid combining based low complexity fusion rule is derived at the fusion center (FC) that also incorporates the local probabilities of detection and false alarm of the individual sensor nodes, thus making it suitable for practical scenarios. Closed-form expressions for the probabilities of detection and false alarm are evaluated to characterize the system performance. Moreover, a deflection coefficient maximization based framework is also developed to determine the signaling matrix that further improves the detection performance of the proposed scheme. Finally, simulation results are presented to demonstrate the performance of the proposed detector and to corroborate the analytical results.
{"title":"Distributed Detection in Millimeter Wave Massive MIMO Wireless Sensor Networks","authors":"Apoorva Chawla, R. Singh, Adarsh Patel, A. Jagannatham","doi":"10.1109/SPCOM50965.2020.9179509","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179509","url":null,"abstract":"This paper considers a distributed detection framework for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) wireless sensor networks (WSNs). A hybrid combining based low complexity fusion rule is derived at the fusion center (FC) that also incorporates the local probabilities of detection and false alarm of the individual sensor nodes, thus making it suitable for practical scenarios. Closed-form expressions for the probabilities of detection and false alarm are evaluated to characterize the system performance. Moreover, a deflection coefficient maximization based framework is also developed to determine the signaling matrix that further improves the detection performance of the proposed scheme. Finally, simulation results are presented to demonstrate the performance of the proposed detector and to corroborate the analytical results.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600669","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 : 2020-07-01DOI: 10.1109/spcom50965.2020.9179616
{"title":"SPCOM 2020 Cover Page","authors":"","doi":"10.1109/spcom50965.2020.9179616","DOIUrl":"https://doi.org/10.1109/spcom50965.2020.9179616","url":null,"abstract":"","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"18 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125632001","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179543
Akash Agarwal, A. Jagannatham
This work considers a finite blocklength (FBL) non-orthogonal multiple access (NOMA)-based joint one-way and two-way relaying aided communication scheme wherein two source nodes share a single decode-and-forward (DF) relay to exchange their information as well as transmit it to the respective destination nodes over a finite number of channel uses. Novel closed-form expressions have been obtained for the end-to-end block error rate (BLER) at all the nodes and also the net throughput of the system. Furthermore, an asymptotic end-to-end BLER floor has also been obtained for all the nodes at high transmit signal to noise power ratio (SNR). Simulation results are presented to authenticate the analytical results derived and demonstrate the efficacy of the proposed scheme.
{"title":"NOMA-based Joint One-Way and Two-Way Relaying Aided Finite Blocklength Communication","authors":"Akash Agarwal, A. Jagannatham","doi":"10.1109/SPCOM50965.2020.9179543","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179543","url":null,"abstract":"This work considers a finite blocklength (FBL) non-orthogonal multiple access (NOMA)-based joint one-way and two-way relaying aided communication scheme wherein two source nodes share a single decode-and-forward (DF) relay to exchange their information as well as transmit it to the respective destination nodes over a finite number of channel uses. Novel closed-form expressions have been obtained for the end-to-end block error rate (BLER) at all the nodes and also the net throughput of the system. Furthermore, an asymptotic end-to-end BLER floor has also been obtained for all the nodes at high transmit signal to noise power ratio (SNR). Simulation results are presented to authenticate the analytical results derived and demonstrate the efficacy of the proposed scheme.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130062019","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179624
G. Ananthi
This paper deals with Simultaneous Extreme Ultra-Violet Information and Power Transfer system (SEUVIPT) for energy harvesting in 6G Mobile networks. The proposed SEUVIPT system consists of EUV photo Light Emitting Diode (LED) at the transmitter and EUV photo detector at the receiver in a high vacuum atmospheric EUV channel. The energy harvesting optimization problem has been formulated for the proposed model using information rate and signal to noise ratio. Power splitting protocol is used for energy harvesting and information transmission. The energy harvesting maximization problem is non-convex. It is converted into convex and an expression for the optimal energy harvesting is derived for the proposed model. Simulation results show that the proposed model increases the harvested energy in SEUVIPT effectively.
{"title":"Simultaneous Extreme Ultraviolet Information and Power Transfer(SEUVIPT)","authors":"G. Ananthi","doi":"10.1109/SPCOM50965.2020.9179624","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179624","url":null,"abstract":"This paper deals with Simultaneous Extreme Ultra-Violet Information and Power Transfer system (SEUVIPT) for energy harvesting in 6G Mobile networks. The proposed SEUVIPT system consists of EUV photo Light Emitting Diode (LED) at the transmitter and EUV photo detector at the receiver in a high vacuum atmospheric EUV channel. The energy harvesting optimization problem has been formulated for the proposed model using information rate and signal to noise ratio. Power splitting protocol is used for energy harvesting and information transmission. The energy harvesting maximization problem is non-convex. It is converted into convex and an expression for the optimal energy harvesting is derived for the proposed model. Simulation results show that the proposed model increases the harvested energy in SEUVIPT effectively.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131627510","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179549
Harsh Vardhan, Ruchi Tripathi, K. Rajawat
This work proposes a dynamic matrix completion (DMC)-based approach for use in the front-end of MIMO radar. The proposed approach is different and complementary to the conventional target tracking algorithms that are widely deployed in the back-end of radar systems. The received signals are modelled as time-varying low-rank matrices and passed through an adaptive singular value thresholding (ASVT) block, resulting in the elimination of noise returns early in the processing chain. When all the antenna elements are not being used and the received signal is only partially observed, the ASVT block imputes the missing entries. Front-end processing results in cleaner signals for the back-end, culminating in fewer range and Doppler bins, increased probability of detection, reduced false alarm rate, and ultimately, improved target tracking performance. Detailed simulation of the radar chain reveal the significant improvements afforded by the proposed algorithm.
{"title":"Adaptive Front-end for MIMO Radar with Dynamic Matrix Completion","authors":"Harsh Vardhan, Ruchi Tripathi, K. Rajawat","doi":"10.1109/SPCOM50965.2020.9179549","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179549","url":null,"abstract":"This work proposes a dynamic matrix completion (DMC)-based approach for use in the front-end of MIMO radar. The proposed approach is different and complementary to the conventional target tracking algorithms that are widely deployed in the back-end of radar systems. The received signals are modelled as time-varying low-rank matrices and passed through an adaptive singular value thresholding (ASVT) block, resulting in the elimination of noise returns early in the processing chain. When all the antenna elements are not being used and the received signal is only partially observed, the ASVT block imputes the missing entries. Front-end processing results in cleaner signals for the back-end, culminating in fewer range and Doppler bins, increased probability of detection, reduced false alarm rate, and ultimately, improved target tracking performance. Detailed simulation of the radar chain reveal the significant improvements afforded by the proposed algorithm.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015824","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179595
Rishu Raj, A. Dixit
Visible light communication (VLC) is an enabling technology which provides ubiquitous indoor wireless access but the capacity of VLC systems is severely limited by the narrow modulation bandwidth of the light emitting diode (LED) transmitters. Non-orthogonal multiple access (NOMA) is envisioned to address this challenge by circumventing the need for spectrum allocation (as in orthogonal multiple access schemes) which limits the number of users. We formulate an analytical model to evaluate the total system capacity achievable by using NOMA in a multiple-input-multiple-output (MIMO) VLC system. We analyze the total capacity of a NOMA based $2 times 2$ MIMO-VLC system employing two different power allocation schemes, namely, gain ratio power allocation (GRPA) and normalized gain power allocation (NGDPA), for power domain superposition coding at the transmitter. We evaluate and compare the performance of these two schemes for various system parameters like system coverage, user location and number of users. The results and analyses presented herein provide critical insights into the modelling of NOMA based MIMO-VLC systems.
{"title":"Performance Evaluation of Power Allocation Schemes for Non-Orthogonal Multiple Access in MIMO Visible Light Communication Links","authors":"Rishu Raj, A. Dixit","doi":"10.1109/SPCOM50965.2020.9179595","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179595","url":null,"abstract":"Visible light communication (VLC) is an enabling technology which provides ubiquitous indoor wireless access but the capacity of VLC systems is severely limited by the narrow modulation bandwidth of the light emitting diode (LED) transmitters. Non-orthogonal multiple access (NOMA) is envisioned to address this challenge by circumventing the need for spectrum allocation (as in orthogonal multiple access schemes) which limits the number of users. We formulate an analytical model to evaluate the total system capacity achievable by using NOMA in a multiple-input-multiple-output (MIMO) VLC system. We analyze the total capacity of a NOMA based $2 times 2$ MIMO-VLC system employing two different power allocation schemes, namely, gain ratio power allocation (GRPA) and normalized gain power allocation (NGDPA), for power domain superposition coding at the transmitter. We evaluate and compare the performance of these two schemes for various system parameters like system coverage, user location and number of users. The results and analyses presented herein provide critical insights into the modelling of NOMA based MIMO-VLC systems.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130394911","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179507
Satish Kumar Suman, Aniket Dhok, Swapnil Bhole
With the advent of modern smartphones, AR, VR services and advancement in display resolution of mobile devices coupled with real-time streaming services, the demand for highresolution video has boomed. To fulfill this requirement, a variety of Adaptive Bit-Rate Streaming methods for Video-on-Demand applications are employed. However, the use of multi-pass encoding in the aforementioned methods renders them obsolete when it comes to real-time video streaming due to latency restrictions. In this work, we bypass the conventional multiple-encoding used in Video-on-Demand applications and present a novel machinelearning-based approach that estimates the optimal video resolution for a given content at a particular bit-rate for ultra low latency applications. A new feature that captures temporal as well as spatial correlation in video sequence has been used to train the Deep Neural Network (DNN) model. A python-based testbed is designed to evaluate the proposed scheme. Experiment results corroborate the viability and effectiveness of the proposed method for real-time mobile video streaming applications.
{"title":"DNNStream: Deep-learning based Content Adaptive Real-time Streaming","authors":"Satish Kumar Suman, Aniket Dhok, Swapnil Bhole","doi":"10.1109/SPCOM50965.2020.9179507","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179507","url":null,"abstract":"With the advent of modern smartphones, AR, VR services and advancement in display resolution of mobile devices coupled with real-time streaming services, the demand for highresolution video has boomed. To fulfill this requirement, a variety of Adaptive Bit-Rate Streaming methods for Video-on-Demand applications are employed. However, the use of multi-pass encoding in the aforementioned methods renders them obsolete when it comes to real-time video streaming due to latency restrictions. In this work, we bypass the conventional multiple-encoding used in Video-on-Demand applications and present a novel machinelearning-based approach that estimates the optimal video resolution for a given content at a particular bit-rate for ultra low latency applications. A new feature that captures temporal as well as spatial correlation in video sequence has been used to train the Deep Neural Network (DNN) model. A python-based testbed is designed to evaluate the proposed scheme. Experiment results corroborate the viability and effectiveness of the proposed method for real-time mobile video streaming applications.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133485418","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 : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179521
Reena Sahu, Kanchan K. Chaurasia, Abhishek K. Gupta
In this paper, we focus on the performance of a broadcast network (single frequency network) including TV broadcasting networks. Since all transmitters in a broadcast network are transmitting the same signal, received signals from multiple transmitters from a certain connectivity region around the user can be combined to improve the coverage at this user. Using tools from stochastic geometry, we provide an analytical framework to derive the SINR and rate coverage of a typical receiver located at the origin. We also validate our analysis via numerical results. We show that rate coverage is affected by the size of the connectivity region and there exists an optimal size of connectivity region that maximizes the rate coverage.
{"title":"SINR and Rate Coverage of Broadcast Networks using Stochastic Geometry","authors":"Reena Sahu, Kanchan K. Chaurasia, Abhishek K. Gupta","doi":"10.1109/SPCOM50965.2020.9179521","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179521","url":null,"abstract":"In this paper, we focus on the performance of a broadcast network (single frequency network) including TV broadcasting networks. Since all transmitters in a broadcast network are transmitting the same signal, received signals from multiple transmitters from a certain connectivity region around the user can be combined to improve the coverage at this user. Using tools from stochastic geometry, we provide an analytical framework to derive the SINR and rate coverage of a typical receiver located at the origin. We also validate our analysis via numerical results. We show that rate coverage is affected by the size of the connectivity region and there exists an optimal size of connectivity region that maximizes the rate coverage.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130224591","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
扫码关注我们
求助内容：
应助结果提醒方式：