Communications
The broad range of communication algorithms are almost all based on DSP technologies. Small high performance phones need minimal embedded kernels and limited I/O. Sophisticated H264 video encoders require many custom multi-core processors and transparent heterogeneous multiprocessing operating system software. Both of these examples represent extremes; however, these and all applications in between require finely tuned and balanced processing to meet demanding price performance goals.
Typical algorithms include:
- RAKE Receivers
- UTMS
- (I)FFT
- Symbol encode and decode
- Virterbi decoding
- Adaptive equalization
- Adaptive filters
- Timing recovery
- Motion estimation
- Image compression
- Cordic beamforming
- Walsh Fourier Transform
All of these algorithms are used for a wide range of different communication modems and compression/decompression techniques. By having modular building blocks for functions like this, more tried, proven and reliable systems can be assembled quickly and easily. Often, these algorithms are expressed in more general matrix formulations and more general matrix math support is provided depending on the processor style and the vendor customer base.
