Pub Date : 2009-07-09DOI: 10.1109/ISSCS.2009.5206183
V. Rantala, T. Lehtonen, P. Liljeberg, J. Plosila
The topology level fault tolerance of Network-on-Chip (NoC) can be improved with multi network interface (multi-NI) architectures. Multi-NI NoC architectures are based on connecting at least two network interfaces on each core. The aim is to improve fault tolerance on the architectural level which means the delivery of packets even when there are faulty links or routers in the network. This paper presents architectures and algorithms for multi-NI NoCs. The analysis of the proposed architectures and algorithms shows that some of them improve the fault tolerance of NoC with a reasonable overhead by decreasing the average hop counts and keeping the cores connectable even in the case of faults. With a multi-NI architecture the number of successfully delivered packets has been even doubled.
{"title":"Multi network interface architectures for fault tolerant Network-on-Chip","authors":"V. Rantala, T. Lehtonen, P. Liljeberg, J. Plosila","doi":"10.1109/ISSCS.2009.5206183","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206183","url":null,"abstract":"The topology level fault tolerance of Network-on-Chip (NoC) can be improved with multi network interface (multi-NI) architectures. Multi-NI NoC architectures are based on connecting at least two network interfaces on each core. The aim is to improve fault tolerance on the architectural level which means the delivery of packets even when there are faulty links or routers in the network. This paper presents architectures and algorithms for multi-NI NoCs. The analysis of the proposed architectures and algorithms shows that some of them improve the fault tolerance of NoC with a reasonable overhead by decreasing the average hop counts and keeping the cores connectable even in the case of faults. With a multi-NI architecture the number of successfully delivered packets has been even doubled.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125184647","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206110
M. Andreica, N. Tapus
With the amount of available multimedia data increasing world-wide and with the expanding need for rapid access to this data, efficient data delivery has become a significant problem for which no fully satisfactory solutions have been provided, yet. A major issue is the concurrent usage of the same bottleneck network resources by multiple communication flows. In the case of multimedia streams, which consist of large volumes of data being transferred over usually long periods of time, and which require strict quality of service guarantees, this problem is even more acute. In this paper we present several decision support and optimization techniques for one of the most common types of solutions employed nowadays - advance resource reservations.
{"title":"Decision optimization techniques for efficient delivery of multimedia streams","authors":"M. Andreica, N. Tapus","doi":"10.1109/ISSCS.2009.5206110","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206110","url":null,"abstract":"With the amount of available multimedia data increasing world-wide and with the expanding need for rapid access to this data, efficient data delivery has become a significant problem for which no fully satisfactory solutions have been provided, yet. A major issue is the concurrent usage of the same bottleneck network resources by multiple communication flows. In the case of multimedia streams, which consist of large volumes of data being transferred over usually long periods of time, and which require strict quality of service guarantees, this problem is even more acute. In this paper we present several decision support and optimization techniques for one of the most common types of solutions employed nowadays - advance resource reservations.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131909088","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206106
Tomasz Patyk, Harri Hannula, P. Kellomaki, J. Takala
This paper presents a statistical approach of finding a set of optimum compiler options to minimize the energy consumption of the compiled executable. The method employs a statistical, non-parametric analysis, namely the Mann-Whitney test, to determine a set of options to be turned on and off for a particular source code. Energy measurements show that an improvement of up to 15% over the default optimization set up of the compiler can be achieved with this methodology.
{"title":"Energy consumption reduction by automatic selection of compiler options","authors":"Tomasz Patyk, Harri Hannula, P. Kellomaki, J. Takala","doi":"10.1109/ISSCS.2009.5206106","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206106","url":null,"abstract":"This paper presents a statistical approach of finding a set of optimum compiler options to minimize the energy consumption of the compiled executable. The method employs a statistical, non-parametric analysis, namely the Mann-Whitney test, to determine a set of options to be turned on and off for a particular source code. Energy measurements show that an improvement of up to 15% over the default optimization set up of the compiler can be achieved with this methodology.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134251615","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206219
P. Cristea, R. Tuduce
Nucleotide imbalance, nucleotide pair imbalance and 2D & 3D nucleotide paths of Nucleotide Genomic Signals (NuGSs) for several shared genes (coding) and control (non-coding) segments in the mitochondrial DNA of the hominidae family are presented in the paper. The common trend (reference) - offset representation for sets of related NuGSs is used to achieve a high resolution comparative analysis.
{"title":"Nucleotide Genomic Signal comparative analysis of homo sapiens and other hominidae mtDNA","authors":"P. Cristea, R. Tuduce","doi":"10.1109/ISSCS.2009.5206219","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206219","url":null,"abstract":"Nucleotide imbalance, nucleotide pair imbalance and 2D & 3D nucleotide paths of Nucleotide Genomic Signals (NuGSs) for several shared genes (coding) and control (non-coding) segments in the mitochondrial DNA of the hominidae family are presented in the paper. The common trend (reference) - offset representation for sets of related NuGSs is used to achieve a high resolution comparative analysis.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122893226","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}
This paper presents an analysis of the effect of duty ratio on power loss and efficiency of the Transcutaneous Energy Transmission System (TETS) with a Class-E power amplifier. Conduction loss for each component of the TETS circuit is derived and the total efficiency of the TETS is expressed as functions of the duty ratio D . Three identical TETS at D = 0.25 , 0.5 and 0.75 are designed, constructed and tested. The experimental results match closely with the calculated ones at the power loss and total efficiency.
{"title":"Power loss and efficiency of Transcutaneous Energy Transmission System with Class-E power amplifier at any duty ratio","authors":"Tian-liang Yang, Chun-yu Zhao, Jinying Zhang, Dayue Chen","doi":"10.1109/ISSCS.2009.5206221","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206221","url":null,"abstract":"This paper presents an analysis of the effect of duty ratio on power loss and efficiency of the Transcutaneous Energy Transmission System (TETS) with a Class-E power amplifier. Conduction loss for each component of the TETS circuit is derived and the total efficiency of the TETS is expressed as functions of the duty ratio D . Three identical TETS at D = 0.25 , 0.5 and 0.75 are designed, constructed and tested. The experimental results match closely with the calculated ones at the power loss and total efficiency.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115788939","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206138
L. Trifina, V. Munteanu, D. Tarniceriu
Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to interleavers proposed by Takeshita in [1]. The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Ω′ metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for various lengths show the efficiency of the proposed methods.
{"title":"Two methods to increase the minimum distance for turbo codes with QPP interleavers","authors":"L. Trifina, V. Munteanu, D. Tarniceriu","doi":"10.1109/ISSCS.2009.5206138","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206138","url":null,"abstract":"Two search methods of quadratic permutation polynomials (QPP) for interleavers used in turbo codes are proposed. These methods lead to larger minimum distances and smaller multiplicities compared to interleavers proposed by Takeshita in [1]. The search is accomplished in a limited set of polynomials, that is, those for which the spreading factor and Ω′ metric are maximum. The minimum distance is computed by means of Garello algorithm in which the maximum weight of information sequence is 3 or 4, reducing the search time. The results obtained for various lengths show the efficiency of the proposed methods.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132086925","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206164
V. Munteanu, D. Tarniceriu, G. Zaharia
In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.
{"title":"Information quantities attached to M-ary antiuniform Huffman codes","authors":"V. Munteanu, D. Tarniceriu, G. Zaharia","doi":"10.1109/ISSCS.2009.5206164","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206164","url":null,"abstract":"In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133748001","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206173
A. Beirami, M. Takhti, H. Shamsi
In this paper, a multi-objective particle swarm optimization (PSO) algorithm is implemented to unveil trade-off margins of the CMOS two-stage op-amp. Power, area, slew rate, unity gain frequency (UGF) were used as objectives. Width and length of the gate of MOSFETS are free parameters. Simulation results reveal the design trade-off margins of the two-stage op-amp as expected theoretically.
{"title":"Extracting trade-off boundaries of CMOS two-stage op-amp using particle swarm optimization","authors":"A. Beirami, M. Takhti, H. Shamsi","doi":"10.1109/ISSCS.2009.5206173","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206173","url":null,"abstract":"In this paper, a multi-objective particle swarm optimization (PSO) algorithm is implemented to unveil trade-off margins of the CMOS two-stage op-amp. Power, area, slew rate, unity gain frequency (UGF) were used as objectives. Width and length of the gate of MOSFETS are free parameters. Simulation results reveal the design trade-off margins of the two-stage op-amp as expected theoretically.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121039866","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206207
G. Nenov, Vasia G. Stoyantcheva
Some results concerning differential relationships between transistor collector currents and the controlling currents in translinear circuits are presented. They are derived by introducing a nullor-diode model of bipolar transistor in the tranconductance matrix description of translinear circuits. Then the jacobian matrix of a circuit represents the influence of the controlling currents of the current sources onto the transistor external collector currents in a differential form. An example illustrates the approach described in the paper.
{"title":"On the sensitivity of translinear circuits","authors":"G. Nenov, Vasia G. Stoyantcheva","doi":"10.1109/ISSCS.2009.5206207","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206207","url":null,"abstract":"Some results concerning differential relationships between transistor collector currents and the controlling currents in translinear circuits are presented. They are derived by introducing a nullor-diode model of bipolar transistor in the tranconductance matrix description of translinear circuits. Then the jacobian matrix of a circuit represents the influence of the controlling currents of the current sources onto the transistor external collector currents in a differential form. An example illustrates the approach described in the paper.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117328532","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 : 2009-07-09DOI: 10.1109/ISSCS.2009.5206184
Ana-Elena Carbunaru, D. Coltuc, M. Jourlin, L. Frangu
This paper proposes a new descriptor for textures, obtained by an Independent Components Analysis (ICA) applied to image wavelet subbands. In certain conditions, ICA refines the wavelet multiband analysis. The descriptor, consisting in the independent components (ICs) distribution parameters, serves as basis for the textile image signature in a recognition application. By using the Kullback-Liebler divergence to compare the signatures, the textile images from a 30 jacquards databasis, were recognized with average rates ranging from 89 to 94%, depending on the analysis number of levels.
{"title":"A texture descriptor for textile image retrieval","authors":"Ana-Elena Carbunaru, D. Coltuc, M. Jourlin, L. Frangu","doi":"10.1109/ISSCS.2009.5206184","DOIUrl":"https://doi.org/10.1109/ISSCS.2009.5206184","url":null,"abstract":"This paper proposes a new descriptor for textures, obtained by an Independent Components Analysis (ICA) applied to image wavelet subbands. In certain conditions, ICA refines the wavelet multiband analysis. The descriptor, consisting in the independent components (ICs) distribution parameters, serves as basis for the textile image signature in a recognition application. By using the Kullback-Liebler divergence to compare the signatures, the textile images from a 30 jacquards databasis, were recognized with average rates ranging from 89 to 94%, depending on the analysis number of levels.","PeriodicalId":277587,"journal":{"name":"2009 International Symposium on Signals, Circuits and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115345690","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
扫码关注我们
求助内容：
应助结果提醒方式：