Method of transmitting binary data sequences and arrangement for enabling the rapid determination of the end of a transmitted binary data sequence

• US 4,447,908 A
• Filed: 12/03/1981
• Issued: 05/08/1984
• Est. Priority Date: 12/23/1980
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ungerboeck, Gottfried, Chevillat, Pierre R.
• Primary Examiner(s): Griffin, Robert L.
• Assistant Examiner(s): Chin, Stephen
• Application Number:
  US06/327,006
• Time in Patent Office: 887 Days
• Field of Search: 375/42, 375/67, 375/114, 375/116, 375/37, 375/39, 332/9 R, 332/16 R, 340/347 DD, 370/100
• US Class Current: 375/269
• CPC Class Codes: H04L 1/0083 Formatting with frames or packets; Protocol or part of protocol for error control
• CPC Class Codes: H04L 27/3433 using an underlying square constellation
• CPC Class Codes: H04L 5/16 Half-duplex systems; Simplex/duplex switching; Transmission of break signals non-automatically inverting the direction of transmission

Abstract

A communication method and arrangement are disclosed which provide, for a trellis encoding process in the transmitter and a maximum-likelihood decoding process in the receiver, an additional fifth state (ZS) in addition to the usual four coding states (S0 . . . S3). The fifth state is entered in the transmitter at the end of transmission when a particularly selected escape symbol from a set of four escape symbols (E0 . . . E3) each associated to one of the four normal coding states is sent by an encoder supplement (15). In the receiver, a stop signal indicating end of transmission is only generated when, after the usual decoder delay, a path decoder (63) determines that an escape symbol was received, and a trellis decoder (61) indicates the fifth state (ZS) to be the most probable one. This enables rapid and secure determination of the end of a transmitted sequence without the need for additional transmission symbols or decoder cycles.

Claims

1. A method of transmitting input 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 input binary data sequence in a sequential encoder (11) having n integral number internal states and furnishing an encoded bit group at each sampling time, reflecting the input data and the internal state at said sampling time,

transmitting in response to each encoded bit group one associated transmission symbol from a given set of transmission symbol (P0...P15) which is subdivided into disjoint subsets, the subset of which the transmitted symbol is a member being associated to said internal encoder state and ending said transmission by,

transmitting one escape symbol from a set of escape symbols (E0...E3) which is a further subset of the set of transmission symbols, comprising selected transmission symbols of said disjoint subsets, the transmitted escape symbol being dependent on the internal encoder state but being not a member of any of the transmission symbol subsets usually associated with said internal encoder state, and

transmitting an unmodulated carrier or no carrier signal at all after said escape symbol is transmitted.

2. Method in accordance with claim 1, further comprising maximum-likelihood decoding in a receiver including a trellis decoder (61) and a path decoder (63), characterized in that said decoder includes a step

for each of n+1 different states corresponding to said n internal transmitter encoder states (S0...S3), an additional zero-energy state (ZS), and a step of determining

a most probable transition path from a predecessor state and a step of transferring indications for these n+1 most probable transition paths to said path decoder, and representing

the most probable of said n+1 different states at an output of trellis decoder. and a further step of furnishing

said path decoder, after a given delay of L sampling intervals and in response to the received transition path indications, a bit group representing the decision for a received symbol;

and furnishing

an end-of-transmission indication by a logic unit (65) in response to simultaneous occurence 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.

3. Apparatus 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, said apparatus comprising., a transmitter which includes

an encoder (11) having n integral number 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 (P0...P15) from a given set which is divided into subsets which are associated to said internal encoder states, and further including

means (15) furnishing in response to a transmission end signal (43) and an internal state indication (37, 39) from said encoder, an escape symbol representation (E0...E3) from a set of n integral number representations, which corresponds to a transmission symbol representation from a subset of said subsets not associated with the present internal encoder state.

4. Apparatus as described in claim 3, comprising:

a receiver having a maximum-likelihood decoder which includes a trellis decoder (61) and a path decoder (63) connected to receive the output of said trellis decoder for providing the output symbol Q, R, S or T in response thereto, and

said trellis decoder having outputs (69, 71, 73, 75, 77,

     81) for furnishing to said path decoder best path indications for n+1 states (S0, S1, S2, S3, ZS) and an indication (α

, β

, γ

) 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

having

a coincidence logic unit (65) 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 symbols.