default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles M. Rader
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[p1]Charles M. Rader:
Connected Components and Minimum Paths. Graph Algorithms in the Language of Linear Algebra 2011: 19-27
2000 – 2009
- 2006
- [j12]Charles M. Rader:
dsp History - The Rise and Fall of Recursive Digital Filters. IEEE Signal Process. Mag. 23(6): 46-49 (2006) - [j11]Charles M. Rader, Leland B. Jackson:
Approximating Noncausal IIR Digital Filters Having Arbitrary Poles, Including New Hilbert Transformer Designs, Via Forward/Backward Block Recursion. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(12): 2779-2787 (2006) - 2005
- [j10]Charles M. Rader:
Generating rectangular coordinates in polar coordinate order. IEEE Signal Process. Mag. 22(6): 178-180 (2005) - 2001
- [j9]Nicholas B. Pulsone, Charles M. Rader:
Adaptive beamformer orthogonal rejection test. IEEE Trans. Signal Process. 49(3): 521-529 (2001)
1990 – 1999
- 1996
- [j8]Charles M. Rader:
VLSI systolic arrays for adaptive nulling [radar]. IEEE Signal Process. Mag. 13(4): 29-49 (1996) - 1992
- [c5]Charles M. Rader:
MUSE-a systolic array for adaptive nulling with 64 degrees of freedom, using Givens transformations and wafer scale integration. ASAP 1992: 277-291
1980 – 1989
- 1988
- [c4]Charles M. Rader:
Wafer-scale systolic array for adaptive antenna processing. ICASSP 1988: 2069-2071 - 1987
- [j7]Charles M. Rader:
IEEE individual learning package. IEEE Trans. Acoust. Speech Signal Process. 35(11): 1644 (1987) - 1986
- [j6]Charles M. Rader, Allan O. Steinhardt:
Hyperbolic householder transformations. IEEE Trans. Acoust. Speech Signal Process. 34(6): 1589-1602 (1986) - [c3]Charles M. Rader, Allan O. Steinhardt:
Hyperbolic householder transformations, definition and application. ICASSP 1986: 2511-2514 - 1982
- [c2]Charles M. Rader:
The application of dynamic programming to the optimal ordering of digital filter sections. ICASSP 1982: 73-76 - 1981
- [j5]Charles M. Rader:
Memory Management in a Viterbi Decoder. IEEE Trans. Commun. 29(9): 1399-1401 (1981)
1970 – 1979
- 1973
- [j4]Charles M. Rader:
Correction to "Discrete Convolutions via Mersenne Transforms". IEEE Trans. Computers 22(7): 703 (1973) - 1972
- [j3]Charles M. Rader:
Discrete Convolutions via Mersenne Transrorms. IEEE Trans. Computers 21(12): 1269-1273 (1972) - 1971
- [j2]Bernard Gold, Irwin L. Lebow, Paul G. McHugh, Charles M. Rader:
The FDP, a Fast Programmable Signal Processor. IEEE Trans. Computers 20(1): 33-38 (1971) - 1970
- [j1]Charles M. Rader, Lawrence R. Rabiner, Ronald W. Schafer:
A fast method of generating digital random numbers. Bell Syst. Tech. J. 49(9): 2303-2310 (1970)
1960 – 1969
- 1966
- [c1]Bernard Gold, Charles M. Rader:
Effects of quantization noise in digital filters. AFIPS Spring Joint Computing Conference 1966: 213-219
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:07 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:
