Summary: This module introduces frequency shift keying (FSK) and describes components of an FSK transmitter block-diagram.
Frequency Shift Keying (FSK) is a scheme to transmit digital information across an analog channel. Binary data bits are grouped into blocks of a fixed size, and each block is represented by a unique carrier frequency, called a symbol, to be sent across the channel. 1 This requires having a unique symbol for each possible combination of data bits in a block. In this laboratory exercise each symbol represents a two-bit block; therefore, there will be four different symbols.
The carrier frequency is kept constant over some number of
samples known as the symbol period
(
![]() |
The input bits to the transmitter are provided by the special
shift-register, called a pseudo-noise sequence
generator (PN generator), on the left side
of Figure 1. A PN generator produces a sequence
of bits that appears random. The PN sequence will repeat with
period
![]() |
As shown in Figure 2, the PN generator is simply a shift-register and XOR gate. Bits 1, 5, 6, and 7 of the shift-register are XORed together and the result is shifted into the highest bit of the register. The lowest bit, which is shifted out, is the output of the PN generator.
The PN generator is a useful source of random data bits for system testing. We can simulate the bit sequence that would be transmitted by a user as the random bits generated by the PN generator. Since communication systems tend to randomize the bits seen by the transmission scheme so that bandwidth can be efficiently utilized, the PN generator is a good data model.2
The shift-register produces one output bit at a time. Because each symbol the system transmits will encode two bits, we require the series-to-parallel conversion to group the output bits from the shift-register into blocks of two bits so that they can be mapped to a symbol.
This is responsible for mapping blocks of bits to one of four
frequencies as shown in Figure 1. Each possible
two-bit block of data from the series-to-parallel conversion
is mapped to a different carrier frequency
| Data Chunk | Carrier Frequency
|
|---|---|
| 00 |
|
| 01 |
|
| 11 |
|
| 10 |
|
One way to implement this mapping is by using a look-up
table. The two-bit data block can be interpreted as an offset
into a frequency table where we have stored the possible
transmission frequencies. Note that since each frequency
mapping defines a symbol, this mapping is done at the symbol
rate
The symbol bit assignments are such that any two adjacent frequencies map to data blocks that differ by only one bit. This assignment is called Gray coding and helps reduce the number of bit errors made in the event of a received symbol error.
In order to minimize the bandwidth used by the transmitted
signal, you should ensure that the phase of your transmitted
waveform is continuous between symbols; i.e., the beginning
phase of any symbol must be equal to the ending phase of the
previous symbol. For instance, if a symbol of frequency