Method and arrangement for coding binary signals and modulating a carrier signal

• US 4,077,021 A
• Filed: 05/23/1977
• Issued: 02/28/1978
• Est. Priority Date: 06/18/1976
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ungerboeck, Gottfried, Csajka, Istvan Peter
• Primary Examiner(s): Grimm, Siegfried H.
• Application Number:
  US05/799,405
• Time in Patent Office: 281 Days
• Field of Search: 332/9 R, 332/16 R, 332/21, 332/42, 178/66 A, 178/66 R, 325/161, 325/163, 340/347 DD
• US Class Current: 332/103
• CPC Class Codes: H04L 27/186 in which the information is carried by both the individual signal points and the subset to which the individual signal points belong, e.g. coset coding or related schemes

Abstract

A method and structure for converting a sequence of binary digits into a sequence of discrete signal values, e.g., phase values, of a modulated carrier signal for data transmission. By introducing additional redundant signal values and coding information in a state-dependent sequential manner, enlarged minimum Euclidian distance between possible signal value sequences is achieved which results in a reduced error probability when maximum-likelihood decoding is applied in the receiver.

Claims

1. A method for transmitting a bit sequence by modulating a carrier signal to sequentially assume one of a plurality of discrete signal values comprising the steps of:

subdividing the predetermined bit sequence into successive groups each containing r sequential bits,

expanding each r bit group into a group of r+1 bits by a sequential coding process utilizing four internal states,

selecting one out of 2^r+1 discrete carrier signal values as a function of each r+1 expanded bit group, the selection being made so that 2^r-1 carrier signal values correspond to each transition from one internal state of the coding process to one of two possible follower states and that the 2^r-1 carrier signal values have a larger minimum distance from each other than the absolute minimum distance within the complete set of discrete carrier signal values, and

transmitting the selected discrete carrier signal values in sequence.

2. The method according to claim 1 in which 2^r carrier signal values correspond to the transitions from any internal state to its two follower states and the 2^r carrier signal values are separated from each other by a minimum distance which is larger than the minimum distance within the complete set of 2^r+1 carrier signal values, and the 2^r-1 carrier signal values selected for a transition from an internal state to one of its two follower states are separated from each other by a larger distance than the distance between the other non-selected 2^r-1 carrier signal values.

3. A modulation system for causing a carrier signal to assume one of a plurality of finite states as a function of the sequential application of a plurality of information bit signals comprising:

a sequential coder means including a plurality of terminals (r) for receiving in sequence r bit groups of signals each said r bit group having bits x0_n, x1_n . . . x(r-1)_n, means responsive to the bits for providing coded bits according to the relations;

space="preserve" listing-type="equation">1) y02.sub. n = x0.sub.n ⊕

x0.sub.n-2, and

space="preserve" listing-type="equation">2) y01.sub. n = x0.sub.n ⊕

x0.sub.n-1 ⊕

x0.sub.n-2, and

space="preserve" listing-type="equation">3) y1.sub.n = x1.sub.n, thru

space="preserve" listing-type="equation">4) y(r-1).sub.n = x(r-1).sub.n ;

modulating means for modulating a carrier signal to assume in sequence one of 2^r+1 discrete signal values in response to the output of the sequential coder means, the discrete signal values being separated from each other such that the complete set of signal values can be subdivided into two pairs of subsets (A, B and C, D), in which

space="preserve" listing-type="equation">d.sub.min I >

d.sub.min G >

d.sub.min M

where,

d_min I = minimum distance between signal values within a given subset,

d_min G = minimum distance between signal values within a pair of subsets, and

d_min M = minimum distance between signal values within the complete set, the connections between the sequential coder outputs and the modulator inputs being arranged so that the outputs y01_n and y02_n selects the subset of signal values and the remaining outputs associated with the bit group select the assigned signal value within the selected subset.

4. A modulation system as set forth in claim 3 in which the sequential coder means is provided with two input terminals for receiving two bit groups (x1_n and X0_n) and three output terminals for furnishing three bit expanded output groups (y1_n , y02_n and y01_n), said sequential coder including between one input terminal and two output terminals two serially connected one bit storage elements connected to said one input for storing bits x0.sub.(n-1) and x0.sub.(n-2), respectively, and two modulo two adders responsive to said (x0_n, x0.sub.(n-2)) bits and x0_n, x0.sub.(n-2), x0.sub.(n-1) bits, respectively, and connected to two of said outputs, respectively, for providing at said outputs the y01_n and y02_n outputs;

and

said modulator being connected to said outputs from said sequential coder and furnishing in response to each applied three bit group (y1_n, y02_n and y01_n) a phase-modulated carrier signal according to the relationship;

space="preserve" listing-type="tabular">______________________________________ y1.sub.n y02.sub.n y01.sub.n Phase Values ______________________________________ 0 0 0 P0 0 0 1 P0 + f . π

/4 0 1 1 P0 + f . π

/2 0 1 0 P0 + f . 3π

/4 1 0 0 P0 + f . π

1 0 1 P0 + f . 5π

/4 1 1 1 P0 + f . 3π

/2 1 1 0 P0 + f . 7π

/4 ______________________________________

P0 being an arbitrary reference phase value, and f being a predetermined value of either 1 or -1.