{"title":"Spect image reconstruction under imaging time constraints","authors":"Igor Fedorov, S. Obrzut, B. Song, B. Rao","doi":"10.1109/ACSSC.2017.8335626","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335626","url":null,"abstract":"Single photon emission computed tomography (SPECT) is a nuclear imaging modality used by, among others, oncologists in the imaging of tumors. At its core, SPECT is an underdetermined signal recovery problem. The degree of difficulty in recovering the underlying image increases as the imaging time decreases. To make the image reconstruction problem well-posed, it is advantageous to introduce a signal prior, such as the total variation. Such priors can dramatically improve reconstruction performance and allow for faster scans. The issue with the adoption of such priors in practice is the lack of an automated method for selecting the regularization strength. The purpose of this work is to review the SPECT problem, discuss the role of regularizers in SPECT, and propose a method for estimating the regularization strength.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125596968","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}
Sven Jacobsson, G. Durisi, M. Coldrey, Christoph Studer
{"title":"On out-of-band emissions of quantized precoding in massive MU-MIMO-OFDM","authors":"Sven Jacobsson, G. Durisi, M. Coldrey, Christoph Studer","doi":"10.1109/ACSSC.2017.8335128","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335128","url":null,"abstract":"We analyze out-of-band (OOB) emissions in the massive multi-user (MU) multiple-input multiple-output (MIMO) downlink. We focus on systems in which the base station (BS) is equipped with low-resolution digital-to-analog converters (DACs) and orthogonal frequency-division multiplexing (OFDM) is used to communicate to the user equipments (UEs) over frequency-selective channels. We demonstrate that analog filtering in combination with simple frequency-domain digital predistortion (DPD) at the BS enables a significant reduction of OOB emissions, but degrades the signal-to-interference-noise-and-distortion ratio (SINDR) at the UEs and increases the peak-to-average power ratio (PAR) at the BS. We use Bussgang's theorem to characterize the tradeoffs between OOB emissions, SINDR, and PAR, and to study the impact of analog filters and DPD on the error-rate performance of the massive MU-MIMO-OFDM downlink. Our results show that by carefully tuning the parameters of the analog filters, one can achieve a significant reduction in OOB emissions with only a moderate degradation of error-rate performance and PAR.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"461 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124352211","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":"Active spectrum sensing with sequential sub-Nyquist sampling","authors":"Lorenzo Ferrari, A. Scaglione","doi":"10.1109/ACSSC.2017.8335400","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335400","url":null,"abstract":"In this paper we propose a new receiver architecture for optimum active sequential sensing via sub-Nyquist sampling. The sensing strategy we propose is formulated as a sequential utility optimization problem, where the chosen utility functions strikes the desired balance between exploration and exploitation, typical in most spectrum sensing problem. To introduce the optimization variables, we first introduce the analog front-end architecture envisioned. Second, we characterize the optimal policy (under constraints on the sensing matrix) and derive the approximation factor for the greedy approach. Numerical simulations showcase the benefits of the proposed adaptive design.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795292","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":"Performance comparison of AES-GCM-SIV and AES-GCM algorithms for authenticated encryption on FPGA platforms","authors":"Sandhya Koteshwara, A. Das, K. Parhi","doi":"10.1109/ACSSC.2017.8335570","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335570","url":null,"abstract":"Authenticated encryption schemes achieve both authentication and encryption in one algorithm and are a must for ensuring security of devices today. In this regard, we investigate architectures for a recently proposed algorithm, AES-GCM-SIV, which achieves complete nonce-misuse resistance. We present detailed architectures for AES-GCM-SIV and contrast with that of an existing standard, AES-GCM. We use modern FPGA platforms for our implementation and discuss the hardware performance in terms of area, throughput, power and energy. Proposed optimizations are implemented and compared with unoptimized architectures. Our observations show that AES-GCM-SIV is able to achieve about 95% of the performance of AES-GCM in terms of throughput while consuming only about 4% more area in terms of LUT count and energy per bit. For this added overhead, it provides better security in terms of nonce-misuse resistance and greater flexibility with respect to reusability of main components of AES-GCM. To the best of our knowledge, this is the first paper which discusses a hardware implementation of AES-GCM-SIV.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134254976","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":"Signal processing in continuous time using asynchronous techniques","authors":"Yu Chen, Y. Tsividis","doi":"10.1109/ACSSC.2017.8335629","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335629","url":null,"abstract":"This paper reviews previous work on continuous-time digital signal processing systems. The operations of these systems avoid the use of a clock and can closely track the input activity. The two major building blocks, continuous-time analog-to-digital converter (CT ADC) and continuous-time digital signal processor (CT DSP) are discussed in detail, with several examples presented.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"7 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134427160","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":"Multiple transmitter localization using clustering by likelihood of transmitter proximity","authors":"M. Saadati, J. Nelson","doi":"10.1109/ACSSC.2017.8335665","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335665","url":null,"abstract":"We propose a measurement clustering method for estimating the locations of multiple radio transmitters based only on received signal strength and a performance analysis approach drawn from a hypothesis testing framework. Measurements are collected at a set of arbitrary locations in the area of interest. Measurements are retained (or discarded) for transmitter localization based on the probability that a transmitter lies within a given neighborhood of the measurement location. Retained measurements are clustered using k-means or a similar approach, and individual transmitter localization is performed in each cluster. The proposed approach makes no assumptions that the measurements are clustered around transmitters; measurement locations may be at a similar distance from several transmitters, complicating the estimation process. The effect of the choice of neighborhood size and measurement threshold is analyzed using a hypothesis testing framework in which the probability of detection, probability of false alarm, and receiver operating characteristic are derived. Simulation results show that, over a wide range of shadowing noise variance, the proposed clustering-based localization achieves performance gains over algorithms that estimate transmitter locations jointly.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133462730","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}
Karl S. Ni, P. Callier, B. Hatch, Jonathan Mastarone, James Cline
{"title":"On noise reduction for handwritten writer identification","authors":"Karl S. Ni, P. Callier, B. Hatch, Jonathan Mastarone, James Cline","doi":"10.1109/ACSSC.2017.8335714","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335714","url":null,"abstract":"Academic work in identifying writers of handwritten documents has previously focused on clean benchmark datasets: plain white documents with uniform writing instruments. Solutions on this type of data have achieved hit-in-top-10 accuracy rates reaching upwards of 98%. Unfortunately, transferring competitive techniques to handwritten documents with noise is nontrivial, where performance drops by two-thirds. Noise in the context of handwritten documents can manifest itself in many ways, from irrelevant structured additions, e.g., graph paper, to unstructured partial occlusion, e.g. coffee stains and stamps. Additional issues that confound algorithmic writer identification solutions include the use of different writing implement, age, and writing state of mind. The proposed work explores training denoising neural networks to aid in identifying authors of handwritten documents. Our algorithms are trained on existing clean datasets artificially augmented with noise, and we evaluate them on a commissioned dataset, which features a diverse but balanced set of writers, writing implements, and writing substrates (incorporating various types of noise). Using the proposed denoising algorithm, we exceed the state of the art in writer identification of noisy handwritten documents by a significant margin.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121587288","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":"Cache-aided private information retrieval","authors":"Minchul Kim, Heecheol Yang, Jungwoo Lee","doi":"10.1109/ACSSC.2017.8335367","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335367","url":null,"abstract":"We present a cache-aided private information retrieval (PIR) problem for a replication-based storage system, where a user caches parts of messages in advance. We propose a new PIR scheme from non-colluding databases with cached data at the user. The main idea of our scheme is to exploit cached data as a side information in a specific way to minimize the amount of download for the retrieval. The amount of download of our scheme is within a multiplicative factor of 2 from the lower bound of the amount of download. Furthermore, we show that the performance gap is zero for a specific range of cache size.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115550176","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}
Hamidreza Abbaspourazad, Han-Lin Hsieh, M. Shanechi
{"title":"Multiscale modeling of dependencies between spikes and fields","authors":"Hamidreza Abbaspourazad, Han-Lin Hsieh, M. Shanechi","doi":"10.1109/ACSSC.2017.8335438","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335438","url":null,"abstract":"Measuring and modeling the brain at multiple spatiotemporal scales are important for studying brain function and developing high-performance brain-machine interfaces. To better understand neural encoding of behavior, the conditional dependencies between different scales of brain activity should be considered in the multiscale modeling framework. Here, we develop a new multiscale model that characterizes the conditional dependence between spikes and fields during behavior. We modeled this mutual dependence by incorporating the effect of field features on each neuron's firing rate function. To reduce the number of model parameters to be learned, we assumed that the strength of dependency between a pair of neuron and field feature is a function of the distance between electrodes from which they are recorded. We then constructed the shape of this unknown spatial dependency function with a weighted sum of Gaussian kernels. We devised an unsupervised learning algorithm using expectation-maximization to learn the kernel weights as well as other model parameters. Using simulated data, we show that this learning algorithm accurately identifies the multiscale model parameters and the conditional dependency functions. This modeling and learning framework can help study spike-field encoding and dependencies and could enhance future neurotechnologies.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121196000","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":"Interference alignment based precoder-decoder design for radar-communication co-existence","authors":"Yuanhao Cui, V. Koivunen, Xiaojun Jing","doi":"10.1109/ACSSC.2017.8335561","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335561","url":null,"abstract":"Co-existence of radar and communication systems is necessary to facilitate new wireless systems and services due to shortage of useful radio spectrum. Moreover, changes in spectrum regulation will be introduced where spectrum is allocated in larger chunks and different radio systems need to share the spectrum. For example LTE, WI-FI and 5G systems will have to share spectrum with S-band radars. Managing interference is a key task in spectrum sharing and co-existence. In this paper we propose a joint Precoder-Decoder design that maximizes SINRs for co-existing radar and communication systems. Multicarrier waveforms are assumed for both subsystems. Interference Alignment (IA) constraints are imposed to facilitate easier interference cancellation in finding the Precoder and Decoder. Therefore, a maximum Degree of Freedom (DoF) upper bound for K + 1 radar-communication users interference channel can be achieved. Our simulation studies demonstrate that the interference can be practically fully cancelled in both communication and radar systems. This leads to improved detection performance in radar and higher rate in communication subsystems. A significant performance gain over a subspace-based Precoder design is obtained as well.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121658437","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}