default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Patronik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Piotr Patronik
, Stanislaw J. Piestrak:
Design of reverse converters for the general RNS 3-moduli set {2k, 2n - 1, 2n + 1}. EURASIP J. Adv. Signal Process. 2023(1): 92 (2023)- 2020
- [j8]Piotr Patronik:
On reverse converters for arbitrary multi-moduli RNS. Integr. 75: 158-167 (2020)
2010 – 2019
- 2018
- [j7]Piotr Patronik, Stanislaw J. Piestrak:
Correction to: Design of Reverse Converters for a New Flexible RNS Five-Moduli Set {2k, 2n-1, 2n+1, 2n+1-1, 2n-1-1} (n Even). Circuits Syst. Signal Process. 37(11): 5197 (2018) - [j6]Piotr Patronik, Stanislaw J. Piestrak:
Design of RNS Reverse Converters with Constant Shifting to Residue Datapath Channels. J. Signal Process. Syst. 90(3): 323-339 (2018) - 2017
- [j5]Piotr Patronik, Stanislaw J. Piestrak:
Design of Reverse Converters for a New Flexible RNS Five-Moduli Set {2k, 2n-1, 2n+1, 2n+1-1, 2n-1-1} (n Even). Circuits Syst. Signal Process. 36(11): 4593-4614 (2017) - [j4]Piotr Patronik, Stanislaw J. Piestrak:
Hardware/Software Approach to Designing Low-Power RNS-Enhanced Arithmetic Units. IEEE Trans. Circuits Syst. I Regul. Pap. 64-I(5): 1031-1039 (2017) - [c7]Piotr Patronik, Stanislaw J. Piestrak:
Design of residue generators with CLA/compressor trees and multi-bit EAC. LASCAS 2017: 1-4 - 2016
- [c6]Piotr Patronik, Stanislaw J. Piestrak:
Design of a low-power RNS-enhanced arithmetic unit. LASCAS 2016: 151-154 - 2015
- [c5]Stanislaw J. Piestrak, Piotr Patronik:
Fault-tolerant implementation of direct FIR filters protected using residue codes. NORCAS 2015: 1-4 - 2014
- [j3]Piotr Patronik, Stanislaw J. Piestrak:
Design of Reverse Converters for General RNS Moduli Sets {2k, 2n-1, 2n+1, 2n+1-1} and {2k, 2n-1, 2n+1, 2n-1-1} (n even). IEEE Trans. Circuits Syst. I Regul. Pap. 61-I(6): 1687-1700 (2014) - [j2]Piotr Patronik, Stanislaw J. Piestrak:
Design of Reverse Converters for the New RNS Moduli Set {2n+1, 2n-1, 2n, 2n-1+1} (n odd). IEEE Trans. Circuits Syst. I Regul. Pap. 61-I(12): 3436-3449 (2014) - [c4]Stanislaw J. Piestrak, Piotr Patronik:
Design of Fault-Secure Transposed FIR Filters Protected Using Residue Codes. DSD 2014: 575-582 - 2013
- [j1]Bartosz Wojciechowski, Krzysztof S. Berezowski, Piotr Patronik, Janusz Biernat:
Fast and accurate thermal modeling and simulation of manycore processors and workloads. Microelectron. J. 44(11): 986-993 (2013) - 2012
- [c3]Piotr Patronik, Krzysztof S. Berezowski, Janusz Biernat, Stanislaw J. Piestrak, Aviral Shrivastava:
Design of an RNS reverse converter for a new five-moduli special set. ACM Great Lakes Symposium on VLSI 2012: 67-70 - 2011
- [c2]Piotr Patronik, Krzysztof S. Berezowski, Stanislaw J. Piestrak, Janusz Biernat, Aviral Shrivastava:
Fast and energy-efficient constant-coefficient FIR filters using residue number system. ISLPED 2011: 385-390
2000 – 2009
- 2005
- [c1]Piotr Patronik:
Delay Testability Properties of Circuits Implementing Threshold and Symmetric Functions. DSD 2005: 289-297
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:21 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:
