WO2023229481A1 - Représentation relais de données intégrales - Google Patents

Représentation relais de données intégrales Download PDF

Info

Publication number
WO2023229481A1
WO2023229481A1 PCT/RU2022/000177 RU2022000177W WO2023229481A1 WO 2023229481 A1 WO2023229481 A1 WO 2023229481A1 RU 2022000177 W RU2022000177 W RU 2022000177W WO 2023229481 A1 WO2023229481 A1 WO 2023229481A1
Authority
WO
WIPO (PCT)
Prior art keywords
current
sign
iii
code
numbers
Prior art date
Application number
PCT/RU2022/000177
Other languages
English (en)
Russian (ru)
Inventor
Александр Валерьевич ИВАНОВ
Original Assignee
Александр Валерьевич ИВАНОВ
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Александр Валерьевич ИВАНОВ filed Critical Александр Валерьевич ИВАНОВ
Priority to PCT/RU2022/000177 priority Critical patent/WO2023229481A1/fr
Publication of WO2023229481A1 publication Critical patent/WO2023229481A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/46—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind

Definitions

  • the present invention relates to methods for encoding (English, coding) and transcoding (English, transcoding) digital signals, whose information equivalent can be represented as a regular sequence of integers, that is, in the form of numeric data.
  • the prototype of the proposed invention is a method of representing ten bundles of eight binary numbers plus a sign in the form of a sequence of eighty-one binary numbers (English 80B/81B encoding), known from the following source:
  • Each link is a code plus a sign, or, taking into account the direct indication of the cycle on which it falls, the #th code plus the #th sign, or briefly, hereinafter, the superscript is # code plus # sign, during further processing they are recognized in the following order:
  • a combination of two or more integers can be uniquely reversible - through their weighing - expressed as one number, and then denoted all of them together as this one number.
  • the information equivalent of the original digital signal can be represented as a sequence, whose regular (that is, periodically repeated) section is formed by two rows (m columns) of m (two) integers, each belonging to a set of cardinality L / s or N , respectively:
  • Finding such a function begins by filling it with numbers dependent on the argument, according to the template below:
  • # xD / C denotes a data octet
  • the corresponding column (#) of the function contains a preliminary result consisting of eight #1 1G binary numbers do- 7 , which together constitute one of the / vD allowed combinations, uniquely associated with the combination x0 -7 .
  • Finding such a function is completed by a set of horizontal and vertical permutations of binary numbers within the framework of the preliminary result, then, those and there, if, for which and where it is necessary to make such a finding of the function uniquely reversible.
  • Example 0A shows the representation function by [1 ( ⁇ ) ] when all ten (1st to 10th) connectors correspond to data octets:
  • Example OB shows the representation function by [1 ( ' ) ], when all the same ten (from the 1st to the 10th) connectives correspond to control characters - here and below, y horizontally (from one column to another) and vertically (within the same column) of rearranged binary numbers, the upper and lower indices are underlined, respectively:
  • Example OB shows the representation function by [1 ( " when only the first (1st) connective matches the control character: 1 rge 1 2 3 4 5 6 7 8 9 10
  • Example 0G shows the representation function by [1 ( ' ) ], when only the last (10th) connective corresponds to the control character: 1 rge 1 2 3 4 5 6 7 8 9 10
  • the OD example shows the representation function by [1 ( ⁇ ], when three selective (3rd, 9th, 10th) connectives correspond to control symbols: 1 rge 1 2 3 4 5 6 7 8 9 10 ⁇ 7
  • the prototype is characterized by the following features, which are also its limitations (disadvantages) - here and further, when describing the prototype or when comparing with it, it is the general (generalized) case that is considered: the time it takes to find the representation function from the selected argument (signal processing delay) depends both on the duration of the argument (t), known initially, and on the contents of the argument, changing arbitrarily over time - see (*); In addition, finding the representation function requires rearranging the binary numbers that make up the argument, both between the columns corresponding to the cycles in which such numbers were delivered, and within these same columns, that is, both horizontal and vertical.
  • the present invention is aimed at overcoming the limitations inherent in the prototype.
  • 1111 is uniquely reversibly comparable to the current code, if the current sign means “data”, when among its previous ones in the section there is not a single one meaning “control”, about it to the next code, if the current sign not the last one on the site if the next sign for him means “data”, when among himself or his previous ones on the site there is at least one meaning “management”, because of the cycle of that sign meaning “control”, the closest current attribute among itself and its previous ones on the site, if the current attribute is the last on the site or if its next attribute means “control”, when among itself or its previous ones on the site there is at least one meaning “control”;
  • the main technical result of this solution is that it completely eliminates the rearrangement of numbers within columns, that is, between rows, and significantly reduces the time it takes for the representation function to move from the selected argument to a fixed value in two cycles, regardless of the duration and content of such an argument.
  • the representation function disclosed above allows you to receive a processed digital signal with a minimum delay and with a minimum, only horizontal rearrangement of numbers.
  • I I numbers are chosen from sets, at least one is prime
  • Each code plus sign combination delivered by the original digital signal on the corresponding (#th) cycle of its corresponding section, consisting of n > 0 such cycles, is associated with the following three numbers, one for each of the three rows - relay, running, visual, when attribute means “data”:
  • # t selected from a set of cardinality NT > 1 + 1 ;
  • # f selected from a set of cardinality N P d > 1 .
  • Each code plus sign combination delivered by the original digital signal on the corresponding (#th) cycle of its corresponding section, consisting of n > 0 such cycles, is associated with the following three numbers, one for each of the three rows - relay, running, visual, when sign means “control”:
  • # b - selected from a set of power TVB > 1 + 1;
  • # f selected from a set of cardinality N Pc > 1 .
  • Numbers p and f are not subject to permutation, numbers b and 1 can only move to the right (“to the future”), numbers t can only move to the left (“to the past”) and only once, which reduces the signal processing delay to a constant:
  • N, N D , N c (see earlier) and 2Vp, N T , N Pd , N B , N L , N Fc , expressing each power of the corresponding set, statically characterizes the representation function described (defined) by them, Moreover, such numbers can be interconnected - balanced among themselves - in a unique way in each practical case, including when N c > A Fc And, accordingly, N > n x (N c / AA C ).
  • AAd AA c 2 1 2° 2 1 2 1 2 1 2 1 2 3 2° 2 3 2°
  • Each number, reflecting the power of the corresponding set, is a positive integer, (by definition) decomposable into prime factors, the combinations of which are weighted, therefore, the numbers selected from such a set are comparable.
  • Example of ST - cf. with OB - shows the representation function according to ⁇ 3, when all ten (1st to 10th) connectives correspond to ex. characters: 1 2 3 4 5 6 7 8 9 10 10 post
  • Example of SV - cf. with OB - shows the representation function according to ⁇ 3, when only the first (1st) connective corresponds to the control character: 1 2 3 4 5 6 7 8 9 10 10 post
  • Example ZG - cf. with 0 ⁇ - shows the representation function according to ⁇ 3, when only the last (10th) connective corresponds to the control character: 1 2 3 4 5 6 7 8 9 10 10 post
  • Example of AP - cf. with OD - shows the representation function according to ⁇ 3, when three selective (3rd, 9th, 10th) connectives correspond to ex. characters:
  • the representation function is: n + 1 number p/b from sets with powers no more than 7Vp B ; n numbers t/1 from sets of cardinality no more than AGm; n numbers f/f from sets of cardinality at most AT F F •
  • Example 6 shows examples for the representation function according to ⁇ 6 with
  • the presentation function is adapted to the characteristics of existing digital signals, especially the original one; if technically possible, however, the opposite is also possible.
  • Example 7 A shows modified to achieve compatibility
  • Example 7B shows a modified version of the GMII protocol to achieve compatibility with the representation function according to ⁇ 7 for k ⁇ 2 4 :
  • Example 7B shows modified to achieve compatibility with representation function according to ⁇ 7 with k ⁇ 2 protocol version 64V/66V
  • the basis of the proposed invention is the processing of precisely finite integers inside finite sets of such numbers as sections of a certain sequence, regular, that is, repeatable in their structure, imaginary in a table, the numbers of which fill its relay row (sentence in English, pit/baton row - " ⁇ row, PBR), running row (sent. English, track/leg row - TL row, TLR), visual row (sent. English, fan/fan row - * FF row, FFR).

Abstract

L'invention concerne des procédés de (re)codage de signaux numériques dont l'équivalent informatique est représenté sous forme d'un séquence régulière de nombres entiers, lesquels consistent à exercer une action sur un signal numérique initial (argument de représentation), permettant d'obtenir un signal numérique traité (fonction de représentation) avec un retard minimal lors d'une permutation minimale.
PCT/RU2022/000177 2022-05-27 2022-05-27 Représentation relais de données intégrales WO2023229481A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/RU2022/000177 WO2023229481A1 (fr) 2022-05-27 2022-05-27 Représentation relais de données intégrales

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/RU2022/000177 WO2023229481A1 (fr) 2022-05-27 2022-05-27 Représentation relais de données intégrales

Publications (1)

Publication Number Publication Date
WO2023229481A1 true WO2023229481A1 (fr) 2023-11-30

Family

ID=88919665

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/RU2022/000177 WO2023229481A1 (fr) 2022-05-27 2022-05-27 Représentation relais de données intégrales

Country Status (1)

Country Link
WO (1) WO2023229481A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9838072B1 (en) * 2015-06-24 2017-12-05 Marvell International Ltd. Systems and methods to mitigate electro-magnetic interference in single twisted-pair-based communication systems
US20180041303A1 (en) * 2014-05-09 2018-02-08 Avago Technologies General Ip (Singapore) Pte. Ltd. Robust line coding scheme for communication under severe external noises
US20190268614A1 (en) * 2013-10-11 2019-08-29 Telefonaktiebolaget Lm Ericsson (Publ) Method and Arrangement for Transcoding a Video Bitstream
US20220046114A1 (en) * 2019-01-20 2022-02-10 Arilou Information Security Technologies Ltd. System and method for data compression based on data position in frames structure

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190268614A1 (en) * 2013-10-11 2019-08-29 Telefonaktiebolaget Lm Ericsson (Publ) Method and Arrangement for Transcoding a Video Bitstream
US20180041303A1 (en) * 2014-05-09 2018-02-08 Avago Technologies General Ip (Singapore) Pte. Ltd. Robust line coding scheme for communication under severe external noises
US9838072B1 (en) * 2015-06-24 2017-12-05 Marvell International Ltd. Systems and methods to mitigate electro-magnetic interference in single twisted-pair-based communication systems
US20220046114A1 (en) * 2019-01-20 2022-02-10 Arilou Information Security Technologies Ltd. System and method for data compression based on data position in frames structure

Similar Documents

Publication Publication Date Title
Lelewer et al. Data compression
US6052390A (en) Data code block transmission using preselected control signals and delimiters
CN1262972C (zh) 改进的霍夫曼数据压缩方法
Chen et al. The capacity of finite-state Markov channels with feedback
Roman Coding and information theory
CN1151424C (zh) 输入表意字符的方法
KR910010945A (ko) 데이타 표시 및 프로토콜
Wesolowski Introduction to digital communication systems
CN115276666B (zh) 一种装备训练模拟器数据高效传输方法
Apostolico et al. New clique and independent set algorithms for circle graphs
Haddad et al. On gossiping with faulty telephone lines
CN108647209B (zh) 一种基于思维导图的题目生成方法
WO2023229481A1 (fr) Représentation relais de données intégrales
CN109495211A (zh) 一种信道编码和解码方法
US4382286A (en) Method and apparatus for compressing and decompressing strings of electrical digital data bits
TW543308B (en) Converter and method for converting an input data packet stream into an output data symbol stream
CN105938469B (zh) 编码存储方法、文本存储数据结构以及文本压缩存储和统计输出方法
Grinberg et al. Splay trees for data compression
Farnoud et al. Multipermutation codes in the Ulam metric
CN112087418A (zh) 计算报文数据填充位的方法及装置
CN1166136C (zh) 在时分多址网与基于分组或信元的网之间提供透明传输的方法和设备
Santhanam Probability estimation and compression involving large alphabets
Garg et al. Low correlation interleaved QAM sequences
Bulatek et al. THE TOPOLOGICAL CENTRALIZERS OF TOEPLITZ FLOWS AND THEIR Z₂-EXTENSIONS
Verhoeff A new data compression technique

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22943947

Country of ref document: EP

Kind code of ref document: A1