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

2007 International Symposium on Signals, Circuits and Systems最新文献

筛选
英文 中文
ΔΣ ADC Design Considerations for WiFi/WiMAX Receivers ΔΣ WiFi/WiMAX接收机的ADC设计注意事项
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292644
P. Malla, H. Lakdawala, R. Naiknaware, S. Krishnamurthy, K. Kornegay
{"title":"ΔΣ ADC Design Considerations for WiFi/WiMAX Receivers","authors":"P. Malla, H. Lakdawala, R. Naiknaware, S. Krishnamurthy, K. Kornegay","doi":"10.1109/ISSCS.2007.4292644","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292644","url":null,"abstract":"Modern multi-standard receivers in deep-submicron technologies pose significant design challenges on the analog baseband. Moving this analog filtering to the digital domain simplifies the design, yielding a process-scalable implementation. However, analog-to-digital converter (ADC) specifications now become more stringent and must be obtained by comprehending the standard and the system. Assuming a receiver NF of 5.96dB and SNR degradation of 0.36dB by the ADC, the proposed dual-mode WiFi/WiMAX receiver attains an input sensitivity of -74dBm (20MHz channel bandwidth). To accommodate the high dynamic range and the anti-alias rejection needed for the system, a Delta-Sigma (ΔΣ) ADC is proposed. Single-loop and Multi-Stage Noise-Shaping (MASH) architectures that achieve a SNR of 69dB at a low oversampling ratio (OSR) of 8 for a conversion bandwidth of 40MHz (108Mbps, OFDM) are investigated. Based on the important insights from this analysis on thermal noise, harmonic distortion, and power tradeoffs, an optimal ΔΣ ADC design is proposed.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115648858","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}
引用次数: 0
Software Control for PWMA (Angular Pulse Width Modulation) 角脉宽调制(PWMA)的软件控制
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292754
C. Aghion, O. Ursaru, M. Lucanu, L. Dimitriu, L. Vornicu
{"title":"Software Control for PWMA (Angular Pulse Width Modulation)","authors":"C. Aghion, O. Ursaru, M. Lucanu, L. Dimitriu, L. Vornicu","doi":"10.1109/ISSCS.2007.4292754","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292754","url":null,"abstract":"This paper describes a software control method using the equations of PWMA modulation to command a three-phase inverter.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115701965","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}
引用次数: 2
Object Simplification Using a Skeleton-Based Weight Function 使用基于骨架的权重函数简化对象
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292727
A. Hajdu, C. Giamas, I. Pitas
{"title":"Object Simplification Using a Skeleton-Based Weight Function","authors":"A. Hajdu, C. Giamas, I. Pitas","doi":"10.1109/ISSCS.2007.4292727","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292727","url":null,"abstract":"In this paper, we present a novel method for template simplification, where the template is used to find interesting objects within an image. In this way, we improve computational performance since less template points are matched using a simplified template. Moreover, we increase the reliability of the matching as we keep template points with focusing on the main shape behavior (skeleton) of the template. The theoretical background of the simplification is derived through the centroidal Voronoi tessellation framework. The efficiency of the proposed approach is demonstrated with detecting human appearance in thermal images.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115743926","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
B-spline and Wavelet Based Techniques for Iris Recognition 基于b样条和小波的虹膜识别技术
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292748
S. Emerich, A. Discant, E. Lupu, S. Demea
{"title":"B-spline and Wavelet Based Techniques for Iris Recognition","authors":"S. Emerich, A. Discant, E. Lupu, S. Demea","doi":"10.1109/ISSCS.2007.4292748","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292748","url":null,"abstract":"Over recent years, applications of wavelet analysis are widespread and cover many fields of scientific research including biomedical science. We propose an iris classification method based on wavelet techniques. The fundamental theory for iris identification rests on the premise that every iris is individually characteristic enough to distinguish it from others through image analysis. In our study we are using different wavelet and scaling functions, including the recent discovered family of fractional B-splines. To perform the classification task we use the Weka system.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116650769","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
Performance of RAKE Reception with Decision Aided Channel Estimation Using the UMTS P-CPICH 基于UMTS P-CPICH决策辅助信道估计的RAKE接收性能
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292792
M. Ionescu, S. Halunga, O. Fratu
{"title":"Performance of RAKE Reception with Decision Aided Channel Estimation Using the UMTS P-CPICH","authors":"M. Ionescu, S. Halunga, O. Fratu","doi":"10.1109/ISSCS.2007.4292792","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292792","url":null,"abstract":"A decision aided (DA) scheme is proposed in order to estimate the complex channel coefficients (needed for coherent combining in a RAKE receiver) using the UMTS downlink primary common pilot channel (P-CPICH). Thus, the rough estimates resulted after descrambling the corresponding signal are further refined by way of the above mentioned DA scheme. Monte Carlo simulations are carried out to comparatively assess the performance of maximal ratio combining (MRC) and equal gain combining (EGC) RAKE reception, underlining the optimal choice of DA parameters.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220766","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
An Investigation of Complex Triangle Elimination Problem of VLSI Floor Planning Employing Genetic Algorithmic Scheme 基于遗传算法的VLSI平面规划复杂三角消除问题研究
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292672
R. Mishra, B. Sahana, Sukes Maiti, S. Samaddar
{"title":"An Investigation of Complex Triangle Elimination Problem of VLSI Floor Planning Employing Genetic Algorithmic Scheme","authors":"R. Mishra, B. Sahana, Sukes Maiti, S. Samaddar","doi":"10.1109/ISSCS.2007.4292672","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292672","url":null,"abstract":"This paper provides a scheme based on genetic algorithm (GA) to solve the complex triangle elimination (CTE) problem of rectangular dualization approach in VLSI floor planning. Rectangular dualization, where each module is realized as a rectangular area, is an important approach in VLSI floor planning. It is known that if the input adjacency graph contains a complex triangle (CT), i.e. a cycle of three edges that is not a face, and then its rectangular dual does not exists. Elimination of CTs therefore becomes essential before constructing a floor plan. There are two versions of the CTE problems -weighted and unweighted adjacency graphs. The weighted CTE problem is known to be NP-complete (Sun, 1993). Recently it has been proved that unweighted problem is also NP-complete. In this paper we present a genetic algorithmic scheme to solve unweighted CTE problem and weighted CTE problem.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130387","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}
引用次数: 0
Improved RSA Encryption Algorithm for Increased Security of Wireless Networks 改进的RSA加密算法提高无线网络的安全性
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292737
Mircea Frunza, L. Scripcariu, Gh. Asachi
{"title":"Improved RSA Encryption Algorithm for Increased Security of Wireless Networks","authors":"Mircea Frunza, L. Scripcariu, Gh. Asachi","doi":"10.1109/ISSCS.2007.4292737","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292737","url":null,"abstract":"The RSA algorithm proposed by Rivest, Shamir and Adleman as a public key cryptosystem is used in different communication networks in order to ensure data confidentiality. Different weaknesses of this algorithm could be observed and many attacks against it are developed successfully. Improving this algorithm was performed in this paper in order to ensure a higher data security and an increased computing process speed. We propose an optimized encryption method which may be associated with the RSA key generation mechanism. The proposed method is based on a detailed analysis of the algebraic finite fields (AFF). The improved algorithm can be implemented on new generation networks (second generation networks and so on) and applies to wireless networks with Bluetooth devices which need an increased security by enlargement of the utilization area. In the same time, we have used a maximum acceptable length encryption key and algorithm complexity, which increases the computing speed and security degree, but allows the processor to work properly.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191150","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}
引用次数: 25
On Symmetry Properties of Distributed Resistive Structures 分布电阻结构的对称性
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292675
A. Manolescu, A. Manolescu
{"title":"On Symmetry Properties of Distributed Resistive Structures","authors":"A. Manolescu, A. Manolescu","doi":"10.1109/ISSCS.2007.4292675","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292675","url":null,"abstract":"In this paper we present some results obtained in the study of symmetry properties of resistive distributed microelectronic structures. Although these structures present many properties similar with those obtained using classical lumped resistive networks, some specific aspects based on their bidimensional structure are studied. A very particular case, named 'complete symmetrical' structure introduced before is presented and its equivalent matrix parameters are computed based on its symmetry properties only. The results were used for comparison with the results already obtained by authors in the analysis and synthesis of these structures. However these results are useful for comparison in other similar problems too.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940547","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}
引用次数: 2
On the Power Spectral Density of Chaotic Signals Generated by Skew Tent Maps 斜帐篷映射产生的混沌信号的功率谱密度
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292662
D. M. Kato, M. Eisencraft
{"title":"On the Power Spectral Density of Chaotic Signals Generated by Skew Tent Maps","authors":"D. M. Kato, M. Eisencraft","doi":"10.1109/ISSCS.2007.4292662","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292662","url":null,"abstract":"This paper investigates the characteristics of the Power Spectral Density (PSD) of chaotic orbits generated by skew tent maps. The influence of the Lyapunov exponent on the autocorrelation sequence and on the PSD is evaluated via computational simulations. We conclude that the essential bandwidth of these chaotic signals is strongly related to this exponent and they can be low-pass or high-pass depending on the parameter of the family. These results withstand the usual thought that chaotic signals are always broadband and provide a simple way of generating chaotic sequences with arbitrary bandwidth.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123765560","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}
引用次数: 10
A Compact Model of Submicron Channel MOS Transistor Transconductance for Analog Circuit Simulation 用于模拟电路仿真的亚微米通道MOS晶体管跨导的紧凑模型
2007 International Symposium on Signals, Circuits and Systems Pub Date : 2007-07-13 DOI: 10.1109/ISSCS.2007.4292673
G. Brezeanu, A. Sevcenco
{"title":"A Compact Model of Submicron Channel MOS Transistor Transconductance for Analog Circuit Simulation","authors":"G. Brezeanu, A. Sevcenco","doi":"10.1109/ISSCS.2007.4292673","DOIUrl":"https://doi.org/10.1109/ISSCS.2007.4292673","url":null,"abstract":"An analytical model to estimate the submicron MOS channel transconductance is presented. The model is continuous between conditions where velocity saturation can be either dominant or negligible, depending on the CMOS processes and bias voltages. New parameters are proposed for the description of the saturation velocity effects.","PeriodicalId":225101,"journal":{"name":"2007 International Symposium on Signals, Circuits and Systems","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116079","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
下一页 尾页
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学术官方微信