会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Markov processor for context encoding from given characters and for
character decoding from given contexts
    • 马尔可夫处理器用于从给定字符进行上下文编码,并从给定的上下文中进行字符解码
    • US4099257A
    • 1978-07-04
    • US720019
    • 1976-09-02
    • Richard Fairbanks ArnoldYitzhak DishonNorman Ken OuchiMarshall I. Schor
    • Richard Fairbanks ArnoldYitzhak DishonNorman Ken OuchiMarshall I. Schor
    • H03M7/40H03M7/42H04L23/00G06F5/00
    • H03M7/4025H03M7/42
    • In an apparatus for generating variable length codewords c(a.sub.i) and c(a.sub.j) responsive to corresponding fixed length codewords b(a.sub.i) and b(a.sub.j), where a.sub.i and a.sub.j are source alphabet characters, a.sub.i .epsilon. A.sub.1 and a.sub.j .epsilon. A.sub.2, ambiguity arises whenever any fixed length character to be encoded can instantaneously represent source characters a.sub.i and a.sub.j drawn from two or more dissimilar alphabets i.e. A.sub.1 or A.sub.2. 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.
    • 在用于产生响应于对应的固定长度码字b(ai)和b(aj))的可变长度码字c(ai)和c(aj)的装置中,其中ai和aj是源字母字符,ai∈A1和ajε2A2, 每当要编码的任何固定长度字符可以瞬时表示从两个或多个不同字母(即A1或A2)绘出的源字符ai和aj时,就会出现歧义。 这通过将马尔科夫处理器与该装置结合在一起来解决。 当一个字母的固定长度字符与另一个字母表中的固定长度字符之间的转换发生在消息上下文中时,处理器将按顺序建立点。 处理器包括状态和转换路径的映射。 该地图模拟固定代码元素运行的某些统计规律,以及出现在第一个运行中的模糊固定代码字符属于给定字母表的相对可能性。 处理器从任意的初始位置开始,根据一系列状态和路径跟踪应用于编码器的固定代码字符的任何给定运行。