Pub Date : 2008-12-07DOI: 10.1109/ISITA.2008.4895623
G. Hodtani, M. Aref
Capacity has been found for degraded, reversely degraded, full feedback, semi-deterministic, orthogonal relay channels, also for a class of deterministic relay channels and a class of modulo sum relay channels. We indicate what the relay decodes and forwards with one auxiliary random variable having bounded cardinality and attempt to define a more general class of relay channels in order to unify most of known capacity theorems into one capacity theorem by considering additional assumptions imposed to the definition of those channels. In other words, the relay channel inputs are dependent as in multiple access channel with arbitrarily correlated sources and here we do for the relay channel the same as Cover, El Gamal and Salehi has done for the multiple access channel. Certainly, our theorem includes only all of the relay channels which satisfy the constraints of our definition.
{"title":"Capacity of a more general glass of relay channels","authors":"G. Hodtani, M. Aref","doi":"10.1109/ISITA.2008.4895623","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895623","url":null,"abstract":"Capacity has been found for degraded, reversely degraded, full feedback, semi-deterministic, orthogonal relay channels, also for a class of deterministic relay channels and a class of modulo sum relay channels. We indicate what the relay decodes and forwards with one auxiliary random variable having bounded cardinality and attempt to define a more general class of relay channels in order to unify most of known capacity theorems into one capacity theorem by considering additional assumptions imposed to the definition of those channels. In other words, the relay channel inputs are dependent as in multiple access channel with arbitrarily correlated sources and here we do for the relay channel the same as Cover, El Gamal and Salehi has done for the multiple access channel. Certainly, our theorem includes only all of the relay channels which satisfy the constraints of our definition.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116947295","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.4895434
Peng Yang, Kanta Matsuura
We propose an identity based encryption scheme with forward security. Especially in our scheme, the top secret, called the master key, updates as time evolves. Our scheme is provably secure in the sense of FS-IND-ID-CPA based on DBDH assumption in standard model.
{"title":"A forward secure identity based encryption scheme with master key update","authors":"Peng Yang, Kanta Matsuura","doi":"10.1109/ISITA.2008.4895434","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895434","url":null,"abstract":"We propose an identity based encryption scheme with forward security. Especially in our scheme, the top secret, called the master key, updates as time evolves. Our scheme is provably secure in the sense of FS-IND-ID-CPA based on DBDH assumption in standard model.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"50 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":"115228809","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.4895511
Yugo Haruta, K. Ishibashi, T. Wada
Recently, multihop wireless networks have gained much attraction. Since the available bandwidth and battery are strictly limited, multihop wireless networks should communicate efficiently. If the error correcting code is used, by using the longer codeword, the decoding error probability can be improved. Therefore, in this paper, we propose the information interflow network (I2N), which transmits several data packets as one longer data packet and show that the proposed network with low density parity check (LDPC) codes can improve the throughput performance compared with the conventional network.
{"title":"Information interflow network (I2N) using LDPC codes","authors":"Yugo Haruta, K. Ishibashi, T. Wada","doi":"10.1109/ISITA.2008.4895511","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895511","url":null,"abstract":"Recently, multihop wireless networks have gained much attraction. Since the available bandwidth and battery are strictly limited, multihop wireless networks should communicate efficiently. If the error correcting code is used, by using the longer codeword, the decoding error probability can be improved. Therefore, in this paper, we propose the information interflow network (I2N), which transmits several data packets as one longer data packet and show that the proposed network with low density parity check (LDPC) codes can improve the throughput performance compared with the conventional network.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"14 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":"115375590","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.4895384
T. Yamamoto, I. Oka, S. Ata
The increased demands for wireless communications lead to the development of cognitive radio, which realizes an effective utilization of channel resources. A modulation identification takes an important role in cognitive radio. In this paper an identification method is discussed for block orthogonal modulations expressed by general orthogonal modulation. The identification requires a reconstruction of signal-hypercube in a multidimensional space. The clustering and labeling methods are proposed for block orthogonal signals, and are evaluated from the view points of clustering error rate and labeling error rate.
{"title":"Clustering and labeling of orthogonal signals for modulation identification","authors":"T. Yamamoto, I. Oka, S. Ata","doi":"10.1109/ISITA.2008.4895384","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895384","url":null,"abstract":"The increased demands for wireless communications lead to the development of cognitive radio, which realizes an effective utilization of channel resources. A modulation identification takes an important role in cognitive radio. In this paper an identification method is discussed for block orthogonal modulations expressed by general orthogonal modulation. The identification requires a reconstruction of signal-hypercube in a multidimensional space. The clustering and labeling methods are proposed for block orthogonal signals, and are evaluated from the view points of clustering error rate and labeling error rate.","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":"116808099","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.4895510
K. Gowda, S. Sumei
We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.
{"title":"Multicast capacity of multiple access erasure networks","authors":"K. Gowda, S. Sumei","doi":"10.1109/ISITA.2008.4895510","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895510","url":null,"abstract":"We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"59 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":"127151671","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.4895509
M. Hirotomo, Y. Konishi, M. Morii
The performance of LDPC codes decoded by iterative algorithms depends on the structural properties of their underlying Tanner graphs. For general memoryless channels, error patterns dominating the bit and frame error probabilities at the error floor region are termed trapping sets. In this paper, we propose an effective method for finding small-size trapping sets of LDPC codes. In the proposed method, a probabilistic algorithm to find low-weight codewords is applied to finding small trapping sets of LDPC codes. Furthermore, we show numerical results of examining small trapping sets of (504, 252) and (1008, 504) LDPC codes.
{"title":"Approximate examination of trapping sets of LDPC codes using the probabilistic algorithm","authors":"M. Hirotomo, Y. Konishi, M. Morii","doi":"10.1109/ISITA.2008.4895509","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895509","url":null,"abstract":"The performance of LDPC codes decoded by iterative algorithms depends on the structural properties of their underlying Tanner graphs. For general memoryless channels, error patterns dominating the bit and frame error probabilities at the error floor region are termed trapping sets. In this paper, we propose an effective method for finding small-size trapping sets of LDPC codes. In the proposed method, a probabilistic algorithm to find low-weight codewords is applied to finding small trapping sets of LDPC codes. Furthermore, we show numerical results of examining small trapping sets of (504, 252) and (1008, 504) LDPC codes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"18 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":"115343040","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.4895612
M. Yasutake, Jun Cheng, Chen Sun, Y. Watanabe
The frame-splitting (FS) for the downlink transmission from a base station (BS) that has distributed antennas to a mobile station is studied. A data frame from the BS is split into two portions that are transmitted consecutively from the distributed antennas. The bit error rate (BER) is formulated as a function of the FS ratios. Based on this analytical model, the closed-form solution of the optimal FS ratios is derived to achieve the lowest BER over AWGN and Rayleigh fading channels, respectively.
{"title":"Optimal frame-splitting ratio achieving lowest BER over AWGN and Rayleigh fading channels with distributed antennas","authors":"M. Yasutake, Jun Cheng, Chen Sun, Y. Watanabe","doi":"10.1109/ISITA.2008.4895612","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895612","url":null,"abstract":"The frame-splitting (FS) for the downlink transmission from a base station (BS) that has distributed antennas to a mobile station is studied. A data frame from the BS is split into two portions that are transmitted consecutively from the distributed antennas. The bit error rate (BER) is formulated as a function of the FS ratios. Based on this analytical model, the closed-form solution of the optimal FS ratios is derived to achieve the lowest BER over AWGN and Rayleigh fading channels, respectively.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"291 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":"116093208","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.4895659
Y. Kida, T. Kida
We derive a method of obtaining approximate numerical solution of linear variable-coefficient partial differential equations (PDEs) with two independent variables from Kida's optimum approximation theory. It is shown that a certain generalized filter bank implements linear PDEs. By applying generalized discrete orthogonality of Kida's optimum approximation to this filter bank, we prove that our approximate solution satisfies a given linear PDEs and the corresponding initial or boundary conditions at all given sample points, simultaneously.
{"title":"A numerical solution of linear variable-coefficient partial differential equations with two independent variables based on Kida's optimum approximation theory","authors":"Y. Kida, T. Kida","doi":"10.1109/ISITA.2008.4895659","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895659","url":null,"abstract":"We derive a method of obtaining approximate numerical solution of linear variable-coefficient partial differential equations (PDEs) with two independent variables from Kida's optimum approximation theory. It is shown that a certain generalized filter bank implements linear PDEs. By applying generalized discrete orthogonality of Kida's optimum approximation to this filter bank, we prove that our approximate solution satisfies a given linear PDEs and the corresponding initial or boundary conditions at all given sample points, simultaneously.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"189 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":"122596380","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.4895638
Hsin-Li Chiu, Sau-Hsuan Wu
The throughput and the tradeoff between the diversity, multiplexing and the delay constraint of cooperative automatic retransmission request (ARQ) are investigated for distributed space-time coding (DSTC). According to the analysis, the maximum operational throughput turns out to be a piecewise linear curve with respect to the signal to noise ratio in decibel. In addition, the multiplexing gain divided by the average transmission times, referred to as the effective multiplexing gain, appears to be a better performance measure for delay-limited cooperative ARQ schemes. The tradeoff between the diversity and effective multiplexing gains is characterized for cooperative ARQ using DSTC in slow and fast fading channels, respectively.
{"title":"Cooperative ARQ for distributed space-time coding: The diversity-multiplexing-delay tradeoff","authors":"Hsin-Li Chiu, Sau-Hsuan Wu","doi":"10.1109/ISITA.2008.4895638","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895638","url":null,"abstract":"The throughput and the tradeoff between the diversity, multiplexing and the delay constraint of cooperative automatic retransmission request (ARQ) are investigated for distributed space-time coding (DSTC). According to the analysis, the maximum operational throughput turns out to be a piecewise linear curve with respect to the signal to noise ratio in decibel. In addition, the multiplexing gain divided by the average transmission times, referred to as the effective multiplexing gain, appears to be a better performance measure for delay-limited cooperative ARQ schemes. The tradeoff between the diversity and effective multiplexing gains is characterized for cooperative ARQ using DSTC in slow and fast fading channels, respectively.","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":"128476320","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.4895428
Yung-Chih Tsai, Tien-Hui Chen, Y. Lo, M. Lin
We propose a time-domain selective mapping technique for reducing the peak-to-average power (PAPR) of the multi-input multi-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. The candidates for selection are obtained from various combinations of consecutive MIMO-OFDM blocks. The error performance will not be deteriorated if the way of combination is properly designed.
{"title":"A low-complexity selective mapping PAPR reduction scheme for coded MIMO-OFDM","authors":"Yung-Chih Tsai, Tien-Hui Chen, Y. Lo, M. Lin","doi":"10.1109/ISITA.2008.4895428","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895428","url":null,"abstract":"We propose a time-domain selective mapping technique for reducing the peak-to-average power (PAPR) of the multi-input multi-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. The candidates for selection are obtained from various combinations of consecutive MIMO-OFDM blocks. The error performance will not be deteriorated if the way of combination is properly designed.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"2 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":"128752561","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
扫码关注我们
求助内容：
应助结果提醒方式：