Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895657
K. Komatsu, H. Takata
In this paper we consider a nonlinear feedback control problem for stabilizing multidimensional nonlinear systems using a formal linearization method based on Taylor expansion. Our goal is to design a nonlinear feedback control which stabilizes the nonlinear system in wider region of state space with less restricted conditions. The single-input multidimensional nonlinear system is transformed into an approximated bilinear system with respect to a formal linearization function by a formal linearization method using Taylor expansion. Substituting the ordinary LQ control function to the bilinear terms, a linear system with respect to the formal linearization function is derived and a feedback control is obtained. Finally, we illustrate some simulations to verify our approach.
{"title":"Nonlinear feedback control of stabilization problem via formal linearization using Taylor expansion","authors":"K. Komatsu, H. Takata","doi":"10.1109/ISITA.2008.4895657","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895657","url":null,"abstract":"In this paper we consider a nonlinear feedback control problem for stabilizing multidimensional nonlinear systems using a formal linearization method based on Taylor expansion. Our goal is to design a nonlinear feedback control which stabilizes the nonlinear system in wider region of state space with less restricted conditions. The single-input multidimensional nonlinear system is transformed into an approximated bilinear system with respect to a formal linearization function by a formal linearization method using Taylor expansion. Substituting the ordinary LQ control function to the bilinear terms, a linear system with respect to the formal linearization function is derived and a feedback control is obtained. Finally, we illustrate some simulations to verify our approach.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131861","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895412
M. Ito, T. Shikama, A. Watanabe
We proposed the session distribution method as one of the multi GW selection methods. Based on the results of the simulation, we came to the conclusion that the TCP throughput becomes larger in the session distribution method compares with the session distribution method. As the next step, we are going to make the implementation of the session distribution method.
{"title":"A proposal of gateway decentralization method in wireless mesh networks and its evaluation","authors":"M. Ito, T. Shikama, A. Watanabe","doi":"10.1109/ISITA.2008.4895412","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895412","url":null,"abstract":"We proposed the session distribution method as one of the multi GW selection methods. Based on the results of the simulation, we came to the conclusion that the TCP throughput becomes larger in the session distribution method compares with the session distribution method. As the next step, we are going to make the implementation of the session distribution method.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"23 90","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132476967","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895386
N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, J.L. Walker
In this paper, the non-codeword errors was analyzed that occur during parallel, iterative decoding with the min-sum decoder. Recently, work has been done relating the min-sum decoder to the linear programming (LP) decoder via graph covers. The LP decoder recasts the problem of decoding as an optimization problem whose feasible set is a polytope defined by the parity-check matrix of a code. It was shown that LP decoding can be realized as a decoder operating on graph covers.
{"title":"Towards universal cover decoding","authors":"N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, J.L. Walker","doi":"10.1109/ISITA.2008.4895386","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895386","url":null,"abstract":"In this paper, the non-codeword errors was analyzed that occur during parallel, iterative decoding with the min-sum decoder. Recently, work has been done relating the min-sum decoder to the linear programming (LP) decoder via graph covers. The LP decoder recasts the problem of decoding as an optimization problem whose feasible set is a polytope defined by the parity-check matrix of a code. It was shown that LP decoding can be realized as a decoder operating on graph covers.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131329790","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895450
H. Kuwakado, M. Mori
This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.
{"title":"Multi-bit revocable network coding scheme for butterfly-like network","authors":"H. Kuwakado, M. Mori","doi":"10.1109/ISITA.2008.4895450","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895450","url":null,"abstract":"This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126357369","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895528
R. Martinez, R. Reyes, C. Cruz, M. Nakano, H. Pérez
A blind watermarking algorithm for digital video resilient to MPEG-2 compression combined with several attacks is proposed. The proposed algorithm embeds binary visually recognizable patterns, such as the owner's logotype, in the DWT domain of some randomly selected video frames. To increase the security, the watermark data is transformed into a noise-like pattern by using a chaotic mixing method before the embedding process. The main advantage of the proposed algorithm is its simplicity, blindness and robustness. Extensive simulations show the watermark imperceptibility and robustness against several video degradations and other combined attacks. These results also show that the extracted watermark data from the watermarked video sequences using the proposed blind scheme is enough clear even after several attacks.
{"title":"A DWT-based Video watermarking scheme resilient to MPEG-2 compression and collusion attacks","authors":"R. Martinez, R. Reyes, C. Cruz, M. Nakano, H. Pérez","doi":"10.1109/ISITA.2008.4895528","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895528","url":null,"abstract":"A blind watermarking algorithm for digital video resilient to MPEG-2 compression combined with several attacks is proposed. The proposed algorithm embeds binary visually recognizable patterns, such as the owner's logotype, in the DWT domain of some randomly selected video frames. To increase the security, the watermark data is transformed into a noise-like pattern by using a chaotic mixing method before the embedding process. The main advantage of the proposed algorithm is its simplicity, blindness and robustness. Extensive simulations show the watermark imperceptibility and robustness against several video degradations and other combined attacks. These results also show that the extracted watermark data from the watermarked video sequences using the proposed blind scheme is enough clear even after several attacks.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538549","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895620
T. Sakai, K. Shibata
This study shows a new algorithm for distance spectrum (DS) estimation of turbo codes. We propose fundamental error event whose intervals of the consecutive two non zero inputs are less than the fundamental period. The DS is recursively estimated by some consecutive zero inputs with length of the fundamental period and the combination of fundamental error events. The proposed method also reduces the complexity of the calculation of codeword weight by looking up the tables of the number of weights and state transition instead of traversing over the trellis diagram.
{"title":"A distance spectrum estimation method of turbo codes","authors":"T. Sakai, K. Shibata","doi":"10.1109/ISITA.2008.4895620","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895620","url":null,"abstract":"This study shows a new algorithm for distance spectrum (DS) estimation of turbo codes. We propose fundamental error event whose intervals of the consecutive two non zero inputs are less than the fundamental period. The DS is recursively estimated by some consecutive zero inputs with length of the fundamental period and the combination of fundamental error events. The proposed method also reduces the complexity of the calculation of codeword weight by looking up the tables of the number of weights and state transition instead of traversing over the trellis diagram.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637713","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895438
K. Takeuchi, M. Vehkapera, T. Tanaka, R. Muller
We derive asymptotic upper bounds of the performance of a one-shot MMSE multiuser detector (MUD) and an optimal MUD in frequency-selective fading DS-CDMA channels with imperfect CSI at the receiver, using the replica method. We find that the performance bound of the one-shot MMSE MUD is indistinguishable from the performance of the one-shot LMMSE MUD analyzed by Evans and Tse when signal-to-noise ratio is high and the system load is small, and that the performance gap between the optimal MUD and the one-shot LMMSE MUD is also small on the same conditions.
{"title":"Asymptotic performance bounds of joint channel estimation and multiuser detection in frequency-selective fading DS-CDMA channels","authors":"K. Takeuchi, M. Vehkapera, T. Tanaka, R. Muller","doi":"10.1109/ISITA.2008.4895438","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895438","url":null,"abstract":"We derive asymptotic upper bounds of the performance of a one-shot MMSE multiuser detector (MUD) and an optimal MUD in frequency-selective fading DS-CDMA channels with imperfect CSI at the receiver, using the replica method. We find that the performance bound of the one-shot MMSE MUD is indistinguishable from the performance of the one-shot LMMSE MUD analyzed by Evans and Tse when signal-to-noise ratio is high and the system load is small, and that the performance gap between the optimal MUD and the one-shot LMMSE MUD is also small on the same conditions.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"7 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114040542","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895493
Jiun-Je Jian, Hsuan-Jung Su, Hsueh-Jyh Li
We address the problem of multiple-input multiple-output (MIMO) relay design for multiple distributed source and destination pairs with signal-to-interference-plus-noise-ratio (SINR) constraints. Multiple link pairs communicating through a relay can be beneficial in the wireless digital home network (DHN) scenario where various equipments exchange or share digital media contents. In the first hop from the source nodes to the relay, cooperative transmit-receive beamforming design is performed to maximize SINR at the relay. Then joint power allocation and transmit-receive beamforming is conducted in the second hop from the relay to the destination nodes based on the SINR constraints for each link pair. The beamforming filter is a group maximum SINR filter which exploits intra-group cooperation. The group-based uplink-downlink duality property in downlink channel is adopted and modified for amplify-and-forward (AF) relaying. An iterative algorithm is then proposed to solve the problem. Simulation results show the superiority of the proposed algorithm over other methods.
{"title":"MIMO relay design for multiple link pairs based on SINR constraints","authors":"Jiun-Je Jian, Hsuan-Jung Su, Hsueh-Jyh Li","doi":"10.1109/ISITA.2008.4895493","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895493","url":null,"abstract":"We address the problem of multiple-input multiple-output (MIMO) relay design for multiple distributed source and destination pairs with signal-to-interference-plus-noise-ratio (SINR) constraints. Multiple link pairs communicating through a relay can be beneficial in the wireless digital home network (DHN) scenario where various equipments exchange or share digital media contents. In the first hop from the source nodes to the relay, cooperative transmit-receive beamforming design is performed to maximize SINR at the relay. Then joint power allocation and transmit-receive beamforming is conducted in the second hop from the relay to the destination nodes based on the SINR constraints for each link pair. The beamforming filter is a group maximum SINR filter which exploits intra-group cooperation. The group-based uplink-downlink duality property in downlink channel is adopted and modified for amplify-and-forward (AF) relaying. An iterative algorithm is then proposed to solve the problem. Simulation results show the superiority of the proposed algorithm over other methods.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122829852","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895380
Mitsugu Iwamoto
We introduce a visual secret sharing (VSS) scheme with a new security condition, called a weakly secure VSS scheme, which is not unconditionally secure in general, but is designed to be secure for human eyesight. It is shown in this paper that the weakly secure VSS scheme is equivalent to the unconditional one for black-white binary secret images although they are different for color secret images. This fact implies that, at the sacrifice of security, the clearer color images can be reproduced by the weakly secure VSS schemes compared with the unconditional ones. Furthermore, some constructions of weakly secure VSS schemes are presented.
{"title":"Weakly secure visual secret sharing schemes","authors":"Mitsugu Iwamoto","doi":"10.1109/ISITA.2008.4895380","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895380","url":null,"abstract":"We introduce a visual secret sharing (VSS) scheme with a new security condition, called a weakly secure VSS scheme, which is not unconditionally secure in general, but is designed to be secure for human eyesight. It is shown in this paper that the weakly secure VSS scheme is equivalent to the unconditional one for black-white binary secret images although they are different for color secret images. This fact implies that, at the sacrifice of security, the clearer color images can be reproduced by the weakly secure VSS schemes compared with the unconditional ones. Furthermore, some constructions of weakly secure VSS schemes are presented.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131481664","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895460
N. Mekloi
Minimum mean square error (MMSE), also know as optimum combining, is already mentioned to be good matched technique for suppressing the multipath fading and reducing the effect of co-channel interference (CCI) in wireless communications. It has been used for either Gaussian fading channels and non-Gaussian fading channels for different conditions and purposes. In this paper, the performance evaluation of wireless digital communication systems for linear minimum mean square error diversity is investigated. The approach of this paper and its main contribution is to model the non-Gaussian fading channel of wireless systems. A new expression of outage probability in a non-Gaussian fading environment is studied by modeling fading channel as a spherically invariant random process (SIRP). It assumed that the interferers have equal powers and their number is no less than the diversity order. Finally, some numerical results show the impact of the number of antenna elements, the number of interferers and noise.
{"title":"Outage probability for MMSE linear diversity in a non-Gaussian fading environment","authors":"N. Mekloi","doi":"10.1109/ISITA.2008.4895460","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895460","url":null,"abstract":"Minimum mean square error (MMSE), also know as optimum combining, is already mentioned to be good matched technique for suppressing the multipath fading and reducing the effect of co-channel interference (CCI) in wireless communications. It has been used for either Gaussian fading channels and non-Gaussian fading channels for different conditions and purposes. In this paper, the performance evaluation of wireless digital communication systems for linear minimum mean square error diversity is investigated. The approach of this paper and its main contribution is to model the non-Gaussian fading channel of wireless systems. A new expression of outage probability in a non-Gaussian fading environment is studied by modeling fading channel as a spherically invariant random process (SIRP). It assumed that the interferers have equal powers and their number is no less than the diversity order. Finally, some numerical results show the impact of the number of antenna elements, the number of interferers and noise.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127759847","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
扫码关注我们
求助内容：
应助结果提醒方式：