2011 IEEE Workshop on Signal Processing Systems (SiPS)最新文献

筛选
英文 中文
EVA-MAC: An event-based adaptive medium access control for wireless sensor networks EVA-MAC:一种基于事件的无线传感器网络自适应介质访问控制
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088950
Z. Merhi, M. Elgamel, M. Bayoumi
{"title":"EVA-MAC: An event-based adaptive medium access control for wireless sensor networks","authors":"Z. Merhi, M. Elgamel, M. Bayoumi","doi":"10.1109/SiPS.2011.6088950","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088950","url":null,"abstract":"Event-based systems are typically characterized by having long periods of sleep and short abrupt periods of high data traffic when an event is detected. High throughput event-based sensor network applications are severely limited by the medium access control layer. EVA-MAC is a medium access control that is tailored specifically for event based systems. In event-based systems, multiple sensors that are in communication range of each other collaborate to execute a specified task. As the number of sensors per hop increases, high contention is generated as multiple sensors detecting the event contend to deliver data to the base station. This contention will lower the throughput, increase latency and deteriorate the application's performance. EVA-MAC is simulated with NS2 and compared with an implementation of S-MAC and 802.11. EVA-MAC presented its superiority in throughput, Latency and energy consumption.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"32 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124596798","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
High level analysis of trade-offs across different partitioning schemes for wireless applications 对无线应用程序的不同分区方案进行高级分析
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088967
Prashant Agrawal, Robert Fasthuber, P. Raghavan, T. Aa, U. Ahmad, L. Perre, F. Catthoor
{"title":"High level analysis of trade-offs across different partitioning schemes for wireless applications","authors":"Prashant Agrawal, Robert Fasthuber, P. Raghavan, T. Aa, U. Ahmad, L. Perre, F. Catthoor","doi":"10.1109/SiPS.2011.6088967","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088967","url":null,"abstract":"With the advent of heterogeneous MPSoC (Multi-Processors System-on-Chip) implementations of wireless applications, system partitioning and mapping has become a key challenge. To achieve efficient designs, system partitioning should simultaneously consider application characteristics, architecture constraints and physical design costs. It is also important to analyze the impact of partitioning on the system's area, energy and performance, as early as possible in the design flow. In this paper, we analyze the impact of different partitioning schemes for lattice reduction based MIMO detector. We show the trade-offs due to different partitioning schemes on area, energy and data parallelization factor for a given performance target for different number of processors. We carry out analysis based on high level estimates derived from the application and a set of characterized datapath and memory primitives for a template based architecture.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419865","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
A comparative study of pre-image techniques: The kernel autoregressive case 预图像技术的比较研究:核自回归情况
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6089006
Maya Kallas, P. Honeine, C. Francis, H. Amoud
{"title":"A comparative study of pre-image techniques: The kernel autoregressive case","authors":"Maya Kallas, P. Honeine, C. Francis, H. Amoud","doi":"10.1109/SiPS.2011.6089006","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6089006","url":null,"abstract":"The autoregressive (AR) model is one of the most used techniques for time series analysis, applied to study stationary as well as non-stationary processes. However, being a linear technique, it is not adapted for nonlinear systems. Recently, we introduced the kernel AR model, a straightforward extension of the AR model to the nonlinear case. It is based on the concept of kernel machines, where data are nonlinearly mapped from the input space to a feature space. The AR model can thus be applied on the mapped data. Nevertheless, in order to predict future samples, one needs to go back to the input space, by solving the pre-image problem. The prediction performance highly depends on the considered pre-image technique. In this paper, a comparative study of several state-of-the-art pre-image techniques is conducted for the kernel AR model, investigating the prediction error with the optimal model parameters, as well as the computational complexity. The conformal map approach presents results as good as the well known fixed-point iterative method, with less computational time. This is shown on unidimensional and multidimensional chaotic time series.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863257","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}
引用次数: 2
Reconfigurable cache memory architecture for integral image and integral histogram applications 用于积分图像和积分直方图应用的可重构缓存存储器架构
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088966
Po-Hao Hsu, Shao-Yi Chien
{"title":"Reconfigurable cache memory architecture for integral image and integral histogram applications","authors":"Po-Hao Hsu, Shao-Yi Chien","doi":"10.1109/SiPS.2011.6088966","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088966","url":null,"abstract":"Cache memory can reduce the memory latency between processor and off-chip DRAM, and it usually occupies a large area of the whole system. However, for accessing integral images and integral integral histograms, which are famous for getting an arbitrary-sized block summation and histogram in a constant speed and widely implemented in many applications, the read and write mechanisms of cache are not suitable for such algorithms with stream processing characteristic. In this paper, a reconfigurable cache memory architecture is proposed with two modes: normal cache mode and Row-Based Stream Processing (RBSP) mode, which is a specific memory architecture for data accessing of integral images and integral histograms. Moreover, the data reuse scheme between different filter sizes and different rows are taken into consideration to further reduce the data access to the off-chip DRAM. In addition, a method called Memory Dividing Technique (MDT) is also proposed to further reduce the word-length. SURF algorithm and center-surround histogram salience map are implemented to verify the proposed design. The experimental results show that the proposed architecture can save 89.15% and 68.12% memory read cycle count for these two applications compared to the traditional fully-associative cache in the same memory size.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117160896","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
Optimization of portable parallel signal processing applications by design space exploration of dataflow programs 通过数据流程序的设计空间探索优化便携式并行信号处理应用
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088947
Christophe Lucarz, M. Mattavelli, J. Janneck
{"title":"Optimization of portable parallel signal processing applications by design space exploration of dataflow programs","authors":"Christophe Lucarz, M. Mattavelli, J. Janneck","doi":"10.1109/SiPS.2011.6088947","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088947","url":null,"abstract":"This paper describes a methodology for the optimization of portable parallel signal processing applications specified by dataflow programs. The use of dataflow as a programming model for signal processing applications targeting parallel platforms provides an important advantage versus the traditional sequential programming paradigm: the portability of parallelism. The paper introduce a design space exploration methodology for exploring alternative implementations in which abstract traces of a program, representing the actual data dependencies of its parts, are first constructed and then analyzed to guide the refactoring and mapping and of the signal processing applications to best match its intended parallel target. The methodology is demonstrated and evaluated in an at-size case study of an MPEG-4 video decoder.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128673615","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}
引用次数: 6
Using the arithmetic representation properties of data to reduce the area and power consumption of FFT circuits for wireless OFDM systems 利用数据的算术表示特性,减少无线OFDM系统FFT电路的面积和功耗
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088941
A. Brokalakis, Vassilis Paliouras
{"title":"Using the arithmetic representation properties of data to reduce the area and power consumption of FFT circuits for wireless OFDM systems","authors":"A. Brokalakis, Vassilis Paliouras","doi":"10.1109/SiPS.2011.6088941","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088941","url":null,"abstract":"FFT is one of the most widely used transformations in modern communication systems, especially those based on OFDM. At the same time, it is one of the largest and most power hungry parts of a modem and therefore any effort to reduce its area and energy footprint is highly desirable. In this paper, we propose the use of mixed linear and logarithmic arithmetic data representation in order to reduce the area and more importantly the energy consumption of a 64-point FFT implementation. By adopting BER as the metric to compare the equivalence between different implementations, we demonstrate that small words can be used throughout the FFT system and these allow the combination of a linear two's complement fixed-point representation with LNS. For the same performance levels, this hybrid representation system requires 5% less area and consumes 23% less energy when compared with a pure linear representation implementation.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130176805","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
Compressed sensing based MR image reconstruction from multiple partial K-space scans 基于压缩感知的多局部k空间磁共振图像重建
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088999
A. Majumdar, R. Ward
{"title":"Compressed sensing based MR image reconstruction from multiple partial K-space scans","authors":"A. Majumdar, R. Ward","doi":"10.1109/SiPS.2011.6088999","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088999","url":null,"abstract":"In Magnetic Resonance Imaging (MRI), signal averaging is an established technique for reducing white Gaussian noise or motion artifacts. Acquiring multiple scans for signal averaging is time consuming. To reduce the data acquisition time, Compressed Sensing (CS) based techniques advocate partial scanning of the K-space only. Instead of using averaging techniques in conjunction with CS based reconstruction, this work proposes a novel formulation that produces extremely accurate reconstruction results. Our method gives the same reconstruction accuracy at 50% K-space sampling as does the conventional signal averaging of the full K-space.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128435121","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
Saliency prediction using scene motion for JND based video compression 基于场景运动的JND视频压缩显著性预测
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088952
R. Wang, C. Chiu
{"title":"Saliency prediction using scene motion for JND based video compression","authors":"R. Wang, C. Chiu","doi":"10.1109/SiPS.2011.6088952","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088952","url":null,"abstract":"Due to the popularity of online repositories, an efficient compression algorithm that removes statistical redundancy and psychovisual redundancies without perceptual degradation is important for data transmission and storage. Visual attention model and visual sensitivity model are proposed for removing psychovisual redundancies. However most visual attention models are based on spatial component analysis, and only a few adopt motion vectors for temporal component analysis, which lacks perceptual information. This paper proposes a scene motion and saliency motion based visual attention model that effectively traces the movement of salient regions, and incorporates the obtained motion saliency map with Just Noticeable Distortion (JND) to determine the quantization parameters. The proposed framework achieves an 8% to 73% bit rate reduction compared with the H.264 in version JM14.0, and its bit rate reduction is three times higher than the previous methods. Visual quality assessment experiments indicate that participants cannot distinguish the difference between the compressed video streams and the original video streams.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130878188","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}
引用次数: 2
Hardware efficiency versus error probability in unreliable computation 不可靠计算中的硬件效率与错误概率
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088969
Yangyang Tang, E. Boutillon, C. Jégo, M. Jézéquel
{"title":"Hardware efficiency versus error probability in unreliable computation","authors":"Yangyang Tang, E. Boutillon, C. Jégo, M. Jézéquel","doi":"10.1109/SiPS.2011.6088969","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088969","url":null,"abstract":"For the purpose of mitigating the effect of transient error in unreliable architecture, many authors have proposed redundant computation (sensitive to error) and an error-free correction unit. In this paper, taking into account that the correction unit is also subject to error, we propose to evaluate the quality of an architecture using not only its efficiency (i.e. the normalized number of operation per area and per unit of time), but also its final output error rate. The new criteria, namely Reliability-Efficiency Criteria (RE-Criteria) thus defines a two dimensional space of solution, i.e. a Pareto distribution [1]. After revisiting well-known correcting techniques with the RE-Criteria, we give an example of Pareto distribution based on a classical FIR filter performed with the error-correcting mechanism based architectures.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130990496","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
Combining LDPC, turbo and Viterbi decoders: Benefits and costs 结合LDPC,涡轮和维特比解码器:效益和成本
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088977
S. Kunze, E. Matús, G. Fettweis, T. Kobori
{"title":"Combining LDPC, turbo and Viterbi decoders: Benefits and costs","authors":"S. Kunze, E. Matús, G. Fettweis, T. Kobori","doi":"10.1109/SiPS.2011.6088977","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088977","url":null,"abstract":"In this paper we present a detailed analysis into the benefits and costs of merging decoders for different channel code types such as convolutional, turbo and LDPC codes. An ASIP (application-specific instruction set processor)-based framework for multi-code forward error correction (FEC) architectures is applied to implement three dedicated decoders for convolutional, turbo and LDPC codes respectively as well as one decoder capable of decoding all three. Synthesis results and performance estimations for all architectures are presented and used to draw a clear and fair comparison between single-mode and multi-mode decoders.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127634713","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
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学术官方微信
小红书