A method of configuring a communication system, said system including a transmitter having an encoder with a memory length L and capable of being in a plurality of encoder states coupled to a mapper for mapping the encoder states to a phase angle signal, a pair of parallel branches coupled to an output of the mapper, each branch having a transmit filter coupled to the mapper for filtering the phase angle signal with a transfer function Q(f), a digital-to-analog (D/A) converter coupled to the transmit filter for sampling the filtered signal, a low pass filter and a modulator coupled in series with the D/A converter, a summer coupled to the modulator of each branch, and a transmit antenna coupled to the output of the summer, said system further including;
- a receiver having a receive antenna, a first down converter, a receive filter having a power spectrum H.sub.r (f), a second down converter, an analog-to-digital converter and a decoder all serially coupled;
- said method comprising the steps of:
- a) choosing a desired minimum acceptable value, (MPDR), of P.sub.DR for the transmitter where P.sub.DR is defined as:
- ##EQU16## where P.sub.ave is an average power signal transmitted from the transmit antenna, P.sub.peak is the peak power of the transmitted signal, and d.sub.min is a minimum Euclidean distance associated with an encoder set;
- b) choosing a symbol period, T.sub.s ;
- c) choosing a number of input bits to be shifted into the encoder at each said symbol period thereby determining the encoder alphabet having M entries;
- d) choosing a number of bits to be output by the encoder during each said symbol period to determine length of an encoder output code and a number of constellation points;
- e) setting a probability associated with each said encoder alphabet entry uniformly to a single predetermined value, thereby fixing a probability matrix X.sub.n ;
- f) setting a probability associated with each said encoder output code uniformly to a single predetermined value, thereby fixing a probability matrix Y.sub.n ;
- g) permutating all possible encoder states with all encoder alphabet entries to result in a plurality of encoder sets U;
- h) choosing an encoder set as a present encoder set;
- i) adapting the encoder to provide a plurality of encoder output codes u from the present encoder set U according to the encoder's present state and a presently received encoder alphabet entry;
- j) determining P.sub.DR associated with the present encoder set U;
- k) comparing P.sub.DR determined from step "j" with MPDR, and discarding the present encoder set U if P.sub.DR does not exceed MPDR;
- l) repeating steps "h"-"k" for all encoder sets U;
- m) determining a P.sub.ib /P.sub.ab ratio for each encoder set that has not been discarded according to the following equation:
- ##EQU17## and the superscript H indicates Hermitian or conjugate transpose operator, M=number of input alphabet entries, N=number of encoder states, L=memory length of the shift register encoder, and T.sub.s is the symbol duration;
- n) choosing from the encoder sets that have not been discarded an encoder set having the greatest P.sub.ib /P.sub.ab ratio as the optimum coding set;
- o) adapting the transmitter to transmit the optimum coding set for all future transmissions;
- and
- p) adapting the decoder to decode signals it receives according to the optimum coding set.