Pub Date : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174386
Arno Schneuwly, Derya Malak, M. Médard
We study the performance of a coded point-to-point multi-path (MP) packet erasure channel (PEC) network model consisting of one sender (Tx) and one receiver (Rx). A network coded discrete water filling (DWF) scheduler is the core invention of this work. We provide an optimization framework to allocate coded packets over multiple network paths of varying channel conditions while minimizing the transmission delay. Applying the DWF framework to a feedback-based protocol shows significant throughput gains, delay and efficiency improvements compared to single path (SP) systems: In an example network with 4 paths we improve the transmission rate by a factor up to 2. This is not only beneficial for throughput-demanding applications such as large file downloads, but also for real-time systems such as livevideo streams which require low-latency environments. Moreover, we provide the optimization formulation for the DWF algorithm and a low-complexity implementation. The presented findings pave the way for efficient scheduling in next-generation transmission protocols for network coded MP and mesh networks.
{"title":"Discrete Water Filling Multi-Path Packet Scheduling","authors":"Arno Schneuwly, Derya Malak, M. Médard","doi":"10.1109/ISIT44484.2020.9174386","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174386","url":null,"abstract":"We study the performance of a coded point-to-point multi-path (MP) packet erasure channel (PEC) network model consisting of one sender (Tx) and one receiver (Rx). A network coded discrete water filling (DWF) scheduler is the core invention of this work. We provide an optimization framework to allocate coded packets over multiple network paths of varying channel conditions while minimizing the transmission delay. Applying the DWF framework to a feedback-based protocol shows significant throughput gains, delay and efficiency improvements compared to single path (SP) systems: In an example network with 4 paths we improve the transmission rate by a factor up to 2. This is not only beneficial for throughput-demanding applications such as large file downloads, but also for real-time systems such as livevideo streams which require low-latency environments. Moreover, we provide the optimization formulation for the DWF algorithm and a low-complexity implementation. The presented findings pave the way for efficient scheduling in next-generation transmission protocols for network coded MP and mesh networks.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127066872","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174108
Fatemeh Hosseinigoki, O. Kosut
This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.
{"title":"Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel","authors":"Fatemeh Hosseinigoki, O. Kosut","doi":"10.1109/ISIT44484.2020.9174108","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174108","url":null,"abstract":"This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125249822","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174360
Mark Sinzger, Maximilian Gehri, H. Koeppl
A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by exploiting the link with filtering theory. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFF-favoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ON-favoring local optima.
{"title":"Poisson channel with binary Markov input and average sojourn time constraint","authors":"Mark Sinzger, Maximilian Gehri, H. Koeppl","doi":"10.1109/ISIT44484.2020.9174360","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174360","url":null,"abstract":"A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by exploiting the link with filtering theory. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFF-favoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ON-favoring local optima.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755752","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9173987
Hang Liu, Xiaojun Yuan, Y. Zhang
In this paper, we study the channel acquisition problem in a reconfigurable intelligent surface (RIS) assisted multiuser multiple-input multiple-output (MIMO) system, where an RIS with fully passive phase-shift elements is deployed to assist the MIMO communication. The state-of-the-art channel acquisition approach in such a system estimates the cascaded transmitter-to-RIS and RIS-to-receiver channels by adopting excessively long training sequences. To estimate the cascaded channels with an affordable training overhead, we formulate the channel estimation problem as a matrix-calibration based matrix factorization task. By exploiting the information on the slow-varying channel components and the hidden channel sparsity, we propose a novel message-passing based algorithm to factorize the cascaded channels.
{"title":"Message-Passing Based Channel Estimation for Reconfigurable Intelligent Surface Assisted MIMO","authors":"Hang Liu, Xiaojun Yuan, Y. Zhang","doi":"10.1109/ISIT44484.2020.9173987","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9173987","url":null,"abstract":"In this paper, we study the channel acquisition problem in a reconfigurable intelligent surface (RIS) assisted multiuser multiple-input multiple-output (MIMO) system, where an RIS with fully passive phase-shift elements is deployed to assist the MIMO communication. The state-of-the-art channel acquisition approach in such a system estimates the cascaded transmitter-to-RIS and RIS-to-receiver channels by adopting excessively long training sequences. To estimate the cascaded channels with an affordable training overhead, we formulate the channel estimation problem as a matrix-calibration based matrix factorization task. By exploiting the information on the slow-varying channel components and the hidden channel sparsity, we propose a novel message-passing based algorithm to factorize the cascaded channels.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133726333","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174469
Arman Fazeli, A. Vardy, Hanwen Yao
Successive-cancellation decoding has gained much renewed interest since the advent of polar coding a decade ago. For polar codes, successive-cancellation decoding can be accomplished in time O(n log n). However, the complexity of successive-cancellation decoding for other families of codes remains largely unexplored. Herein, we prove that successive-cancellation decoding of general binary linear codes is NP-hard. In order to establish this result, we reduce from maximum-likelihood decoding of linear codes, a well-known NP-complete problem. Unlike maximum-likelihood decoding, however, the successive-cancellation decoding problem depends on the choice of a generator matrix. Thus we further strengthen our result by showing that there exist codes for which successive-cancellation decoding remains hard for every possible choice of the generator matrix. On the other hand, we also observe that polynomial-time successive-cancellation decoding can be extended from polar codes to many other linear codes. Finally, we show that every binary linear code can be encoded as a polar code with dynamically frozen bits. This approach makes it possible to use list-decoding of polar codes to approximate the maximum-likelihood decoding performance of arbitrary codes.
{"title":"Hardness of Successive-Cancellation Decoding of Linear Codes","authors":"Arman Fazeli, A. Vardy, Hanwen Yao","doi":"10.1109/ISIT44484.2020.9174469","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174469","url":null,"abstract":"Successive-cancellation decoding has gained much renewed interest since the advent of polar coding a decade ago. For polar codes, successive-cancellation decoding can be accomplished in time O(n log n). However, the complexity of successive-cancellation decoding for other families of codes remains largely unexplored. Herein, we prove that successive-cancellation decoding of general binary linear codes is NP-hard. In order to establish this result, we reduce from maximum-likelihood decoding of linear codes, a well-known NP-complete problem. Unlike maximum-likelihood decoding, however, the successive-cancellation decoding problem depends on the choice of a generator matrix. Thus we further strengthen our result by showing that there exist codes for which successive-cancellation decoding remains hard for every possible choice of the generator matrix. On the other hand, we also observe that polynomial-time successive-cancellation decoding can be extended from polar codes to many other linear codes. Finally, we show that every binary linear code can be encoded as a polar code with dynamically frozen bits. This approach makes it possible to use list-decoding of polar codes to approximate the maximum-likelihood decoding performance of arbitrary codes.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022381","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174496
Shohei Satake, Yujie Gu
Complex codebooks with small inner-product correlation have many applications such as in code-division multiple access communications and compressed sensing. It is desirable but difficult to construct optimal codebooks achieving the well-known Welch bound. In this paper, complex codebooks are investigated from a graph theoretic perspective. A connection between codebooks and Cayley sum graphs is established. Based on this, many infinite families of complex codebooks are explicitly constructed, which are asymptotically optimal with respect to the Welch bound. These constructions not only include some known constructions as special cases but also provide flexible new parameters.
{"title":"Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach","authors":"Shohei Satake, Yujie Gu","doi":"10.1109/ISIT44484.2020.9174496","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174496","url":null,"abstract":"Complex codebooks with small inner-product correlation have many applications such as in code-division multiple access communications and compressed sensing. It is desirable but difficult to construct optimal codebooks achieving the well-known Welch bound. In this paper, complex codebooks are investigated from a graph theoretic perspective. A connection between codebooks and Cayley sum graphs is established. Based on this, many infinite families of complex codebooks are explicitly constructed, which are asymptotically optimal with respect to the Welch bound. These constructions not only include some known constructions as special cases but also provide flexible new parameters.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116571557","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174375
Shuowen Zhang, Rui Zhang
Intelligent reflecting surface (IRS) is a promising solution to enhance the wireless communication capacity both cost-effectively and energy-efficiently, by properly altering the signal propagation via tuning a large number of passive reflecting units. In this paper, we aim to characterize the fundamental capacity limit of IRS-aided point-to-point multiple-input multiple-output (MIMO) communication systems with multi-antenna transmitter and receiver in general, by jointly optimizing the IRS reflection coefficients and the MIMO transmit covariance matrix. We consider narrowband transmission under frequency-flat fading channels, and develop an efficient alternating optimization algorithm to find a locally optimal solution by iteratively optimizing the transmit covariance matrix or one of the reflection coefficients with the others being fixed. Numerical results show that our proposed algorithm achieves substantially increased capacity compared to traditional MIMO channels without the IRS, and also outperforms various benchmark schemes.
{"title":"On the Capacity of Intelligent Reflecting Surface Aided MIMO Communication","authors":"Shuowen Zhang, Rui Zhang","doi":"10.1109/ISIT44484.2020.9174375","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174375","url":null,"abstract":"Intelligent reflecting surface (IRS) is a promising solution to enhance the wireless communication capacity both cost-effectively and energy-efficiently, by properly altering the signal propagation via tuning a large number of passive reflecting units. In this paper, we aim to characterize the fundamental capacity limit of IRS-aided point-to-point multiple-input multiple-output (MIMO) communication systems with multi-antenna transmitter and receiver in general, by jointly optimizing the IRS reflection coefficients and the MIMO transmit covariance matrix. We consider narrowband transmission under frequency-flat fading channels, and develop an efficient alternating optimization algorithm to find a locally optimal solution by iteratively optimizing the transmit covariance matrix or one of the reflection coefficients with the others being fixed. Numerical results show that our proposed algorithm achieves substantially increased capacity compared to traditional MIMO channels without the IRS, and also outperforms various benchmark schemes.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637845","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174258
Jiongyue Xing, M. Bossert, Sebastian Bitzer, Li Chen
This paper proposes a novel shift-sum decoding scheme for non-binary cyclic codes. Using minimum-weight dual codewords and their cyclic shifts, a reliability measure can be yielded as an indicator for the error position and the error magnitude. Based on this shift-sum decoding concept, a harddecision iterative decoding algorithm is proposed, which can correct errors beyond half of the code’s minimum Hamming distance. By utilizing reliability information from the channel, a soft-decision iterative decoding algorithm is further introduced to improve the decoding performance. These two shift-sum based iterative decoding algorithms are realized with polynomial multiplication and integer (or real number) comparisons, which are hardware-friendly. Simulation results on Reed-Solomon codes and non-binary BCH codes show the decoding potential of the proposed algorithms.
{"title":"Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords","authors":"Jiongyue Xing, M. Bossert, Sebastian Bitzer, Li Chen","doi":"10.1109/ISIT44484.2020.9174258","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174258","url":null,"abstract":"This paper proposes a novel shift-sum decoding scheme for non-binary cyclic codes. Using minimum-weight dual codewords and their cyclic shifts, a reliability measure can be yielded as an indicator for the error position and the error magnitude. Based on this shift-sum decoding concept, a harddecision iterative decoding algorithm is proposed, which can correct errors beyond half of the code’s minimum Hamming distance. By utilizing reliability information from the channel, a soft-decision iterative decoding algorithm is further introduced to improve the decoding performance. These two shift-sum based iterative decoding algorithms are realized with polynomial multiplication and integer (or real number) comparisons, which are hardware-friendly. Simulation results on Reed-Solomon codes and non-binary BCH codes show the decoding potential of the proposed algorithms.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131034096","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174106
C. Leung, M. Motani, R. Bhat
There has been a growing interest in designing neural-network based decoders (or neural decoders in short) for communication systems. In the prior work, we cast the problem of decoding an (n, k) block code as a single-label classification problem, and it is shown that the performance of such single-label neural decoders closely approaches that of the corresponding maximum likelihood soft-decision (ML-SD) decoders. The main issue is that the number of output nodes of single-label neural decoders increases exponentially with k, making it prohibitive to decode a code with medium or large dimension. To address this issue, we first explore a multi-label classification based neural decoder for block codes, in which the number of output nodes increases linearly with k. The complexity of the multi-label neural decoder is lower, but the performance is still close to that of the ML-SD decoder. We also consider concatenating a high-rate short-length outer code with the original code as the inner code. The proposed concatenated decoding architecture consists of a multi-label neural decoder for the inner code and a single label neural decoder for the outer code. The results demonstrate that the concatenated decoding approach leads to better bit and block error performance as compared to a benchmark soft-decision decoder. We note that the overall size of the concatenated neural decoder is close to that of the single-label neural decoder.
{"title":"Multi-Label and Concatenated Neural Block Decoders","authors":"C. Leung, M. Motani, R. Bhat","doi":"10.1109/ISIT44484.2020.9174106","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174106","url":null,"abstract":"There has been a growing interest in designing neural-network based decoders (or neural decoders in short) for communication systems. In the prior work, we cast the problem of decoding an (n, k) block code as a single-label classification problem, and it is shown that the performance of such single-label neural decoders closely approaches that of the corresponding maximum likelihood soft-decision (ML-SD) decoders. The main issue is that the number of output nodes of single-label neural decoders increases exponentially with k, making it prohibitive to decode a code with medium or large dimension. To address this issue, we first explore a multi-label classification based neural decoder for block codes, in which the number of output nodes increases linearly with k. The complexity of the multi-label neural decoder is lower, but the performance is still close to that of the ML-SD decoder. We also consider concatenating a high-rate short-length outer code with the original code as the inner code. The proposed concatenated decoding architecture consists of a multi-label neural decoder for the inner code and a single label neural decoder for the outer code. The results demonstrate that the concatenated decoding approach leads to better bit and block error performance as compared to a benchmark soft-decision decoder. We note that the overall size of the concatenated neural decoder is close to that of the single-label neural decoder.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"14 11-12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131451425","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174430
T. T. Nguyen, K. Cai, Kees A. Schouhamer Immink
The subblock energy-constrained codes (SECCs) have recently attracted attention due to various applications in communication systems such as simultaneous energy and information transfer. In a SECC, each codeword is divided into smaller subblocks, and every subblock is constrained to carry sufficient energy. In this work, we study SECCs under more general constraints, namely bounded SECCs and sliding-window constrained codes (SWCCs), and propose two methods to construct such codes with low redundancy and linear-time complexity, based on Knuth’s balancing technique and sequence replacement technique. For certain codes parameters, our methods incur only one redundant bit.
{"title":"Binary Subblock Energy-Constrained Codes: Knuth’s Balancing and Sequence Replacement Techniques","authors":"T. T. Nguyen, K. Cai, Kees A. Schouhamer Immink","doi":"10.1109/ISIT44484.2020.9174430","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174430","url":null,"abstract":"The subblock energy-constrained codes (SECCs) have recently attracted attention due to various applications in communication systems such as simultaneous energy and information transfer. In a SECC, each codeword is divided into smaller subblocks, and every subblock is constrained to carry sufficient energy. In this work, we study SECCs under more general constraints, namely bounded SECCs and sliding-window constrained codes (SWCCs), and propose two methods to construct such codes with low redundancy and linear-time complexity, based on Knuth’s balancing technique and sequence replacement technique. For certain codes parameters, our methods incur only one redundant bit.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132708937","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
扫码关注我们
求助内容：
应助结果提醒方式：