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

The 10th IEEE International Symposium on Signal Processing and Information Technology最新文献

筛选
英文 中文
A hybrid algorithm for restructuring distributed Object-oriented software 面向对象分布式软件重构的混合算法
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711744
M. Faheem, R. Ammar, Al sayed A. H. Sallam, A. Sarhan, Hebat-Allah M. Ragab
{"title":"A hybrid algorithm for restructuring distributed Object-oriented software","authors":"M. Faheem, R. Ammar, Al sayed A. H. Sallam, A. Sarhan, Hebat-Allah M. Ragab","doi":"10.1109/ISSPIT.2010.5711744","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711744","url":null,"abstract":"Distributed Object-oriented software has been used in a large number of applications for solving complex problems in different scientific fields like: machine learning, data mining, pattern recognition, image analysis and bioinformatics. However, we need to collect objects into groups such that the objects in a group will be similar (or related) to one another and different from (or unrelated to) the objects in other groups. This collection is called cluster analysis or clustering. Each cluster will be assigned to different computer to minimize communication among objects and speedup the execution of tasks. There have been several clustering techniques applied to objects. In this paper, we introduce three algorithms for clustering objects into present numbers of clusters to match the target hardware (i.e. software restructuring). These algorithms, through simulation results, achieve better performance than the existing algorithms as they generate more accurate clusters in less time.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134509613","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
Design and FPGA implementation of reduced-complexity MIMO-MLD systems 低复杂度MIMO-MLD系统的设计与FPGA实现
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711809
Y. A. Al-Zahrani, Saleh Al-Marshed, Abdullah Al-Dhofyan, A. I. Sulyman, Saeed Al-Dosari, M. Elnamaky, Saleh Al-Shebeili
{"title":"Design and FPGA implementation of reduced-complexity MIMO-MLD systems","authors":"Y. A. Al-Zahrani, Saleh Al-Marshed, Abdullah Al-Dhofyan, A. I. Sulyman, Saeed Al-Dosari, M. Elnamaky, Saleh Al-Shebeili","doi":"10.1109/ISSPIT.2010.5711809","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711809","url":null,"abstract":"Multiple-antenna systems, also known as multiple input-multiple output (MIMO) radio, improve the capacity and reliability of radio communication systems. Of considerable concern however is the huge complexity involved in the implementation of such systems. Therefore, the design of low complexity, low cost, MIMO systems that keep most of the advantages and benefits of the full-complexity system has gained significant attentions recently. In this paper, we design and implement on field programmable gate array (FPGA) board, a reduced-complexity MIMO-maximum likelihood detection (MLD) system whose performance is as close as possible to the optimal MLD (full-complexity) system while making significant cut back in the over-all hardware/software complexity (and therefore the operating cost) of the system.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"25 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131226692","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
Improved parameterized efficient FPGA implementations of parallel 1-D filtering algorithms using Xilinx System Generator 基于Xilinx System Generator的并行一维滤波算法的改进参数化高效FPGA实现
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711807
S. Hasan, S. Boussakta, Alexandre Yakovlev
{"title":"Improved parameterized efficient FPGA implementations of parallel 1-D filtering algorithms using Xilinx System Generator","authors":"S. Hasan, S. Boussakta, Alexandre Yakovlev","doi":"10.1109/ISSPIT.2010.5711807","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711807","url":null,"abstract":"Two hardware architectures are developed via an improved parameterized efficient FPGA implementation method for parallel 1-D real-time signal filtering algorithms to provide higher performance per Watt and minimum logic area at maximum frequency. This improvement is evidently manifested rapid system-level abstraction FPGA prototyping and optimized speed, area and power, targeting Virtex-6 xc6vlX130Tl-1lff1156 FPGA board to achieve lower power consumption of (820 mW) and a (27%–44%) less device utilization at a maximum frequency of up to (231 MHz) using Xilinx System Generator . The improved parameterized FPGA implementation is a system-level abstraction of hardware-oriented parallel programming, as an alternative to gate-level Hardware Descriptive Language (HDL), to satisfy the high performance computation of parallel multidimensional filtering algorithms at a minimal development-to-market time.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134484451","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}
引用次数: 17
Statistical post-processing improves basis pursuit denoising performance 统计后处理提高了基追求去噪的性能
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711773
S. Chatterjee, D. Sundman, M. Skoglund
{"title":"Statistical post-processing improves basis pursuit denoising performance","authors":"S. Chatterjee, D. Sundman, M. Skoglund","doi":"10.1109/ISSPIT.2010.5711773","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711773","url":null,"abstract":"For compressive sensing (CS), we explore the framework of Bayesian linear models to achieve a robust reconstruction performance in the presence of measurement noise. Using a priori statistical knowledge, we develop a two stage method such that the performance of a standard l1 norm minimization based CS method improves. In the two stage framework, we use a standard basis pursuit denoising (BPDN) method in the first stage for estimating the support set of higher amplitude signal components and then use a linear estimator in the second stage for achieving better CS reconstruction. Through experimental evaluations, we show that the use of the new two stage based algorithm leads to a better CS reconstruction performance than the direct use of the standard BPDN method.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117069289","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
First-Slot scheduling with wavelength conversion for distributed file transfers 第一槽调度与波长转换分布式文件传输
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711718
Yan Li, S. Ranka, S. Sahni
{"title":"First-Slot scheduling with wavelength conversion for distributed file transfers","authors":"Yan Li, S. Ranka, S. Sahni","doi":"10.1109/ISSPIT.2010.5711718","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711718","url":null,"abstract":"As more flexible and self-adaptive network connections are expected between cloud users and service vendors, the requests for more sophisticated bandwidth scheduling schemes are emerging. In this paper, we conduct a thorough study on the a specific type of bandwidth reservation: First-Slot scheduling in this scenario. We introduce a model for the optical networks with sparse wavelength conversion, which are now widely served as dedicated networks between the users and the cloud. We evaluate the performances of EBF and KDP algorithms under various topologies and workloads. Our results show that increasing the fraction of nodes with wavelength converters reduces the blocking probability, but have only marginal effects on requests' average start time. However, both metrics are heavily affected by network topology and traffic load. We also observe that accepting requests greedily, like EBF does, yields better performance when the workload is low, but the more conservative approach, KDP, is superior when the workload is high.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127354181","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
Multi-objective optimization of NoC standard architectures using Genetic Algorithms 基于遗传算法的NoC标准体系结构多目标优化
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711730
A. A. Morgan, H. Elmiligi, M. El-Kharashi, F. Gebali
{"title":"Multi-objective optimization of NoC standard architectures using Genetic Algorithms","authors":"A. A. Morgan, H. Elmiligi, M. El-Kharashi, F. Gebali","doi":"10.1109/ISSPIT.2010.5711730","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711730","url":null,"abstract":"One of the challenging problems in Networks-on-Chip (NoC) design is optimizing the architectural structure of the on-chip network in order to maximize the network performance while minimizing corresponding costs. In this paper, a methodology for multi-objective optimization of NoC standard architectures using Genetic Algorithms is presented. The methodology considers two cost metrics, power and area, and two performance metrics, delay and reliability. Moreover, our methodology combines the best selection of NoC standard topology, the optimum mapping of application cores onto that topology, and the best routing of application traffic traces over the generated network. The methodology is evaluated by applying it to an NoC benchmark application as a case study. Results show that the architectures generated by our methodology outperform those of other standard architectures customization techniques with respect to power, area, delay, reliability, and the combination of the four metrics.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130344212","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}
引用次数: 9
A novel SLM PAPR reduction of OFDM signals without side information 一种新的无侧信息OFDM信号的SLM PAPR降低方法
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711802
T. Kojima, Shohei Iwamoto, Yuki Shida, T. Fujino
{"title":"A novel SLM PAPR reduction of OFDM signals without side information","authors":"T. Kojima, Shohei Iwamoto, Yuki Shida, T. Fujino","doi":"10.1109/ISSPIT.2010.5711802","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711802","url":null,"abstract":"Selected mapping (SLM) is a well-known technique to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM). SLM generally requires the side information for each OFDM symbol, which leads to decrease the transmitting efficiency. In addition, false side information detection degrades the bit error rate (BER) performance significantly. In this paper, we propose a novel SLM scheme without any side information by devising a phase rotation and simple scrambler detection in the receiver. Computer simulation results show that the proposed scheme achieves excellent performances in terms of both PAPR reduction and BER.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124648531","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}
引用次数: 12
A low complexity lattice reduction aided detection based on Gram-Schmidt 基于Gram-Schmidt的低复杂度格约简辅助检测
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711799
C. M. Kinoshita, Wei Hou, Yusuke Sasaki, T. Fujino
{"title":"A low complexity lattice reduction aided detection based on Gram-Schmidt","authors":"C. M. Kinoshita, Wei Hou, Yusuke Sasaki, T. Fujino","doi":"10.1109/ISSPIT.2010.5711799","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711799","url":null,"abstract":"In this paper, we proposes a low-complexity lattice-reduction aided detection (LRAD) based on the Gram-Schmidt (GS) procedure in multi-input multi-output (MIMO) communications. The conventional LRAD achieves good bit error ratios (BERs) because it reduces the column vectors of the channel matrix close to orthogonal using LLL Algorithm. The proposed detection method reduces the column vectors of the channel matrix mutually purely orthogonal using the LLL algorithm and then the GS procedure, and achieve more reliable estimation of the transmitted signals than the conventional LLL algorithm. The BER curves for the proposed detection is steeper than the conventional LRAD with low complexity.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131587646","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
Effect of MFCC normalization on vector quantization based speaker identification MFCC归一化对基于矢量量化的说话人识别的影响
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711789
M. Shirali-Shahreza, S. Shirali-Shahreza
{"title":"Effect of MFCC normalization on vector quantization based speaker identification","authors":"M. Shirali-Shahreza, S. Shirali-Shahreza","doi":"10.1109/ISSPIT.2010.5711789","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711789","url":null,"abstract":"Mel Frequency Cepstral Coefficients (MFCC) are widely used in speech recognition and speaker identification. MFCC features are usually pre-processed before being used for recognition. One of these pre-processing is creating delta and delta-delta coefficients and append them to MFCC to create feature vector. Another pre-processing is coefficients mean normalization. In this paper, the effect of these two processes on the accuracy of a Vector Quantization (VQ) speaker identification system is compared. Additionally, it is shown that coefficient variance normalization, which is less common, can improve the accuracy.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115966913","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}
引用次数: 20
Task clustering & scheduling with duplication using recursive critical path approach (RCPA) 使用递归关键路径方法(RCPA)的任务聚类和重复调度
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711720
A. Ebaid, R. Ammar, S. Rajasekaran, T. Fergany
{"title":"Task clustering & scheduling with duplication using recursive critical path approach (RCPA)","authors":"A. Ebaid, R. Ammar, S. Rajasekaran, T. Fergany","doi":"10.1109/ISSPIT.2010.5711720","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711720","url":null,"abstract":"This paper address the problem of static task clustering and scheduling of a parallel program given as a Directed Acyclic Graph(DAG) with duplication. Scheduling of task graphs onto multiprocessors is known to be an NP-complete in most cases leading to solutions based on heuristics [1]. In this paper, a novel task-duplication scheduling heuristic is presented. Our approach differs from other heuristics found in literature since task clustering and scheduling are handled during the same phase. This technique omit the need of the independent clustering and scheduling phases (i.e., creating a cluster for every single task in the given DAG followed by the scheduling process) as in [2–6]. Preliminarily results shows that our algorithm outperforms PY, LWB, PLW, TCSD and LG algorithms in terms of the overall makespan, and total number of processors used.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115634196","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}
引用次数: 11
首页 上一页 下一页 尾页
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学术官方微信