The search functionality is under construction.

Author Search Result

[Author] Nobuoki ESHIMA(2hit)

1-2hit
  • Code Acquisition in DS/CDMA Systems by Employing a Detector Based on a posteriori Probability Calculation

    M. Tahir Abbas KHAN  Nobuoki ESHIMA  Yutaka JITSUMATSU  Tohru KOHDA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E88-B No:10
      Page(s):
    4047-4055

    A detector based on calculation of a posteriori probability is proposed for code acquisition in singleuser direct sequence code division multiple access (DS/CDMA) systems. Available information is used for decision making, unlike conventional methods which only use a part of it. Although this increases the overhead in terms of additional memory and computational complexity, significant performance improvements are achieved. The frame work is extended to multiuser systems and again mean acquisition time/correct acquisition probability performance is superior to the conventional systems although computational complexity is high. An approximate multiuser method with significantly less complexity is also derived.

  • Low-Complexity Code Acquisition Method in DS/CDMA Communication Systems: Application of the Maximum Likelihood Method to Propagation Delay Estimation

    Nobuoki ESHIMA  Tohru KOHDA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E91-B No:5
      Page(s):
    1472-1479

    Code acquisition performance in the Direct-Sequence Code-Division Multiple-Access (DS/CDMA) communication system is strongly related to the quality of the communication systems. The performance is assessed by (i) code acquisition time; (ii) precision; and (iii) complexity for implementation. This paper applies the method of maximum likelihood (ML) to estimation of propagation delay in DS/CDMA communications, and proposes a low-complexity method for code acquisition. First, a DS/CDMA system model and properties of outputs with a passive matched-filter receiver are reviewed, and a statistical problem in code acquisition is mentioned. Second, an error-controllable code acquisition method based on the maximum likelihood is discussed. Third, a low-complexity ML code acquisition method is proposed. It is shown that the code acquisition time with the low-complexity method is about 1.5 times longer than that with the original ML method, e.g. 13 data periods under 4.96 dB.