default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTuomas Järvinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j2]Tuomas Järvinen, Perttu Salmela, Harri Sorokin, Jarmo Takala
:
Stride Permutation Networks for Array Processors. J. VLSI Signal Process. 49(1): 51-71 (2007)- 2006
- [c13]Tuomas Järvinen, Perttu Salmela, Konsta Punkka, Jarmo Takala:
Evaluation of stride permutation networks. ISCAS 2006 - [c12]Perttu Salmela, Pekka Jääskeläinen, Tuomas Järvinen, Jarmo Takala:
Software Pipelining Support for Transport Triggered Architecture Processors. SAMOS 2006: 237-247 - 2005
- [j1]Tuomas Järvinen, Perttu Salmela, Teemu Sipilä, Jarmo Takala:
Systematic approach for path metric access in Viterbi decoders. IEEE Trans. Commun. 53(5): 755-759 (2005) - [c11]Perttu Salmela, Tuomas Järvinen, Teemu Sipilä, Jarmo Takala:
256-State Rate 1/2 Viterbi Decoder on TTA Processor. ASAP 2005: 370-378 - [c10]Tuomas Järvinen, Perttu Salmela, Panu Hämäläinen, Jarmo Takala:
Efficient byte permutation realizations for compact AES implementations. EUSIPCO 2005: 1-4 - 2004
- [c9]Tuomas Järvinen, Perttu Salmela, Harri Sorokin, Jarmo Takala:
Stride Permutation Networks for Array Processors. ASAP 2004: 376-386 - [c8]Tuomas Järvinen, Jarmo Takala:
Register-Based Permutation Networks for Stride Permutations. SAMOS 2004: 108-117 - 2003
- [c7]Jarmo Takala, Tuomas Järvinen, Harri Sorokin:
Conflict-free parallel memory access scheme for FFT processors. ISCAS (4) 2003: 524-527 - [c6]Perttu Salmela, Tuomas Järvinen, Teemu Sipilä, Jarmo Takala:
On allocation of turbo decoder iterations. PIMRC 2003: 157-160 - [c5]Perttu Salmela, Tuomas Järvinen, Teemu Sipilä, Jarmo Takala:
Parallel memory access in turbo decoders. PIMRC 2003: 2157-2161 - [c4]Tuomas Järvinen, Perttu Salmela, Teemu Sipilä, Jarmo Takala:
In-Place Storage of Path Metrics in Viterbi Decoders. VLSI-SOC 2003: 295-300 - 2002
- [c3]Jarmo Takala, Tuomas Järvinen, Jari Nikara:
Register-based reordering networks for matrix transpose. ISCAS (4) 2002: 874-877 - 2001
- [c2]Jarmo Takala, Tuomas Järvinen, Perttu Salmela, David Akopian:
Multi-port interconnection networks for radix-R algorithms. ICASSP 2001: 1177-1180 - [c1]Tuomas Järvinen, Jarmo Takala, David Akopian, Jukka Saarinen:
Register-based multi-port perfect shuffle networks. ISCAS (4) 2001: 306-309
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
