Data Transmission with FSK Permutation Modulation

Abstract

Performance characteristics are derived for an FSK data transmission scheme in which M frequencies out of N are used simultaneously. Noncoherent matched filters are applied at the N frequencies, and the filter outputs are compared as in a permutation modulation system. It is shown that many permutation alphabets provide energy per bit advantage over binary FSK, although the best results are obtained with one-out-of-N alphabets. Considering bits per unit bandwidth, many permutation alphabets perform as well as or better than binary; however, one-out-of-N alphabets carry less information per unit bandwidth when N > 4.