OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS

OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS

A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storag...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ZHENG, BIXIA, LUEH, GUEI-YUAN, LIM, CHUOW, JIANG, HONG
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
BASIC ELECTRONIC CIRCUITRY
CALCULATING
CODE CONVERSION IN GENERAL
CODING
COMPUTING
COUNTING
DECODING
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
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 ZHENG, BIXIA
LUEH, GUEI-YUAN
LIM, CHUOW
JIANG, HONG
description A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP2127089A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP2127089A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP2127089A13</originalsourceid><addsrcrecordid>eNrjZPD1Dwjx9HX0UQh29XF1DvH091Pwd1Nw9vcNCHINDgZxXf1CgjxdgxXc_IMQ4n7uCgFB_u5Bjr4Knn7BIUGhYK3BPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXAyNDI3MDC0tHQmAglAODdLpE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS</title><source>esp@cenet</source><creator>ZHENG, BIXIA ; LUEH, GUEI-YUAN ; LIM, CHUOW ; JIANG, HONG</creator><creatorcontrib>ZHENG, BIXIA ; LUEH, GUEI-YUAN ; LIM, CHUOW ; JIANG, HONG</creatorcontrib><description>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</description><language>eng ; fre ; ger</language><subject>BASIC ELECTRONIC CIRCUITRY ; CALCULATING ; CODE CONVERSION IN GENERAL ; CODING ; COMPUTING ; COUNTING ; DECODING ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS</subject><creationdate>2009</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&amp;date=20091202&amp;DB=EPODOC&amp;CC=EP&amp;NR=2127089A1$$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&amp;date=20091202&amp;DB=EPODOC&amp;CC=EP&amp;NR=2127089A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZHENG, BIXIA</creatorcontrib><creatorcontrib>LUEH, GUEI-YUAN</creatorcontrib><creatorcontrib>LIM, CHUOW</creatorcontrib><creatorcontrib>JIANG, HONG</creatorcontrib><title>OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS</title><description>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</description><subject>BASIC ELECTRONIC CIRCUITRY</subject><subject>CALCULATING</subject><subject>CODE CONVERSION IN GENERAL</subject><subject>CODING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DECODING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2009</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPD1Dwjx9HX0UQh29XF1DvH091Pwd1Nw9vcNCHINDgZxXf1CgjxdgxXc_IMQ4n7uCgFB_u5Bjr4Knn7BIUGhYK3BPAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXAyNDI3MDC0tHQmAglAODdLpE</recordid><startdate>20091202</startdate><enddate>20091202</enddate><creator>ZHENG, BIXIA</creator><creator>LUEH, GUEI-YUAN</creator><creator>LIM, CHUOW</creator><creator>JIANG, HONG</creator><scope>EVB</scope></search><sort><creationdate>20091202</creationdate><title>OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS</title><author>ZHENG, BIXIA ; LUEH, GUEI-YUAN ; LIM, CHUOW ; JIANG, HONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP2127089A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2009</creationdate><topic>BASIC ELECTRONIC CIRCUITRY</topic><topic>CALCULATING</topic><topic>CODE CONVERSION IN GENERAL</topic><topic>CODING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DECODING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ZHENG, BIXIA</creatorcontrib><creatorcontrib>LUEH, GUEI-YUAN</creatorcontrib><creatorcontrib>LIM, CHUOW</creatorcontrib><creatorcontrib>JIANG, HONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZHENG, BIXIA</au><au>LUEH, GUEI-YUAN</au><au>LIM, CHUOW</au><au>JIANG, HONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS</title><date>2009-12-02</date><risdate>2009</risdate><abstract>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP2127089A1
source esp@cenet
subjects BASIC ELECTRONIC CIRCUITRY
CALCULATING
CODE CONVERSION IN GENERAL
CODING
COMPUTING
COUNTING
DECODING
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
title OPTIMAL SELECTION OF COMPRESSION ENTRIES FOR COMPRESSING PROGRAM INSTRUCTIONS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A05%3A34IST&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=ZHENG,%20BIXIA&rft.date=2009-12-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP2127089A1%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