{"title":"Improved Noncoherent Receiver for Joint Range and Symbol Estimation","authors":"S. Sharma, A. Bishnu, Anubha Gupta, V. Bhatia","doi":"10.1109/SPCOM.2018.8724389","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724389","url":null,"abstract":"The noncoherent receiver (NCR) has, recently, gained importance due to its simple design and low-complexity for the internet of things and wireless communications. However, NCR's performance is sub-optimal as compared to a coherent receiver due to the presence of noise. In this paper, we propose an NCR for joint ranging and data symbol estimation for pulse-based communication such as ultra-wideband and terahertz band communication. The proposed NCRs (referred as pulse autocorrelation NCR (PA-NCR) and iterative PA-NCR (IPA-NCR)) utilize apriori information about the transmitted pulse and channel statistics for enhancing the system's signal-to-noise ratio. The proposed IPA-NCR's performance is improved using an iterative algorithm for a block-wise data symbol detection and ranging estimation, while considering the channel to be static during the block length. The PA-NCR and IPA-NCR are the best choice for fast varying (i.e. vehicular communication) and slow varying (i.e. indoor communication) channels respectively. Performance of the proposed NCR is analyzed over standard IEEE 802.15.4a channels and is also compared with some existing NCRs.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121239227","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}
Subhadip Mukherjee, A. Sekuboyina, C. Seelamantula
{"title":"Binary Compressive Sensing and Super-Resolution With Unknown Threshold","authors":"Subhadip Mukherjee, A. Sekuboyina, C. Seelamantula","doi":"10.1109/SPCOM.2018.8724489","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724489","url":null,"abstract":"We consider the problem of binary compressive sensing (CS), where random linear projections of a sparse signal are encoded using threshold-crossing information. The threshold used by the binary encoder for acquisition is unknown to the decoder and is estimated jointly with the signal. We cast the problem of signal reconstruction and threshold estimation as one of learning a hyperplane that separates the sampling vectors corresponding to the +1 and −1 measurements, and develop a reconstruction algorithm that entails iterative minimization of reweighted $ell_{1}$-norm subject to a set of linear constraints that enforce measurement separability. The proposed algorithm leads to a reconstruction performance comparable with that obtained using a popular binary CS algorithm, namely binary iterative hard-thresholding, which assumes that the threshold is set to zero. We consider binary super-resolution as an application, where a signal consisting of point sources needs to be estimated from sign measurements of its blurred version. The proposed algorithm successfully recovers the locations and amplitudes of the point sources, even in the presence of significant blurring.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125288278","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}
B. Sai, Ishwar Chandra Yadav, S. Shahnawazuddin, G. Pradhan
{"title":"Enhancing Pitch Robustness of Speech Recognition System through Spectral Smoothing","authors":"B. Sai, Ishwar Chandra Yadav, S. Shahnawazuddin, G. Pradhan","doi":"10.1109/SPCOM.2018.8724416","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724416","url":null,"abstract":"In this paper, we present a novel approach for front-end speech parameterization that is more robust towards pitch variations than the most commonly used technique. Earlier works have shown that, insufficient smoothing of magnitude spectrum leads to pitch-induced distortions. This, in turn, results in poor performance of speech recognition system especially for high-pitched child speakers. To overcome this shortcoming, the short-time magnitude spectrum is first decomposed into several components using a modified version of empirical mode decomposition (EMD). Next, the lowest-order component is discarded and the spectrum is reconstructed using the rest of the higherorder modes for sufficiently smoothing the spectrum. The Mel-frequency cepstral coefficients (MFCC) are then extracted using the smoothed spectra. The signal domain analyses presented in this paper demonstrate that the ill-effects of pitch variations get significantly reduced by the inclusion of proposed spectral smoothing module. In order to statistically validate the same, an automatic speech recognition system is developed using speech data from adult speakers. To simulate large pitch differences, evaluations are performed on a test set which consists of speech data from child speakers. Inclusion of proposed spectral smoothing module leads to a relative improvement of 12% over the baseline system employing acoustic modeling based on deep neural network.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115247369","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}
{"title":"Copper Coin loaded Miniaturized Slot Antenna","authors":"K. Parvez, S. M. Haque, Enamul Khan","doi":"10.1109/SPCOM.2018.8724449","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724449","url":null,"abstract":"This article presents a new technique of slot antenna miniaturization using a copper coin loading at a location close to the center position of the slot. The resonant frequency for reference antenna and loaded antenna are 2.86GHz and 1.45GHz respectively. As a result, the frequency of loaded antenna reduces by a factor of 49.30% compared to the reference antenna topology with good radiation characteristics. A prototype of the proposed antenna is fabricated on an FR4 microwave substrate with ground plane size 100×100 mm2, and its reflection coefficient, E-plane, H-plane and efficiency are compared with the simulation results.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023324","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}
{"title":"Inference Algorithms for the Multiplicative Mixture Mallows Model","authors":"Ranjitha Prasad, V. Tan","doi":"10.1109/SPCOM.2018.8724429","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724429","url":null,"abstract":"A popular approach to obtain a consensus ranking from ranking data is based on the probabilistic, distance-based Mallows model comprising of a modal permutation and dispersion parameters. Often, the population consists of several subpopulations. As a result, finite mixture models are used to distinguish latent sub-groups of individuals in a heterogeneous population. Given a finite number of subpopulations each based on the Mallows model, a popular inference approach is the computationally intensive expectation maximization algorithm for additive models. We address the drawbacks of this model using a novel multiplicative mixture Mallows model (M4). Given complete ranking observations from a heterogeneous population, we derive inference algorithms for the joint estimation of the parameters and the consensus rankings of the component distributions. We numerically validate the permutation estimation performance of the proposed algorithms on synthetic datasets. We also demonstrate the goodness-of-fit using the Bayesian information criterion and the integrated complete likelihood on the real-world APA and Sushi datasets.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129284","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}
{"title":"Age-of-Information Aware Scheduling","authors":"P. Jhunjhunwala, Sharayu Moharir","doi":"10.1109/SPCOM.2018.8724448","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724448","url":null,"abstract":"We study the task of scheduling in a multi-source system where sources report their time-varying information to a central monitoring station via multiple orthogonal channels. The Age-of-Information of a source is defined as the amount of time elapsed since the latest update from that source was received at the monitoring station. At each time instant, the system pays a cost that is a function of the current Ages-of-Information of the sources. Our goal is to design scheduling policies to minimize this cost. We draw a novel parallel between our scheduling problem and the minimum mean cost cycle problem in weighted graphs and use this insight to design optimal scheduling policies for a very general class of cost functions. In addition, we compare the performance of our policy with naive greedy policies. We show that while greedy policies can be optimal if the cost function is symmetric with respect to the sources, our policy strictly outperforms greedy policies when the cost function is asymmetric across sources.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121799927","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}
{"title":"Preventing Collusion Attacks in Cooperative Spectrum Sensing","authors":"S. Shrivastava, Sunju John, A. Rajesh, P. Bora","doi":"10.1109/SPCOM.2018.8724473","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724473","url":null,"abstract":"Cooperative spectrum sensing is prone to attacks by malicious users. These attacks become more severe when launched in collusion. In this paper, a collision penalty based attack prevention method is proposed to defend individual and collusion attacks in all the possible attack scenarios. We identify the possible attack strategies in each scenario and prevent them with appropriate bounds on the collision penalty. Simulation results verify the effectiveness of the proposed scheme.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115952693","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}
{"title":"Detection of Heart Sound using Logistic Function Amplitude Moderator and Teager-Kaiser Energy Operator","authors":"Alex Paul Kamson, L. N. Sharma, S. Dandapat","doi":"10.1109/SPCOM.2018.8724410","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724410","url":null,"abstract":"In this paper, we have proposed a new morphological feature to improve the detection of S1 and S2 sounds from noisy or pathological phonocardiogram (PCG) signals. This feature is based on logistic function amplitude moderator (LFAM) and Teager-Kaiser energy operator (TKEO). The LFAM is used to enhance the intensity of weak heart sounds so that the intensities of envelope peaks are uniform. The LFAM is operated at two modes: low amplitude mode and high amplitude mode. The selection of the operational mode is decided based on probability density function (PDF) derived from intensity based histogram analysis. Then the homomorphic envelope of the resulting waveform is calculated. Finally, TKEO is applied to the envelope signal to track the instantaneous energy of signal oscillation. This feature will capture prominent peaks for heart sounds and nullify the effect of noises and murmurs that have more or less uniform envelope intensity distribution. PCG database from the University of Washington has been used for evaluation. The performance of the proposed method is tested using logistic regression-hidden semi-Markov model (LR-HSMM) classifier and obtain an average F1 score of $79.08pm 3.93$.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130091394","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}
{"title":"Reference Signals based Time and Frequency Tracking in NB-IoT","authors":"Sriharsha, K. Kuchi","doi":"10.1109/SPCOM.2018.8724398","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724398","url":null,"abstract":"Narrowband Internet of Things (NB-IoT) is the technology developed by 3GPP to bring the connectivity among IoT devices. The main aim of this technology is to improve the coverage and support massive number of IoT devices with long battery life. Coverage is enhanced by data repetitions over an extended period of time. The battery life at the User Equipment (UE) is extended by incorporating long DRX cycles of 10.24 sec. Preserving timing and frequency synchronization under such long repetitions and DRX cycles poses a challenge for NB-IoT. In this paper we propose Narrowband Reference signals (NRS) based tracking of residual timing and frequency offsets. The proposed method assume that the initial synchronization has been carried out using NB Primary (NPSS) and Secondary synchronization (NSSS) signals. The results obtained from the initial synchronization serves as the coarse estimates for the proposed method. Inherent non rapid channel variations across NRS carrying subcarriers of successive OFDM symbols is exploited to estimate residual offsets. The extracted residual offsets from NRS signals of two antenna ports are combined to refine the estimates. The performance results of presented algorithm and its processing time to yield the estimates at −12 dB SNR obtained by computer simulations are presented.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160982","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}
{"title":"Decentralized Asynchronous Stochastic Gradient Descent: Convergence Rate Analysis","authors":"A. S. Bedi, Hrusikesha Pradhan, K. Rajawat","doi":"10.1109/SPCOM.2018.8724408","DOIUrl":"https://doi.org/10.1109/SPCOM.2018.8724408","url":null,"abstract":"Decentralized algorithms for multi-agent networks have attracted a considerable research interest. Stochastic gradient descent and its variations are popularly used for developing such algorithms. This paper considers a stochastic gradient descent algorithm in which each node is randomly selected to carry out the update. The stringent computational and communication requirements of the synchronous framework are overcome by proposing an asynchronous variant that allows updates to be carried out using delayed gradients. The performance of the proposed algorithm is analyzed by developing non-asymptotic bounds on the optimality gap, as a function of the number of iterations, and for various diminishing step-size rules. The bounds indicate that the effect of asynchrony on the algorithm convergence rate is minimal. The theoretical findings of this work are further illustrated through solving a distributed estimation problem over a large network. We conclude by presenting the performance comparison of the proposed algorithm against the classical cyclic incremental algorithm.","PeriodicalId":146502,"journal":{"name":"2018 International Conference on Signal Processing and Communications (SPCOM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134364905","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}