A simulation for real time data compression

T. Pham
{"title":"A simulation for real time data compression","authors":"T. Pham","doi":"10.1109/ITCC.2000.844270","DOIUrl":null,"url":null,"abstract":"This paper presents one new basic step in real time data compression. The data under compression are random sequence of variable Y which at time t:y/sub 0/, y/sub 1/, ..., y/sub t/ have occurred. Y-random integer-{0, 1, ..., N-1}. So, at time t, if we produce Y~/sub t+1/ to be really a subset to Y so that y/sub t+1//spl isin/Y~/sub t+1/ then we can write or send the index of y/sub t+1/ in Y~/sub t+1/ instead of y/sub t+1/. To do it we create a function F, which learned from some recent past Y by the fixed rules, to map a known set onto V. The known set is the set known by both sender and receiver, and also, the function F is automatically created the same at both sides.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2000.844270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents one new basic step in real time data compression. The data under compression are random sequence of variable Y which at time t:y/sub 0/, y/sub 1/, ..., y/sub t/ have occurred. Y-random integer-{0, 1, ..., N-1}. So, at time t, if we produce Y~/sub t+1/ to be really a subset to Y so that y/sub t+1//spl isin/Y~/sub t+1/ then we can write or send the index of y/sub t+1/ in Y~/sub t+1/ instead of y/sub t+1/. To do it we create a function F, which learned from some recent past Y by the fixed rules, to map a known set onto V. The known set is the set known by both sender and receiver, and also, the function F is automatically created the same at both sides.
实时数据压缩的仿真
本文提出了实时数据压缩的一个新的基本步骤。被压缩的数据是变量Y在时刻t的随机序列:Y /下标0/,Y /下标1/,…y/下标t/已经发生了。y -随机整数-{0,1,…, n - 1}。那么,在时刻t,如果Y~/ t+1/是Y的一个子集那么Y / t+1//spl等于/Y~/ t+1/那么我们可以把Y / t+1/的索引写在Y~/ t+1/里而不是Y / t+1/里。为了做到这一点,我们创建一个函数F,它根据固定的规则从最近的Y学习,将一个已知集合映射到v上。已知集合是发送者和接收者都知道的集合,而且,函数F在两边自动创建相同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信