Method of and circuit for decoding block-coded messages affected by symbol substitutions, insertions and deletions

Claim 3

The method defined in claim 1, further comprising the step of: generating said retransmission request when the received message length is out of said range.

Claim 4

The method defined in claim 1 wherein the word emitted has the maximum probability value of being the word transmitted as the respective message, provided the difference of the probability value of the word with the next lower probability is not less than a predetermined value.

Claim 5

The method defined in claim 1 wherein said messages are speech messages.

Claim 6

The method defined in claim 4 wherein each symbol of said message is one of the digits of the decimal number system.

Claim 7

A decoding circuit for decoding messages coded as blocks of a fixed number of symbols and affected by symbol substitutions, deletions and insertions, comprising: means for generating for each message received of a length lying in a predetermined range, a sequence of words forming error frames and comprised of all combinations of positions of possible deletions and insertions in a message of the said length, each said word being composed of a number of symbols equal to said fixed number, each symbol indicating at least one of the states: (a) deletion error, (b) insertion error, and (c) reception of a symbol in correspondence with a transmitted symbol; decoder means, connected to said means for generating, for decoding the words of each message received, using said error frames, to obtain a decoded word for each error frame; means, connected to said decoder means, for calculating a value of a probability that each decoded word is actually a word transmitted as the respective message; and means, connected to said means for calculating, for thereafter selectively emitting as a decoded message the decoded word whose probability as calculated satisfies predetermined criteria as to freedom from error and, if no word satisfies said criteria, generating a request for retransmission of the respective message.

Claim 8

A decoding circuit for decoding messages coded as blocks of a fixed number of symbols and affected by symbol substitutions, deletions and insertions, comprising: means for generating for each message received of a length lying in a predetermined range, a sequence of words forming error frames and comprised of all combinations of positions of possible deletions and insertions in a message of the said length, each said word being composed of a number of symbols equal to said fixed number, each symbol indicating at least one of the states: (a) deletion error, (b) insertion error, and (c) reception of a symbol in correspondence with a transmitted symbol; decoder means, connected to said means for generating, for decoding the words of each message received, using said error frames, to obtain a decoded word for each error frame; means, connected to said decoder means, for calculating a value of a probability that each decoded word is actually a word transmitted as the respective message; and means, connected to said means for calculating, for thereafter selectively emitting as a decoded message the decoded word whose probability as calculated satisfies predetermined criteria as to freedom from error and, if no word satisfies said criteria, generating a request for retransmission of the respective message.

Claim 9

The decoding circuit defined in claim 6 which comprises: a channel decoder receiving the messages to be decoded; an error-frame generator connected to an input of said channel decoder, controlled by the message length and generating and supplying to said channel decoder a sequence of words forming error frames comprising all of the possible combinations of locations of deletions and insertions and correct symbol positions for a message of a respective message length when the message length lies in a predetermined range, each error frame consisting of a number of symbols equal to said fixed number, each symbol indicating deletion or insertion of symbols of a received message or reception of a symbol in correspondence with a symbol of the respective transmitted message, said channel decoder emitting for each received message a number of decoded words equal to the number of error frames; a computing circuit connected to an output side of said channel decoder for receiving said decoded words, said error frames and the message to be decoded therefrom, said computing circuit calculating the probability that each of said decoded words is the transmitted word; a selection logic connected to said computing circuit, said channel decoder and said error-frame generator for deciding on the basis of calculated probability values which of the decoded words is to be emitted; and a utilization device connected to said selection logic for utilizing the decoded message.

Claim 10

The decoding circuit defined in claim 7 wherein said error-frame generator and said selection logic are so connected as to generate signals requesting retransmission of a message when the message to be decoded has a length which is outside said range and when no word can be forwarded to said utilization device corresponding to a received message, the retransmission-request signals disabling said channel decoder, said computing circuit and the selection logic.

Claim 11

The decoding circuit defined in claim 7 wherein said logic is connected and arranged to supply said utilization device with the decoded word for each received message which has the maximum probability of being the transmitted word provided that the difference of the probability value of the word with the next lower probability is not less than a predetermined value.

Claim 12

The decoding circuit defined in claim 7, further comprising: a speech-recognition device receiving the received message and connected to an input side of said error-frame generator, said messages being speech messages, said speech-recognition device supplying said error-frame generator with information as to the length of a message received.