Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895635
K. Gowda, C. Yuen, Sumei Sun
This paper proposes a class of space-time (ST) codes for supporting applications that demand unequal error protection. Traditionally, an ST code is designed to support a single information stream aiming to achieve a point on the fundamental rate versus diversity trade-off curve. The construction in this paper is based on the diversity-embedded codes recently proposed by Diggavi et.al., where-in ST codes need to encode multiple information streams, with each stream demanding a different level of reliability. In this paper, we propose to use an existing class of ST codes with low maximum-likelihood decoding complexity, as diversity embedded codes. For this class of codes, we are able to characterize the different diversity levels achievable for every message symbol.
{"title":"Diversity embedded space-time code from quasi-orthogonal designs","authors":"K. Gowda, C. Yuen, Sumei Sun","doi":"10.1109/ISITA.2008.4895635","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895635","url":null,"abstract":"This paper proposes a class of space-time (ST) codes for supporting applications that demand unequal error protection. Traditionally, an ST code is designed to support a single information stream aiming to achieve a point on the fundamental rate versus diversity trade-off curve. The construction in this paper is based on the diversity-embedded codes recently proposed by Diggavi et.al., where-in ST codes need to encode multiple information streams, with each stream demanding a different level of reliability. In this paper, we propose to use an existing class of ST codes with low maximum-likelihood decoding complexity, as diversity embedded codes. For this class of codes, we are able to characterize the different diversity levels achievable for every message symbol.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"40 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":"132526393","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.4895449
Xiaoyan Xu, M. Flanagan, C. Koller, N. Goertz
In cooperative communications, the technique of algebraic code superposition (or network coding) may efficiently utilize limited communications resources to produce spatial diversity. In this paper, we propose a simple cooperative diversity scheme for the scenario of two sources sharing a single relay. No cooperative coding is required at the sources, and only very simple interleave-and-superpose operations are performed at the relay. We propose a novel computationally efficient message passing algorithm at the destination's decoder which utilizes spatial diversity gathered over multiple transmission frames. We show that despite the simplicity of the proposed scheme, diversity gains are efficiently leveraged by the simple combination of channel coding at the sources and network coding at the relay.
{"title":"A shared-relay cooperative diversity scheme based on joint channel and network coding","authors":"Xiaoyan Xu, M. Flanagan, C. Koller, N. Goertz","doi":"10.1109/ISITA.2008.4895449","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895449","url":null,"abstract":"In cooperative communications, the technique of algebraic code superposition (or network coding) may efficiently utilize limited communications resources to produce spatial diversity. In this paper, we propose a simple cooperative diversity scheme for the scenario of two sources sharing a single relay. No cooperative coding is required at the sources, and only very simple interleave-and-superpose operations are performed at the relay. We propose a novel computationally efficient message passing algorithm at the destination's decoder which utilizes spatial diversity gathered over multiple transmission frames. We show that despite the simplicity of the proposed scheme, diversity gains are efficiently leveraged by the simple combination of channel coding at the sources and network coding at the relay.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"135 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":"132728676","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.4895484
Y. Yanagihara
For an observation system assisted for diagnosis of 3-D CT images consisting of time-sequenced multi slice tomograms, the refinement method to obtain the more precise region detection on which noise areas are reduced is proposed. The experimental results show that noise areas are reduced effectively. And also the system model refined by code refactoring is also proposed to be able to make the system having flexibility, also for that the proposed method is implemented.
{"title":"A study of region extraction and system model on an observation system of time-sequenced 3-D CT images","authors":"Y. Yanagihara","doi":"10.1109/ISITA.2008.4895484","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895484","url":null,"abstract":"For an observation system assisted for diagnosis of 3-D CT images consisting of time-sequenced multi slice tomograms, the refinement method to obtain the more precise region detection on which noise areas are reduced is proposed. The experimental results show that noise areas are reduced effectively. And also the system model refined by code refactoring is also proposed to be able to make the system having flexibility, also for that the proposed method is implemented.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"21 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":"131792159","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.4895469
Takahiro Yoshida, T. Matsushima, H. Imai
In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user' s information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.
{"title":"A ramp scheme for Key Predistribution System against collusion of users and centers","authors":"Takahiro Yoshida, T. Matsushima, H. Imai","doi":"10.1109/ISITA.2008.4895469","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895469","url":null,"abstract":"In this paper, we consider a ramp scheme for Key Predistribution System (KPS). In the ramp scheme, it can be regarded as one kind of generalization of KPS, and the required resources can be reduced at the cost of a security degradation which depends on the size of users. We define a ramp scheme for KPS, show lower bound on the amount of user' s information needed to generate a common key, and design a protocol that realize a ramp scheme for KPS.","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":"134235246","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.4895622
H. Yoshikawa
An analytical bound to bit error probability of turbo codes can be derived by weight distribution of recursive systematic convolutional codes. In this paper, the conditional weight enumerating function of terminated recursive systematic convolutional codes is computed. This form can be expressed as a function of number of information bits, and can reduce the computational complexity of calculation of error bounds. Applying these results, it is shown that improved error bound can be obtained by the conditional weight enumerating function of parallel concatenated convolutional codes.
{"title":"On the weight distribution of recursive systematic convolutional codes","authors":"H. Yoshikawa","doi":"10.1109/ISITA.2008.4895622","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895622","url":null,"abstract":"An analytical bound to bit error probability of turbo codes can be derived by weight distribution of recursive systematic convolutional codes. In this paper, the conditional weight enumerating function of terminated recursive systematic convolutional codes is computed. This form can be expressed as a function of number of information bits, and can reduce the computational complexity of calculation of error bounds. Applying these results, it is shown that improved error bound can be obtained by the conditional weight enumerating function of parallel concatenated convolutional codes.","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":"134373888","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.4895426
J. Hall, A. Rao
Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in Copfd are known when d is a prime power, it is unknown if such complete sets exist in non-prime power dimensions. It has been conjectured that sets of complete MUBs only exist in Copfd if a projective plane of size d also exists. We investigate the structure of MUBs using two algebraic tools: relation algebras and group rings. We construct two relation algebras from MUBs and compare these to relation algebras constructed from projective planes. We show several examples of complete sets of MUBs in Copfd, that when considered as elements of a group ring form a commutative monoid. We conjecture that complete sets of MUBs will always form a monoid if the appropriate group ring is chosen.
{"title":"The algebraic structure of Mutually Unbiased Bases","authors":"J. Hall, A. Rao","doi":"10.1109/ISITA.2008.4895426","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895426","url":null,"abstract":"Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in Copfd are known when d is a prime power, it is unknown if such complete sets exist in non-prime power dimensions. It has been conjectured that sets of complete MUBs only exist in Copfd if a projective plane of size d also exists. We investigate the structure of MUBs using two algebraic tools: relation algebras and group rings. We construct two relation algebras from MUBs and compare these to relation algebras constructed from projective planes. We show several examples of complete sets of MUBs in Copfd, that when considered as elements of a group ring form a commutative monoid. We conjecture that complete sets of MUBs will always form a monoid if the appropriate group ring is chosen.","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":"131612457","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.4895440
K. Enda, R. Kohno
It is important for sensor networks to estimate the sensor tag accurately, for example, RFID. Time difference of arrival (TDOA) positioning algorithm is well known as the positioning algorithm of the sensor tag. Therefore, the positioning accuracy of conventional linear search algorithm is decreased exceedingly in non-line-of sight (NLOS) environment. In this paper, we propose the iterative NLOS delay compensation algorithm based on TDOA in order to fulfill high accuracy in the damaged propagation through NLOS environment. At first, the temporary position is estimated by normal TDOA method and transmission start time is estimated. Next, the time difference between transmission start time and node arrival time is compensated by delay compensation function (DCOMF), and reliability of each node is decided by reliability weight function (RELF). Finally, abnormal error occurred in serious NLOS environment is improved by limitation method. By those iterative processes, the positioning accuracy is improved.
{"title":"Iterative delay compensation algorithm to mitigate NLOS influence for positioning","authors":"K. Enda, R. Kohno","doi":"10.1109/ISITA.2008.4895440","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895440","url":null,"abstract":"It is important for sensor networks to estimate the sensor tag accurately, for example, RFID. Time difference of arrival (TDOA) positioning algorithm is well known as the positioning algorithm of the sensor tag. Therefore, the positioning accuracy of conventional linear search algorithm is decreased exceedingly in non-line-of sight (NLOS) environment. In this paper, we propose the iterative NLOS delay compensation algorithm based on TDOA in order to fulfill high accuracy in the damaged propagation through NLOS environment. At first, the temporary position is estimated by normal TDOA method and transmission start time is estimated. Next, the time difference between transmission start time and node arrival time is compensated by delay compensation function (DCOMF), and reliability of each node is decided by reliability weight function (RELF). Finally, abnormal error occurred in serious NLOS environment is improved by limitation method. By those iterative processes, the positioning accuracy is improved.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"64 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":"133729541","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.4895518
Lei Zhou, Wei Yu
This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from the interference-free receiver to the interfered receiver. An achievable rate region is derived based on a combination of the Han-Kobayashi common-private information splitting technique and a partial interference-forwarding relaying strategy in which a part of the interference is decoded then forwarded through the digital link using a binning strategy for interference cancellation. The proposed strategy is shown to be capacity achieving in the strong interference regime, and asymptotically sum capacity approaching in the weak interference regime in the high signal-to-noise ratio and high interference-to-noise ratio limit.
{"title":"Gaussian Z-interference channel with a relay link: Achievable rate region and asymptotic sum capacity","authors":"Lei Zhou, Wei Yu","doi":"10.1109/ISITA.2008.4895518","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895518","url":null,"abstract":"This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from the interference-free receiver to the interfered receiver. An achievable rate region is derived based on a combination of the Han-Kobayashi common-private information splitting technique and a partial interference-forwarding relaying strategy in which a part of the interference is decoded then forwarded through the digital link using a binning strategy for interference cancellation. The proposed strategy is shown to be capacity achieving in the strong interference regime, and asymptotically sum capacity approaching in the weak interference regime in the high signal-to-noise ratio and high interference-to-noise ratio limit.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"68 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":"133451449","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}
We propose and evaluate new quantum secret sharing schemes (QSSS) for sharing a classical secret between two groups, group 1 and group 2. It is observed that the proposed scheme is secure against well-known attacks on QSSS, particularly attacks with single photons or EPR pairs.
{"title":"Quantum secret sharing between multiparty and multiparty against the attacks with single photons or EPR-pair","authors":"Atsushi Waseda, Takayuki Takagi, Masakazu Soshi, Atsuko Miyaji","doi":"10.1109/ISITA.2008.4895427","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895427","url":null,"abstract":"We propose and evaluate new quantum secret sharing schemes (QSSS) for sharing a classical secret between two groups, group 1 and group 2. It is observed that the proposed scheme is secure against well-known attacks on QSSS, particularly attacks with single photons or EPR pairs.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"3 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":"122240209","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.4895568
Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang
Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.
{"title":"A self-orthogonal code and its maximum-likelihood decoder for combined channel estimation and error protection","authors":"Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang","doi":"10.1109/ISITA.2008.4895568","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895568","url":null,"abstract":"Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"33 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":"121269208","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
扫码关注我们
求助内容：
应助结果提醒方式：