default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirofumi Tsuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Hirofumi Tsuda, Ken Umeno:
Randomization Approaches for Reducing PAPR with Partial Transmit Sequence and Semidefinite Relaxation. IEICE Trans. Commun. 104-B(3): 262-276 (2021)
2010 – 2019
- 2019
- [b1]Hirofumi Tsuda:
Study on Communication System From the Perspective of Improving Signal-to-Noise Ratio. Kyoto University, Japan, 2019 - [c3]Hirofumi Tsuda:
Optimal Sequence and SINR for Desired User in Asynchronous CDMA System. EuCNC 2019: 1-5 - [c2]Hirofumi Tsuda:
Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix. WCNC Workshops 2019: 1-6 - [i11]Hirofumi Tsuda:
Moment-Based Bound on Peak-to-Average Power Ratio and Reduction with Unitary Matrix. CoRR abs/1902.06420 (2019) - [i10]Hirofumi Tsuda:
Optimal Sequence and SINR for Desired User in Asynchronous CDMA System. CoRR abs/1902.06422 (2019) - [i9]Hirofumi Tsuda:
Bound on Peak-to-Average Power Ratio with Moment and Reduction Method. CoRR abs/1909.05110 (2019) - 2018
- [j3]Hirofumi Tsuda, Ken Umeno:
Weyl Spreading Sequence Optimizing CDMA. IEICE Trans. Commun. 101-B(3): 897-908 (2018) - [j2]Hirofumi Tsuda
, Ken Umeno:
Non-Linear Programming: Maximize SINR for Designing Spreading Sequence. IEEE Trans. Commun. 66(1): 278-289 (2018) - [c1]Hirofumi Tsuda, Ken Umeno:
Randomization Algorithm for Partial Transmit Sequence with Semidefinite Relaxation. VTC Fall 2018: 1-5 - [i8]Hirofumi Tsuda, Ken Umeno:
Randomization Approaches for Reducing PAPR with Partial Transmit Sequences and Semidefinite Relaxation. CoRR abs/1805.04666 (2018) - 2017
- [i7]Hirofumi Tsuda, Ken Umeno:
Method to Design UF-OFDM Filter and its Analysis. CoRR abs/1711.07197 (2017) - 2016
- [j1]Hirofumi Tsuda, Ken Umeno:
Orthogonal basis spreading sequence for optimal CDMA. JSIAM Lett. 8: 77-80 (2016) - [i6]Hirofumi Tsuda, Ken Umeno:
Weyl Spreading Sequence Optimizing CDMA. CoRR abs/1602.04584 (2016) - [i5]Hirofumi Tsuda, Ken Umeno:
Orthogonal Basis Spreading Sequence for Optimal CDMA. CoRR abs/1605.04721 (2016) - [i4]Hirofumi Tsuda, Ken Umeno:
Numerical Approach to Maximize SNR for CDMA Systems. CoRR abs/1609.09577 (2016) - [i3]Hirofumi Tsuda, Ken Umeno:
SNR Maximization as a Non-Linear Programming -Towards Optimal Spreading Sequence-. CoRR abs/1610.04340 (2016) - [i2]Hirofumi Tsuda, Ken Umeno:
Non-Linear Programming: Maximize SNR for Designing Spreading Sequence - Part I: SNR versus Mean-Square Correlation. CoRR abs/1612.08232 (2016) - [i1]Hirofumi Tsuda, Ken Umeno:
Non-Linear Programming: Maximize SNR for Designing Spreading Sequence - Part II: Conditions for Optimal Spreading Sequences. CoRR abs/1612.08785 (2016)
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:57 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:
