Pub Date : 2005-12-06DOI: 10.1109/ICICS.2005.1689304
S. Xie, Z. Gu, S. Rahardja, J. C. Wong, Y. Xin
The performance of a direct-sequence code division multiple access (DS-CDMA) system is largely dependent on the correlation properties of the spreading sequences in use. Given a set of sequences, it is thus important to select an appropriate subset for optimal performance. In this paper, two new selection criteria of sequence subsets are given for synchronous and asynchronous DS-CDMA systems over multipath fading channels respectively when the multipath intensity profiles (MIP) are known. Simulation results show that subsets of sequences based on the proposed selection criteria can provide better bit-error rate (BER) performance than those based on the existing mean-square correlation selection criteria
{"title":"Selection of Spreading Sequence Subsets for DS-CDMA Systems over Multipath Channels","authors":"S. Xie, Z. Gu, S. Rahardja, J. C. Wong, Y. Xin","doi":"10.1109/ICICS.2005.1689304","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689304","url":null,"abstract":"The performance of a direct-sequence code division multiple access (DS-CDMA) system is largely dependent on the correlation properties of the spreading sequences in use. Given a set of sequences, it is thus important to select an appropriate subset for optimal performance. In this paper, two new selection criteria of sequence subsets are given for synchronous and asynchronous DS-CDMA systems over multipath fading channels respectively when the multipath intensity profiles (MIP) are known. Simulation results show that subsets of sequences based on the proposed selection criteria can provide better bit-error rate (BER) performance than those based on the existing mean-square correlation selection criteria","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":"123548638","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.1689175
Mikko Löytynoja, N. Cvejic, Eeva Lähetkangas, Tapio Seppänen MediaTeam
The main application area for digital watermarking is copyright protection. We propose a method that increases the robustness of copyright protection watermarks by persuading users not to try attacking the watermark. The method embeds two watermarks into media; a robust one and fragile one. Copy protection information is embedded into the robust watermark. The fragile watermark contains some application specific information that the user do not want to lose. The fragile watermark is constructed so that it is destroyed, if the robust watermark is attacked. The proposed method is demonstrated with a audio encryption scenario that uses the mobile phone to play protected audio files. The audio decryption keys are embedded into the fragile watermark
{"title":"Audio Encryption Using Fragile Watermarking","authors":"Mikko Löytynoja, N. Cvejic, Eeva Lähetkangas, Tapio Seppänen MediaTeam","doi":"10.1109/ICICS.2005.1689175","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689175","url":null,"abstract":"The main application area for digital watermarking is copyright protection. We propose a method that increases the robustness of copyright protection watermarks by persuading users not to try attacking the watermark. The method embeds two watermarks into media; a robust one and fragile one. Copy protection information is embedded into the robust watermark. The fragile watermark contains some application specific information that the user do not want to lose. The fragile watermark is constructed so that it is destroyed, if the robust watermark is attacked. The proposed method is demonstrated with a audio encryption scenario that uses the mobile phone to play protected audio files. The audio decryption keys are embedded into the fragile watermark","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"382 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":"123350042","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.1689246
Bin Chen, S. Bose, W. Zhong
Handling low and medium speed traffic flows using cost-effective traffic grooming strategies is becoming increasingly important for the efficient operation of WDM networks. In this paper, we apply the saturated cut method to routing sub-wavelength multicast traffic in reconfigurable, unicast, mesh WDM networks. Simulations show that setting up lightpaths for the saturated cut significantly improves network-blocking performance
{"title":"Applying Saturated Cut Method in Dynamic Multicast Traffic Grooming in IP/MPLS over WDM Mesh Networks","authors":"Bin Chen, S. Bose, W. Zhong","doi":"10.1109/ICICS.2005.1689246","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689246","url":null,"abstract":"Handling low and medium speed traffic flows using cost-effective traffic grooming strategies is becoming increasingly important for the efficient operation of WDM networks. In this paper, we apply the saturated cut method to routing sub-wavelength multicast traffic in reconfigurable, unicast, mesh WDM networks. Simulations show that setting up lightpaths for the saturated cut significantly improves network-blocking performance","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"8 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":"130007393","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.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.1689261
P. Meher
A common computing-core representation of the discrete cosine transform and discrete sine transform is derived, and a reduced-complexity algorithm is developed for computation of the proposed common computing-core. A parallel architecture based on the principle of distributed arithmetic is designed further for computation of these transforms using the common-core algorithm. The proposed scheme not only leads to a systolic-like, fully-pipelined regular and modular hardware for computing the these transforms, but also offers significant saving of hardware over the existing structures having nearly the same computational throughput. The proposed structure is devoid of complicated input/output mapping and does not involve any complex control structure. Moreover, it does not have restriction on the transform-length, and can be utilized as a reusable core for cost-effective, high-throughput implementation of either of these transforms
{"title":"Unified DA-based Parallel Architecture for Computing the DCT and the DST","authors":"P. Meher","doi":"10.1109/ICICS.2005.1689261","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689261","url":null,"abstract":"A common computing-core representation of the discrete cosine transform and discrete sine transform is derived, and a reduced-complexity algorithm is developed for computation of the proposed common computing-core. A parallel architecture based on the principle of distributed arithmetic is designed further for computation of these transforms using the common-core algorithm. The proposed scheme not only leads to a systolic-like, fully-pipelined regular and modular hardware for computing the these transforms, but also offers significant saving of hardware over the existing structures having nearly the same computational throughput. The proposed structure is devoid of complicated input/output mapping and does not involve any complex control structure. Moreover, it does not have restriction on the transform-length, and can be utilized as a reusable core for cost-effective, high-throughput implementation of either of these transforms","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":"130288054","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.1689137
S. Tansuriyavong, T. Suzuki, M. Takeda, M. Iwahashi
This paper aims at extracting human region based on the multi-resolution expression of wavelet transform technique, and also creating transparent image of person based on bit-plane encoding technique, which both techniques are a constituent technology of JPEG2000. The purpose of using these techniques is to reduce the computational cost and data transfer bit rate. We developed the privacy conscious video communication system by using these techniques. In this system, the persons who stay far from the camera at the sending site are displayed as a high-transparent person at the receiving site, in order to protect their privacy
{"title":"Development of a Privacy Conscious Video Communication System Using JPEG2000 Technology","authors":"S. Tansuriyavong, T. Suzuki, M. Takeda, M. Iwahashi","doi":"10.1109/ICICS.2005.1689137","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689137","url":null,"abstract":"This paper aims at extracting human region based on the multi-resolution expression of wavelet transform technique, and also creating transparent image of person based on bit-plane encoding technique, which both techniques are a constituent technology of JPEG2000. The purpose of using these techniques is to reduce the computational cost and data transfer bit rate. We developed the privacy conscious video communication system by using these techniques. In this system, the persons who stay far from the camera at the sending site are displayed as a high-transparent person at the receiving site, in order to protect their privacy","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"11 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":"125570417","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.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.1689087
Chunbo Ma, Dake He, Jun Ao
When some one wants to sign a message for a designated group in distributed networks, he can sign the message one by one for each member in designated group, but the efficiency is very low. In this paper, we propose a new type of signature, broadcast group oriented signature, to make the signer easier. The signature has the properties: is easy to manage public keys; has no characteristic of key escrow; nobody outside the designated group can verify the signature. The signature is very fit for the condition that the signer only has limited computational resource or bandwidth and each member in designated group is asked to independently verify the signature
{"title":"Broadcast Group Oriented Signature","authors":"Chunbo Ma, Dake He, Jun Ao","doi":"10.1109/ICICS.2005.1689087","DOIUrl":"https://doi.org/10.1109/ICICS.2005.1689087","url":null,"abstract":"When some one wants to sign a message for a designated group in distributed networks, he can sign the message one by one for each member in designated group, but the efficiency is very low. In this paper, we propose a new type of signature, broadcast group oriented signature, to make the signer easier. The signature has the properties: is easy to manage public keys; has no characteristic of key escrow; nobody outside the designated group can verify the signature. The signature is very fit for the condition that the signer only has limited computational resource or bandwidth and each member in designated group is asked to independently verify the signature","PeriodicalId":425178,"journal":{"name":"2005 5th International Conference on Information Communications & Signal Processing","volume":"180 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":"114530319","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
扫码关注我们
求助内容：
应助结果提醒方式：