Simulation Use Case 4: Analyzing FSK Algorithms
The CLIP example implements a phone Caller ID (Identification) algorithm that is used to receive telephone caller information, such as telephone number and/or caller name.
The data is transmitted to the subscriber in the ringing phase of the telephone (on hook) using the V.23 modem standard, which is an FSK-type modem at 1200 bit/s.
This example only implements the decoding algorithm itself. It does not contain a ringing phase detection. The µVision simulator is used to determine the most effective algorithm that has only minimal processing time requirements
The project contains three targets:
When you start the the µVision Simulator you may use the Toolbox button GenPattern to create a FSK input signal.
The Logic Analyzer shows the various interim values:
The Performance Analyzer show the CPU time required by the FSK detection algorithm. You may open the Clip module to view all individual functions. When you double-click on a function name the source code is shown along with the execution time. With Optimize Level 2 or 3, the Compiler performs function in-lining. It is therefore no longer possible to see the execution time of a function that is in-lined.
In ARM Mode the algorithm requires 10% of the processing power
You may analyze the C source to tune algorithms for execution speed.
The Disassembly Window each assembly instruction along with the execution time spend on it.
Monday, October 9, 2006
of your data.