default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenny Johansson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c19]Kenny Johansson, Oscar Gustafsson
, Linda DeBrunner, Lars Wanhammar:
Minimum adder depth multiple constant multiplication algorithm for low power FIR filters. ISCAS 2011: 1439-1442- 2010
- [c18]Rui Guo, Linda DeBrunner, Kenny Johansson:
Truncated MCM using pattern modification for FIR filter implementation. ISCAS 2010: 3881-3884
2000 – 2009
- 2009
- [c17]Kenny Johansson, Oscar Gustafsson, Linda DeBrunner:
Estimation of the Switching Activity in Shift-and-add based Computations. ISCAS 2009: 3054-3057 - 2008
- [j1]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Implementation of elementary functions for logarithmic number systems. IET Comput. Digit. Tech. 2(4): 295-304 (2008) - [c16]Muhammad Abbas, Fahad Qureshi, Zaka Ullah Sheikh, Oscar Gustafsson, Håkan Johansson, Kenny Johansson:
Comparison of multiplierless implementation of nonlinear-phase versus linear-phase FIR filters. ACSCC 2008: 598-601 - [c15]Oscar Gustafsson, Kenny Johansson:
An empirical study on standard cell synthesis of elementary function lookup tables. ACSCC 2008: 1810-1813 - [c14]Lars Wanhammar, Baharak Soltanian, Oscar Gustafsson, Kenny Johansson:
Synthesis of bandpass circulator-tree wave digital filters. ICECS 2008: 834-837 - [c13]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Switching activity estimation for shift-and-add based constant multipliers. ISCAS 2008: 676-679 - [c12]Saeeid Tahmasbi Oskuii, Kenny Johansson, Oscar Gustafsson, Per Gunnar Kjeldsberg:
Power optimization of weighted bit-product summation tree for elementary function generator. ISCAS 2008: 1240-1243 - 2007
- [c11]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Bit-Level Optimization of Shift-and-Add Based FIR Filters. ICECS 2007: 713-716 - [c10]Oscar Gustafsson, Saeeid Tahmasbi Oskuii, Kenny Johansson, Per Gunnar Kjeldsberg:
Switching Activity Reduction of MAC-Based FIR Filters with Correlated Input Data. PATMOS 2007: 526-535 - 2006
- [c9]Oscar Gustafsson, Kenny Johansson, Håkan Johansson, Lars Wanhammar:
Implementation of Polyphase Decomposed FIR Filters for Interpolation and Decimation Using Multiple Constant Multiplication Techniques. APCCAS 2006: 924-927 - [c8]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Approximation of elementary functions using a weighted sum of bit-products. ISCAS 2006 - 2005
- [c7]Lars Wanhammar, Kenny Johansson, Oscar Gustafsson:
Efficient sine and cosine computation using a weighted sum of bit-products. ECCTD 2005: 139-142 - [c6]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity. ECCTD 2005: 465-468 - [c5]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Implementation of low-complexity FIR filters using serial arithmetic. ISCAS (2) 2005: 1449-1452 - 2004
- [c4]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Switching activity in bit-serial constant-coefficient multipliers. ISCAS (2) 2004: 469-472 - [c3]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Low-complexity bit-serial constant-coefficient multipliers. ISCAS (3) 2004: 649-652 - [c2]Tina Lindkvist, Jacob Löfvenberg, Henrik Ohlsson, Kenny Johansson, Lars Wanhammar:
A Power-Efficient, Low-Complexity, Memoryless Coding Scheme for Buses with Dominating Inter-Wire Capacitances. IWSOC 2004: 257-262 - [c1]Kenny Johansson, Oscar Gustafsson, Lars Wanhammar:
Power Estimation for Ripple-Carry Adders with Correlated Input Data. PATMOS 2004: 662-674
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:16 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:
