default search action
Hideo Murakami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c7]Hideo Murakami:
A block transmission system modeled as parallel additive white Gaussian noise channel systems. EUSIPCO 2012: 2546-2550
2000 – 2009
- 2008
- [c6]Hideo Murakami:
Fractionally-sampled blind channel estimation for a mobile communication system. Mobility Conference 2008: 38 - 2007
- [j12]Hideo Murakami:
Deterministic Blind Channel Estimation for a Block Transmission System Using Fractional Sampling and Interpolation. IEEE Trans. Signal Process. 55(10): 4969-4978 (2007) - [c5]Koji Abe, Kazuya Miyashita, Hideo Murakami, Takahiro Hayashi, Haiyan Tian:
Estimation of essential objects in the sports ticker for segmenting a broadcasted baseball video into all the plate appearances. SIP 2007: 236-240 - 2006
- [j11]Hideo Murakami:
Blind estimation of a fractionally sampled FIR channel for OFDM transmission using residue polynomials. IEEE Trans. Signal Process. 54(1): 225-234 (2006) - 2005
- [c4]Suguru Arimoto, Hiroe Hashiguchi, Hideo Murakami:
Stability of zero-moment-manifold control for a family of under-actuated robots. IROS 2005: 1974-1979 - 2004
- [j10]Hideo Murakami:
Discrete wavelet transform based on cyclic convolutions. IEEE Trans. Signal Process. 52(1): 165-174 (2004) - 2002
- [j9]Hideo Murakami:
Prime-length real-valued polynomial residue division algorithms. IEEE Trans. Signal Process. 50(11): 2777-2788 (2002) - 2001
- [j8]Hideo Murakami:
Residue-division multiplexing for discrete-time signals. IEEE Trans. Commun. 49(6): 1000-1010 (2001) - [c3]Hideo Murakami:
A real-valued block filter bank with perfect-reconstruction property. ICIP (3) 2001: 186-189 - 2000
- [c2]Hideo Murakami:
Generalization of the cyclic convolution system and its applications. ICASSP 2000: 3351-3353
1990 – 1999
- 1997
- [j7]Hideo Murakami:
Implementation and perfect reconstruction of a maximally decimated FIR filter bank using parallel module decomposition. IEEE Trans. Signal Process. 45(2): 328-332 (1997) - [j6]Hideo Murakami:
Block sampling rate conversion systems using real-valued fast cyclic convolution algorithms. IEEE Trans. Signal Process. 45(4): 1070-1075 (1997) - 1996
- [c1]Hideo Murakami:
Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length. ICASSP 1996: 1311-1314 - 1995
- [j5]Hideo Murakami:
Sampling rate conversion systems using a new generalized form of the discrete Fourier transform. IEEE Trans. Signal Process. 43(9): 2095-2102 (1995)
1980 – 1989
- 1988
- [j4]Hideo Murakami:
Multiple FIR filters on a finite ring. IEEE Trans. Acoust. Speech Signal Process. 36(5): 686-692 (1988)
1970 – 1979
- 1978
- [j3]Hideo Murakami, Irving S. Reed:
Multichannel convolutional coding systems over a direct sum of Galois fields. IEEE Trans. Inf. Theory 24(2): 205-212 (1978) - 1977
- [j2]Hideo Murakami, Irving S. Reed:
Recursive realization of finite impulse filters using finite field arithmetic. IEEE Trans. Inf. Theory 23(2): 232-242 (1977) - [j1]Hideo Murakami, Irving S. Reed, Lloyd R. Welch:
A transform decoder for Reed-Solomon codes in multiple-user communication systems. IEEE Trans. Inf. Theory 23(6): 675-683 (1977)
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 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint