EP0054583B1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method of transmitting binary data sequences and arrangement for enabling the rapid determination of the end of a transmitted binary data sequence
Assignee: International Business Machines Corp
•
Filing: 1980-12-23
•
Granted: 1984-03-07
•
Expires: 2000-12-23
Abstract
No abstract record available.
Inventors
- 👤 Pierre Dr. Chevillat
- 👤 Gottfried Dr. Ungerboeck
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-24 05:35
CPC Classifications
H; H04; H04L; H04L5/00; H04L5/14; H04L5/16; H04L1/00; H04L1/0078; H04L1/0083; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427; H04L27/3433
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
205 words
Method of transmitting binary data sequences in the form of transmission symbols represented by modulation states of a carrier signal at discrete sampling times, said method comprising the steps of - encoding said binary data sequence in a sequential encoder (11) having n internal states and furnishing an encoded bit group at each sampling time, reflecting the current input data and the current internal state, - transmitting in response to each encoded bit group one associated transmission symbol from a given set of transmission symbols (PO ... P 15) which is subdivided into disjoint subsets, the subset of which the transmitted symbol is a member being associated to current said internal encoder state, characterized in that at the end of any binary data sequence, - one escape symbol is transmitted from a set of escape symbols (EO ... E3) which is a further subset of transmission symbols, comprising selected transmission symbols of said disjoint subsets, the transmitted escape symbol being dependent on the current internal encoder state but being not a member of any of the transmission symbol subsets usually associated with said current internal encoder state, and that - an unmodulated carrier or no carrier signal at all is transmitted after said escape symbol.
Claim 2
Dependent Claim
205 words
Method of transmitting binary data sequences in the form of transmission symbols represented by modulation states of a carrier signal at discrete sampling times, said method comprising the steps of - encoding said binary data sequence in a sequential encoder (11) having n internal states and furnishing an encoded bit group at each sampling time, reflecting the current input data and the current internal state, - transmitting in response to each encoded bit group one associated transmission symbol from a given set of transmission symbols (PO ... P 15) which is subdivided into disjoint subsets, the subset of which the transmitted symbol is a member being associated to current said internal encoder state, characterized in that at the end of any binary data sequence, - one escape symbol is transmitted from a set of escape symbols (EO ... E3) which is a further subset of transmission symbols, comprising selected transmission symbols of said disjoint subsets, the transmitted escape symbol being dependent on the current internal encoder state but being not a member of any of the transmission symbol subsets usually associated with said current internal encoder state, and that - an unmodulated carrier or no carrier signal at all is transmitted after said escape symbol.
Claim 3
Dependent Claim
183 words
Method in accordance with claim 1, comprising maximum-likelihood decoding in a receiver including a trellis decoder (61) and a path decoder (63), characterized in that - in said trellis decoder, for each of n+1 different states corresponding to said n internal transmitter encoder states (SO ... S3) and an additional zero-energy state (ZS), - a most probable transition path from a predecessor state is determined, and indications for these n+1 most probable transition paths are transferred to said path decoder, and - the most probable of said n+1 different states is represented at an output of said trellis decoder; that - said path decoder, after a given delay of L sampling intervals and in response to the received transition path indications, furnishes a bit group representing the decision for a received symbol; and that - an end-of-transmission indication is furnished by a logic unit (65) in response to simultaneous occurrence of - the indication by said trellis decoder that the zero-energy state is the most probable state, and - the furnishing of a bit group representing an escape symbol by said path decoder.
Claim 4
Dependent Claim
190 words
Arrangement for enabling rapid determination of the end of a binary data sequence transmitted in the form of transmission symbols represented by modulation states of a carrier signal at discrete sampling times after which end an unmodulated carrier signal or no carrier signal at all is transmitted, said arrangement comprising a transmitter which includes - an encoder (11) having n internal states, which furnishes in response to its internal state and an input bit group an expanded bit group (25, 27, 29, 31) and an internal state indication (37, 39 and - means (13) furnishing in response to each expanded bit group from said encoder, a transmission symbol representation (PO ... P 15) from a given set which is divided into subsets which are associated to said internal encoder states, characterized by - means (15) furnishing in response to a transmission end signal (43) and a current internal state indication (37, 39) from said encoder, an escape symbol representation (EO... E3) from a set of n escape symbol representations, which corresponds to a transmission symbol representation from a subset of said subsets not associated with the present internal encoder state.
Claim 5
Dependent Claim
190 words
Arrangement for enabling rapid determination of the end of a binary data sequence transmitted in the form of transmission symbols represented by modulation states of a carrier signal at discrete sampling times after which end an unmodulated carrier signal or no carrier signal at all is transmitted, said arrangement comprising a transmitter which includes - an encoder (11) having n internal states, which furnishes in response to its internal state and an input bit group an expanded bit group (25, 27, 29, 31) and an internal state indication (37, 39 and - means (13) furnishing in response to each expanded bit group from said encoder, a transmission symbol representation (PO ... P 15) from a given set which is divided into subsets which are associated to said internal encoder states, characterized by - means (15) furnishing in response to a transmission end signal (43) and a current internal state indication (37, 39) from said encoder, an escape symbol representation (EO... E3) from a set of n escape symbol representations, which corresponds to a transmission symbol representation from a subset of said subsets not associated with the present internal encoder state.
Claim 6
Dependent Claim
142 words
Arrangement in accordance with claim 3, comprising a receiver including a maximum-likelihood decoder which includes a trellis decoder (61) and a path decoder (63), characterized in that - said trellis decoder has outputs (69, 71, 73, 75, 77; 81) for furnishing best path indications for n+1 states (SO, S1, S2, S3, ZS) and an indication (a, A, y) which of said n+1 states has the best path metric, one of said n+1 states being a zero-energy state normally not entered during transmission of a binary sequence; and that - a coincidence logic unit (65) is connected to receive data from said trellis decoder and said path decoder, for generating a stop signal on its output (99) in response to input data representing, respectively, the zero-energy state (ZS) as best metric state, and the output symbol Q, R, S, T) as escape symbol.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.