The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Hirofumi TSUDA(2hit)

1-2hit
  • Randomization Approaches for Reducing PAPR with Partial Transmit Sequence and Semidefinite Relaxation Open Access

    Hirofumi TSUDA  Ken UMENO  

     
    PAPER-Transmission Systems and Transmission Equipment for Communications

      Pubricized:
    2020/09/01
      Vol:
    E104-B No:3
      Page(s):
    262-276

    To reduce peak-to-average power ratio, we propose a method of choosing suitable vectors in a partial transmit sequence technique. Conventional approaches require that a suitable vector be selected from a large number of candidates. By contrast, our method does not include such a selecting procedure, and instead generates random vectors from the Gaussian distribution whose covariance matrix is a solution of a relaxed problem. The suitable vector is chosen from the random vectors. This yields lower peak-to-average power ratio than a conventional method.

  • Weyl Spreading Sequence Optimizing CDMA

    Hirofumi TSUDA  Ken UMENO  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2017/09/11
      Vol:
    E101-B No:3
      Page(s):
    897-908

    This paper shows an optimal spreading sequence in the Weyl sequence class, which is similar to the set of the Oppermann sequences for asynchronous CDMA systems. Sequences in Weyl sequence class have the desired property that the order of cross-correlation is low. Therefore, sequences in the Weyl sequence class are expected to minimize the inter-symbol interference. We evaluate the upper bound of cross-correlation and odd cross-correlation of spreading sequences in the Weyl sequence class and construct the optimization problem: minimize the upper bound of the absolute values of cross-correlation and odd cross-correlation. Since our optimization problem is convex, we can derive the optimal spreading sequences as the global solution of the problem. We show their signal to interference plus noise ratio (SINR) in a special case. From this result, we propose how the initial elements are assigned, that is, how spreading sequences are assigned to each users. In an asynchronous CDMA system, we also numerically compare our spreading sequences with other ones, the Gold codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and the SP sequences in Bit Error Rate. Our spreading sequence, which yields the global solution, has the highest performance among the other spreading sequences tested.