Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895389
Anxiao Jiang, Jehoshua Bruck
Flash memories are the most widely used type of non-volatile electronic memories. Compared to magnetic recording and optical recording, flash memories have the unique property that their cell levels, which represent data, are programmed using an iterative procedure that monotonically shifts each cell level upward toward its target value. In this paper, we study the capacity of flash memories to store data. We explore the relationship among their capacity, programming precision and programming time. The study is focused on the capacity of single cells, and an optimal programming algorithm is presented.
{"title":"On the capacity of flash memories","authors":"Anxiao Jiang, Jehoshua Bruck","doi":"10.1109/ISITA.2008.4895389","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895389","url":null,"abstract":"Flash memories are the most widely used type of non-volatile electronic memories. Compared to magnetic recording and optical recording, flash memories have the unique property that their cell levels, which represent data, are programmed using an iterative procedure that monotonically shifts each cell level upward toward its target value. In this paper, we study the capacity of flash memories to store data. We explore the relationship among their capacity, programming precision and programming time. The study is focused on the capacity of single cells, and an optimal programming algorithm is presented.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"90 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":"116294301","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.4895482
J. Muramatsu, S. Miyake
A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.
{"title":"Lossy source coding algorithm using lossless multi-terminal source codes","authors":"J. Muramatsu, S. Miyake","doi":"10.1109/ISITA.2008.4895482","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895482","url":null,"abstract":"A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"42 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":"127152112","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.4895555
R. Agarwal, J. Cioffi
This work studies linear transmit filter design for weighted sum-rate (WSR) maximization in the multiple input multiple output broadcast channel (MIMO-BC). The problem of finding the optimal transmit filter is non-convex and intractable to solve. Motivated by the iterative algorithm that solves for the optimal transmit and receive filters for minimizing sum-mean square error (MSE), this paper suggests to use weighted minimum mean square error (WMMSE) optimization in the MIMO-BC. The paper presents an iterative algorithm to maximize WSR. Numerical results for sum-rate using the derived filter are provided under different system settings.
本文研究了多输入多输出广播信道(MIMO-BC)中加权和速率(WSR)最大化的线性传输滤波器设计。寻找最优传输滤波器的问题是非凸的，难以解决。基于求解最大均方误差(sum-mean square error, MSE)的最优收发滤波器的迭代算法，本文建议在MIMO-BC中采用加权最小均方误差(weighted minimum mean square error, WMMSE)优化。本文提出了一种最大化WSR的迭代算法。在不同的系统设置下，给出了使用该滤波器计算和速率的数值结果。
{"title":"Beamforming design for the MIMO downlink for maximizing Weighted Sum-Rate","authors":"R. Agarwal, J. Cioffi","doi":"10.1109/ISITA.2008.4895555","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895555","url":null,"abstract":"This work studies linear transmit filter design for weighted sum-rate (WSR) maximization in the multiple input multiple output broadcast channel (MIMO-BC). The problem of finding the optimal transmit filter is non-convex and intractable to solve. Motivated by the iterative algorithm that solves for the optimal transmit and receive filters for minimizing sum-mean square error (MSE), this paper suggests to use weighted minimum mean square error (WMMSE) optimization in the MIMO-BC. The paper presents an iterative algorithm to maximize WSR. Numerical results for sum-rate using the derived filter are provided under different system settings.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"56 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":"125974282","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.4895477
A. Barbero, G. Horler, E. Rosnes, O. Ytrehus
In this paper we study and compare methods for representing information for transmission on inductively coupled channels. We introduce combined runlength and power constraints on modulation codes for such channels, calculate the capacities of these new constraints, and propose new codes that meet the constraints.
{"title":"Modulation codes for reader-tag communication on inductively coupled channels","authors":"A. Barbero, G. Horler, E. Rosnes, O. Ytrehus","doi":"10.1109/ISITA.2008.4895477","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895477","url":null,"abstract":"In this paper we study and compare methods for representing information for transmission on inductively coupled channels. We introduce combined runlength and power constraints on modulation codes for such channels, calculate the capacities of these new constraints, and propose new codes that meet the constraints.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"104 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":"124210751","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.4895467
E.T. Taniguchi, H. Yamamoto
In this paper, we extend the work by M. Naor [7] on deniable ring authentication to include key establishment. Two secure deniable private key establishment protocols will be proposed. These two related schemes create only a secure private channel between Alice and Bob where the identity of Bob remains completely hidden. The first scheme does not require Alice to been within the user set S and in fact does not even require Alice to have a public-private key pair. The second scheme requires that Alice choose a user set S such that she is also within set S. This scheme also indirectly requires that Alice have a public-private key pair. Similar to the deniable ring authentication protocol by Naor, the protocols proposed here only assumes the existence of strong public key encryption schemes where all members have already established public and private keys. Finally, the problem of ciphertext search and ciphertext ambiguity will also be examined and a solution will be proposed.
{"title":"Deniable ring authenticated private key establishment","authors":"E.T. Taniguchi, H. Yamamoto","doi":"10.1109/ISITA.2008.4895467","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895467","url":null,"abstract":"In this paper, we extend the work by M. Naor [7] on deniable ring authentication to include key establishment. Two secure deniable private key establishment protocols will be proposed. These two related schemes create only a secure private channel between Alice and Bob where the identity of Bob remains completely hidden. The first scheme does not require Alice to been within the user set S and in fact does not even require Alice to have a public-private key pair. The second scheme requires that Alice choose a user set S such that she is also within set S. This scheme also indirectly requires that Alice have a public-private key pair. Similar to the deniable ring authentication protocol by Naor, the protocols proposed here only assumes the existence of strong public key encryption schemes where all members have already established public and private keys. Finally, the problem of ciphertext search and ciphertext ambiguity will also be examined and a solution will be proposed.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"EM-28 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":"126525741","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.4895549
Tony Q. S. Quek, Hyundong Shin
In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying and coordinated beamforming. However, many cooperation techniques have been developed for operation in narrowband systems for high signal-to-noise ratio (SNR) applications. It is important to study how relay networks perform in a low-SNR regime, where the available degrees of freedom is large and the resulting SNR per degree of freedom is small. In this paper, we investigate the achievable rates and scaling laws of bursty amplify-and-forward relay networks in the low-SNR regime. Specifically, our results allow us to understand the effect of different system parameters on the achievable rates and scaling laws in the low-SNR regime, and highlight the role of bursty transmissions in this regime. These results entirely depend on the geographic locations of the nodes and are applicable for both fixed and random networks. We identify four scaling regimes that depend on the growth of the number of relay nodes and the increase of burstiness relative to the SNR.
{"title":"Bursty narrowband relay networks in the low-SNR regime","authors":"Tony Q. S. Quek, Hyundong Shin","doi":"10.1109/ISITA.2008.4895549","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895549","url":null,"abstract":"In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying and coordinated beamforming. However, many cooperation techniques have been developed for operation in narrowband systems for high signal-to-noise ratio (SNR) applications. It is important to study how relay networks perform in a low-SNR regime, where the available degrees of freedom is large and the resulting SNR per degree of freedom is small. In this paper, we investigate the achievable rates and scaling laws of bursty amplify-and-forward relay networks in the low-SNR regime. Specifically, our results allow us to understand the effect of different system parameters on the achievable rates and scaling laws in the low-SNR regime, and highlight the role of bursty transmissions in this regime. These results entirely depend on the geographic locations of the nodes and are applicable for both fixed and random networks. We identify four scaling regimes that depend on the growth of the number of relay nodes and the increase of burstiness relative to the SNR.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"13 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":"130435322","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.4895560
Y. Kimura, A. Watanabe, T. Katoh, B. B. Bista, T. Takata
In recent years, the use of Weblog is increasing rapidly and some people are using functions to record referer (URL of the page that the site visitor was viewing immediately before) and create back-links to the URL. Recently, as the main purpose to guide visitors to harmful sites, people are using this function to misinterpret referer information and access a large number of sites indiscriminately causing the problem called referrer spam. To combat the referrer spam, the authors have proposed the referrer spam blocking system using Bayesian filter. However, the proposed system has non-negligible false negative (i.e. undetected spam request) ratio of 12%. In this paper, we improve the previous proposed system by introducing image optical character recognition technique. We implement prototype and evaluate computational cost and filtering performance of the proposed scheme and we attain low false negative ratio with reasonable additional computational cost.
{"title":"Improvement of Referrer SPAM blocking system","authors":"Y. Kimura, A. Watanabe, T. Katoh, B. B. Bista, T. Takata","doi":"10.1109/ISITA.2008.4895560","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895560","url":null,"abstract":"In recent years, the use of Weblog is increasing rapidly and some people are using functions to record referer (URL of the page that the site visitor was viewing immediately before) and create back-links to the URL. Recently, as the main purpose to guide visitors to harmful sites, people are using this function to misinterpret referer information and access a large number of sites indiscriminately causing the problem called referrer spam. To combat the referrer spam, the authors have proposed the referrer spam blocking system using Bayesian filter. However, the proposed system has non-negligible false negative (i.e. undetected spam request) ratio of 12%. In this paper, we improve the previous proposed system by introducing image optical character recognition technique. We implement prototype and evaluate computational cost and filtering performance of the proposed scheme and we attain low false negative ratio with reasonable additional computational cost.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"34 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":"116985366","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.4895626
Y. Kida, T. Kida
We consider set of signals with a main-lobe and a pair of small side-lobes. Weighted square-integral of the main-lobe is assumed to be bounded. Moreover, in order to define divergence of side-lobes of error in the sense of worst-case amplitude in attenuation band, we introduce a measure like Kullback-Leibler divergence and this measure is assumed to be bounded. We prove that the presented approximation minimizes various measures of error of running approximation at the same time.
{"title":"The optimum approximation of signals having quite small side-lobes","authors":"Y. Kida, T. Kida","doi":"10.1109/ISITA.2008.4895626","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895626","url":null,"abstract":"We consider set of signals with a main-lobe and a pair of small side-lobes. Weighted square-integral of the main-lobe is assumed to be bounded. Moreover, in order to define divergence of side-lobes of error in the sense of worst-case amplitude in attenuation band, we introduce a measure like Kullback-Leibler divergence and this measure is assumed to be bounded. We prove that the presented approximation minimizes various measures of error of running approximation at the same time.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"5 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":"131075511","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：