# US 10,771,193 B2 · Channel adaptive error-detecting codes with guaranteed residual error probability > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,771,193 B2 - Document ID: US10771193B2 - Status: Granted - Kind: B2 - Application number: 16/001,164 - Filed: 2018-06-06 - Published: 2018-12-13 - Granted: 2020-09-08 - Earliest claimed: 2017-06-07 - Assignees: Siemens Aktiengesellschaft - Applicants: Siemens Aktiengesellschaft - Inventors: Maximilian Walter; Bastian Mauerer - Web page: https://patentgrep.com/patent/US10771193B2 ## CPC - H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)} - G06F 7/584: {using finite field arithmetic, e.g. using a linear feedback shift register} - G06F 17/18: for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} - G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks - H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit - H03M 13/091: {Parallel or block-wise CRC computation} - H03M 13/095: {Error detection codes other than CRC and single parity bit codes} - H03M 13/3738: {with judging correct decoding} - H04L 1/0061: {Error detection codes} - G06N 20/00: Machine learning - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) ## Abstract A method for checking a signal transmission of a specified message with a number of d bits from a sender to a receiver by a control unit using a linear block code generated via a coding tool, a channel model, and a specified linear feedback shift register, which is parameterized via a generator polynomial, wherein the residual error probability of different Markov-modulated Bernoulli processes is calculated, where boundary conditions for signal transmission can be specified by using a characterizing Markov-modulated Bernoulli process and also a linear feedback shift register, where integration of the calculation of the residual error probability is performed in a dynamic, intelligent control circuit such that the respective residual error probabilities can be determined for different generator polynomials. ## Claims ### Claim 1 A method for checking a signal transmission of a specified message with a number of d bits from a sender to a receiver by a control unit such that a speed at which a residual error probability is calculated and an accuracy of the calculated residual error probability utilizing a linear block code created via a coding tool, a channel model, and a linear feedback shift register are increased, the method comprising: describing the channel model via a characterizing Markov-modulated Bernoulli process; performing an iterative first calculation of probability values for a probability distribution of states of one of the d bits relative to a current bit after transmission of a signal by a signal transmission unit, starting from a current probability distribution of states in the current bit, taking into account all possible transitions that result from a Cartesian product of a number of states in accordance with the Markov-modulated Bernoulli process and the number of states of the linear feedback shift register, the control unit adding probability values of transitions into an equal state and performing this iteration up to a probability distribution of a final bit; performing an iterative second calculation of probability values for the probability distribution of the states of one of the d bits relative to the current bit after transmission of the signal by the signal transmission unit, starting from the current probability distribution of the states in the current bit, ignoring all transitions obtained during a specified zero state, the control unit adding the probability values of transitions into an equal state and performing this iteration up to the probability distribution of the final bit; and forming a difference from the probability values of a specified zero state obtained during the first iterative calculation with the probability values of the specified zero state obtained during the second iterative calculation, as the residual error probability having the increased accuracy. ### Claim 2 (depends on 1) The method as claimed in claim 1, wherein the iterative second calculation of the probability values for the probability distribution of the states of the final bit, ignoring all the transitions out of the specified zero state, occurs together with the first iterative calculation, using local memory locations, which cache results of the iterative calculation at least up to the calculation of the residual error probability. ### Claim 3 (depends on 1) The method as claimed in claim 1, wherein the linear feedback shift register, which is parameterized via a generator polynomial, is used as a coding tool. ### Claim 4 (depends on 3) The method as claimed in claim 3, wherein different generator polynomials are utilized in a specified channel model to calculate the residual error probability. ### Claim 5 (depends on 3) The method as claimed in claim 3, wherein the generator polynomial is selected by a control circuit based on residual error probabilities. ### Claim 6 (depends on 5) The method as claimed in claim 5, wherein selection of the respective generator polynomial is learnt. ### Claim 7 (depends on 1) The method as claimed in one claim 1, wherein a table with d+1 columns is generated at a start of the method, said table being allocated zeros; and wherein respective probability values are recorded in the columns. ### Claim 8 (depends on 7) The method as claimed in claim 7, wherein different generator polynomials are utilized in a specified channel model to calculate the residual error probability. ### Claim 9 (depends on 7) The method as claimed in claim 7, wherein the control unit in each case holds in the memory only two columns of the table to calculate the residual error probability. ### Claim 10 (depends on 1) The method as claimed in claim 1, wherein the respective residual error probability is calculated for different channel models with a respective Markov-modulated Bernoulli process. ### Claim 11 (depends on 1) The method as claimed in claim 1, wherein a stationary distribution of the probability values for the specified zero state is calculated for initialization of the iterative calculation. ### Claim 12 An apparatus for checking a signal transmission of a specified message with d bits from a sender to a receiver by a control unit, said apparatus having an increased speed at which a residual error probability is calculated and an increased accuracy of the calculated residual error probability, the apparatus comprising: a processor; and memory; wherein the processor of the apparatus: describes a channel model via a characterizing Markov-modulated Bernoulli process; performs an iterative first calculation of probability values for a probability distribution of states of one of the d bits relative to a current bit after transmission of a signal by a signal transmission unit, starting from a current probability distribution of states in the current bit, taking into account all possible transitions that result from a Cartesian product of a number of states in accordance with the Markov-modulated Bernoulli process and the number of states of the linear feedback shift register, the control unit adding probability values of transitions into an equal state and performing this iteration up to a probability distribution of a final bit; performs an iterative second calculation of probability values for the probability distribution of the states of one of the d bits relative to the current bit after transmission of the signal by the signal transmission unit, starting from the current probability distribution of the states in the current bit, ignoring all transitions obtained during a specified zero state, the control unit adding the probability values of transitions into an equal state and performing this iteration up to the probability distribution of the final bit; and forms a difference from the probability values of a specified zero state obtained during the first iterative calculation with the probability values of the specified zero state obtained during the second iterative calculation, as the residual error probability having the increased accuracy.