公开(公告)号：CA1106975A

公开(公告)日：1981-08-11

申请号：CA285875

申请日：1977-08-31

Applicant: IBM

Inventor： ARNOLD RICHARD F ,  DISHON YITZHAK ,  OUCHI NORMAN K ,  SCHOR MARSHALL I

IPC: H03M7/40 ,  H03M7/42 ,  H04L23/00 ,  G06F13/06

Abstract: A MARKOV PROCESSOR FOR CONTEXT ENCODING FROM GIVEN CHARACTERS AND FOR CHARACTER DECODING FROM GIVEN CONTEXTS In an apparatus for generating variable length codewords c(ai) and c(aj) responsive to corresponding fixed length codewords b(ai) and b(aj), where ai and aj are source alphabet characters, ai.epsilon.A1 and aj.epsilon.A2,ambiguity arises whenever any fixed length charac-ter to be encoded can instantaneously represent source characters ai and aj drawn from two or more dissimilar alphabets i.e., A1 or A2. This is resolved by the inclusion of a Markov processor in combination with the apparatus. The processor establishes the point in the sequence when transitions occur between fixed length characters in one alphabet to fixed length characters in another alphabet by the message context. The processor includes a map of state and transition paths. This map models certain statistical regularities of runs of fixed code elements and the relative likelihood that an ambiguous fixed code character appearing in a first run belongs to a given alphabet. The processor, starting from an arbitrary initial position, tracks any given run of fixed code characters applied to the encoder in terms of a succession of states and paths. SA9-75-024 -1-

公开(公告)号：FR2363830A1

公开(公告)日：1978-03-31

申请号：FR7724680

申请日：1977-08-01

Applicant: IBM

Inventor： ARNOLD RICHARD F ,  DISHON YITZHAK ,  OUCHI NORMAN K ,  SCHOR MARSHALL I

IPC: H03M7/40 ,  H03M7/42 ,  H04L23/00 ,  G06F5/00 ,  H03K13/24

Abstract: In an apparatus for generating variable length codewords c(ai) and c(aj) responsive to corresponding fixed length codewords b(ai) and b(aj), where ai and aj are source alphabet characters, ai epsilon A1 and aj epsilon A2, ambiguity arises whenever any fixed length character to be encoded can instantaneously represent source characters ai and aj drawn from two or more dissimilar alphabets i.e. A1 or A2. This is resolved by the inclusion of a Markov processor in combination with the apparatus. The processor establishes the point in the sequence when transitions occur between fixed length characters in one alphabet to fixed length characters in another alphabet by the message context. The processor includes a map of state and transition paths. This map models certain statistical regularities of runs of fixed code elements and the relative likelihood that an ambiguous fixed code character appearing in a first run belongs to a given alphabet. The processor, starting from an arbitrary initial position, tracks any given run of fixed code characters applied to the encoder in terms of a succession of states and paths.

公开(公告)号：AU2814177A

公开(公告)日：1979-03-08

申请号：AU2814177

申请日：1977-08-23

Applicant: IBM

Inventor： ARNOLD RICHARD FAIRBANKS ,  DISHON YITZHAK ,  OUCHI NORMAN KEN ,  SCHOR MARSHALL I

IPC: H03M7/40 ,  H03M7/42 ,  H04L23/00 ,  H04L3/00 ,  G06F15/38 ,  H03K13/24

Abstract: In an apparatus for generating variable length codewords c(ai) and c(aj) responsive to corresponding fixed length codewords b(ai) and b(aj), where ai and aj are source alphabet characters, ai epsilon A1 and aj epsilon A2, ambiguity arises whenever any fixed length character to be encoded can instantaneously represent source characters ai and aj drawn from two or more dissimilar alphabets i.e. A1 or A2. This is resolved by the inclusion of a Markov processor in combination with the apparatus. The processor establishes the point in the sequence when transitions occur between fixed length characters in one alphabet to fixed length characters in another alphabet by the message context. The processor includes a map of state and transition paths. This map models certain statistical regularities of runs of fixed code elements and the relative likelihood that an ambiguous fixed code character appearing in a first run belongs to a given alphabet. The processor, starting from an arbitrary initial position, tracks any given run of fixed code characters applied to the encoder in terms of a succession of states and paths.

公开(公告)号：DE68926326D1

公开(公告)日：1996-05-30

申请号：DE68926326

申请日：1989-07-24

Applicant: IBM

Inventor： SCHOR MARSHALL I

IPC: G06F9/44 ,  G06N5/04

Abstract: In a pattern-matching network, such as a RETE, elapsed time for successive pattern matching operations is reduced by selectively priming predetermined ones of pattern-matching nodes, such as beta nodes, by caching stabilized computed delta input or argument values derived from ones of the predecessor nodes that appear not to change during the conduct of one of the tests in the node. The computed argument value caching occurs in an argument storing portion of any test to be conducted using a cached argument value. At any node, different tests may or may not be able to used cached argument values.

公开(公告)号：CA1105141A

公开(公告)日：1981-07-14

申请号：CA359579

申请日：1980-09-04

Applicant: IBM

Inventor： ARNOLD RICHARD F ,  DISHON YITZHAK ,  OUCHI NORMAN K ,  SCHOR MARSHALL I

IPC: H03K9/08 ,  H03K13/01

Abstract: A MARKOV PROCESSOR FOR CONTEXT ENCODING FROM GIVEN CHARACTERS AND FOR CHARACTER DECODING FROM GIVEN CONTEXTS In an apparatus for generating variable length codewords c(aj) and c(aj) responsive to corresponding fixed length codewords b(ai) and b(aj), where ai and aj are source alphabet characters, ai.epsilon.Al and aj.epsilon.A2, ambiguity arises whenever any fixed length charac-ter to be encoded can instantaneously represent source characters aj and aj drawn from two or more dissimilar alphabets i.e., A1 or A2. This is resolved by the inclusion of a Markov processor in combination with the apparatus. The processor establishes the point in the sequence when transitions occur between fixed length characters in one alphabet to fixed length characters in another alphabet by the message context. The processor includes a map of state and transition paths. This map models certain statistical regularities of runs of fixed code elements and the relative likelihood that an ambiguous fixed code character appearing in a first run belongs to a given alphabet. The processor, starting from an arbitrary initial position, tracks any given run of fixed code characters applied to the encoder in terms of a succession of states and paths. SA9-75-024

公开(公告)号：DE2735319A1

公开(公告)日：1978-03-09

申请号：DE2735319

申请日：1977-08-05

Applicant: IBM

Inventor： ARNOLD RICHARD FAIRBANKS ,  DISHON YITZHAK ,  OUCHI NORMAN KEN ,  SCHOR MARSHALL I

IPC: H03M7/40 ,  H03M7/42 ,  H04L23/00 ,  G06F5/00

Abstract: In an apparatus for generating variable length codewords c(ai) and c(aj) responsive to corresponding fixed length codewords b(ai) and b(aj), where ai and aj are source alphabet characters, ai epsilon A1 and aj epsilon A2, ambiguity arises whenever any fixed length character to be encoded can instantaneously represent source characters ai and aj drawn from two or more dissimilar alphabets i.e. A1 or A2. This is resolved by the inclusion of a Markov processor in combination with the apparatus. The processor establishes the point in the sequence when transitions occur between fixed length characters in one alphabet to fixed length characters in another alphabet by the message context. The processor includes a map of state and transition paths. This map models certain statistical regularities of runs of fixed code elements and the relative likelihood that an ambiguous fixed code character appearing in a first run belongs to a given alphabet. The processor, starting from an arbitrary initial position, tracks any given run of fixed code characters applied to the encoder in terms of a succession of states and paths.