Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627047
B. Marendic, H. Stark, Yongyi Yang
In this paper we explore a new approach for unwrapping of two-dimensional phase functions using vector-space projection methods. Phase unwrapping is essential for imaging systems that construct the image from phase information. Unlike some existing methods where unwrapping is performed locally on a piece-by-piece basis, this work approaches the unwrapping problem from a global point of view. The unwrapping is done iteratively, based on an extension of the Gerchberg-Papoulis algorithm, and the solution is refined over the entire region of support at each iteration. Robustness is demonstrated through its performance in a noisy environment, and its performance is compared to the least-squares algorithm developed by Pritt
{"title":"Phase unwrapping using vector space projection methods","authors":"B. Marendic, H. Stark, Yongyi Yang","doi":"10.1109/EIT.2005.1627047","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627047","url":null,"abstract":"In this paper we explore a new approach for unwrapping of two-dimensional phase functions using vector-space projection methods. Phase unwrapping is essential for imaging systems that construct the image from phase information. Unlike some existing methods where unwrapping is performed locally on a piece-by-piece basis, this work approaches the unwrapping problem from a global point of view. The unwrapping is done iteratively, based on an extension of the Gerchberg-Papoulis algorithm, and the solution is refined over the entire region of support at each iteration. Robustness is demonstrated through its performance in a noisy environment, and its performance is compared to the least-squares algorithm developed by Pritt","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123184287","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627007
A. Ahmed, S. Reaz, Mohammed Atiquzzaman, S. Fu
Domain name system (DNS) maps domain names to IP addresses in the Internet. DNS can, however, be used as a location manager (LM) for mobility management in wireless mobile networks. The suitability and performance of DNS as a LM for locating mobile hosts (MH) has not been studied in the past. In this paper, we develop an analytical model to measure the performance of DNS as LM for IP diversity based mobility management. We have used success rate, which takes into account the radius of the subnet, the residence time of a MH in a subnet, velocity of MH, network latency, DNS processing delay and the overlapping distance between two neighboring subnets as performance measures. Our analysis shows that for a reasonable overlap between cells, DNS can serve as a LM with very high success rate even under high network latency
DNS (Domain name system)将域名映射到Internet中的IP地址。但是，DNS可以用作无线移动网络中移动管理的位置管理器(LM)。DNS作为LM定位移动主机(MH)的适用性和性能在过去还没有研究。在本文中，我们开发了一个分析模型来衡量DNS作为基于IP多样性的移动性管理的LM的性能。我们使用了成功率，它考虑了子网的半径、MH在子网中的停留时间、MH的速度、网络延迟、DNS处理延迟和两个相邻子网之间的重叠距离作为性能指标。我们的分析表明，对于单元之间的合理重叠，即使在高网络延迟下，DNS也可以作为LM，成功率非常高
{"title":"Performance of DNS as location manager","authors":"A. Ahmed, S. Reaz, Mohammed Atiquzzaman, S. Fu","doi":"10.1109/EIT.2005.1627007","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627007","url":null,"abstract":"Domain name system (DNS) maps domain names to IP addresses in the Internet. DNS can, however, be used as a location manager (LM) for mobility management in wireless mobile networks. The suitability and performance of DNS as a LM for locating mobile hosts (MH) has not been studied in the past. In this paper, we develop an analytical model to measure the performance of DNS as LM for IP diversity based mobility management. We have used success rate, which takes into account the radius of the subnet, the residence time of a MH in a subnet, velocity of MH, network latency, DNS processing delay and the overlapping distance between two neighboring subnets as performance measures. Our analysis shows that for a reasonable overlap between cells, DNS can serve as a LM with very high success rate even under high network latency","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115341321","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627018
D. Socek, S. Magliveras
We propose and analyze a new type of cryptographic scheme, which extends principles of secret sharing to Morse code-like audio signals. The proposed "audio cryptography scheme" (ACS) is perfectly secure and easy to implement. It relies on the human auditory system for decoding. "Audio sharing schemes" (ASS) proposed earlier were based on disguising secret binary message with a cover sound. Moreover, only 2-out-of-n audio sharing schemes have ever been proposed. Our scheme correlates strongly, and is analogous to schemes in well-studied visual cryptography. Consequently, we were able to use the existing visual cryptography constructions and obtain not only k-out-of-n audio sharing schemes, but also the most general audio cryptography schemes for qualified subsets. In audio cryptography scheme for qualified subsets, a subset of participants can recover the secret audio signal only if some qualified subset of participants is its subset
{"title":"General access structures in audio cryptography","authors":"D. Socek, S. Magliveras","doi":"10.1109/EIT.2005.1627018","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627018","url":null,"abstract":"We propose and analyze a new type of cryptographic scheme, which extends principles of secret sharing to Morse code-like audio signals. The proposed \"audio cryptography scheme\" (ACS) is perfectly secure and easy to implement. It relies on the human auditory system for decoding. \"Audio sharing schemes\" (ASS) proposed earlier were based on disguising secret binary message with a cover sound. Moreover, only 2-out-of-n audio sharing schemes have ever been proposed. Our scheme correlates strongly, and is analogous to schemes in well-studied visual cryptography. Consequently, we were able to use the existing visual cryptography constructions and obtain not only k-out-of-n audio sharing schemes, but also the most general audio cryptography schemes for qualified subsets. In audio cryptography scheme for qualified subsets, a subset of participants can recover the secret audio signal only if some qualified subset of participants is its subset","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115062607","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626971
B. Gregoire, Robert C. Maher
In this paper we introduce the use of map-seeking circuits for auditory pattern detection and classification. A map-seeking circuit is a signal processing structure used to detect a desired feature in a mixture by iteratively transforming, superposing, and comparing the composite mixture with a pattern template. The result is a mapping between the template and the position of the matched feature in the mixture. The iterative detection process is inspired by the neural connections in the human visual system. A particularly important feature of map-seeking classification is that the search operates on an additive superposition of allowable transformations of the desired feature vector, giving a linear increase in computation with increasing image complexity, rather than a brute-force feature detection that increases in computation geometrically
{"title":"Harmonic envelope detection and amplitude estimation using map seeking circuits","authors":"B. Gregoire, Robert C. Maher","doi":"10.1109/EIT.2005.1626971","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626971","url":null,"abstract":"In this paper we introduce the use of map-seeking circuits for auditory pattern detection and classification. A map-seeking circuit is a signal processing structure used to detect a desired feature in a mixture by iteratively transforming, superposing, and comparing the composite mixture with a pattern template. The result is a mapping between the template and the position of the matched feature in the mixture. The iterative detection process is inspired by the neural connections in the human visual system. A particularly important feature of map-seeking classification is that the search operates on an additive superposition of allowable transformations of the desired feature vector, giving a linear increase in computation with increasing image complexity, rather than a brute-force feature detection that increases in computation geometrically","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125397418","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627001
H. Otu, Shakirahmed Kolia, Jon Jones, Osman Osman, T. Libermann, Beth Israel
In the post-genomic era, the availability of complete genome sequences has given rise to high throughput systems such as gene chips and protein arrays. These techniques revolutionize our understanding of biology by simultaneously probing thousands of biological entities at any given time. Unsupervised classification and clustering have emerged as important methods of analysis, which can be used to group samples with a similar molecular profile and/or molecules with a similar expression profile. However, techniques like hierarchical clustering, k-means, and self organizing maps (SOM) have been extensively used with little attention to the significance of their results. We propose a general method utilizing bootstrap technique to assign confidence levels to clustering results of high throughput biological data. We apply the proposed method to real genomics and proteomics data regarding Renal Cell Cancer (RCC), which is the most common malignancy of the adult kidney. We utilize protein profiles from IL-2 treatment responders and non-responders among metastatic RCC patients using surface-enhanced laser desorption/ionization time-of-flight mass spectrometry (SELDI TOF-MS). We also use gene expression data using Affymetrix HG-U133A chips for primary RCC tumors, inquiring the Union International Contre le Cancer's (UICC) TNM classification
{"title":"Significance analysis of clustering high throughput biological data","authors":"H. Otu, Shakirahmed Kolia, Jon Jones, Osman Osman, T. Libermann, Beth Israel","doi":"10.1109/EIT.2005.1627001","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627001","url":null,"abstract":"In the post-genomic era, the availability of complete genome sequences has given rise to high throughput systems such as gene chips and protein arrays. These techniques revolutionize our understanding of biology by simultaneously probing thousands of biological entities at any given time. Unsupervised classification and clustering have emerged as important methods of analysis, which can be used to group samples with a similar molecular profile and/or molecules with a similar expression profile. However, techniques like hierarchical clustering, k-means, and self organizing maps (SOM) have been extensively used with little attention to the significance of their results. We propose a general method utilizing bootstrap technique to assign confidence levels to clustering results of high throughput biological data. We apply the proposed method to real genomics and proteomics data regarding Renal Cell Cancer (RCC), which is the most common malignancy of the adult kidney. We utilize protein profiles from IL-2 treatment responders and non-responders among metastatic RCC patients using surface-enhanced laser desorption/ionization time-of-flight mass spectrometry (SELDI TOF-MS). We also use gene expression data using Affymetrix HG-U133A chips for primary RCC tumors, inquiring the Union International Contre le Cancer's (UICC) TNM classification","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130180355","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627022
Xutao Deng, H. Ali
Accurate gene assembly and precise exon annotations are two of the key goals of human genome project. Existing gene reference sequences and exon annotations are far from perfection. This paper introduces a new greedy algorithm which makes use of mRNA reference sequence and BLAST tools from NCBI (National Center for Biotechnology Information) to effectively assemble and annotate gene structures. Four pipelined components are included in this approach. 1. Blast parser: extract mRNA-DNA local alignment pairs. 2. Chain finder: transform local alignments to spliced alignment. 3. Assembler: assemble multiple DNA sequences into a continuous DNA sequence based on their spliced alignments with a given mRNA sequence. 4. Annotator: resolve exon-intron boundary based on splicing signals. Test results on one sample set of human genes show that gene assembly and exon annotation using the proposed approach is significantly better than contig references from NCBI. The software is available upon request
精确的基因组装和精确的外显子注释是人类基因组计划的两个关键目标。现有的基因参考序列和外显子注释还远远不够完善。本文介绍了一种利用NCBI (National Center for Biotechnology Information)的mRNA参考序列和BLAST工具有效组装和注释基因结构的贪心算法。该方法包含四个流水线组件。1. Blast解析器:提取mRNA-DNA局部比对。2. 寻链器:将局部对齐转换为拼接对齐。3.组装:根据多个DNA序列与给定mRNA序列的剪接比对，将多个DNA序列组装成连续的DNA序列。4. 注释器:基于剪接信号解析外显子-内含子边界。对一个人类基因样本集的测试结果表明，使用该方法进行基因组装和外显子注释的效果明显优于NCBI的contig参考文献。该软件可应要求提供
{"title":"A computational approach for gene assembly and exon annotation based on BLAST","authors":"Xutao Deng, H. Ali","doi":"10.1109/EIT.2005.1627022","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627022","url":null,"abstract":"Accurate gene assembly and precise exon annotations are two of the key goals of human genome project. Existing gene reference sequences and exon annotations are far from perfection. This paper introduces a new greedy algorithm which makes use of mRNA reference sequence and BLAST tools from NCBI (National Center for Biotechnology Information) to effectively assemble and annotate gene structures. Four pipelined components are included in this approach. 1. Blast parser: extract mRNA-DNA local alignment pairs. 2. Chain finder: transform local alignments to spliced alignment. 3. Assembler: assemble multiple DNA sequences into a continuous DNA sequence based on their spliced alignments with a given mRNA sequence. 4. Annotator: resolve exon-intron boundary based on splicing signals. Test results on one sample set of human genes show that gene assembly and exon annotation using the proposed approach is significantly better than contig references from NCBI. The software is available upon request","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124141785","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1626962
S. Anumalla, B. Ramamurthy, D. Gosselin, M. Burbach
Groundwater resources are the principal source of drinking water for about 50 percent of the United States population. Groundwater resources in Nebraska are under increasing stress as there is a rapid growth in their usage. Water managers need more timely and accurate data to assess ground-water conditions to manage adverse situations such as drought and loss of pumpage in agriculture and domestic water supply. Currently groundwater researchers use stand-alone data logging equipment which is labor intensive and the method is not easily scalable if the number of logging locations increases. Commercially available real-time data monitoring solutions are either prohibitively costly or highly inflexible. In this paper, we present a design for a groundwater monitoring system based on a network of wirelessly-linked pressure sensors. The proposed solution will enable groundwater researchers and decision makers to have quick access to the groundwater data with less effort and cost. Though our design is initially meant for groundwater monitoring, it can be easily adapted to other fields of environmental monitoring
{"title":"Ground water monitoring using smart sensors","authors":"S. Anumalla, B. Ramamurthy, D. Gosselin, M. Burbach","doi":"10.1109/EIT.2005.1626962","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626962","url":null,"abstract":"Groundwater resources are the principal source of drinking water for about 50 percent of the United States population. Groundwater resources in Nebraska are under increasing stress as there is a rapid growth in their usage. Water managers need more timely and accurate data to assess ground-water conditions to manage adverse situations such as drought and loss of pumpage in agriculture and domestic water supply. Currently groundwater researchers use stand-alone data logging equipment which is labor intensive and the method is not easily scalable if the number of logging locations increases. Commercially available real-time data monitoring solutions are either prohibitively costly or highly inflexible. In this paper, we present a design for a groundwater monitoring system based on a network of wirelessly-linked pressure sensors. The proposed solution will enable groundwater researchers and decision makers to have quick access to the groundwater data with less effort and cost. Though our design is initially meant for groundwater monitoring, it can be easily adapted to other fields of environmental monitoring","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127425779","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627048
Jiazheng Shi, S. Reichenbach
This paper develops an approach for restoration of data from comprehensive two-dimensional gas chromatography (GCtimesGC), a powerful new technology for chemical separations. GCtimesGC restoration is required to separate coeluting (i.e., overlapping) peaks. The GCtimesGC process is modeled as a two-dimensional linear, shift-variant system, based on the properties of chemical compounds and gas chromatography. The model can account for nonhomogeneous peak shapes and separability of the two instrument columns. The restoration problem is formulated to minimize the difference between observed GCtimesGC data and an ideal separation, subject to the physically meaningful constraints: nonnegativity, volume preservation, and unimodality. The paper develops a constrained alternating least-squares (CALS) method for solving the restoration problem. Experimental results based on simulation and real GCtimesGC data indicate that the proposed model and CALS method perform well for GCtimesGC restoration
{"title":"Restoration for comprehensive two-dimensional gas chromatography","authors":"Jiazheng Shi, S. Reichenbach","doi":"10.1109/EIT.2005.1627048","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627048","url":null,"abstract":"This paper develops an approach for restoration of data from comprehensive two-dimensional gas chromatography (GCtimesGC), a powerful new technology for chemical separations. GCtimesGC restoration is required to separate coeluting (i.e., overlapping) peaks. The GCtimesGC process is modeled as a two-dimensional linear, shift-variant system, based on the properties of chemical compounds and gas chromatography. The model can account for nonhomogeneous peak shapes and separability of the two instrument columns. The restoration problem is formulated to minimize the difference between observed GCtimesGC data and an ideal separation, subject to the physically meaningful constraints: nonnegativity, volume preservation, and unimodality. The paper develops a constrained alternating least-squares (CALS) method for solving the restoration problem. Experimental results based on simulation and real GCtimesGC data indicate that the proposed model and CALS method perform well for GCtimesGC restoration","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126578401","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627017
B. Al-Salim
We developed a strategy to design a travel package with the most popular and appropriate elements for the traveler; at the same time, this strategy minimizes the operation and processing costs of the travel agency. Association rules as a data mining technique is implemented to develop this model. We rely on the available massive travel agency database to make essential decisions related to the optimality of designing the travel package. A heuristic algorithm is an approach used to solve the final model. An illustrative numerical example based on a made-up data set is also provided
{"title":"Data mining application in designing popular and optimal travel packages","authors":"B. Al-Salim","doi":"10.1109/EIT.2005.1627017","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627017","url":null,"abstract":"We developed a strategy to design a travel package with the most popular and appropriate elements for the traveler; at the same time, this strategy minimizes the operation and processing costs of the travel agency. Association rules as a data mining technique is implemented to develop this model. We rely on the available massive travel agency database to make essential decisions related to the optimality of designing the travel package. A heuristic algorithm is an approach used to solve the final model. An illustrative numerical example based on a made-up data set is also provided","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122296089","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}
Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627046
F. M. Vallina, E. Oruklu, J. Saniie
This paper introduces a set of rules and guidelines for the implementation of a distributed processing network (DPN) as the basis for a dynamic reconfigurable architecture targeted at improving the performance of microprocessor (muP) based systems in computationally intensive application domains. In order to provide the computation gains needed to improve upon the performance of the muP, the DPN architecture offers: 1) A low reconfiguration overhead, 2) A simple control interface, 3) Dynamic resource allocation, 4) Concurrent execution with dynamic reconfiguration, 5) Lower power dissipation than a muP executing the same computation kernel and, 6) Scalability to tackle tasks of varying resource requirements. DPN is currently targeted at realtime computationally intensive application domains such as compression, and signal transformations
{"title":"Distributed processing network architecture for reconfigurable computing","authors":"F. M. Vallina, E. Oruklu, J. Saniie","doi":"10.1109/EIT.2005.1627046","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627046","url":null,"abstract":"This paper introduces a set of rules and guidelines for the implementation of a distributed processing network (DPN) as the basis for a dynamic reconfigurable architecture targeted at improving the performance of microprocessor (muP) based systems in computationally intensive application domains. In order to provide the computation gains needed to improve upon the performance of the muP, the DPN architecture offers: 1) A low reconfiguration overhead, 2) A simple control interface, 3) Dynamic resource allocation, 4) Concurrent execution with dynamic reconfiguration, 5) Lower power dissipation than a muP executing the same computation kernel and, 6) Scalability to tackle tasks of varying resource requirements. DPN is currently targeted at realtime computationally intensive application domains such as compression, and signal transformations","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128261765","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：