FSK demodulation can be implemented pretty well either using envelopes
or matched filters. For now the matched filters seems to be a better
candidate. However, some normalization issues should be solved.
The clock recovery mechanism of GNU Radio is considered
an overkill for the needs of AFSK. So the afsk_decoder
will focus on a frequency domain approach.
The CW symbol decoder block takes as input the power of the processed
signal and tries to identify the dot and dash symbols. It produces
asynchronous messages containing the decoded symbols. The output
messages can be directly used by the Morse code decoder block, in order
to retrieve the clear text message.
There are some few thing that need to be done for the block to be fully
operational.
For now the generic clear text message sink just prints the decoded
clear text messages in the stdout. In the future and depending the needs
of the project, the clear text messages can be forwarded at other
services on the same host or via the network.
Also the debug message source block now supports injection of artificial
errors, for more robust decoding of the Morse decoder block.
Now, with the Morse code debug source block the testing of the decoder
can begin.
Add at the examples directory a small flowgraph that connects the debug
source block with the decoder.
Depending the received symbol the tree is traversed towards the leafs.
At each step the corresponding decode-able character is appended at a
string buffer.
TODOs:
* Add logic in the decoder to retrieve the decoded words from the tree
* Create a debug source block
The morse decoder is not yet functional. The decoding is performed
using a binary tree. Left child, corresponds to a received dot whereas
right to a received dash.