|
Search the dblp DataBase
Perttu Salmela:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Adrian Burian, Perttu Salmela, Jarmo Takala
Complex Fixed-Point Matrix Inversion Using Transport Triggered Architecture. [Citation Graph (0, 0)][DBLP] ASAP, 2005, pp:107-112 [Conf]
- Tuomas Järvinen, Perttu Salmela, Harri Sorokin, Jarmo Takala
Stride Permutation Networks for Array Processors. [Citation Graph (0, 0)][DBLP] ASAP, 2004, pp:376-386 [Conf]
- Perttu Salmela, Tuomas Järvinen, Teemu Sipilä, Jarmo Takala
256-State Rate 1/2 Viterbi Decoder on TTA Processor. [Citation Graph (0, 0)][DBLP] ASAP, 2005, pp:370-378 [Conf]
- Perttu Salmela, Pekka Jääskeläinen, Tuomas Järvinen, Jarmo Takala
Software Pipelining Support for Transport Triggered Architecture Processors. [Citation Graph (0, 0)][DBLP] SAMOS, 2006, pp:237-247 [Conf]
- Tuomas Järvinen, Perttu Salmela, Teemu Sipilä, Jarmo Takala
In-Place Storage of Path Metrics in Viterbi Decoders. [Citation Graph (0, 0)][DBLP] VLSI-SOC, 2003, pp:295-300 [Conf]
- Tuomas Järvinen, Perttu Salmela, Teemu Sipilä, Jarmo Takala
Systematic approach for path metric access in Viterbi decoders. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Communications, 2005, v:53, n:5, pp:755-759 [Journal]
- Tuomas Järvinen, Perttu Salmela, Konsta Punkka, Jarmo Takala
Evaluation of stride permutation networks. [Citation Graph (0, 0)][DBLP] ISCAS, 2006, pp:- [Conf]
Fine-grained application-specific instruction set processor design for the K-best list sphere detector algorithm. [Citation Graph (, )][DBLP]
Memory-Based List Updating for List Sphere Decoders. [Citation Graph (, )][DBLP]
Synthesis of DSP Architectures Using Libraries of Coarse-Grain Configurations. [Citation Graph (, )][DBLP]
Low-complexity polynomials modulo integer with linearly incremented variable. [Citation Graph (, )][DBLP]
Reconfigurable video decoder with transform acceleration. [Citation Graph (, )][DBLP]
Complex-valued QR decomposition implementation for MIMO receivers. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|