发布求助
文献互助 智能选刊 最新文献

2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)最新文献

筛选
英文 中文
Backoff based resource access for contend machine type communications in LTE networks LTE网络中竞争机类型通信的基于后退的资源访问
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334832
Tingting Zheng, Qixun Zhang, Zebing Feng, Z. Feng
{"title":"Backoff based resource access for contend machine type communications in LTE networks","authors":"Tingting Zheng, Qixun Zhang, Zebing Feng, Z. Feng","doi":"10.1109/PACRIM.2015.7334832","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334832","url":null,"abstract":"Considering the delay sensitive services in machine type communications (MTC), how to minimize the end-to-end delay is a great challenge to achieve the millisecond time delay requirement in the fifth generation (5G) communication systems. To utilize the radio resources efficiently, the radio resources of cellular networks are partitioned and utilized randomly for MTC devices, known as contention based access (CBA). To solve the delay caused by contention among MTC devices, a novel backoff based resource access (BBRA) scheme is proposed in this paper. In contrast to the existing random resource access schemes, contend MTC devices postpone by a random backoff window before transmission and access to radio resources according to the new transmission request order. Moreover, the backoff probability and expected time delay for a group of MTC devices are also analyzed. Results verify that a significant decrease of 50% on time delay has been achieved for 50 MTC devices by using proposed BBRA scheme in contrast to conventional schemes.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129213958","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
Discrete Gaussian sampling for low-power devices 用于低功耗器件的离散高斯采样
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334831
Shruti More, R. Katti
{"title":"Discrete Gaussian sampling for low-power devices","authors":"Shruti More, R. Katti","doi":"10.1109/PACRIM.2015.7334831","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334831","url":null,"abstract":"Sampling from the discrete Gaussian probability distribution is used in lattice-based cryptosystems. A need for faster and memory-efficient samplers has become a necessity for improving the performance of such cryptosystems. We propose a new algorithm for sampling from the Gaussian distribution that can efficiently change on-the-fly its speed/memory requirement. The Ziggurat algorithm that attempted to do this requires up to 1000 seconds of computation time to change memory requirements on-the-fly. Our algorithm eliminates this large computational overhead.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115651270","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}
引用次数: 5
Energy-reduced non-contiguous spectrum sensing for compliance enforcement in dynamic spectrum access environments 在动态频谱接入环境中，降低能量的非连续频谱传感，实现合规性执行
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334865
Sean Rocke, Azim Abdool, D. Ringis
{"title":"Energy-reduced non-contiguous spectrum sensing for compliance enforcement in dynamic spectrum access environments","authors":"Sean Rocke, Azim Abdool, D. Ringis","doi":"10.1109/PACRIM.2015.7334865","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334865","url":null,"abstract":"Spectrum measurements are a crucial element of compliance enforcement in dynamic spectrum access (DSA) networks and for emerging interference limit policies such as harm claim thresholds. Such measurements should provide better spatio-temporal resolution than traditional compliance enforcement approaches for characterisation of spectrum usage. Using current techniques, even in distributed monitoring networks, monitoring nodes typically sense contiguous spectral bands, including sub-bands which may not be of interest. This can be energy inefficient, particularly for use in denser monitoring networks, such as those envisioned for DSA within the VHF and UHF bands. In this paper a knowledge-based, non-contiguous, multi-resolution sensing approach for characterization of spectrum occupancy is proposed for compliance enforcement networks. The knowledge framework is introduced for scenarios involving heterogeneous radio access technologies (RAT), and non-uniform spectral sampling using the Non-Uniform Fast Fourier Transform (NUFFT) is demonstrated. The performance of the proposed approach is compared to the typical contiguous sensing approach used in practice, using simulations. Results suggest that the proposed approach can decrease the number of computations required, which would improve energy efficiency for individual nodes in monitoring networks.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363326","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}
引用次数: 3
AMIM: A novel locator-ID mapping scheme for locator-identifier separated Internet architectures AMIM:一种新的定位器-id映射方案，用于定位器-标识符分离的Internet体系结构
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334847
Zhaozhong Xiong, Biao Han, Zhigang Sun, Jianbiao Mao
{"title":"AMIM: A novel locator-ID mapping scheme for locator-identifier separated Internet architectures","authors":"Zhaozhong Xiong, Biao Han, Zhigang Sun, Jianbiao Mao","doi":"10.1109/PACRIM.2015.7334847","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334847","url":null,"abstract":"The idea of separating identifiers (ID) from routable locators has been attracting a lot of attentions. This paper presents the design and implementation of a novel AS-based matching and ID-based mapping (AMIM) scheme to manage dynamic identifier to locator mappings for the locator identifier separated Internet architectures. The proposed AMIM scheme achieves double stage light-weighted locator-ID mapping through a novel hash procedure, while maintaining low update/query latency and high look-up efficiency. Besides, AMIM is able to solve the mapping shared problem which is caused by the fact that global Distributed Hash Table (DHT) is maintained by different operators. Evaluation results are presented to reveal the efficiency of the proposed scheme by comparing with DMap, which is a shared hosting mapping scheme for the locator-ID separated networks. Theoretical results show that AMIM is able to achieve much less packet processing latency than DMap while implementing in hardware. Experimental results are conducted to show more performance improvement by implementing AMIM in software.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124886982","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
Investigating the effects of store value locality on processor power 研究存储值局部性对处理器功耗的影响
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334858
Saman Khoshbakht, N. Dimopoulos
{"title":"Investigating the effects of store value locality on processor power","authors":"Saman Khoshbakht, N. Dimopoulos","doi":"10.1109/PACRIM.2015.7334858","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334858","url":null,"abstract":"The power requirements of a single workload may vary depending on the program phase, or region. In order to monitor the power dissipation of the processor, multiple power models have been previously proposed. These models rely on the performance counters to estimate the power dissipation of the processor. To the best of our knowledge, this work is the first to investigate the effects of the value of the data being processed in the workload on power. It is shown that the power requirements of the processor correlates with the amount of bit-flips necessary to store a new value over the previous one and considering value locality can improve the power model of store performing instructions to up to 7%. This work shows the limitations of relying solely on performance counters and introduces the need to investigate the data flow of the workload in addition to the control flow, in order to achieve more precise power estimations.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971652","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}
引用次数: 3
Bit allocation for lossy image set compression 有损图像集压缩的位分配
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334808
Howard Cheng, Camara Lerner
{"title":"Bit allocation for lossy image set compression","authors":"Howard Cheng, Camara Lerner","doi":"10.1109/PACRIM.2015.7334808","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334808","url":null,"abstract":"Large sets of similar images are produced in many applications. To store these images more efficiently, redundancy among similar images need to be exploited. A number of methods have been proposed to reduce such inter-image redundancy in lossy image set compression. These methods encode each image either using a conventional image compression algorithm, or predicts the image from a similar image already encoded and encode the prediction residual. Although these methods differ in the way they determine the prediction structure in the image set, they do not consider the effect of bit allocation on the overall quality of the reconstructed images. In this paper, we show that Lagrangian optimization can be used to determine bit allocation for each encoded image in order to improve the overall quality of the reconstructed image set. Furthermore, a model approximating rate-distortion curves of the residual images can be used to reduce the encoding time significantly.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172983","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}
引用次数: 7
Multi-label classification using labelled association 使用标签关联的多标签分类
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334815
Yuichiro Kase, T. Miura
{"title":"Multi-label classification using labelled association","authors":"Yuichiro Kase, T. Miura","doi":"10.1109/PACRIM.2015.7334815","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334815","url":null,"abstract":"In this investigation we discuss a multi-label classification problem where documents may have several labels. We put our focus on dependencies among labels in a probabilistic manner, and we extract characteristic features in a form of probabilistic distribution functions by data mining techniques. We show some experimental results, i.e., dependencies among items/labels to see the effectiveness of the approach.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"5 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116778129","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
On hardware solution of dense linear systems via Gauss-Jordan Elimination 稠密线性系统高斯-约当消元的硬件解
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334863
M. Tarek, Ibnu Ziad, Y. Alkabani, M. Watheq El-Kharashi
{"title":"On hardware solution of dense linear systems via Gauss-Jordan Elimination","authors":"M. Tarek, Ibnu Ziad, Y. Alkabani, M. Watheq El-Kharashi","doi":"10.1109/PACRIM.2015.7334863","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334863","url":null,"abstract":"Gauss-Jordan Elimination (GJE) is a popular method for solving systems of linear equations. Much work has been done to design high throughput, low cost, FPGA-based architectures for GJE. However, as the interest in energy efficient designs increases, power consumption becomes a prevalent metric that must be considered in any FPGA-based implementation. In this paper, we present a scalable architecture that can efficiently solve any generic system of linear equations using GJE with a single-precision floating-point accuracy and reasonable power and area overheads. Comparisons with two previous implementations show the efficiency of our design.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127658322","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}
引用次数: 4
Traffic analysis of multi-core body sensor networks based on Wireless NoC infrastructure 基于无线NoC架构的多核体传感器网络流量分析
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334834
H. Elmiligi, F. Gebali, M. El-Kharashi, A. A. Morgan
{"title":"Traffic analysis of multi-core body sensor networks based on Wireless NoC infrastructure","authors":"H. Elmiligi, F. Gebali, M. El-Kharashi, A. A. Morgan","doi":"10.1109/PACRIM.2015.7334834","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334834","url":null,"abstract":"This paper proposes a new hybrid Wireless Networks-on-Chip (WNoCs) architecture for multi-core body sensor network (MBSN) applications. Multi-core is a promising design approach that improves system efficiency and application performance at reduced power cost. Since body sensor network (BSN) nodes communicate wirelessly, an efficient multi-core interconnection-architecture requires heterogeneous network design, which employs both wired and wireless networks. Therefore, WNoCs is proposed as an efficient communication architecture for MBSN applications. In this paper, we analyze the traffic characteristics of WNoCs for BSN applications and identify the traffic load carried by the nodes in the network. Simulation results show that data compression is the most essential design requirement in MBSN to prolong the network life time.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572662","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}
引用次数: 3
A 3-dimensional triangulation scheme to improve the accuracy of indoor localization for IoT services 一种提高物联网服务室内定位精度的三维三角测量方案
2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2015-11-30 DOI: 10.1109/PACRIM.2015.7334862
Gaoyang Shan, Byeong-hun Park, Song-hyeon Nam, Bosung Kim, B. Roh, Young-Bae Ko
{"title":"A 3-dimensional triangulation scheme to improve the accuracy of indoor localization for IoT services","authors":"Gaoyang Shan, Byeong-hun Park, Song-hyeon Nam, Bosung Kim, B. Roh, Young-Bae Ko","doi":"10.1109/PACRIM.2015.7334862","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334862","url":null,"abstract":"Beacon allows Bluetooth [1] devices to broadcast and receive tiny information within short distance, which consists of two parts: a broadcaster (beacon device) and a receiver (smartphone app). So, it is being widely used in URL (Uniform Resource Locator) broadcast, distance measurement, localization etc. However, because of its deviation, measured distance value is not always accuracy. In this paper, we propose a new scheme to improve the distance measurement accuracy. The distance measurement function can be used for localization flexibly, but in some special situation such as a faulted or bad beacon is present, or obstacle is present between the beacon and user, the localization will be incorrect. We also call the beacon is “malicious beaon”. These malicious beacons will significantly impact the accuracy of user's localization. In this paper, we provide a new scheme to mitigate the influence of the “malicious beacon” use the improved distance measurement, and identify it. At last, we compare the performance of our scheme with the general scheme. The simulation result shows that the proposed scheme is better than the general scheme.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117226515","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}
引用次数: 25
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信