Pub Date : 2020-07-01DOI: 10.1109/SPCOM50965.2020.9179515
S. Mukhopadhyay, M. Chakraborty
Hard thresholding pursuit (HTP) is a recently proposed iterative sparse recovery algorithm which is a result of combination of a support selection step from iterated hard thresholding (IHT) and an estimation step from the orthogonal matching pursuit (OMP). HTP has been seen to enjoy improved recovery guarantee along with enhanced speed of convergence. Much of the success of HTP can be attributed to its improved support selection capability due to the support selection step from IHT. In this paper, we propose a generalized HTP algorithm, called regularized HTP (RHTP), where the support selection step of HTP is modified by replacing the cost function involved in the support selection with a regularized cost function. With decomposable regularizer, satisfying certain regularity conditions, the RHTP algorithm is shown to produce a sequence dynamically equivalent to a sequence evolving according to a HTP-like evolution, where the identification stage has a gradient premultiplied with a time-varying diagonal matrix. RHTP is also proven, both theoretically, and numerically, to enjoy faster convergence visa-vis HTP with both noiseless and noisy measurement vectors.
{"title":"Regularized Hard Thresholding Pursuit (RHTP) for Sparse Signal Recovery","authors":"S. Mukhopadhyay, M. Chakraborty","doi":"10.1109/SPCOM50965.2020.9179515","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179515","url":null,"abstract":"Hard thresholding pursuit (HTP) is a recently proposed iterative sparse recovery algorithm which is a result of combination of a support selection step from iterated hard thresholding (IHT) and an estimation step from the orthogonal matching pursuit (OMP). HTP has been seen to enjoy improved recovery guarantee along with enhanced speed of convergence. Much of the success of HTP can be attributed to its improved support selection capability due to the support selection step from IHT. In this paper, we propose a generalized HTP algorithm, called regularized HTP (RHTP), where the support selection step of HTP is modified by replacing the cost function involved in the support selection with a regularized cost function. With decomposable regularizer, satisfying certain regularity conditions, the RHTP algorithm is shown to produce a sequence dynamically equivalent to a sequence evolving according to a HTP-like evolution, where the identification stage has a gradient premultiplied with a time-varying diagonal matrix. RHTP is also proven, both theoretically, and numerically, to enjoy faster convergence visa-vis HTP with both noiseless and noisy measurement vectors.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"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":"128316987","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.9179570
C. Parthipan, Priyanka Kokil
This paper examines stability properties of digital filters using saturation arithmetic. A new input state-strict passivity condition for interfered digital filters using saturation arithmetic is proposed. Further, the presented criterion is utilized to get conditions for passivity and state-strict passivity of the system as special cases. The established criterion can also be used to guarantee asymptotic stability of the digital filters with zero external interference. Compared with an existing work in literature, the proposed condition is demonstrated to be less conservative. To show effectiveness of the proposed approach, a few numerical examples are provided.
{"title":"Limit-Cycle Free Realization of Digital Filters","authors":"C. Parthipan, Priyanka Kokil","doi":"10.1109/SPCOM50965.2020.9179570","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179570","url":null,"abstract":"This paper examines stability properties of digital filters using saturation arithmetic. A new input state-strict passivity condition for interfered digital filters using saturation arithmetic is proposed. Further, the presented criterion is utilized to get conditions for passivity and state-strict passivity of the system as special cases. The established criterion can also be used to guarantee asymptotic stability of the digital filters with zero external interference. Compared with an existing work in literature, the proposed condition is demonstrated to be less conservative. To show effectiveness of the proposed approach, a few numerical examples are provided.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"13 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":"128240510","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.9179627
Dileep Bapatla, S. Prakriya
In this paper we consider full-duplex (FD) signalling between two energy harvesting (EH) devices D1 and D2. We assume that D1 and D2 are equipped with energy buffers. We consider two buffer energy management policies: on-off policy (OOP) and best-effort policy (BEP). Expressions are derived for sum throughput and outage probability. Insights are obtained on the transmit powers to be used to maximize throughput while ensuring buffer stability. The derived analytical expressions are validated by Monte Carlo simulations.
{"title":"Performance of Full-Duplex Signalling by Energy Buffer Equipped Energy Harvesting Nodes","authors":"Dileep Bapatla, S. Prakriya","doi":"10.1109/SPCOM50965.2020.9179627","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179627","url":null,"abstract":"In this paper we consider full-duplex (FD) signalling between two energy harvesting (EH) devices D1 and D2. We assume that D1 and D2 are equipped with energy buffers. We consider two buffer energy management policies: on-off policy (OOP) and best-effort policy (BEP). Expressions are derived for sum throughput and outage probability. Insights are obtained on the transmit powers to be used to maximize throughput while ensuring buffer stability. The derived analytical expressions are validated by Monte Carlo simulations.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"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":"129008409","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.9179592
Anuj S. Vora, Ankur A. Kulkarni
We introduce a new setting in information theory where a receiver tries to exactly recover a source signal from a dishonest sender who sends messages with an intention to maximize its utility. The sender can send messages to the receiver over a noiseless channel whose input space is the entire signal space, but due to its dishonesty, not all signals can be recovered. We formulate the problem as a game between the sender and the receiver, where the receiver chooses a strategy such that it can recover the maximum number of source signals. We show that, despite the strategic nature of the sender, the receiver can recover an exponentially large number of signals. We show that this maximum rate of strategic communication is lower bounded by the independence number of a suitably defined graph on the alphabet and upper bounded by the Shannon capacity of this graph. This allows us to exactly characterize the rate of strategic communication for perfect graphs.
{"title":"Zero Error Strategic Communication","authors":"Anuj S. Vora, Ankur A. Kulkarni","doi":"10.1109/SPCOM50965.2020.9179592","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179592","url":null,"abstract":"We introduce a new setting in information theory where a receiver tries to exactly recover a source signal from a dishonest sender who sends messages with an intention to maximize its utility. The sender can send messages to the receiver over a noiseless channel whose input space is the entire signal space, but due to its dishonesty, not all signals can be recovered. We formulate the problem as a game between the sender and the receiver, where the receiver chooses a strategy such that it can recover the maximum number of source signals. We show that, despite the strategic nature of the sender, the receiver can recover an exponentially large number of signals. We show that this maximum rate of strategic communication is lower bounded by the independence number of a suitably defined graph on the alphabet and upper bounded by the Shannon capacity of this graph. This allows us to exactly characterize the rate of strategic communication for perfect graphs.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"96 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":"123110937","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.9179623
A. Srivastava, Gyanajyoti Routray, R. Hegde
In this paper, a novel method for spatial Head Related Transfer Function (HRTF) interpolation is proposed. The property of linearity of HRTF spectral phase with frequency is first illustrated. An optimization problem is then formulated to compute the interpolated HRTF phase by imposing linearity constraints on the spectral phase of adjacent spatial angles. A weighted error minimization is carried out in an alternating optimization framework to obtain the solution to this problem. Phase-only reconstruction is used to obtain the HRIR for subsequent rendering of binaural audio. Interpolated HRTFs obtained by using the CIPIC and SYMARE database are evaluated using statistical analysis. Subjective evaluations are also performed to evaluate the quality of the binaural audio rendered using the proposed method.
{"title":"Spatial HRTF Interpolation using Spectral Phase Constraints","authors":"A. Srivastava, Gyanajyoti Routray, R. Hegde","doi":"10.1109/SPCOM50965.2020.9179623","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179623","url":null,"abstract":"In this paper, a novel method for spatial Head Related Transfer Function (HRTF) interpolation is proposed. The property of linearity of HRTF spectral phase with frequency is first illustrated. An optimization problem is then formulated to compute the interpolated HRTF phase by imposing linearity constraints on the spectral phase of adjacent spatial angles. A weighted error minimization is carried out in an alternating optimization framework to obtain the solution to this problem. Phase-only reconstruction is used to obtain the HRIR for subsequent rendering of binaural audio. Interpolated HRTFs obtained by using the CIPIC and SYMARE database are evaluated using statistical analysis. Subjective evaluations are also performed to evaluate the quality of the binaural audio rendered using the proposed method.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"76 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":"124900717","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.9179575
Kamini Upadhyay, M. Agrawal, P. Vashist
Segmentation of retinal blood vessels is a crucial preliminary step in the diagnosis of any retinal disease. While extracting vessel-map, the biggest challenge is to segment fine vessels which are in poor contrast with the non-vessel background. Key contribution of this work is a fine-to-coarse retinal vessel extraction model with high sensitivity. Proposed algorithm uses a directional wavelet to generate a novel multiscale, three-channel image. To generate this image, only the real coefficients of wavelet transform are used, which facilitate the extraction of fine vessel-ends. Multiple scales cover different thicknesses of vessels. The vessel-enhanced image catalyzes the learning of deep U-net model for pixel classification. This work uses STARE and DRIVE databases for experimentation. Algorithm has performed robustly well in cross-database testing, even in pathological environment. Proposed method has produced state-of-the-art results. The vessel segmentation is outstanding in terms of sensitivity measure which validates better extraction of fine vessels. In this paper, an elaborate comparison with the other existing methods is also presented.
{"title":"Wavelet based Fine-to-Coarse Retinal Blood Vessel Extraction using U-net Model","authors":"Kamini Upadhyay, M. Agrawal, P. Vashist","doi":"10.1109/SPCOM50965.2020.9179575","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179575","url":null,"abstract":"Segmentation of retinal blood vessels is a crucial preliminary step in the diagnosis of any retinal disease. While extracting vessel-map, the biggest challenge is to segment fine vessels which are in poor contrast with the non-vessel background. Key contribution of this work is a fine-to-coarse retinal vessel extraction model with high sensitivity. Proposed algorithm uses a directional wavelet to generate a novel multiscale, three-channel image. To generate this image, only the real coefficients of wavelet transform are used, which facilitate the extraction of fine vessel-ends. Multiple scales cover different thicknesses of vessels. The vessel-enhanced image catalyzes the learning of deep U-net model for pixel classification. This work uses STARE and DRIVE databases for experimentation. Algorithm has performed robustly well in cross-database testing, even in pathological environment. Proposed method has produced state-of-the-art results. The vessel segmentation is outstanding in terms of sensitivity measure which validates better extraction of fine vessels. In this paper, an elaborate comparison with the other existing methods is also presented.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"17 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114020711","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.9179576
{"title":"SPCOM 2020 Author Index","authors":"","doi":"10.1109/spcom50965.2020.9179576","DOIUrl":"https://doi.org/10.1109/spcom50965.2020.9179576","url":null,"abstract":"","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"127 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":"133953489","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.9179557
Sunil Kumar, A. Garg, M. Bhatnagar
In this paper, we analyze the physical layer secrecy performance of two-bit feedback based 4 × 1 multiple-inputsingle-output communication system in the presence of a single antenna equipped passive eavesdropper over Rayleigh faded channel. To achieve full-rate and spatial diversity real orthogonal space-time block code is employed in the considered wiretap communication system. In a practical wireless communication system, it is not always possible to acquire full channel knowledge. Thereby, in this paper, we exploit the partial channel state information at the transmitter with the help of two-bit quantized feedback based diagonal precoder. Further, exact closed-form expressions of the secrecy outage probabilities are derived over perfect and imperfect feedback bits by using order statistics. It is shown in the numerical results that an optimized power allocation scheme successfully improves secrecy performance gain under erroneous feedback in comparison to other schemes.
{"title":"Physical Layer Secrecy Performance Analysis of Imperfect Feedback Based 4×1 MISO System","authors":"Sunil Kumar, A. Garg, M. Bhatnagar","doi":"10.1109/SPCOM50965.2020.9179557","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179557","url":null,"abstract":"In this paper, we analyze the physical layer secrecy performance of two-bit feedback based 4 × 1 multiple-inputsingle-output communication system in the presence of a single antenna equipped passive eavesdropper over Rayleigh faded channel. To achieve full-rate and spatial diversity real orthogonal space-time block code is employed in the considered wiretap communication system. In a practical wireless communication system, it is not always possible to acquire full channel knowledge. Thereby, in this paper, we exploit the partial channel state information at the transmitter with the help of two-bit quantized feedback based diagonal precoder. Further, exact closed-form expressions of the secrecy outage probabilities are derived over perfect and imperfect feedback bits by using order statistics. It is shown in the numerical results that an optimized power allocation scheme successfully improves secrecy performance gain under erroneous feedback in comparison to other schemes.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"20 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":"115038732","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.9179539
Ziwei Xuan, K. Narayanan
We consider the design of neural network based joint source channel coding (JSCC) schemes for transmitting an independent and identically distributed (i.i. d.) Gaussian source over additive white Gaussian noise (AWGN) channels with bandwidth mismatch when the source dimension is small. Unlike existing deep learning based works on this topic, we do not resort to domain expertise to constrain the model; rather, we propose to employ fine tuning techniques to optimize the model. We show that our proposed techniques can provide performance that is comparable to that of the state-of-the-art when the source dimension is small. Furthermore, the proposed model can spontaneously learn encoding functions that are similar to those designed by conventional schemes. Finally, we empirically show that the learned JSCC scheme is robust to mismatch between the assumed and actual channel signal to noise ratios.
{"title":"Analog Joint Source-Channel Coding for Gaussian Sources over AWGN Channels with Deep Learning","authors":"Ziwei Xuan, K. Narayanan","doi":"10.1109/SPCOM50965.2020.9179539","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179539","url":null,"abstract":"We consider the design of neural network based joint source channel coding (JSCC) schemes for transmitting an independent and identically distributed (i.i. d.) Gaussian source over additive white Gaussian noise (AWGN) channels with bandwidth mismatch when the source dimension is small. Unlike existing deep learning based works on this topic, we do not resort to domain expertise to constrain the model; rather, we propose to employ fine tuning techniques to optimize the model. We show that our proposed techniques can provide performance that is comparable to that of the state-of-the-art when the source dimension is small. Furthermore, the proposed model can spontaneously learn encoding functions that are similar to those designed by conventional schemes. Finally, we empirically show that the learned JSCC scheme is robust to mismatch between the assumed and actual channel signal to noise ratios.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"26 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":"116671261","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.9179590
C. P. Najlah, S. Sameer
This paper presents a novel non-orthogonal multiple access (NOMA) scheme for the uplink heterogeneous network (HetNet) using a projection operator. The aim of the proposed NOMA scheme is to develop an interference cancellation (IC) technique for the femtocell users (FUs) that minimizes the interference and additive white Gaussian noise (AWGN) power without the knowledge of channel state information at transmitter (CSIT) and macrocell user channel state information at receiver (MU-CSIR). Conventional successive interference cancellation (SIC) based NOMA scheme rely on both these information and feeding them back to the user equipment (UE) of FU through a highly bandwidth consuming process. The proposed method decode the desired NOMA users’ data from the composite received signal at the femtocell base station (FBS). Extensive simulation studies show that the performance of the proposed NOMA scheme achieves superior performance in terms of bit error rate (BER) and sum-rate also over on existing SIC based NOMA scheme.
{"title":"A Projection-based NOMA Scheme for Uplink Heterogeneous Network Without CSIT and Multiuser-CSIR","authors":"C. P. Najlah, S. Sameer","doi":"10.1109/SPCOM50965.2020.9179590","DOIUrl":"https://doi.org/10.1109/SPCOM50965.2020.9179590","url":null,"abstract":"This paper presents a novel non-orthogonal multiple access (NOMA) scheme for the uplink heterogeneous network (HetNet) using a projection operator. The aim of the proposed NOMA scheme is to develop an interference cancellation (IC) technique for the femtocell users (FUs) that minimizes the interference and additive white Gaussian noise (AWGN) power without the knowledge of channel state information at transmitter (CSIT) and macrocell user channel state information at receiver (MU-CSIR). Conventional successive interference cancellation (SIC) based NOMA scheme rely on both these information and feeding them back to the user equipment (UE) of FU through a highly bandwidth consuming process. The proposed method decode the desired NOMA users’ data from the composite received signal at the femtocell base station (FBS). Extensive simulation studies show that the performance of the proposed NOMA scheme achieves superior performance in terms of bit error rate (BER) and sum-rate also over on existing SIC based NOMA scheme.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"135 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":"123301185","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
扫码关注我们
求助内容：
应助结果提醒方式：