default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Blad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c10]Antonio Maria Cipriano, Philippe Agostini, Anton Blad, Raymond Knopp:
Cooperative communications with HARQ in a wireless mesh network based on 3GPP LTE. EUSIPCO 2012: 1004-1008- [c9]Anton Blad, Erik Axell
, Erik G. Larsson:
Spectrum sensing of OFDM signals in the presence of CFO: New algorithms and empirical evaluation using USRP. SPAWC 2012: 159-163 - 2011
- [b1]Anton Blad:
Low Complexity Techniques for Low Density Parity Check Code Decoders and Parallel Sigma-Delta ADC Structures. Linköping University, Sweden, 2011 - [c8]Anton Blad, Oscar Gustafsson:
FPGA implementation of rate-compatible QC-LDPC code decoder. ECCTD 2011: 777-780 - 2010
- [j2]Anton Blad, Oscar Gustafsson:
Integer Linear Programming-Based Bit-Level Optimization for High-Speed FIR Decimation Filter Architectures. Circuits Syst. Signal Process. 29(1): 81-101 (2010) - [c7]Oscar Gustafsson, Kiarash Amiri, Dennis Andersson, Anton Blad, Christian Bonnet, Joseph R. Cavallaro, Jeroen Declerck, Antoine Dejonghe, Patrik Eliardsson, Miguel Glassee, Aawatif Hayar, Lieven Hollevoet, Christopher Hunter, Madhura Joshi, Florian Kaltenberger, Raymond Knopp, Khanh Le, Zoran Miljanic, Patrick Murphy, Frederik Naessens, Navid Nikaein, Dominique Nussbaum, Renaud Pacalet, Praveen Raghavan, Ashutosh Sabharwal, Onkar Sarode, Predrag Spasojevic, Yang Sun, Hugo M. Tullberg, Tom Vander Aa, Liesbet Van der Perre, Michelle Wetterwald, Michael Wu:
Architectures for cognitive radio testbeds and demonstrators - An overview. CrownCom 2010: 1-6 - [c6]Anton Blad, Oscar Gustafsson:
Redundancy reduction for high-speed fir filter architectures based on carry-save adder trees. ISCAS 2010: 181-184 - [c5]Meng Zheng, Zesong Fei, Xiang Chen, Jingming Kuang, Anton Blad:
Power Efficient Partial Repeated Cooperation Scheme with Regular LDPC Code. VTC Spring 2010: 1-5
2000 – 2009
- 2008
- [j1]Anton Blad, Håkan Johansson, Per Löwenborg:
Multirate Formulation for Mismatch Sensitivity Analysis of Analog-to-Digital Converters That Utilize Parallel ΣΔ-Modulators. EURASIP J. Adv. Signal Process. 2008 (2008) - [c4]Anton Blad, Oscar Gustafsson:
Bit-level optimized FIR filter architectures for high-speed decimation applications. ISCAS 2008: 1914-1917 - 2006
- [c3]Anton Blad, Håkan Johansson, Per Löwenborg:
A General Formulation of Analog-to-Digital Converters Using Parallel Sigma-Delta Modulators and Modulation Sequences. APCCAS 2006: 438-441 - [c2]Anton Blad, Per Löwenborg, Håkan Johansson:
Design trade-offs for linear-phase FIR decimation filters and ΣΔ-modulators. EUSIPCO 2006: 1-5 - 2005
- [c1]Anton Blad, Oscar Gustafsson, Lars Wanhammar:
An early decision decoding algorithm for LDPC codes using dynamic thresholds. ECCTD 2005: 285-288
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-10-07 21:10 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:
