Pub Date : 2018-01-11DOI: 10.1109/TIT.2018.2791995
Shaofeng Zou, Yingbin Liang, L. Lai, H. Poor, S. Shamai
A three-receiver degraded broadcast channel with secrecy outside of a bounded range is studied, in which the channel quality gradually degrades from receiver 3 to receiver 1. The transmitter has three messages intended for the receivers with receiver 3 decoding all messages, receiver 2 decoding the first two messages, and receiver 1 decoding only the first message. Furthermore, the third message should be kept secure from receiver 1. The discrete memoryless channel is studied and the secrecy capacity region is characterized. The achievable scheme is based on superposition coding and random binning, in which one superposition layer and random binning together provide secrecy. The converse proof is derived based on the insight obtained from the achievable scheme so that manipulations of terms yield tight rate bounds.
{"title":"Degraded broadcast channel: Secrecy outside of a bounded range","authors":"Shaofeng Zou, Yingbin Liang, L. Lai, H. Poor, S. Shamai","doi":"10.1109/TIT.2018.2791995","DOIUrl":"https://doi.org/10.1109/TIT.2018.2791995","url":null,"abstract":"A three-receiver degraded broadcast channel with secrecy outside of a bounded range is studied, in which the channel quality gradually degrades from receiver 3 to receiver 1. The transmitter has three messages intended for the receivers with receiver 3 decoding all messages, receiver 2 decoding the first two messages, and receiver 1 decoding only the first message. Furthermore, the third message should be kept secure from receiver 1. The discrete memoryless channel is studied and the secrecy capacity region is characterized. The achievable scheme is based on superposition coding and random binning, in which one superposition layer and random binning together provide secrecy. The converse proof is derived based on the insight obtained from the achievable scheme so that manipulations of terms yield tight rate bounds.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731296","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133114
A. Frolov, V. Zyablov
The paper addresses the problem of constructing an asynchronous multiple access system for a multi-user Q-frequency channel with additive white Gaussian noise (AWGN). We propose a coding scheme for the channel which allows a large number of users to work simultaneously in the system. The scheme combines the ideas of Frequency Shift Keying (FSK) and Frequency Hopping Spread Spectrum (FHSS). The major component of the scheme is a non-binary low-density parity-check (LDPC) code. The efficiency of the resulting multiple-access system is shown by simulations.
{"title":"A new coding method for a multiple-access system with a large number of active users","authors":"A. Frolov, V. Zyablov","doi":"10.1109/ITW.2015.7133114","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133114","url":null,"abstract":"The paper addresses the problem of constructing an asynchronous multiple access system for a multi-user Q-frequency channel with additive white Gaussian noise (AWGN). We propose a coding scheme for the channel which allows a large number of users to work simultaneously in the system. The scheme combines the ideas of Frequency Shift Keying (FSK) and Frequency Hopping Spread Spectrum (FHSS). The major component of the scheme is a non-binary low-density parity-check (LDPC) code. The efficiency of the resulting multiple-access system is shown by simulations.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123031936","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133100
Yonathan Murin, Y. Kaspi, R. Dabora, Deniz Gündüz
We study the uncoded transmission of a bivariate Gaussian source over a two-user symmetric Gaussian broadcast channel with a unit-delay noiseless feedback (GBCF), assuming that each (uncoded) source sample is transmitted using a finite number of channel uses, and that the transmission scheme is linear. We consider three transmission schemes: The scheme of Ardestanizadeh et al., which is based on linear quadratic Gaussian (LQG) control theory, the scheme of Ozarow and Leung (OL), and a novel scheme derived in this work designed using a dynamic programing (DP) approach. For the LQG scheme we characterize the minimal number of channel uses needed to achieve a specified mean-square error (MSE). For the OL scheme we present lower and upper bounds on the minimal number of channel uses needed to achieve a specified MSE, which become tight when the signal-to-noise ratio approaches zero. Finally, we show that for any fixed and finite number of channel uses, the proposed DP scheme achieves MSE lower than the MSE achieved by either the LQG or the OL schemes.
{"title":"On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback","authors":"Yonathan Murin, Y. Kaspi, R. Dabora, Deniz Gündüz","doi":"10.1109/ITW.2015.7133100","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133100","url":null,"abstract":"We study the uncoded transmission of a bivariate Gaussian source over a two-user symmetric Gaussian broadcast channel with a unit-delay noiseless feedback (GBCF), assuming that each (uncoded) source sample is transmitted using a finite number of channel uses, and that the transmission scheme is linear. We consider three transmission schemes: The scheme of Ardestanizadeh et al., which is based on linear quadratic Gaussian (LQG) control theory, the scheme of Ozarow and Leung (OL), and a novel scheme derived in this work designed using a dynamic programing (DP) approach. For the LQG scheme we characterize the minimal number of channel uses needed to achieve a specified mean-square error (MSE). For the OL scheme we present lower and upper bounds on the minimal number of channel uses needed to achieve a specified MSE, which become tight when the signal-to-noise ratio approaches zero. Finally, we show that for any fixed and finite number of channel uses, the proposed DP scheme achieves MSE lower than the MSE achieved by either the LQG or the OL schemes.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114640023","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133138
Mainak Chowdhury, Alexandros Manolakos, Felipe Gómez-Cuba, E. Erkip, A. Goldsmith
This paper studies noncoherent wideband systems with a single antenna transmitter and a multiple antenna receiver with many elements, under signaling with peak-to-average power ratio constraints. The analysis considers the scaling behavior of capacity and achievable rates by letting both the number of antennas and the bandwidth go to infinity jointly. In contrast to prior work on wideband single input single output (SISO) channels without a-priori channel state information, it is shown that a sufficiently large number of receive antennas can make up for the vanishingly small SNR at each antenna. In particular, it is shown that when bandwidth grows sufficiently slowly with the number of antennas, the capacity scaling with an increasing number of receive antennas is the same as the optimal coherent capacity scaling. If the bandwidth grows faster than a certain threshold, however, the additional bandwidth does not help because a finite transmit power is spread over an excessively large bandwidth.
{"title":"Capacity scaling in noncoherent wideband massive SIMO systems","authors":"Mainak Chowdhury, Alexandros Manolakos, Felipe Gómez-Cuba, E. Erkip, A. Goldsmith","doi":"10.1109/ITW.2015.7133138","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133138","url":null,"abstract":"This paper studies noncoherent wideband systems with a single antenna transmitter and a multiple antenna receiver with many elements, under signaling with peak-to-average power ratio constraints. The analysis considers the scaling behavior of capacity and achievable rates by letting both the number of antennas and the bandwidth go to infinity jointly. In contrast to prior work on wideband single input single output (SISO) channels without a-priori channel state information, it is shown that a sufficiently large number of receive antennas can make up for the vanishingly small SNR at each antenna. In particular, it is shown that when bandwidth grows sufficiently slowly with the number of antennas, the capacity scaling with an increasing number of receive antennas is the same as the optimal coherent capacity scaling. If the bandwidth grows faster than a certain threshold, however, the additional bandwidth does not help because a finite transmit power is spread over an excessively large bandwidth.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132047815","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133076
Aditya Vempaty, L. Varshney
We consider the CEO problem for belief sharing. Multiple subordinates observe independently corrupted versions of uniformly distributed data and transmit coded versions over rate-limited links to a CEO who then estimates the underlying data. Agents are not allowed to convene before transmitting their observations. This formulation is motivated by the practical problem of a firm's CEO estimating uniformly distributed beliefs about a sequence of events, before acting on them. Agents' observations are modeled as jointly distributed with the underlying data through a given conditional probability density function. We study the asymptotic behavior of the minimum achievable mean squared error distortion at the CEO in the limit when the number of agents L and the sum rate R tend to infinity. We establish a 1/R2 convergence of the distortion, an intermediate regime of performance between the exponential behavior in discrete CEO problems [Berger, Zhang, and Viswanathan (1996)], and the 1/R behavior in Gaussian CEO problems [Viswanathan and Berger (1997)]. Achievability is proved by a layered architecture with scalar quantization, distributed entropy coding, and midrange estimation. The converse is proved using the Bayesian Chazan-Zakai-Ziv bound.
我们考虑CEO问题的信念共享。多个下属独立地观察均匀分布数据的损坏版本，并通过速率限制的链接将编码版本传输给CEO，然后由后者估计底层数据。特工们在传送他们的观察结果之前是不允许开会的。这个公式是由一个公司的CEO在对一系列事件采取行动之前估计均匀分布信念的实际问题所激发的。通过给定的条件概率密度函数，将智能体的观测数据与底层数据联合分布。研究了当代理数L和和速率R趋于无穷时，在极限情况下，均方误差畸变的最小可达性的渐近行为。我们建立了失真的1/R2收敛性，这是离散CEO问题中的指数行为[Berger, Zhang, and Viswanathan(1996)]和高斯CEO问题中的1/R行为之间的一个中间机制[Viswanathan and Berger(1997)]。通过采用标量量化、分布式熵编码和中程估计的分层体系结构证明了其可实现性。利用贝叶斯Chazan-Zakai-Ziv界证明了其逆命题。
{"title":"CEO problem for belief sharing","authors":"Aditya Vempaty, L. Varshney","doi":"10.1109/ITW.2015.7133076","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133076","url":null,"abstract":"We consider the CEO problem for belief sharing. Multiple subordinates observe independently corrupted versions of uniformly distributed data and transmit coded versions over rate-limited links to a CEO who then estimates the underlying data. Agents are not allowed to convene before transmitting their observations. This formulation is motivated by the practical problem of a firm's CEO estimating uniformly distributed beliefs about a sequence of events, before acting on them. Agents' observations are modeled as jointly distributed with the underlying data through a given conditional probability density function. We study the asymptotic behavior of the minimum achievable mean squared error distortion at the CEO in the limit when the number of agents L and the sum rate R tend to infinity. We establish a 1/R2 convergence of the distortion, an intermediate regime of performance between the exponential behavior in discrete CEO problems [Berger, Zhang, and Viswanathan (1996)], and the 1/R behavior in Gaussian CEO problems [Viswanathan and Berger (1997)]. Achievability is proved by a layered architecture with scalar quantization, distributed entropy coding, and midrange estimation. The converse is proved using the Bayesian Chazan-Zakai-Ziv bound.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123435063","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133113
A. Kipnis, A. Goldsmith, Yonina C. Eldar
The minimal sampling frequency required to achieve the rate-distortion function of a Gaussian stationary process is analyzed. Although the Nyquist rate is the minimal sampling frequency that allows perfect reconstruction of a bandlimited signal from its samples, relaxing perfect reconstruction to a prescribed distortion may allow a lower sampling frequency to achieve the optimal rate-distortion trade-off. We consider a combined sampling and source coding problem in which an analog Gaussian source is reconstructed from its rate-limited sub-Nyquist samples. We show that each point on the distortion-rate curve of the source corresponds to a sampling frequency fDR smaller than the Nyquist rate, such that this point can be achieved by sampling at frequency fDR or above. This can be seen as an extension of the sampling theorem in the sense that it describes the minimal amount of excess distortion in the reconstruction due to lossy compression of the samples, and provides the minimal sampling frequency required in order to achieve that distortion.
{"title":"Sub-Nyquist sampling achieves optimal rate-distortion","authors":"A. Kipnis, A. Goldsmith, Yonina C. Eldar","doi":"10.1109/ITW.2015.7133113","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133113","url":null,"abstract":"The minimal sampling frequency required to achieve the rate-distortion function of a Gaussian stationary process is analyzed. Although the Nyquist rate is the minimal sampling frequency that allows perfect reconstruction of a bandlimited signal from its samples, relaxing perfect reconstruction to a prescribed distortion may allow a lower sampling frequency to achieve the optimal rate-distortion trade-off. We consider a combined sampling and source coding problem in which an analog Gaussian source is reconstructed from its rate-limited sub-Nyquist samples. We show that each point on the distortion-rate curve of the source corresponds to a sampling frequency fDR smaller than the Nyquist rate, such that this point can be achieved by sampling at frequency fDR or above. This can be seen as an extension of the sampling theorem in the sense that it describes the minimal amount of excess distortion in the reconstruction due to lossy compression of the samples, and provides the minimal sampling frequency required in order to achieve that distortion.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482117","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133172
Mingyue Ji, A. Tulino, J. Llorca, G. Caire
The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple users, each having the capability to store segments (packets) of the library files, over a shared multicast link. Each user requests one file from the library according to a common demand distribution and the server sends a coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible average codeword length to satisfy such requests. In this paper, we consider the generalization to the case where each user places L ≥ 1 independent requests according to the same common demand distribution. We propose an achievable scheme based on random vector (packetized) caching placement and multiple groupcast index coding, shown to be order-optimal in the asymptotic regime in which the number of packets per file B goes to infinity. We then show that the scalar (B = 1) version of the proposed scheme can still preserve order-optimality when the number of per-user requests L is large enough. Our results provide the first order-optimal characterization of the shared link caching network with multiple random requests, revealing the key effects of L on the performance of caching-aided coded multicast schemes.
{"title":"Caching-aided coded multicasting with multiple random requests","authors":"Mingyue Ji, A. Tulino, J. Llorca, G. Caire","doi":"10.1109/ITW.2015.7133172","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133172","url":null,"abstract":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple users, each having the capability to store segments (packets) of the library files, over a shared multicast link. Each user requests one file from the library according to a common demand distribution and the server sends a coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible average codeword length to satisfy such requests. In this paper, we consider the generalization to the case where each user places L ≥ 1 independent requests according to the same common demand distribution. We propose an achievable scheme based on random vector (packetized) caching placement and multiple groupcast index coding, shown to be order-optimal in the asymptotic regime in which the number of packets per file B goes to infinity. We then show that the scalar (B = 1) version of the proposed scheme can still preserve order-optimality when the number of per-user requests L is large enough. Our results provide the first order-optimal characterization of the shared link caching network with multiple random requests, revealing the key effects of L on the performance of caching-aided coded multicast schemes.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058602","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133129
Zhao Wang, Ming Xiao, M. Skoglund, H. Poor
The secrecy degrees of freedom (SDOF) of the multiple-input single-output (MISO) broadcast channel with confidential messages (BCC) is studied. The network consists of a two-antenna transmitter and two single-antenna receivers, each demanding a confidential message from the transmitter. The problem is investigated with mixed channel state information at transmitter (CSIT), which is a combination of perfect delayed CSIT and inaccurate current CSIT. When the variance of the estimation error for the current CSIT scales with O(P-α), with α ∈ [0, 1], it is shown that the optimal sum SDOF of the considered BCC is 1+α. Furthermore, the optimal SDOF region of the considered MISO BCC is shown to be a polygon scaling with α. The proposed scheme is based on an artificial noise alignment that can combine the benefits of both types of delayed and current CSIT. These results can be seen as an extension of results of Yang et al. and Gou-Jafar to multiuser networks with secrecy constraints.
{"title":"Secrecy degrees of freedom of the two-user MISO broadcast channel with mixed CSIT","authors":"Zhao Wang, Ming Xiao, M. Skoglund, H. Poor","doi":"10.1109/ITW.2015.7133129","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133129","url":null,"abstract":"The secrecy degrees of freedom (SDOF) of the multiple-input single-output (MISO) broadcast channel with confidential messages (BCC) is studied. The network consists of a two-antenna transmitter and two single-antenna receivers, each demanding a confidential message from the transmitter. The problem is investigated with mixed channel state information at transmitter (CSIT), which is a combination of perfect delayed CSIT and inaccurate current CSIT. When the variance of the estimation error for the current CSIT scales with O(P-α), with α ∈ [0, 1], it is shown that the optimal sum SDOF of the considered BCC is 1+α. Furthermore, the optimal SDOF region of the considered MISO BCC is shown to be a polygon scaling with α. The proposed scheme is based on an artificial noise alignment that can combine the benefits of both types of delayed and current CSIT. These results can be seen as an extension of results of Yang et al. and Gou-Jafar to multiuser networks with secrecy constraints.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127673373","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133159
A. Vardy, Eitan Yaakobi
One of the prominent properties of flash memories is their asymmetry between writing and erasing. When pages, which are the smallest write unit, are updated, they are written in a new copy rather than in place. As a result, every page can have more than one copy in the memory, its current version as well as some of its old invalid copies. Each invalid copy can be cleaned only when the block in which it resides is erased (blocks are the smallest erase unit and are typically in the order of hundreds of pages). This write property introduces redundancy in the memory, given by the invalid copies of the pages, and as a result can also affect the memory lifetime. In this paper we show how this inherent redundancy of invalid pages can be taken advantage of for the purpose of improving RAID solutions which are based upon Solid State Drives (SSDs). Our main contribution in the paper is a construction which shows how to improve the repair bandwidth of codes which are implemented on SSDs. We first show that with a single parity it is possible to transmit on the average roughly half of the data for rebuilding a single drive failure. We then show how these ideas can be extended for Zigzag codes with two parities and again improve their repair bandwidth.
{"title":"Codes for RAID solutions based upon SSDs","authors":"A. Vardy, Eitan Yaakobi","doi":"10.1109/ITW.2015.7133159","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133159","url":null,"abstract":"One of the prominent properties of flash memories is their asymmetry between writing and erasing. When pages, which are the smallest write unit, are updated, they are written in a new copy rather than in place. As a result, every page can have more than one copy in the memory, its current version as well as some of its old invalid copies. Each invalid copy can be cleaned only when the block in which it resides is erased (blocks are the smallest erase unit and are typically in the order of hundreds of pages). This write property introduces redundancy in the memory, given by the invalid copies of the pages, and as a result can also affect the memory lifetime. In this paper we show how this inherent redundancy of invalid pages can be taken advantage of for the purpose of improving RAID solutions which are based upon Solid State Drives (SSDs). Our main contribution in the paper is a construction which shows how to improve the repair bandwidth of codes which are implemented on SSDs. We first show that with a single parity it is possible to transmit on the average roughly half of the data for rebuilding a single drive failure. We then show how these ideas can be extended for Zigzag codes with two parities and again improve their repair bandwidth.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125805333","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 : 2015-06-25DOI: 10.1109/ITW.2015.7133164
Ying-zong Huang, G. Wornell
High-performance Model-Code Separation (MCS) architectures for lossless compression are practically viable with graphical message-passing in the decoder. This paper extends separation architectures to lossy compression by constructing model-free but semantics-aware encoders and contributes a new inference-friendly low-density hashing quantizer (LDHQ) to support decoding.
{"title":"Separation architectures for lossy compression","authors":"Ying-zong Huang, G. Wornell","doi":"10.1109/ITW.2015.7133164","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133164","url":null,"abstract":"High-performance Model-Code Separation (MCS) architectures for lossless compression are practically viable with graphical message-passing in the decoder. This paper extends separation architectures to lossy compression by constructing model-free but semantics-aware encoders and contributes a new inference-friendly low-density hashing quantizer (LDHQ) to support decoding.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127379476","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
扫码关注我们
求助内容：
应助结果提醒方式：