Skip-Sliding Window Codes

Ting Yi Wu, Anshoo Tandon, Lav R Varshney, Mehul Motani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window constraint. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J, and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of length L where window i starts at (iJ+1)th symbol for all non-negative integers i such that i\leq k; and the cost constraint E in each window must be satisfied. In this work, two methods are given to enumerate the size of SSW codes. Using the proposed enumeration methods, the noiseless capacity of binary SSW codes is determined and observations such as greater capacity than other classes of codes are made. Moreover, some noisy capacity bounds are given. SSW coding constraints arise in various applications including simultaneous energy and information transfer.

Original languageEnglish (US)
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1799-1803
Number of pages5
ISBN (Print)9781538647806
DOIs
StatePublished - Aug 15 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: Jun 17 2018Jun 22 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June
ISSN (Print)2157-8095

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period6/17/186/22/18

Fingerprint

Sliding Window
Costs
Communication
Coding
Information Transfer
Storage System
Energy Transfer
Enumeration
Communication Systems
Non-negative
Valid
Binary
Integer

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Wu, T. Y., Tandon, A., Varshney, L. R., & Motani, M. (2018). Skip-Sliding Window Codes. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 1799-1803). [8437345] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437345

Skip-Sliding Window Codes. / Wu, Ting Yi; Tandon, Anshoo; Varshney, Lav R; Motani, Mehul.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1799-1803 8437345 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wu, TY, Tandon, A, Varshney, LR & Motani, M 2018, Skip-Sliding Window Codes. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437345, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 1799-1803, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 6/17/18. https://doi.org/10.1109/ISIT.2018.8437345
Wu TY, Tandon A, Varshney LR, Motani M. Skip-Sliding Window Codes. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1799-1803. 8437345. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2018.8437345
Wu, Ting Yi ; Tandon, Anshoo ; Varshney, Lav R ; Motani, Mehul. / Skip-Sliding Window Codes. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1799-1803 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{02d16caec0af40b1b0631a354fb41c89,
title = "Skip-Sliding Window Codes",
abstract = "Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window constraint. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J, and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of length L where window i starts at (iJ+1)th symbol for all non-negative integers i such that i\leq k; and the cost constraint E in each window must be satisfied. In this work, two methods are given to enumerate the size of SSW codes. Using the proposed enumeration methods, the noiseless capacity of binary SSW codes is determined and observations such as greater capacity than other classes of codes are made. Moreover, some noisy capacity bounds are given. SSW coding constraints arise in various applications including simultaneous energy and information transfer.",
author = "Wu, {Ting Yi} and Anshoo Tandon and Varshney, {Lav R} and Mehul Motani",
year = "2018",
month = "8",
day = "15",
doi = "10.1109/ISIT.2018.8437345",
language = "English (US)",
isbn = "9781538647806",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1799--1803",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
address = "United States",

}

TY - GEN

T1 - Skip-Sliding Window Codes

AU - Wu, Ting Yi

AU - Tandon, Anshoo

AU - Varshney, Lav R

AU - Motani, Mehul

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window constraint. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J, and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of length L where window i starts at (iJ+1)th symbol for all non-negative integers i such that i\leq k; and the cost constraint E in each window must be satisfied. In this work, two methods are given to enumerate the size of SSW codes. Using the proposed enumeration methods, the noiseless capacity of binary SSW codes is determined and observations such as greater capacity than other classes of codes are made. Moreover, some noisy capacity bounds are given. SSW coding constraints arise in various applications including simultaneous energy and information transfer.

AB - Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window constraint. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J, and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of length L where window i starts at (iJ+1)th symbol for all non-negative integers i such that i\leq k; and the cost constraint E in each window must be satisfied. In this work, two methods are given to enumerate the size of SSW codes. Using the proposed enumeration methods, the noiseless capacity of binary SSW codes is determined and observations such as greater capacity than other classes of codes are made. Moreover, some noisy capacity bounds are given. SSW coding constraints arise in various applications including simultaneous energy and information transfer.

UR - http://www.scopus.com/inward/record.url?scp=85052468985&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052468985&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2018.8437345

DO - 10.1109/ISIT.2018.8437345

M3 - Conference contribution

AN - SCOPUS:85052468985

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1799

EP - 1803

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -