Michele Polese, M. Mezzavilla, Menglei Zhang, Jing Zhu, S. Rangan, S. Panwar, M. Zorzi
{"title":"milliProxy: A TCP proxy architecture for 5G mmWave cellular systems","authors":"Michele Polese, M. Mezzavilla, Menglei Zhang, Jing Zhu, S. Rangan, S. Panwar, M. Zorzi","doi":"10.1109/ACSSC.2017.8335489","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335489","url":null,"abstract":"TCP is the most widely used transport protocol in the internet. However, it offers suboptimal performance when operating over high bandwidth mmWave links. The main issues introduced by communications at such high frequencies are (i) the sensitivity to blockage and (ii) the high bandwidth fluctuations due to Line of Sight (LOS) to Non Line of Sight (NLOS) transitions and vice versa. In particular, TCP has an abstract view of the end-to-end connection, which does not properly capture the dynamics of the wireless mmWave link. The consequence is a suboptimal utilization of the available resources. In this paper we propose a TCP proxy architecture that improves the performance of TCP flows without any modification at the remote sender side. The proxy is installed in the Radio Access Network, and exploits information available at the Next Generation Node Base (gNB) in order to maximize throughput and minimize latency.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122615888","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":"Joint user scheduling and power optimization in full-duplex cells with successive interference cancellation","authors":"Shahram Shahsavari, David Ramírez, E. Erkip","doi":"10.1109/ACSSC.2017.8335520","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335520","url":null,"abstract":"This paper considers a cellular system with a full-duplex base station and half-duplex users. The base station can activate one user in uplink or downlink (half-duplex mode), or two different users one in each direction simultaneously (full-duplex mode). Simultaneous transmissions in uplink and downlink causes self-interference at the base station and uplink-to-downlink interference at the downlink user. Although uplink-to-downlink interference is typically treated as noise, it is shown that successive interference decoding and cancellation (SIC mode) can lead to significant improvement in network utility, especially when user distribution is concentrated around a few hotspots. The proposed temporal fair user scheduling algorithm and corresponding power optimization utilizes full-duplex and SIC modes as well as half-duplex transmissions based on their impact on network utility. Simulation results reveal that the proposed strategy can achieve up to 95% average cell throughput improvement in typical indoor scenarios with respect to a conventional network in which the base station is half-duplex.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115857702","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":"Deep neural network architectures for modulation classification","authors":"Xiaoyu Liu, Diyu Yang, A. E. Gamal","doi":"10.1109/ACSSC.2017.8335483","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335483","url":null,"abstract":"In this work, we investigate the value of employing deep learning for the task of wireless signal modulation recognition. Recently in [1], a framework has been introduced by generating a dataset using GNU radio that mimics the imperfections in a real wireless channel, and uses 10 different modulation types. Further, a convolutional neural network (CNN) architecture was developed and shown to deliver performance that exceeds that of expert-based approaches. Here, we follow the framework of [1] and find deep neural network architectures that deliver higher accuracy than the state of the art. We tested the architecture of [1] and found it to achieve an accuracy of approximately 75% of correctly recognizing the modulation type. We first tune the CNN architecture of [1] and find a design with four convolutional layers and two dense layers that gives an accuracy of approximately 83.8% at high SNR. We then develop architectures based on the recently introduced ideas of Residual Networks (ResNet [2]) and Densely Connected Networks (DenseNet [3]) to achieve high SNR accuracies of approximately 83.5% and 86.6%, respectively. Finally, we introduce a Convolutional Long Short-term Deep Neural Network (CLDNN [4]) to achieve an accuracy of approximately 88.5% at high SNR.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121107925","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}
Ramin Soltani, D. Goeckel, D. Towsley, A. Houmansadr
{"title":"Towards provably invisible network flow fingerprints","authors":"Ramin Soltani, D. Goeckel, D. Towsley, A. Houmansadr","doi":"10.1109/ACSSC.2017.8335179","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335179","url":null,"abstract":"Network traffic analysis reveals important information even when messages are encrypted. We consider active traffic analysis via flow fingerprinting by invisibly embedding information into packet timings of flows. In particular, assume Alice wishes to embed fingerprints into flows of a set of network input links, whose packet timings are modeled by Poisson processes, without being detected by a watchful adversary Willie. Bob, who receives the set of fingerprinted flows after they pass through the network modeled as a collection of independent and parallel M/M/1 queues, wishes to extract Alice's embedded fingerprints to infer the connection between input and output links of the network. We consider two scenarios: 1) Alice embeds fingerprints in all of the flows; 2) Alice embeds fingerprints in each flow independently with probability p. Assuming that the flow rates are equal, we calculate the maximum number of flows in which Alice can invisibly embed fingerprints while having those fingerprints successfully decoded by Bob. Then, we extend the construction and analysis to the case where flow rates are distinct, and discuss the extension of the network model.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123306012","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":"Seeded graph matching: Efficient algorithms and theoretical guarantees","authors":"Farhad Shirani, S. Garg, E. Erkip","doi":"10.1109/ACSSC.2017.8335178","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335178","url":null,"abstract":"In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is analyzed and sufficient conditions for successful matching are rederived using type analysis. Furthermore, a new seeded matching algorithm with polynomial time complexity is introduced. The algorithm uses ‘typicality matching’ and techniques from point-to-point communications for reliable matching. Assuming an Erdös-Renyi model on the correlated graph pair, it is shown that successful matching is guaranteed when the number of seeds grows logarithmically with the number of vertices in the graphs. The logarithmic coefficient is shown to be inversely proportional to the mutual information between the edge variables in the two graphs.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125106352","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":"Efficient and robust classification of seismic data using nonlinear support vector machines","authors":"K. Hickmann, J. Hyman, G. Srinivasan","doi":"10.1109/ACSSC.2017.8335156","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335156","url":null,"abstract":"We characterize the robustness and scalability of nonlinear Support Vector Machines (SVM) combined with kernel Principal Component Analysis (kPCA) for the classification of nonlinearly correlated data within the context of geo-structure identification using seismic data. Classification through pattern recognition using supervised learning algorithms such as SVM is popular in many fields. However, the suitability of such methods for classifying seismic data is severely hampered by assumptions of linearity (linear SVM), which affects accuracy, or computational limitations with increases in data dimension (nonlinear SVM). We propose an alternate approach to overcome this limitation, performing nonlinear SVM in a reduced dimensional space determined using kPCA. The utility of the method is demonstrated by characterizing the geologic structure using synthetically generated seismograms. We observe that our method produced a more efficient and robust classifier for seismic data than standard nonlinear SVM. Optimal SVM performance occurs when a subspace that makes up only 10% of the entire feature space is used for the training set. We also observe a greater than five times speedup in computational time between the optimal performance and standard nonlinear SVM. The results indicate that performing kPCA dimension reduction prior to classification can significantly increase performance and robustness.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127262597","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":"Interleaver design for deep neural networks","authors":"Sourya Dey, P. Beerel, K. Chugg","doi":"10.1109/ACSSC.2017.8335713","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335713","url":null,"abstract":"We propose a class of interleavers for a novel deep neural network (DNN) architecture that uses algorithmically predetermined, structured sparsity to significantly lower memory and computational requirements, and speed up training. The interleavers guarantee clash-free memory accesses to eliminate idle operational cycles, optimize spread and dispersion to improve network performance, and are designed to ease the complexity of memory address computations in hardware. We present a design algorithm with mathematical proofs for these properties. We also explore interleaver variations and analyze the behavior of neural networks as a function of interleaver metrics.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120969241","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}
Bert Moons, Koen Goetschalckx, Nick Van Berckelaer, M. Verhelst
{"title":"Minimum energy quantized neural networks","authors":"Bert Moons, Koen Goetschalckx, Nick Van Berckelaer, M. Verhelst","doi":"10.1109/ACSSC.2017.8335699","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335699","url":null,"abstract":"This work targets the automated minimum-energy optimization of Quantized Neural Networks (QNNs) — networks using low precision weights and activations. These networks are trained from scratch at an arbitrary fixed point precision. At iso-accuracy, QNNs using fewer bits require deeper and wider network architectures than networks using higher precision operators, while they require less complex arithmetic and less bits per weights. This fundamental trade-off is analyzed and quantified to find the minimum energy QNN for any benchmark and hence optimize energy-efficiency. To this end, the energy consumption of inference is modeled for a generic hardware platform. This allows drawing several conclusions across different benchmarks. First, energy consumption varies orders of magnitude at iso-accuracy depending on the number of bits used in the QNN. Second, in a typical system, BinaryNets or int4 implementations lead to the minimum energy solution, outperforming int8 networks up to 2–10× at iso-accuracy. All code used for QNN training is available from https://github.com/BertMoons/.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114343820","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":"Hyper-threaded multiplier for HECC","authors":"Gabriel Gallin, A. Tisserand","doi":"10.1109/ACSSC.2017.8335378","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335378","url":null,"abstract":"Modular multiplication is the most costly and common operation in hyper-elliptic curve cryptography. Over prime fields, it uses dependent partial products and reduction steps. These dependencies make FPGA implementations with fully pipelined DSP blocks difficult to optimize. We propose a new multiplier architecture with hyper-threaded capabilities. Several independent multiplications are handled in parallel for efficiently filling the pipeline and overlapping internal latencies by independent computations. It increases the silicon efficiency and leads to a better area / computation time trade-off than current state of the art. We use this hyper-threaded multiplier into small accelerators for hyper-elliptic curve cryptography in embedded systems.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131969838","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}
Alexios Balatsoukas-Stimming, T. Podzorny, J. Uythoven
{"title":"Polar coding for the large hadron collider: Challenges in code concatenation","authors":"Alexios Balatsoukas-Stimming, T. Podzorny, J. Uythoven","doi":"10.1109/ACSSC.2017.8335654","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335654","url":null,"abstract":"In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Interlock System of the Large Hadron Collider at CERN. Even though this concatenation scheme is simple, it reveals significant challenges that may be encountered when designing a concatenated scheme that uses a polar code as an inner code, such as error correlation and unusual decision log-likelihood ratio distributions. We explain and analyze these challenges and we propose two ways to overcome them.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126417922","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}