2017 51st Asilomar Conference on Signals, Systems, and Computers最新文献_第6页

A super-resolution algorithm for multiband signal identification 一种多波段信号识别的超分辨率算法

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335193

Zhihui Zhu, Dehui Yang, M. Wakin, Gongguo Tang

引用次数: 4

Full-duplex communications for wireless links with asymmetric capacity requirements 具有非对称容量要求的无线链路的全双工通信

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335646

Orion Afisiadis, A. Austin, Alexios Balatsoukas-Stimming, A. Burg

{"title":"Full-duplex communications for wireless links with asymmetric capacity requirements","authors":"Orion Afisiadis, A. Austin, Alexios Balatsoukas-Stimming, A. Burg","doi":"10.1109/ACSSC.2017.8335646","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335646","url":null,"abstract":"Asymmetric capacity requirements between the uplink and down-link channels are common in many communication standards and are usually satisfied by using time-division or frequency-division duplexing with asymmetric resource allocation. In-band full-duplex communication can reduce the overhead associated with the aforementioned duplexing methods, but, unfortunately, practical full-duplex systems suffer from residual self-interference. However, in asymmetric links the impact of residual self-interference can be partially mitigated by reducing the transmit powers with the goal of maximising the down-link capacity. Compared to time-division half-duplex systems, it is found that power-adjusted full-duplex operation can improve the down-link capacity of an asymmetric IEEE 802.11 system by 20% at a link distance of 10 m, even with pessimistic assumptions on the achievable amount of self-interference suppression. For highly asymmetric traffic, the operation range where a full-duplex system outperforms a corresponding time-division half-duplex system can extend up to 2 km, covering a typical urban LTE macro-cell.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"38 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":"114642234","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}

引用次数: 0

Nonlinear least-mean-squares type algorithm for second-order interference cancellation in LTE-A RF transceivers LTE-A射频收发器二阶干扰消除的非线性最小均二乘算法

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335457

A. Gebhard, C. Motz, R. S. Kanumalli, H. Pretl, M. Huemer

引用次数: 15

Iterative re-weighted L1-norm principal-component analysis 迭代重加权l1范数主成分分析

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335373

Y. Liu, D. Pados, S. Batalama, M. Medley

引用次数: 4

Molecular computation of complex Markov chains with self-loop state transitions 具有自环状态转换的复杂马尔可夫链的分子计算

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335385

S. A. Salehi, Marc D. Riedel, K. Parhi

{"title":"Molecular computation of complex Markov chains with self-loop state transitions","authors":"S. A. Salehi, Marc D. Riedel, K. Parhi","doi":"10.1109/ACSSC.2017.8335385","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335385","url":null,"abstract":"This paper describes a systematic method for molecular implementation of complex Markov chain processes with self-loop transitions. Generally speaking, Markov chains consist of two parts: a set of states, and state transition probabilities. Each state is modeled by a unique molecular type, referred to as a data molecule. Each state transition is modeled by a unique molecular type, referred to as a control molecule, and a unique molecular reaction. Each reaction consumes data molecules of one state and produces data molecules of another state. As we show in this paper, the produced data molecules are the same as the reactant data molecules for self-loop transitions. Although the reactions corresponding to self-loop transitions do not change the molecular concentrations of the data molecules, they are required in order for the system to compute probabilities correctly. The concentrations of control molecules are initialized according to the probabilities of corresponding state transitions in the chain. The steady-state probability of Markov chain is computed by equilibrium concentration of data molecules. We demonstrate our method for a molecular design of a seven-state Markov chain as an instance of a complex Markov chain process with self-loop state transitions. The molecular reactions are then mapped to DNA strand displacement reactions. Using the designed DNA system we compute the steady-state probability matrix such that its element (i, j) corresponds to the long-term probability of staying in state j, given it starts from state i. For example, the error in the computed probabilities is shown to be less than 2% for DNA strand-displacement reactions.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"13 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":"124038156","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}

引用次数: 1

Synchronization signal design and hierarchical detection for the D2D sidelink D2D副链路同步信号设计与分层检测

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335639

K. Manolakis, Wen Xu, G. Caire

引用次数: 3

Rationally inattentive Markov decision processes over a finite horizon 在有限的视界上理性的不注意的马尔可夫决策过程

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335416

Ehsan Shafieepoorfard, M. Raginsky

引用次数: 0

A method to estimate the energy consumption of deep neural networks 一种估计深度神经网络能量消耗的方法

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335698

Tien-Ju Yang, Yu-hsin Chen, J. Emer, V. Sze

{"title":"A method to estimate the energy consumption of deep neural networks","authors":"Tien-Ju Yang, Yu-hsin Chen, J. Emer, V. Sze","doi":"10.1109/ACSSC.2017.8335698","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335698","url":null,"abstract":"Deep Neural Networks (DNNs) have enabled state-of-the-art accuracy on many challenging artificial intelligence tasks. While most of the computation currently resides in the cloud, it is desirable to embed DNN processing locally near the sensor due to privacy, security, and latency concerns or limitations in communication bandwidth. Accordingly, there has been increasing interest in the research community to design energy-efficient DNNs. However, estimating energy consumption from the DNN model is much more difficult than other metrics such as storage cost (model size) and throughput (number of operations). This is due to the fact that a significant portion of the energy is consumed by data movement, which is difficult to extract directly from the DNN model. This work proposes an energy estimation methodology that can estimate the energy consumption of a DNN based on its architecture, sparsity, and bitwidth. This methodology can be used to evaluate the various DNN architectures and energy-efficient techniques that are currently being proposed in the field and guide the design of energy-efficient DNNs. We have released an online version of the energy estimation tool at energyestimation.mit.edu. We believe that this method will play a critical role in bridging the gap between algorithm and hardware design and provide useful insights for the development of energy-efficient DNNs.","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":"129529213","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}

引用次数: 118

Managing analog beams in mmWave networks 管理毫米波网络中的模拟波束

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335544

Yasaman Ghasempour, N. Prasad, M. Khojastepour, S. Rangarajan

{"title":"Managing analog beams in mmWave networks","authors":"Yasaman Ghasempour, N. Prasad, M. Khojastepour, S. Rangarajan","doi":"10.1109/ACSSC.2017.8335544","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335544","url":null,"abstract":"In this paper we consider multi-cell mmWave networks wherein each cell equipped with a large antenna array can employ an analog precoder (or a group of analog beams) to serve its associated users, while each such user can employ a single analog beam. A key problem over such a network is to determine the set of users that each cell should serve (a.k.a. user association), the group of beams it should employ, as well as their attributes such as how often and with how much power should each beam be used. This problem becomes harder since the choice of beam at any user is coupled to the cell it is assigned to and the latter's choice of beams. Moreover, practical considerations demand that each transmitting and receiving beam and their attributes be selected from finite codebooks. We develop novel solutions to this seemingly intractable problem. We adopt the generalized Quality-of-Service (QoS) Proportional Fairness (PF) network utility which can balance efficiency with fairness, and is particularly relevant for coverage constrained mmWave systems, since QoS constraints demand provisioning a minimum rate for each user. We prove that, remarkably, the user association problem under this QoS-PF utility can be formulated as a constrained submodular set function maximization problem. Consequently, it can be optimally solved (up to an additive constant) using distributed algorithms. We then propose a simple distributed algorithm to optimize the choice of beams and their attributes, and prove that it converges to a social equilibrium even in the presence a non-ideal communication channel between cells.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"8 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":"129776087","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}

引用次数: 10

On the performance of polar codes for 5G eMBB control channel 5G eMBB控制信道极化码性能研究

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI: 10.1109/ACSSC.2017.8335664

Seyyed Ali Hashemi, C. Condo, Furkan Ercan, W. Gross

{"title":"On the performance of polar codes for 5G eMBB control channel","authors":"Seyyed Ali Hashemi, C. Condo, Furkan Ercan, W. Gross","doi":"10.1109/ACSSC.2017.8335664","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335664","url":null,"abstract":"Polar codes are a class of error-correcting codes which can provably achieve the capacity of a binary memoryless symmetric channel with low-complexity encoding and decoding algorithms. They have been selected for use in the next generation of wireless communications, as a coding scheme for the enhanced mobile broadband (eMBB) control channel, which requires codes with short lengths and low rates. Successive-cancellation (SC), SC list (SCL), and their modifications, are some of the most studied polar code decoding algorithms. In this paper, we study polar codes of short lengths and different code rates. We show that for a fixed target frame error rate (FER), there is an optimal code rate with which SC and SCL decoders can achieve it with maximum power efficiency. In addition, we study the effect of CRC on the error-correction performance of SCL decoders and show that there is an optimal CRC length with which the decoder achieves its best results. We further analyze the speed of polar code decoding by considering state-of-the-art fast SCL decoders available in literature, thus providing a survey of the decoder design space for eMBB, considering error-correction performance, achievable throughput, flexibility and estimated complexity.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"16 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":"128194641","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}

引用次数: 15