Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689005
B.A. Goh, D. McLernon
This paper presents a new analysis and synthesis filters design method for achieving nearly perfect reconstruction low group delay cosine-modulated filter bank (CMFB). The objective is to show how far we can reduce the overall group delay of this proposed CMFB by using this new analysis and synthesis filter prototypes. Simulation results show that the overall group delay of our proposed approach can be reduced to about 45% of the original CMFB group delay. In addition, the mean-square-error-reconstruction performance of our new method is also 3.9 dB superior compared to that for the original CMFB
提出了一种新的分析和合成滤波器设计方法，以实现近乎完美的重构低群延迟余弦调制滤波器组(CMFB)。目的是展示通过使用这种新的分析和合成滤波器原型，我们可以在多大程度上减少所提出的CMFB的整体群延迟。仿真结果表明，该方法可将整体群延迟降低到原CMFB群延迟的45%左右。此外，新方法的均方误差重建性能也比原始CMFB高3.9 dB
{"title":"Design of Nearly Perfect Reconstruction Low Group Delay Cosine-Modulated Filter Banks","authors":"B.A. Goh, D. McLernon","doi":"10.1109/ICICS.2005.1689005","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689005","url":null,"abstract":"This paper presents a new analysis and synthesis filters design method for achieving nearly perfect reconstruction low group delay cosine-modulated filter bank (CMFB). The objective is to show how far we can reduce the overall group delay of this proposed CMFB by using this new analysis and synthesis filter prototypes. Simulation results show that the overall group delay of our proposed approach can be reduced to about 45% of the original CMFB group delay. In addition, the mean-square-error-reconstruction performance of our new method is also 3.9 dB superior compared to that for the original CMFB","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129280618","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-12-06DOI: 10.1109/ICICS.2005.1689093
D. Ji, W. Yoo, Sangmoon Lee, S. Won
In this paper, we present a dynamic output feedback Hinfin receding horizon controller for uncertain systems with both norm bound uncertainty and disturbance using new parameter dependent Lyapunov function. This Lyapunov function is proposed to get a less conservative condition and guarantees both closed loop stability and the Hinfinnorm bound. The controller is obtained numerically from the output feedback Hinfin optimization problem, which is hardly solved analytically. The results are illustrated with numerical example
{"title":"Dynamic output feedback H∞receding horizon controller design for uncertain discrete-time system with parameter dependent Lyapunov function","authors":"D. Ji, W. Yoo, Sangmoon Lee, S. Won","doi":"10.1109/ICICS.2005.1689093","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689093","url":null,"abstract":"In this paper, we present a dynamic output feedback Hinfin receding horizon controller for uncertain systems with both norm bound uncertainty and disturbance using new parameter dependent Lyapunov function. This Lyapunov function is proposed to get a less conservative condition and guarantees both closed loop stability and the Hinfinnorm bound. The controller is obtained numerically from the output feedback Hinfin optimization problem, which is hardly solved analytically. The results are illustrated with numerical example","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128517231","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-12-06DOI: 10.1109/ICICS.2005.1689117
Lianggui Liu, G. Feng
Ant based routing protocols for MANETs have been widely explored, but most of them are essentially of single-path which tends to have heavy burden on the hosts along the shortest path from source to destination. The robustness of these protocols is comparatively not good which is further weakened by the positive feedback mechanism of ant. Node-disjoint multi-path routing is more robust and can support QoS better than single-path routing in MANETs. In this paper we combine swarm intelligence and node-disjoint multi-path routing to solve the problem mentioned above. A novel approach named Ant colony based Multi-path Routing (AMR) is proposed. AMR establishes and utilizes multiple routes of node-disjoint paths to send data packets concurrently and adopts pheromone to disperse communication traffic, thus it can adapt to the dynamic changes of the network and support QoS better. The simulation results show that the proposed approach outperforms other pertinent algorithms
{"title":"Swarm Intelligence Based Node-disjoint Multi-path Routing Protocol for Mobile Ad Hoc Networks","authors":"Lianggui Liu, G. Feng","doi":"10.1109/ICICS.2005.1689117","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689117","url":null,"abstract":"Ant based routing protocols for MANETs have been widely explored, but most of them are essentially of single-path which tends to have heavy burden on the hosts along the shortest path from source to destination. The robustness of these protocols is comparatively not good which is further weakened by the positive feedback mechanism of ant. Node-disjoint multi-path routing is more robust and can support QoS better than single-path routing in MANETs. In this paper we combine swarm intelligence and node-disjoint multi-path routing to solve the problem mentioned above. A novel approach named Ant colony based Multi-path Routing (AMR) is proposed. AMR establishes and utilizes multiple routes of node-disjoint paths to send data packets concurrently and adopts pheromone to disperse communication traffic, thus it can adapt to the dynamic changes of the network and support QoS better. The simulation results show that the proposed approach outperforms other pertinent algorithms","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122409511","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-12-06DOI: 10.1109/ICICS.2005.1689249
Zhigang Zhou, Xiaodong Zhang
An improved channel estimator with time delay tracking measurement for OFDM systems is proposed by exploiting the inherent correlation between the cyclic prefix and port of the received OFDM signal. This scheme make use of real time measured size of inter-symbol interference (ISI) free window to estimate the maximum delay spread of channel, then a transform domain channel estimator is adopted to further reduce the noise variance. Due to the ISI-free window can be estimated before the application of FFT to the received signal, it is a parallel processing, and very suitable for the practical systems. Simulation result demonstrated that the proposed method can track the variation of delay spread of wireless channel, and improve the MSE of channel estimation significantly, thus give at least 1-dB improvement in ITU PA3 channel and 0.5-dB in ITU PB3 channel
利用接收OFDM信号的循环前缀和端口之间的固有相关性，提出了一种改进的OFDM信道估计器。该方案利用实时测量的无码间干扰(ISI)窗口的大小来估计信道的最大延迟扩展，然后采用变换域信道估计器进一步减小噪声方差。由于在FFT应用于接收信号之前可以估计出无is窗口，因此它是一种并行处理，非常适合于实际系统。仿真结果表明，该方法能够跟踪无线信道的延迟扩展变化，显著提高信道估计的MSE，在ITU PA3信道中至少提高1 db，在ITU PB3信道中至少提高0.5 db
{"title":"Channel Estimator with Time Spread Tracking for OFDM systems","authors":"Zhigang Zhou, Xiaodong Zhang","doi":"10.1109/ICICS.2005.1689249","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689249","url":null,"abstract":"An improved channel estimator with time delay tracking measurement for OFDM systems is proposed by exploiting the inherent correlation between the cyclic prefix and port of the received OFDM signal. This scheme make use of real time measured size of inter-symbol interference (ISI) free window to estimate the maximum delay spread of channel, then a transform domain channel estimator is adopted to further reduce the noise variance. Due to the ISI-free window can be estimated before the application of FFT to the received signal, it is a parallel processing, and very suitable for the practical systems. Simulation result demonstrated that the proposed method can track the variation of delay spread of wireless channel, and improve the MSE of channel estimation significantly, thus give at least 1-dB improvement in ITU PA3 channel and 0.5-dB in ITU PB3 channel","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"53 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121162643","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-12-06DOI: 10.1109/ICICS.2005.1689194
V. Pirajnanchai, K. Janchitrapongvej, N. Panyanouvong
In many signal processing situations, filters must interface with the real world where the input and output signal take on continuous values functions of the continuous variable time. In this paper describes a new high frequency continuous-time high-pass filter. The filter is realized for converting an active distributed RC to a transistor-only high pass filter circuit. The frequency response of high-pass was examined by a MOSFET model. Preliminary experimental simulation results by PSpice programs for high frequency high-pass filter is presented
{"title":"High Frequency Active High-pass Filter used Distributed MOSFET","authors":"V. Pirajnanchai, K. Janchitrapongvej, N. Panyanouvong","doi":"10.1109/ICICS.2005.1689194","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689194","url":null,"abstract":"In many signal processing situations, filters must interface with the real world where the input and output signal take on continuous values functions of the continuous variable time. In this paper describes a new high frequency continuous-time high-pass filter. The filter is realized for converting an active distributed RC to a transistor-only high pass filter circuit. The frequency response of high-pass was examined by a MOSFET model. Preliminary experimental simulation results by PSpice programs for high frequency high-pass filter is presented","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127039808","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-12-06DOI: 10.1109/ICICS.2005.1689192
Shanying Wu, S. Hau, Y. Wong
Nonlinearity has long been recognized as a problem endemic in power amplifiers (PA) with a high power. Digital predistortion (DPD) is one of most effective method to solve this problem. In this paper we used nonlinear curve-fitting to perform digital predistortion. We applied our technique to a RF power amplifier that nominally operates at 885 MHz with 30 watts output. When the IS95 standard test signal is applied to the power amplifier with its output power pushed to 45 watts, we found that nonlinearity of power amplifiers can be greatly improved (8 dB in ACLR) by our technique. Experimental results demonstrate the success and the feasibility of this method
{"title":"The use of Nonlinear Curvefitting in Digital Predistortion for Linearizing RF Power Amplifiers","authors":"Shanying Wu, S. Hau, Y. Wong","doi":"10.1109/ICICS.2005.1689192","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689192","url":null,"abstract":"Nonlinearity has long been recognized as a problem endemic in power amplifiers (PA) with a high power. Digital predistortion (DPD) is one of most effective method to solve this problem. In this paper we used nonlinear curve-fitting to perform digital predistortion. We applied our technique to a RF power amplifier that nominally operates at 885 MHz with 30 watts output. When the IS95 standard test signal is applied to the power amplifier with its output power pushed to 45 watts, we found that nonlinearity of power amplifiers can be greatly improved (8 dB in ACLR) by our technique. Experimental results demonstrate the success and the feasibility of this method","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587441","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-12-06DOI: 10.1109/ICICS.2005.1689110
J. Hao, Gang Li
This paper deals with optimal state-space realizations of digital systems implemented with finite word length (FWL). A pole modulus sensitivity based stability related measure is derived and the optimal realizations are defined as those that maximize the proposed measure. Based on a polynomial operator approach, a new sparse realization is developed. This is a very efficient structure containing some free parameters which provide more degrees of freedom to reduce the FWL effects. The problem of finding optimal sparse realizations is solved. Two numerical examples are given to illustrate the design procedure and to compare the performance of different realizations
{"title":"An Efficient Structure for Finite Precision Implementation of Digital Systems","authors":"J. Hao, Gang Li","doi":"10.1109/ICICS.2005.1689110","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689110","url":null,"abstract":"This paper deals with optimal state-space realizations of digital systems implemented with finite word length (FWL). A pole modulus sensitivity based stability related measure is derived and the optimal realizations are defined as those that maximize the proposed measure. Based on a polynomial operator approach, a new sparse realization is developed. This is a very efficient structure containing some free parameters which provide more degrees of freedom to reduce the FWL effects. The problem of finding optimal sparse realizations is solved. Two numerical examples are given to illustrate the design procedure and to compare the performance of different realizations","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132626882","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-12-06DOI: 10.1109/ICICS.2005.1689195
Li Kang, Xiaohu Tang
In 2004, Chang et al. proposed a signature scheme without employing one-way hash functions and message redundancy schemes. Later, Zhang and Fu et al., presented the forgery attack on Chang's digital signature and claimed that message redundancy schemes should still be used to resist some attacks. In this letter, we will point out a fatal flaw of Chang's scheme and propose a new digital signature scheme, where neither one-way hash functions nor message redundancy schemes are used
{"title":"A New Digital Signature Scheme without One-Way Hash Functions and Message Redundancy","authors":"Li Kang, Xiaohu Tang","doi":"10.1109/ICICS.2005.1689195","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689195","url":null,"abstract":"In 2004, Chang et al. proposed a signature scheme without employing one-way hash functions and message redundancy schemes. Later, Zhang and Fu et al., presented the forgery attack on Chang's digital signature and claimed that message redundancy schemes should still be used to resist some attacks. In this letter, we will point out a fatal flaw of Chang's scheme and propose a new digital signature scheme, where neither one-way hash functions nor message redundancy schemes are used","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290074","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-12-06DOI: 10.1109/ICICS.2005.1689293
H. Thapliyal, M. Srinivas
In recent years, reversible logic has emerged as a promising computing paradigm having application in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper utilizes a new 4*4 reversible gate called TSG gate to build the components of a primitive reversible/quantum ALU. The most significant aspect of the TSG gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. A Novel reversible 4:2 compressor is also designed from the TSG gate which is later used to design a novel 8times8 reversible Wallace tree multiplier. It is proved that the adder, 4:2 compressor and multiplier architectures designed using the TSG gate are better than their counterparts available in literature, in terms of number of reversible gates and garbage outputs. This is perhaps, the first attempt to design a reversible 4:2 compressor and a reversible Wallace tree multiplier as far as existing literature and our knowledge is concerned. Thus, this paper provides an initial threshold to build more complex systems which can execute complicated operations using reversible logic
{"title":"Novel Reversible `TSG' Gate and Its Application for Designing Components of Primitive Reversible/Quantum ALU","authors":"H. Thapliyal, M. Srinivas","doi":"10.1109/ICICS.2005.1689293","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689293","url":null,"abstract":"In recent years, reversible logic has emerged as a promising computing paradigm having application in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper utilizes a new 4*4 reversible gate called TSG gate to build the components of a primitive reversible/quantum ALU. The most significant aspect of the TSG gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. A Novel reversible 4:2 compressor is also designed from the TSG gate which is later used to design a novel 8times8 reversible Wallace tree multiplier. It is proved that the adder, 4:2 compressor and multiplier architectures designed using the TSG gate are better than their counterparts available in literature, in terms of number of reversible gates and garbage outputs. This is perhaps, the first attempt to design a reversible 4:2 compressor and a reversible Wallace tree multiplier as far as existing literature and our knowledge is concerned. Thus, this paper provides an initial threshold to build more complex systems which can execute complicated operations using reversible logic","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133715577","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-12-06DOI: 10.1109/ICICS.2005.1689216
K. Hyun, D. Yoon, Ki Seol Kim, Lei Wang, Sang Kyu
In this paper, we present a simple and general bitwise decomposition expression using log likelihood ratio (LLR) of an arbitrary gray coded rectangular M-QAM signal. Based on the max-log MAP algorithm, we replace the mathematical max or min functions of the conventional LLR expression with simple arithmetic functions associated with given parameters such as a received symbol value and distance between symbols on a signal space. Since the derived LLR expression can be used as a soft bit metric for input to a conventional binary turbo decoder, it is suitable for practical applications with a turbo decoder or other related applications as an alternative to conventional methods
{"title":"Bitwise Decomposition of M-QAM Signals","authors":"K. Hyun, D. Yoon, Ki Seol Kim, Lei Wang, Sang Kyu","doi":"10.1109/ICICS.2005.1689216","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689216","url":null,"abstract":"In this paper, we present a simple and general bitwise decomposition expression using log likelihood ratio (LLR) of an arbitrary gray coded rectangular M-QAM signal. Based on the max-log MAP algorithm, we replace the mathematical max or min functions of the conventional LLR expression with simple arithmetic functions associated with given parameters such as a received symbol value and distance between symbols on a signal space. Since the derived LLR expression can be used as a soft bit metric for input to a conventional binary turbo decoder, it is suitable for practical applications with a turbo decoder or other related applications as an alternative to conventional methods","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615114","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
扫码关注我们
求助内容：
应助结果提醒方式：