DATA PROCESSOR

PROBLEM TO BE SOLVED: To fast and effectively compress even such data that are in short of regularity and have a small number of iterative patterns by preserving the base data, comparing the data fetched successively with the base data to take out each difference between both data and preserving the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	SUZUKI KATSUO, KOGA NOBUYOSHI, TOMOBE MASARU, ITO TOSHIHIKO, KANAZAWA TAMOTSU
Format:	Patent
Sprache:	eng
Schlagworte:	BASIC ELECTRONIC CIRCUITRY CODE CONVERSION IN GENERAL CODING DECODING ELECTRICITY
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	SUZUKI KATSUO KOGA NOBUYOSHI TOMOBE MASARU ITO TOSHIHIKO KANAZAWA TAMOTSU
description	PROBLEM TO BE SOLVED: To fast and effectively compress even such data that are in short of regularity and have a small number of iterative patterns by preserving the base data, comparing the data fetched successively with the base data to take out each difference between both data and preserving these difference data. SOLUTION: When the processing is started, the base data 217 serving as the base of comparison and recovery are saved to a compressed data saving file 215 from a source data file 201. A difference data saving program 212 compares the data 217 with the current data 202 contained in the file 201 to extract the difference data 204, 205... 209 and monitors whether or not the sizes of these data 204 to 209 are larger than the least number of bytes of difference storage. If those sizes exceed the least number of bytes, the difference data 219 are stored in a difference data area 216 included in the file 215 together with the individual difference data information 218 on the addresses, etc., of the data 219.
format	Patent
fullrecord	<record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JPH1117554A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JPH1117554A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JPH1117554A3</originalsourceid><addsrcrecordid>eNrjZOBzcQxxVAgI8nd2DQ72D-JhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfFeAR6GhobmpqYmjsZEKAEAltIcvw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>DATA PROCESSOR</title><source>esp@cenet</source><creator>SUZUKI KATSUO ; KOGA NOBUYOSHI ; TOMOBE MASARU ; ITO TOSHIHIKO ; KANAZAWA TAMOTSU</creator><creatorcontrib>SUZUKI KATSUO ; KOGA NOBUYOSHI ; TOMOBE MASARU ; ITO TOSHIHIKO ; KANAZAWA TAMOTSU</creatorcontrib><description>PROBLEM TO BE SOLVED: To fast and effectively compress even such data that are in short of regularity and have a small number of iterative patterns by preserving the base data, comparing the data fetched successively with the base data to take out each difference between both data and preserving these difference data. SOLUTION: When the processing is started, the base data 217 serving as the base of comparison and recovery are saved to a compressed data saving file 215 from a source data file 201. A difference data saving program 212 compares the data 217 with the current data 202 contained in the file 201 to extract the difference data 204, 205... 209 and monitors whether or not the sizes of these data 204 to 209 are larger than the least number of bytes of difference storage. If those sizes exceed the least number of bytes, the difference data 219 are stored in a difference data area 216 included in the file 215 together with the individual difference data information 218 on the addresses, etc., of the data 219.</description><edition>6</edition><language>eng</language><subject>BASIC ELECTRONIC CIRCUITRY ; CODE CONVERSION IN GENERAL ; CODING ; DECODING ; ELECTRICITY</subject><creationdate>1999</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19990122&DB=EPODOC&CC=JP&NR=H1117554A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=19990122&DB=EPODOC&CC=JP&NR=H1117554A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SUZUKI KATSUO</creatorcontrib><creatorcontrib>KOGA NOBUYOSHI</creatorcontrib><creatorcontrib>TOMOBE MASARU</creatorcontrib><creatorcontrib>ITO TOSHIHIKO</creatorcontrib><creatorcontrib>KANAZAWA TAMOTSU</creatorcontrib><title>DATA PROCESSOR</title><description>PROBLEM TO BE SOLVED: To fast and effectively compress even such data that are in short of regularity and have a small number of iterative patterns by preserving the base data, comparing the data fetched successively with the base data to take out each difference between both data and preserving these difference data. SOLUTION: When the processing is started, the base data 217 serving as the base of comparison and recovery are saved to a compressed data saving file 215 from a source data file 201. A difference data saving program 212 compares the data 217 with the current data 202 contained in the file 201 to extract the difference data 204, 205... 209 and monitors whether or not the sizes of these data 204 to 209 are larger than the least number of bytes of difference storage. If those sizes exceed the least number of bytes, the difference data 219 are stored in a difference data area 216 included in the file 215 together with the individual difference data information 218 on the addresses, etc., of the data 219.</description><subject>BASIC ELECTRONIC CIRCUITRY</subject><subject>CODE CONVERSION IN GENERAL</subject><subject>CODING</subject><subject>DECODING</subject><subject>ELECTRICITY</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>1999</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZOBzcQxxVAgI8nd2DQ72D-JhYE1LzClO5YXS3AwKbq4hzh66qQX58anFBYnJqXmpJfFeAR6GhobmpqYmjsZEKAEAltIcvw</recordid><startdate>19990122</startdate><enddate>19990122</enddate><creator>SUZUKI KATSUO</creator><creator>KOGA NOBUYOSHI</creator><creator>TOMOBE MASARU</creator><creator>ITO TOSHIHIKO</creator><creator>KANAZAWA TAMOTSU</creator><scope>EVB</scope></search><sort><creationdate>19990122</creationdate><title>DATA PROCESSOR</title><author>SUZUKI KATSUO ; KOGA NOBUYOSHI ; TOMOBE MASARU ; ITO TOSHIHIKO ; KANAZAWA TAMOTSU</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JPH1117554A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>1999</creationdate><topic>BASIC ELECTRONIC CIRCUITRY</topic><topic>CODE CONVERSION IN GENERAL</topic><topic>CODING</topic><topic>DECODING</topic><topic>ELECTRICITY</topic><toplevel>online_resources</toplevel><creatorcontrib>SUZUKI KATSUO</creatorcontrib><creatorcontrib>KOGA NOBUYOSHI</creatorcontrib><creatorcontrib>TOMOBE MASARU</creatorcontrib><creatorcontrib>ITO TOSHIHIKO</creatorcontrib><creatorcontrib>KANAZAWA TAMOTSU</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SUZUKI KATSUO</au><au>KOGA NOBUYOSHI</au><au>TOMOBE MASARU</au><au>ITO TOSHIHIKO</au><au>KANAZAWA TAMOTSU</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>DATA PROCESSOR</title><date>1999-01-22</date><risdate>1999</risdate><abstract>PROBLEM TO BE SOLVED: To fast and effectively compress even such data that are in short of regularity and have a small number of iterative patterns by preserving the base data, comparing the data fetched successively with the base data to take out each difference between both data and preserving these difference data. SOLUTION: When the processing is started, the base data 217 serving as the base of comparison and recovery are saved to a compressed data saving file 215 from a source data file 201. A difference data saving program 212 compares the data 217 with the current data 202 contained in the file 201 to extract the difference data 204, 205... 209 and monitors whether or not the sizes of these data 204 to 209 are larger than the least number of bytes of difference storage. If those sizes exceed the least number of bytes, the difference data 219 are stored in a difference data area 216 included in the file 215 together with the individual difference data information 218 on the addresses, etc., of the data 219.</abstract><edition>6</edition><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng
recordid	cdi_epo_espacenet_JPH1117554A
source	esp@cenet
subjects	BASIC ELECTRONIC CIRCUITRY CODE CONVERSION IN GENERAL CODING DECODING ELECTRICITY
title	DATA PROCESSOR
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T14%3A15%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=SUZUKI%20KATSUO&rft.date=1999-01-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJPH1117554A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true