检索结果-内蒙古大学图书馆

Target range estimation based on a non-homogenous Poisson process model

IET SIGNAL PROCESSING 2013年第3期7卷 249-258页

作者： Yildirim, Alper TUBITAK BILGEM ILTAREN Ankara Turkey

In this study, the author analyses target range estimation errors in matched filtering-based detection performed in high range resolution (HRR) radars. Conventional radar signal processors use point target detectors, where extended target responses are put through a point detection process by windowing and thresholding. The author demonstrates through simulations that the performance of degradation under the point target assumption can be significant for HRR radars, where targets extend across several detection cells. The author modelled the reflections for stationary and moving extended target scenarios by using three target signal models (TSMs). A non-homogenous Poisson process (NHPP) is provided to model the signal at the output of the target detector, which includes reflections from targets and clutter. The corresponding maximum likelihood (ML) estimator is derived as a range estimation technique. The author simulated a target detection process and made comparisons between the classical-and NHPP-based peak estimator performances for each of the TSMs. Furthermore, the ML estimation (MLE) algorithm is extended for multiple targets. The author demonstrates that the ML estimator significantly reduces target range estimation errors compared with the classical point target estimators.

关键词： Computer Programming Languages Poisson process Target detectors radar degradation of performance Writers Estimation Techniques Reflection procedural model SHOOTING RANGE multiprogramming extended target

来源：评论

学校读者我要写书评

暂无评论

RUN-TIME OPTIMIZATION OF A DYNAMICALLY RECONFIGURABLE EMBEDDED SYSTEM THROUGH PERFORMANCE PREDICTION

RUN-TIME OPTIMIZATION OF A DYNAMICALLY RECONFIGURABLE EMBEDD...

引用

23rd International Conference on Field Programmable Logic and Applications (FPL)

作者： Mariani, Giovanni Sima, Vlad-Mihai Palermo, Gianluca Zaccaria, Vittorio Marchiori, Giacomo Silvano, Cristina Bertels, Koen Univ Svizzera Italiana ALaRI Lugano Switzerland Delft Univ Technol NL-2600 AA Delft Netherlands Politecn Milan Milan Italy Bluebee Multicore Technol Delft Netherlands

ISBN: (纸本)9781479900046

A key tool to increase the exploitation of dynamic reconfigurable platforms is the run-time resource manager. This system module coordinates the usage of both software and reconfigurable hardware resources in the context of a multiprogrammed environment, by alleviating the operating system's induced overhead. This paper introduces a two-layers run-time resource manager for dynamic reconfigurable platforms. The upper level is composed of several application-level managers (one for each application) that provide the most suitable mapping based on resource constraints and performance prediction. The lower level is composed of a centralized system-level resource manager that assigns the HW/SW resources to each application. We present a video surveillance case study in which the proposed resource management technique outperforms the performance of the state of the art by 28% on average, introducing a computational time overhead within 2%.

关键词： embedded systems multiprogramming optimisation resource allocation video surveillance

来源：评论

学校读者我要写书评

暂无评论

Shared Cache Aware Task Mapping for WCRT Minimization

Shared Cache Aware Task Mapping for WCRT Minimization

引用

18th Asia and South Pacific Design Automation Conference (ASP-DAC)

作者： Ding, Huping Liang, Yun Mitra, Tulika Natl Univ Singapore Sch Comp Singapore Singapore Peking Univ Sch EECS Ctr Energy Efficient Comp & Applicat Beijing Peoples R China

ISBN: (纸本)9781467330305;9781467330299

The Worst-Case Response Time (WCRT) of multitasking applications running on multi-cores is an important metric for real-time embedded systems. The WCRT is determined by the mapping of the tasks to the cores (which determines load balancing) and theWorst-Case Execution Time (WCET) of the tasks. However, the WCET of a task is also influenced by the conflicts in the shared cache from concurrently executing tasks on other cores in a multi-core system. In other words, the mapping of the tasks to the cores indirectly influences the WCET of the tasks, which in turn impacts the WCRT of the entire application. Thus the mapping of the tasks to the cores should simultaneously maximize workload balance and minimize shared cache interference. We propose an integer-linear programming (ILP) formulation to achieve this objective. Experimental evaluation shows that shared cache aware task mapping achieves on an average 25% and 33% WCRT reduction for real-life and synthetic applications, respectively, compared to traditional approach that is agnostic to shared cache conflicts and solely focuses on load balancing.

关键词： cache storage concurrency control embedded systems integer programming linear programming multiprocessing systems multiprogramming processor scheduling

来源：评论

学校读者我要写书评

暂无评论

RECAP: A Region-Based Cure for the Common Cold (Cache)

RECAP: A Region-Based Cure for the Common Cold (Cache)

引用

19th IEEE International Symposium on High Performance Computer Architecture (HPCA)

作者： Zebchuk, Jason Cain, Harold W. Tong, Xin Srinivasan, Vijayalakshmi Moshovos, Andreas Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada

ISBN: (纸本)9781467355872

Virtualization has become a magic bullet to increase utilization, improve security, lower costs, and reduce management overheads. In many scenarios, the number of virtual machines consolidated onto a single processor has grown even faster than the number of hardware threads. This results in multiprogrammed virtualization where many virtual machines time-share a single processor core. Such fine-grain sharing comes at a cost;each time a virtual machine gets scheduled by the hypervisor, it effectively begins with a "cold" cache, since any cache blocks it accessed in the past have likely been evicted by other virtual machines. Recently, cache restoration prefetchers have been shown to reduce the cold cache effects caused by multiprogrammed virtualization. However, these prefetchers waste large amounts of bandwidth prefetching many useless blocks and writing and reading metadata to and from memory. Using block reuse based filtering, we enhance two existing cache restoration prefetchers and reduce their bandwidth overheads by 16% and 32%, with slowdowns of only 0.5% and 0.6%. We also propose a Region-Based Cache Restoration Prefetcher (RECAP), which groups cache blocks into coarse-grain regions of memory, and predicts which regions contain useful blocks to prefetch the next time the current virtual machine executes. Based on these predictions, and using a simple compression technique that exploits spatial locality, RECAP provides a robust prefetcher that improves performance by up to 42% for some applications and only uses 14% more bandwidth and 3.5% more power than a stride prefetcher, on average. Compared to other prefetchers designed for multiprogrammed virtualization, RECAP provides comparable performance while using an average of 12% to 27% less bandwidth, and reducing the energy-delay product of the L2 cache and main memory by 12% to 13% on average.

关键词： cache storage data compression multiprogramming power aware computing processor scheduling supervisory programs virtual machines virtualisation

来源：评论

学校读者我要写书评

暂无评论

Characterizing Multi-threaded Applications for Designing Sharing-aware Last-level Cache Replacement Policies

Characterizing Multi-threaded Applications for Designing Sha...

引用

IEEE International Symposium on Workload Characterization (IISWC)

作者： Natarajan, Ragavendra Chaudhuri, Mainak Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Indian Inst Technol Kanpur 208016 Uttar Pradesh India

ISBN: (纸本)9781479905539

Recent years have seen a large volume of proposals on managing the shared last-level cache (LLC) of chip-multiprocessors (CMPs). However, most of these proposals primarily focus on reducing the amount of destructive interference between competing independent threads of multi-programmed workloads. While very few of these studies evaluate the proposed policies on shared memory multi-threaded applications, they do not improve constructive cross-thread sharing of data in the LLC In this paper, we characterize a set of multi-threaded applications drawn from the PARSEC, SPEC OMP, and SPLASH-2 suites with the goal of introducing sharing-awareness in LLC replacement policies. We motivate our characterization study by quantifying the potential contributions of the shared and the private blocks toward the overall volume of the LLC hits in these applications and show that the shared blocks are more important than the private blocks. Next, we characterize the amount of sharing-awareness enjoyed by recent proposals compared to the optimal policy. We design and evaluate a generic oracle that can be used in conjunction with any existing policy to quantify the potential improvement that can come from introducing sharing-awareness. The oracle analysis shows that introducing sharing-awareness reduces the number of LLC misses incurred by the least-recently-used (LRU) policy by 6% and 10% on average for a 4MB and 8MB LLC respectively. A realistic implementation of this oracle requires the LLC controller to have the capability to accurately predict, at the time a block is filled into the LLC, whether the block will be shared during its residency in the LLC. We explore the feasibility of designing such a predictor based on the address of the fill and the program counter of the instruction that triggers the fill. Our sharing behavior predictability study of two history-based fill-time predictors that use block addresses and program counters concludes that achieving acceptable levels of ac

关键词： cache storage microprocessor chips multi-threading multiprogramming shared memory systems

来源：评论

学校读者我要写书评

暂无评论

Application-Specific Customisation of Market Data Feed Arbitration

Application-Specific Customisation of Market Data Feed Arbit...

引用

12th International Conference on Field-Programmable Technology (FPT)

作者： Denholm, Stewart Inouet, Hiroaki Takenaka, Takashi Luk, Wayne Univ London Imperial Coll Sci Technol & Med London England NEC Corp Ltd Kawasaki Japan

ISBN: (纸本)9781479921980;9781479921997

Messages are transmitted from financial exchanges to update their members about changes in the market. As UDP packets are used for message transmission, members subscribe to two identical message feeds from the exchange to lower the risk of message loss or delay. As financial trades can be time sensitive, low latency arbitration between these market data feeds is of particular importance. Members must either provide generic arbitration for all of their financial applications, increasing latency, or arbitrate within each application which wastes resources and scales poorly. We present a reconfigurable accelerated approach for market feed arbitration operating at the network level. Multiple arbitrators can operate within a single FPGA to output customised feeds to downstream financial applications. Application-specific customisations are supported by each core, allowing different market feed messaging protocols, windowing operations and message buffering parameters. We model multiple-core arbitration and explore the scalability and performance improvements within and between cores. We demonstrate our design within a Xilinx Virtex-6 FPGA using the NASDAQ TotalView-ITCH 4.1 messaging standard. Our implementation operates at 16Gbps throughput, and with resource sharing, supports 12 independent cores, 33% more than simple core replication. A 56ns (7 clock cycles) windowing latency is achieved, 2.6 times lower than a hardware-accelerated CPU approach.

关键词： Arbitrating core Latency Fodder FEEDS Telemarketing clock cycle network level Resource sharing Messages multiprogramming Customization Scalability

来源：评论

学校读者我要写书评

暂无评论

A COMPARISON STUDY BETWEEN WINDOWING AND BINARY PARTITION TREES FOR HYPERSPECTRAL IMAGE INFORMATION MINING

A COMPARISON STUDY BETWEEN WINDOWING AND BINARY PARTITION TR...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： M. A. Veganzones G. Tochon M. Dalla Mura A. J. Plaza J. Chanussot GIPSA-lab Grenoble-INP Saint Martin d'Heres Hyperspectral Computing Laboratory University of Extremadura (UEX)

ISBN: (纸本)9781479911127

Remote sensors capture large scenes that are conventionally split in smaller patches before being stored and analyzed. Traditionally, this has been done by dividing the scene in rectangular windows. Such windowing methodology could provoke the separation of spectrally homogeneous areas or objects of interest into two or more patches. This is due to the presence of objects of interest in correspondence to windows' borders, or because the fixed size of the windows does not adapt well to the scale of the objects. To alleviate this issue, the windows can be arranged in an overlapping way, incurring in some data redundancy storage. Recently, tree representations have been used as an alternative to windowing in order to structure and store large amounts of remote sensing data. In this work we explore the benefits of using Binary Partition Trees (BPT) instead of windowing to store hyperspectral large scenes. We are particularly interested in storing the information resulting of local spectral unmixing processes running over a large real hyperspectral scene. We show that under similar conditions BPT allows a better storage of the unmixing information in terms of reconstruction error.

关键词： Hyperspectral images BPT representation Windowing Spectral unmixing Image information mining multiprogramming FENSTER windows windows hyperspectral imagery interest Remote sensing equipment Binary information trees reconstruction error

来源：评论

学校读者我要写书评

暂无评论

COMPLEX CEPSTRUM ANALYSIS BASED ON THE MINIMUM MEAN SQUARED ERROR

COMPLEX CEPSTRUM ANALYSIS BASED ON THE MINIMUM MEAN SQUARED ...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Ranniery Maia Masami Akamine M. J. F. Gales Toshiba Research Europe Limited Cambridge Research Laboratory Cambridge UK Toshiba Corporation Corporate Research and Development Center Kawasaki Japan

ISBN: (纸本)9781479903573

This paper introduces a novel approach for complex cepstrum analysis. Given initial estimates of complex cepstra and respective instants of glottal closure, the method iteratively optimizes the complex cepstrum and instants of glottal closure so that the mean squared error between natural and reconstructed speech waveforms is minimized, The proposed approach results in a more accurate speech representation based on the complex cepstrum, with no need of windowing or phase unwrapping. Experimental results show that the proposed method produces reconstructed speech with higher segmental signal-to-noise ratio scores when compared with conventional methods of complex cepstrum analysis. Because this approach can derive the complex cepstrum at fixed periods, it can be applied to statistical modeling in parametric speech synthesizers.

关键词： Cepstral analysis Cepstrum Mean multiprogramming statistical models (nuclear) Speech Complex Complexes Mean square error

来源：评论

学校读者我要写书评

暂无评论

Transform Domain Two Dimensional and Diagonal Modular Principal Component Analysis for Facial Recognition Employing Different Windowing Techniques

Transform Domain Two Dimensional and Diagonal Modular Princi...

引用

IEEE International Midwest Symposium on Circuits and Systems

作者： Ramy C. G. Chehata Wasfy B. Mikhael Moataz M. Abdelwahab Department of Electrical Engineering and Computer Science University of Central Florida School of Communications & Information Technology Nile University

ISBN: (纸本)9781479900657

Spatial domain facial recognition Modular IMage Principal Component Analysis (MIMPCA) has an improved recognition rate compared to the conventional PCA. In the MPCA, face images are divided into smaller sub-images and the PCA approach is applied to each of these sub-images. In this work, the Transform Domain implementation of MPCA is presented. The facial image has two representations. The Two Dimensional MPCA (TD - 2D - MPCA) and the Diagonal matrix MPCA (TD - Dia - MPCA). The sub-images are processed using both non-overlapping and overlapping windows. All the test results, for noise free and noisy images, using ORL, Yale and FERET databases achieved;99.5%, 99.58% and 97.42% recognition accuracy respectively. Transform Domain implementations yield, computational and storage savings of at least 75% and 99.98%, respectively, compared to spatial domain. Sample results are given.

关键词： Facial Recognition principal components analysis subimage Transform component analysis multiprogramming Modularity spatial domain images Domain

来源：评论

学校读者我要写书评

暂无评论

Impact of Windowing on Power Allocation in Cognitive Radio Systems

Impact of Windowing on Power Allocation in Cognitive Radio S...

引用

4th International Conference on Communications and Electronics (ICCE)

作者： Le Van Tuan Dinh Chi Hieu Nguyen Thanh Hieu Nguyen Viet Kinh University of Engineering and Technology Viet Nam

ISBN: (纸本)9781467324939;9781467324922

This paper investigates the impact of windowing on the power allocation in cognitive radio (CR) system. The investigation shows that introducing windowing significantly improves the power allocation and transmission rate of CR as it effectively reduces interference introduced by CR system. Although the windowing technique has been widely introduced to OFDM-based systems, such as WLAN [1], its effect has not been properly examined in the theoretical and numerical analysis of optimized/sub-optimized power allocation problem of OFDM-based CR systems. This paper thoroughly studies the impact of windowing technique on the interference of CR and proposes new approaches to sub-optimal power allocation.

关键词： power splitting multiprogramming Radio systems window method Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：