{"title":"A neural networks approach to interval-valued data clustering. Applicationto Lebanese meteorological stations data","authors":"H. Hamdan, Chantal Hajjar","doi":"10.1109/SiPS.2011.6089005","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6089005","url":null,"abstract":"The Self-Organizing Maps have been widely used as multidimensional unsupervised classifiers. The aim of this paper is to develop a self-organizing map for interval data. Due to the increasing use of such data in Data Mining, many clustering methods for interval data have been proposed this last decade. In this paper, we propose an algorithm to train the self-organizing map for interval data. We use the Euclidian distance to compare two vectors of intervals. In order to show the usefulness of our approach, we apply the self-organizing map on real interval data issued from meteorological stations in Lebanon.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"40 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":"121793995","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}
{"title":"A high parallel macro block level layered LDPC decoding architecture based on dedicated matrix reordering","authors":"Q. Xie, Qian He, Xiao Peng, Ying Cui, Zhixiang Chen, Dajiang Zhou, S. Goto","doi":"10.1109/SiPS.2011.6088961","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088961","url":null,"abstract":"This paper presents a high parallel macro block level layered LDPC decoder architecture for the quasi-cyclic low-density parity-check (QC-LDPC) codes with various code rates and code lengths. LDPC codes defined in WiMAX standard with 6 code rates and 19 code lengths are chosen as the demonstration of this architecture. Based on the proposed dedicated matrix reordering strategy, this decoder costs 12–24 clock cycles per iteration for different code rates. Compared with the state-of-art work, this decoder reduces total memory bits to a great extent and achieves 2x–4.3x higher parallelism with 1.2x hardware cost. The synthesis result proves the low power potential of this architecture.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"60 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":"126169057","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}
{"title":"Fast computation of Gaussian likelihoods using low-rank matrix approximations","authors":"Mrugesh R. Gajjar, T. Sreenivas, R. Govindarajan","doi":"10.1109/SiPS.2011.6088983","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088983","url":null,"abstract":"Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"70 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":"123220918","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}
Johan Ersfolk, Ghislain Roquier, F. Jokhio, J. Lilius, M. Mattavelli
{"title":"Scheduling of dynamic dataflow programs with model checking","authors":"Johan Ersfolk, Ghislain Roquier, F. Jokhio, J. Lilius, M. Mattavelli","doi":"10.1109/SiPS.2011.6088946","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088946","url":null,"abstract":"The scheduling at compile-time of dynamic dataflow programs is still an open problem. This paper presents some initial results showing that scheduling of dynamic portions of CAL dataflow networks can be reduced to static scheduling by the analysis of the state space of network partitions. The CAL sub-network is converted to an equivalent Promela program and analyzed using a state analysis tool (SPIN) identifying deterministic schedules that link recurring network execution states. Therefore, the only dynamic operation of the scheduler remains the guard evaluations between states linked by the obtained deterministic schedules. Experiments show that the number of operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"2 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":"114931409","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}
{"title":"An information-theoretic framework for joint architectural and circuit level optimization for olfactory recognition processing","authors":"Ping-Chen Huang, D. Macii, J. Rabaey","doi":"10.1109/SiPS.2011.6088943","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088943","url":null,"abstract":"Signal processing tasks such as classification or recognition may benefit from implementation strategies inspired by biological sensory pathways. In this paper, we employ an information-theoretic framework to explore the possible energy savings that can result from such an approach when applied to a specific problem, the artificial olfactory system. A preliminary evaluation of the efficiency versus SNR trade-offs for different signal representations demonstrates the advantage of one continuous-time discrete-valued (CTDV) signal representation in the low-precision regime with respect to the digital approach. These results are consequently applied to a joint circuit-architecture optimization of an artificial olfaction signal processing system, leading to promising indications of potential energy savings.","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":"121901164","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}
{"title":"Hardware architecture design of frame rate up-conversion for high definition videos with global motion estimation and compensation","authors":"Kung-Yen Hsu, Shao-Yi Chien","doi":"10.1109/SiPS.2011.6088955","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088955","url":null,"abstract":"Frame rate up-conversion (FRUC) with motion compensated interpolation (MCI) is a key operation for motion blur reduction on liquid crystal displays, and dedicated hardware engine design is necessary. In this paper, a hardware architecture for real-time FRUC applications is designed with global motion estimation and compensation. With the concept of motion estimation in low resolution and motion compensation in high resolution, and redesigning several memory bandwidth-hungry modules, a previous work, global-to-local iterative MCI, is modified for hardware design with similar subjective performance. Next, a high-throughput global motion estimation (GME) engine is designed with subsampling technique and parallel hardware architecture, and global motion compensated interpolation and moving block classifier are both designed by sharing the hardware with GME. Moreover, a motion estimation engine is also designed to support various local motion estimation algorithms in different stages. Implementation results show that the proposed GME engine can achieve much higher specifications with limited hardware cost increase. Furthermore, the proposed FRUC design can generate 60 1920 × 1080 interpolated frames per second with the gate count of 1.3M and on-chip memory size of 99kb.","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":"128405489","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}
Hossam Amer, A. Rahman, I. Amer, Christophe Lucarz, M. Mattavelli
{"title":"Methodology and technique to improve throughput of FPGA-based Cal dataflow programs: Case study of the RVC MPEG-4 SP Intra decoder","authors":"Hossam Amer, A. Rahman, I. Amer, Christophe Lucarz, M. Mattavelli","doi":"10.1109/SiPS.2011.6088972","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088972","url":null,"abstract":"The specification of complex signal processing systems in hardware by means of HDL is no longer the appropriate way since they are known to be time consuming to design, and less flexible to extend features. Recently, Cal dataflow language was specified to increase productivity and scalability, with ability to synthesize to HDL for hardware implementation. In this paper, a new methodology to improve throughput of dataflow-based hardware designs is given by analyzing Cal programs using the profiling tool. As a case study, we analyzed the RVC MPEG-4 SP Intra decoder and found that the texture decoding part has the highest improvement factor. We have also introduced the luminance texture splitting technique as the improvement method by increasing the level of parallelism in the decoder. Experimental results of implementation on Virtex-5 FPGA confirmed our analysis with throughput increase of up to 50.5% with only 4.3% additional slice.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"7 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120863536","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}
M. S. Azzaz, C. Tanougast, S. Sadoudi, A. Dandache
{"title":"New hardware Cryptosystem based chaos for the secure real-time of embedded applications","authors":"M. S. Azzaz, C. Tanougast, S. Sadoudi, A. Dandache","doi":"10.1109/SiPS.2011.6088984","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088984","url":null,"abstract":"This paper proposes a new Cryptosystem for encryption of the real-time embedded applications. The proposed hardware architecture is based on a chaotic rule switching of several three-dimensional continuous chaotic data generators. The originality of the proposed approach is a new stream chaotic key generator used for real time data encrypt and decrypt. Our architecture, implemented in Virtex Xilinx FPGA technology, is particularly attractive since it provides a very low-cost security solution while holding or increasing the throughput rate encryption. Moreover, the application and experimental results for speech encrypted signal effectively hides the original speech signal after synchronization between the transmitter and the receiver which decrypted recovers the original speech signal with reasonable inteligibility.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"53 5 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":"132383472","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}
G. Zaki, W. Plishker, S. Bhattacharyya, T. Clancy, J. Kuykendall
{"title":"Vectorization and mapping of software defined radio applications on heterogeneous multi-processor platforms","authors":"G. Zaki, W. Plishker, S. Bhattacharyya, T. Clancy, J. Kuykendall","doi":"10.1109/SiPS.2011.6088945","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088945","url":null,"abstract":"A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, we have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem we are able to generate a range of designs that efficiently trade-of latency and throughput. In this approach, efficient utilization of SIMD cores is achieved by applying extensive block processing in conjunction with efficient mapping and scheduling. We demonstrate our approach through an integration into the GNU Radio environment for software defined radio system design.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"56 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":"130061936","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}
Esther P. Adeva, M. A. Shah, B. Mennenga, G. Fettweis
{"title":"VLSI architecture for soft-output tuple search sphere decoding","authors":"Esther P. Adeva, M. A. Shah, B. Mennenga, G. Fettweis","doi":"10.1109/SiPS.2011.6088978","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088978","url":null,"abstract":"High detection complexity is known to be one of the major challenges in MIMO communications based on spatial multiplexing. Tuple Search Detector (TSD) was recently introduced, significantly reducing detection complexity in comparison to conventional algorithms while achieving close to full max-log-APP BER performance. Irregular control flow and sequential nature of depth-first-based detectors frustrate efficient application of parallelization techniques, typically leading to inefficient realizations. This work presents a novel TSD implementation, based on a scalable and parallelizable pipelined ASIP architecture. The proposed VLSI design is implemented for 4×4 MIMO transmission using 64-QAM constellation on 65-nm CMOS technology. In low SNR scenarios, proposed detector achieves 403.6 Mbps throughput at 454 MHz clock frequency. TSD can be moreover adjusted according to transmission conditions, reaching >1 Gbps. A silicon area of 0.14 mm2 (98.9 kGEs) is occupied by the TSD core, reporting low power dissipation (57.94 mW) under typical case operating conditions. Proposed detector implementation achieves close to full max-log-APP BER performance and high detection throughput with reasonable hardware complexity, by far outperforming state-of-the-art realizations.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"14 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":"132827635","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}