Sentence examples for distance spectra from inspiring English sources

The bit-wise distance spectra are used to classify mappings of the M-ary PSK constellation.

The pairs of codes are chosen so that the effect of a slight increase in the distance spectra may become apparent in terms of error performance.

Therefore, the mappings can easily be classified through an exhaustive search of unique sets of distance spectra [W 0,W 1 ].

These changes in MC Mmin) for the same TC Mmin) are sufficient to give a slight improvement in the distance spectra of the more complex codes.

On the other hand, all mappings of a given modulation are classified into a number of classes of unique mappings according to bit-wise distance spectra [14], which brings significant complexity reduction of the search for suitable mappings.

It is remarkable that the classification is based only on the distance spectra for the two extreme cases of either no a priori or full a priori information; thus, mappings with the same [W 0,W 1 ] can still exhibit different distance properties for arbitrary a priori information in between the two extreme cases.

In particular, we prove the best known bounds on the binomiality range of the distance spectrum of codes with a known dual distance.

It is observed that the interleaver designed in this manner improves the minimum distance of first few spectral lines of minimum distance spectrum.

The former two-mile champion, unbeaten in four this season, holds entries in the festival's senior Grade 1 chases across the distance spectrum, but his target has yet to be decided.

Table 1 gives an example of the distance spectrum of the compound code.

bCode with the same TC (Mmin), MC (Mmin), and distance spectrum as a code listed in [5].