Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895533
T. Kojima, Masaki Aono
A convoluted-time and code division multiple access (CT-CDMA) communication system based on complete complementary codes has been proposed. There are some variations in setting some parameters for this communication system. In this study, we generalize the parameter settings for this communication system, and evaluate the constraints where the information data can be transmitted without any errors under the multipath environment.
{"title":"On the parameters for CT-CDMA communication systems based on complete complementary codes","authors":"T. Kojima, Masaki Aono","doi":"10.1109/ISITA.2008.4895533","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895533","url":null,"abstract":"A convoluted-time and code division multiple access (CT-CDMA) communication system based on complete complementary codes has been proposed. There are some variations in setting some parameters for this communication system. In this study, we generalize the parameter settings for this communication system, and evaluate the constraints where the information data can be transmitted without any errors under the multipath environment.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"49 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":"128576421","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.4895507
S. Matsuda, S. Saito, T. Hiramatsu
It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.
{"title":"Computation of zeta functions counting pseudo-codewords of linear codes","authors":"S. Matsuda, S. Saito, T. Hiramatsu","doi":"10.1109/ISITA.2008.4895507","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895507","url":null,"abstract":"It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"94 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":"128974665","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.4895411
Jang-Won Lee, Jeong-Ahn Kwon
In this paper, we propose a new framework for opportunistic scheduling in wireless systems. We consider a TDMA type of multiple access scheme, in which only one user can be scheduled in each time-slot. For opportunistic scheduling for such a system, a nice framework has been developed in. However, in this paper, we consider a more general system that has a probabilistic scheduling policy and more general fairness constraints. Moreover, in addition to this generalization, we develop a new framework for opportunistic scheduling based on the duality theory. The duality theory is a well-defined theory in the mathematical optimization area. Hence, by using the framework developed in this paper, we can analyze the developed algorithm more rigorously and systematically.
{"title":"A new framework for opportunistic scheduling in wireless networks","authors":"Jang-Won Lee, Jeong-Ahn Kwon","doi":"10.1109/ISITA.2008.4895411","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895411","url":null,"abstract":"In this paper, we propose a new framework for opportunistic scheduling in wireless systems. We consider a TDMA type of multiple access scheme, in which only one user can be scheduled in each time-slot. For opportunistic scheduling for such a system, a nice framework has been developed in. However, in this paper, we consider a more general system that has a probabilistic scheduling policy and more general fairness constraints. Moreover, in addition to this generalization, we develop a new framework for opportunistic scheduling based on the duality theory. The duality theory is a well-defined theory in the mathematical optimization area. Hence, by using the framework developed in this paper, we can analyze the developed algorithm more rigorously and systematically.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"17 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":"129313640","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.4895473
T. Sugimoto, T. Arai, H. Inai
In this paper, the spread-spectrum (SS) Boomerang system using code-shift-keying (CSK) is proposed. CSK is one of the orthogonal modulation systems which transmit an orthogonal code sequence according to information bits. The conventional SS-Boomerang system which used direct-sequence spread-spectrum (DS/SS) technique applies the spreading sequence to every information bits. However, since the proposed SS-Boomerang system uses CSK, it can transmit more than one information with one spreading sequence. It is able to improve information transmission rate. Moreover, it is shown that the bit error rate and distance ranging performance of the proposed system is superior to that of the conventional system.
{"title":"Performance evaluation of CSK spread spectrum Boomerang system","authors":"T. Sugimoto, T. Arai, H. Inai","doi":"10.1109/ISITA.2008.4895473","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895473","url":null,"abstract":"In this paper, the spread-spectrum (SS) Boomerang system using code-shift-keying (CSK) is proposed. CSK is one of the orthogonal modulation systems which transmit an orthogonal code sequence according to information bits. The conventional SS-Boomerang system which used direct-sequence spread-spectrum (DS/SS) technique applies the spreading sequence to every information bits. However, since the proposed SS-Boomerang system uses CSK, it can transmit more than one information with one spreading sequence. It is able to improve information transmission rate. Moreover, it is shown that the bit error rate and distance ranging performance of the proposed system is superior to that of the conventional system.","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":"114223713","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.4895487
S. Dolinar, K. Andrews, F. Pollara, D. Divsalar
Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.
{"title":"Bounds on error probability of block codes with bounded-angle maximum-likelihood incomplete decoding","authors":"S. Dolinar, K. Andrews, F. Pollara, D. Divsalar","doi":"10.1109/ISITA.2008.4895487","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895487","url":null,"abstract":"Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"99 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":"114341756","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.4895529
H. Sakai, M. Kuribayashi, M. Morii
This paper presents an improved method of the reversible data hiding for JPEG images proposed by Xuan, et al. The conventional method embeds data into the JPEG quantized 8 times 8 block DCT coefficients. In this method, we found that the blocks, located in the noisy part of the image, are not suitable for embedding data. The proposed method can judge whether a block consisted of 8 times 8 DCT coefficients is located in smooth part of image by using the DC coefficient of neighboring blocks. Our method can avoid the noisy part for embedding. It results in a better performance in terms of capacity-distortion behavior.
{"title":"Adaptive reversible data hiding for JPEG images","authors":"H. Sakai, M. Kuribayashi, M. Morii","doi":"10.1109/ISITA.2008.4895529","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895529","url":null,"abstract":"This paper presents an improved method of the reversible data hiding for JPEG images proposed by Xuan, et al. The conventional method embeds data into the JPEG quantized 8 times 8 block DCT coefficients. In this method, we found that the blocks, located in the noisy part of the image, are not suitable for embedding data. The proposed method can judge whether a block consisted of 8 times 8 DCT coefficients is located in smooth part of image by using the DC coefficient of neighboring blocks. Our method can avoid the noisy part for embedding. It results in a better performance in terms of capacity-distortion behavior.","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":"121540696","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.4895640
M. Nakanishi, Y. Murakami
FPGAs are widely used recently, and security on configuration bitstreams is of concern to both users and suppliers of configuration bitstreams (e.g., intellectual property vendors). In order to protect configuration bitstreams against the threats such as FPGA viruses, piracy and reverse engineering, configuration bitstreams need to be encrypted and authenticated before loaded into FPGAs. We previously proposed a configuration scheme that protects configuration bitstreams, which uses a part of a target circuit (i.e., a part of a configuration bitstream of a target circuit) as a secret key. Our proposed scheme has an advantage of using public-key cryptography, while other known methods can use only symmetric-key cryptography. However, ideally, the secret key should not be a part of a configuration bitstream but a random bit string. In this paper, we propose a method that randomizes a part of a configuration bitstream, so that it can be used as a one-time pad for our configuration scheme.
{"title":"A method of randomizing a part of an FPGA configuration bitstream","authors":"M. Nakanishi, Y. Murakami","doi":"10.1109/ISITA.2008.4895640","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895640","url":null,"abstract":"FPGAs are widely used recently, and security on configuration bitstreams is of concern to both users and suppliers of configuration bitstreams (e.g., intellectual property vendors). In order to protect configuration bitstreams against the threats such as FPGA viruses, piracy and reverse engineering, configuration bitstreams need to be encrypted and authenticated before loaded into FPGAs. We previously proposed a configuration scheme that protects configuration bitstreams, which uses a part of a target circuit (i.e., a part of a configuration bitstream of a target circuit) as a secret key. Our proposed scheme has an advantage of using public-key cryptography, while other known methods can use only symmetric-key cryptography. However, ideally, the secret key should not be a part of a configuration bitstream but a random bit string. In this paper, we propose a method that randomizes a part of a configuration bitstream, so that it can be used as a one-time pad for our configuration scheme.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"10 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":"128016963","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}
This paper aims to investigate the convergence and transient behaviors of the symbol-based adaptive receivers for direct sequence-code division multiple access (DS-CDMA) communication system in multipath channels. The input signal vector is characterized as a simple stochastic model to simplify the analysis of the least mean square (LMS) and the normalized least mean square (NLMS) adaptive receivers. The learning curve, which is the ensemble average of the squared estimation error is applied to analyze the convergence of adaptive receivers for DS-CDMA system in multipath channels. Computer simulations show that the analytical results of the learning curve obtained in this work are consistent with the simulation results.
{"title":"Convergence behaviors of adaptive DS-CDMA receivers","authors":"Hsuan-Fu Wang, Fang-Biau Ueng, Jui-Chi Chang, Li-Der Jeng","doi":"10.1109/ISITA.2008.4895561","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895561","url":null,"abstract":"This paper aims to investigate the convergence and transient behaviors of the symbol-based adaptive receivers for direct sequence-code division multiple access (DS-CDMA) communication system in multipath channels. The input signal vector is characterized as a simple stochastic model to simplify the analysis of the least mean square (LMS) and the normalized least mean square (NLMS) adaptive receivers. The learning curve, which is the ensemble average of the squared estimation error is applied to analyze the convergence of adaptive receivers for DS-CDMA system in multipath channels. Computer simulations show that the analytical results of the learning curve obtained in this work are consistent with the simulation results.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"113 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":"132203748","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.4895610
Takeru Miyazaki, Shunsuke Araki, S. Uehara
On the designing of a pseudo-random number generator from a sequence generated by the logistic map, period and link length of the sequence are important for good randomness. In this paper, we focus loops and links of sequences generated by the logistic map over integers. Since their periods and link lengths of them depend on an available bit. We consider the relation between the available bit and expected values of them.
{"title":"Period and link length of logistic map over integers","authors":"Takeru Miyazaki, Shunsuke Araki, S. Uehara","doi":"10.1109/ISITA.2008.4895610","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895610","url":null,"abstract":"On the designing of a pseudo-random number generator from a sequence generated by the logistic map, period and link length of the sequence are important for good randomness. In this paper, we focus loops and links of sequences generated by the logistic map over integers. Since their periods and link lengths of them depend on an available bit. We consider the relation between the available bit and expected values of them.","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":"134242943","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.4895377
H. Koga, M. Miyata
In this paper we discuss construction of the visual secret sharing scheme for plural secret images. We first consider generation of n shares for given two secret image SI1 and SI2. For i = 1, 2, while no information of SIi is revealed from any less than n - 2 + i shares, SIi is visually recovered by the superimposition of arbitrary n - 2 + i shares. We define a new class of basis matrices used for generation of the n shares and give a simple construction of such basis matrices. In addition, a fundamental bound on the contrasts of SI1 and SI2 is established. These results are extended to the case where we have more than two secret images.
{"title":"A construction of a visual secret sharing scheme for plural secret images and its basic properties","authors":"H. Koga, M. Miyata","doi":"10.1109/ISITA.2008.4895377","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895377","url":null,"abstract":"In this paper we discuss construction of the visual secret sharing scheme for plural secret images. We first consider generation of n shares for given two secret image SI1 and SI2. For i = 1, 2, while no information of SIi is revealed from any less than n - 2 + i shares, SIi is visually recovered by the superimposition of arbitrary n - 2 + i shares. We define a new class of basis matrices used for generation of the n shares and give a simple construction of such basis matrices. In addition, a fundamental bound on the contrasts of SI1 and SI2 is established. These results are extended to the case where we have more than two secret images.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"35 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":"133618777","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
扫码关注我们
求助内容：
应助结果提醒方式：