The search functionality is under construction.

Author Search Result

[Author] Iwao SASASE(110hit)

1-20hit(110hit)

  • An Iterative Decoding Method of Updating Redundant Likelihood Information

    Masayuki ARIYOSHI  Iwao SASASE  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E88-B No:3
      Page(s):
    1045-1053

    This paper presents a novel decoding algorithm for turbo codes, in which the likelihood values for redundant parts are updated in order for those values to become more reliable. A criterion for updating the redundant likelihood values is proposed, which is based on the comparisons of the channel values with the re-generated values by the soft-input and soft-output encoders. It is shown that the proposed method can improve the error correcting capabilities, i.e., the improvement of BER/BLER performance and the achievable BER limit.

  • Coherence Multiplexed/Subcarrier Multiplexing (CM/SCM) Lightwave System For Microcelluler Mobile Communications

    Hideyuki UEHARA  Iwao SASASE  

     
    PAPER-Mobile Communication

      Vol:
    E79-B No:5
      Page(s):
    708-715

    Subcarrier multiplexing (SCM) transmission over optical fiber for microcelluler mobile communication systems has been actively studied. However, as increasing the number of channels, intermodulation distortion (IMD) becomes the intrinsic problem. On the other hand, coherence multiplexed (CM) system for broad-band access communications has been developed and may find wide spread application because of its simplicity and flexibility. However the interference noise produced by the mixing of different optical channels at a photodetector is the serious problem. Therefore, on the down link for fiber optic microcell systems, it is attractive to consider the combination of SCM and CM: coherence multiplexed/subcarrier multiplexing (CM/SCM). In this hybrid scheme, since each optical channel is modulated by M microwave subcarriers, the bandwidth allocation is very flexible. In addition, the same microwave subcarrier frequency may be used among the different optical channels, because the optical channels are uncorrelated each other. We derive the received carrier-to-noise ratio (ONR) characteristics of CM/SCM system with optical amplifier as preamplifier or in-line amplifier for the optical down link from central station to base stations. The system performance of CM/SCM system is compared with those of coherent SCM (C-SCM) and CM systems from the viewpoint of the maximum number of base stations to be admitted. It is shown that the performance of CM/SCN system is superior to those of C-SCM and CM systems when optical power at the input to in-line amplifier is limited. CM system has good performance when preamplifier gain and optical power are large, and C-SCM system is the best when in-line amplifier is used.

  • Double-Stage Threshold-Type Foreground-Background Congestion Control for Common-Store Queueing System with Multiple Nonpreemptive Priority Classes

    Eiji SHIMAMURA  Iwao SASASE  

     
    PAPER-Communication Theory

      Vol:
    E77-B No:12
      Page(s):
    1556-1563

    The double-stage threshold-type foreground-background congestion control for the common-store queueing system with multiple nonpreemptive priority classes is proposed to improve the transient performance, where the numbers of accepted priority packets in both foreground and background stores are controlled under the double-stage threshold-type scheduling. In the double-stage threshold-type congestion control, the background store is used for any priority packets, and some parts of the background store are reserved for lower-priority packets to accommodate more lower-priority packets in the background store, whereas some parts of the foreground store are reserved for higher-priority packets to avoid the priority deadlock. First, we derive the general set of coupled differential equations describing the system-state, and the expressions for mean system occupancy, throughput and loss probability. Second, the transient behavior of system performance is evaluated from the time-dependent state probabilities by using the Runge-Kutta procedure. It is shown that when the particular traffic class becomes overloaded, high throughputs and low loss probabilities of other priority classes can be obtained.

  • Fiber Optic Subcarrier Transmission Systems Using Coherence Multiplexing Techniques for Broad-Band Distribution Networks

    Hideyuki UEHARA  Iwao SASASE  Mitsuo YOKOYAMA  

     
    PAPER-Optical Communication

      Vol:
    E80-B No:7
      Page(s):
    1027-1034

    Fiber optic subcarrier transmission system using coherence multiplexing techniques for broad-band distribution networks is proposed. This system makes it possible to improve the laser linewidth requirement and also to eliminate the effect of intermodulation distortion (IMD) which is serious problem in subcarrier multiplexed (SCM) system. In the proposed system, the frequency difference, fo, between the reference light and the signal light makes it possible to generate the broadand FM signal after photodetecting. Thus, an increase in the modulation index provides a corresponding increase in receiver sensitivity. We analyze the fundamental performance of the proposed system and derive the signal-to-noise ratio (SNR) at the output of FM demodulator by taking the threshold effect and spike noise into account. The proposed system can achieve the total capacity in excess of 10 GHz, and thus it is attractive for multichannel broad-band distribution networks.

  • Low Complexity Resource Allocation Algorithm by Multiple Attribute Weighing and User Ranking for OFDMA Systems

    Maduranga LIYANAGE  Iwao SASASE  

     
    PAPER-Transmission Systems and Transmission Equipment for Communications

      Vol:
    E90-B No:8
      Page(s):
    2006-2015

    We propose an effective subcarrier allocation scheme for multiuser orthogonal frequency division multiple access (OFDMA) system in the downlink transmission with low computational complexity. In the proposed scheme, by taking multiple attributes of a user's channel, such as carrier gain decrease rate and variation from the mean channel gain of the system, to determine a rank for the user, subcarriers are then allocated depending on the individual user's rank. Different channel characteristics are used to better understand a user's need for subcarriers and hence determine a priority for the user. We also adopt an attribute weighing scheme to enhance the performance of the proposed scheme. The scheme is computationally efficient, since it avoids using iterations for the algorithm convergence and also common water-filling calculations that become more complex with increasing system parameters. Low complexity is achieved by allocating subcarriers to users depending on their determined rank. Our proposed scheme is simulated in comparison with other mathematically efficient subcarrier allocation schemes as well as with a conventional greedy allocation scheme. It is shown that the proposed method demonstrates competitive results with the simulated schemes.

  • Spreading Code Assignment for Multicarrier CDMA System over Frequency-Selective Fading Channels

    Takashi SHONO  Tomoyuki YAMADA  Kiyoshi KOBAYASHI  Katsuhiko ARAKI  Iwao SASASE  

     
    PAPER-Terrestrial Radio Communications

      Vol:
    E87-B No:12
      Page(s):
    3734-3746

    In multicarrier code division multiple access (MC-CDMA) systems, the orthogonality among the spreading codes is destroyed because the channels exhibit frequency-selective fading and the despreading stage performs gain control; that is, inter-code interference (ICI) can significantly degrade system performance. This paper proposes an optimum spreading code assignment method that reflects our analysis of ICI for up and downlink MC-CDMA cellular systems over correlated frequency-selective Rayleigh fading channels. At first, we derive theoretical expressions for the desired-to-undesired signal power ratio (DUR) as a quantitative representation of ICI; computer simulation results demonstrate the validity of the analytical results. Next, based on the ICI imbalance among code pairs, we assign specific spreading codes to users to minimize ICI (in short, to maximize the multiplexing performance); our proposed method considers the quality of service (QoS) policy of users or operators. We show that the proposed method yields better performance, in terms of DUR, than the conventional methods. The proposed method can maximize the multiplexing performance of a MC-CDMA cellular system once the channel model, spreading sequence, and combining strategy have been set. Three combining strategies are examined at the despreading stage for the uplink, equal gain combining (EGC), orthogonality restoring combining (ORC), and maximum ratio combining (MRC), while two are considered for the downlink, EGC and MRC.

  • Non-Collision Packet Reservation Multiple Access with Random Transmission to Idle Slots

    Mioko TADENUMA  Iwao SASASE  

     
    PAPER-Information Network

      Vol:
    E83-A No:10
      Page(s):
    1945-1954

    The non-collision packet reservation multiple access (NC-PRMA) protocol has been proposed for wireless voice communications. In that protocol, although it can avoid any collision by using control minislot, the terminal which generates its talkspurt in a current frame has to wait till a next frame to transmit an asking packet to obtain reservation. Furthermore, under integrated voice and data traffic, in the conventional NC-PRMA the voice packet dropping probability becomes worse, because of the number of slots that voice terminals can access are limited. In this paper, we propose the NC-PRMA with random transmission to idle slots. First, we evaluate the mean access delay and the voice packet dropping probability under only voice traffic by the theoretical analysis and the computer simulation. It is shown that the proposed scheme attains lower mean access delay than the conventional NC-PRMA. Next, we evaluate the data packet delay and the voice packet dropping probability under integrated voice and data traffic by the computer simulation. It is shown that the proposed scheme attains lower packet dropping probability than the PRMA and the conventional NC-PRMA.

  • A Kalman Filter Merging CV and Kinetic Acceleration Estimation Model Using Mode Probabilities

    Masataka HASHIRAO  Tetsuya KAWASE  Iwao SASASE  

     
    LETTER-Navigation, Guidance and Control Systems

      Vol:
    E86-B No:10
      Page(s):
    3147-3151

    For radar tracking, the α-β filter and the Kalman filter, both of which do not require large computational requirements, have been widely utilized. However these filters cannot track a maneuvering target accurately. In recent years, the IMM (Interactive Multiple Model) algorithm has been proposed. The IMM is expected to reduce tracking errors for both non-maneuvering and maneuvering target. However, the IMM requires heavy computational burden, because it utilizes multiple Kalman filters in parallel. On the other hand, the α-β filter with an acceleration term which can estimate maneuver acceleration from the past target estimated positions using the kinetic model, has been proposed. This filter is not available for tracking targets under clutter environment, since it does not calculate the covariance matrix which is needed for gate setting. In this paper, we apply the acceleration estimate to the Kalman filter, and propose the hybrid Kalman filter with a constant-velocity filter and an acceleration estimation filter, and it integrates the outputs of two filters using the normalized distance of the prediction error of each filter. The computational requirement of the proposed filter is smaller than that of the IMM since the proposed filter consists of only two Kalman based filters. The proposed method can prevent deteriorating tracking accuracy by reducing the risk of maneuver misdetection when a target maneuvers. We evaluate the performance of the proposed filter by computer simulation, and show the effectiveness of the proposed filter, comparing with the conventional Kalman filter and the two-stage Kalman filter.

  • Indoor Crowd Estimation Scheme Using the Number of Wi-Fi Probe Requests under MAC Address Randomization

    Yuki FURUYA  Hiromu ASAHINA  Masashi YOSHIDA  Iwao SASASE  

     
    PAPER-Information Network

      Pubricized:
    2021/06/18
      Vol:
    E104-D No:9
      Page(s):
    1420-1426

    As smartphones have become widespread in the past decade, Wi-Fi signal-based crowd estimation schemes are receiving increased attention. These estimation schemes count the number of unique MAC addresses in Wi-Fi signals, hereafter called probe requests (PRs), instead of counting the number of people. However, these estimation schemes have low accuracy of crowd estimation under MAC address randomization that replaces a unique MAC address with various dummy MAC addresses. To solve this problem, in this paper, we propose an indoor crowd estimation scheme using the number of PRs under MAC address randomization. The main idea of the proposed scheme is to leverage the fact that the number of PRs per a unit of time changes in proportion to the number of smartphones. Since a smartphone tends to send a constant number of PRs per a unit of time, the proposed scheme can estimate the accurate number of smartphones. Various experiment results show that the proposed scheme reduces estimation error by at most 75% compared to the conventional Wi-Fi signal-based crowd estimation scheme in an indoor environment.

  • Performance of a Nonblocking Space-Division Packet Switch with Two Kinds of Correlated Input Calls

    Shigeki SHIOKAWA  Iwao SASASE  

     
    LETTER-Communication Networks and Service

      Vol:
    E78-B No:3
      Page(s):
    414-419

    The performance of a nonblocking switch with two kinds of correlated input calls is analyzed. We define two kinds of calls as the waiting call and the immediate call, and assume that the immediate call has the priority over the waiting call. If the traffic density of one kind of calls is larger than maximum throughput, the ratio of the corresponding kind of calls to the total traffic must be restrained in some range. We derive the maximum ratio of the waiting call by using two approximate methods. The effects of traffic densities and transition probabilities of two kinds of calls on the maximum ratio of the waiting call are also considered. It is shown that, if the traffic density of the immediate call is smaller than that of the waiting call, our approximate methods are useful to derive the maximum ratio of the waiting call to the total traffic.

  • Coherent Optical Polarization-Shift-Keying (POLSK) Homodyne System Using Phase-Diversity Receivers

    Ichiro SETO  Tomoaki OHTSUKI  Hiroyuki YASHIMA  Iwao SASASE  Shinsaku MORI  

     
    PAPER

      Vol:
    E75-A No:1
      Page(s):
    52-59

    We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoretically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

  • The Effect of Message-Class Dependent Threshold-Type Scheduling on the Delay for the M/M/n Queue

    Iwao SASASE  Yoshifumi NISHIO  Hitomi NAKAMURA  

     
    PAPER

      Vol:
    E75-A No:9
      Page(s):
    1087-1099

    The effect of mesage-class dependent threshold-type scheduling on queueing delay and resequencing delay for the M/M/n queueing system is analyzed. We first derive the expressions for the state transition equations, mean queueing delay, resequencing delay and total delay for the M/M/n queueing system shared by C different message classes under a threshold-type scheduling in which the threshold values depend on the message class at the head of queue and the number of messages in the buffer. Next, the numerical calculation and the computer simulation are carried out for the queueing system with two servers. It is found that the message-class dependent threshold-type scheduling is effective to reduce the resequencing delay of some specific message class, which can not be attained under the conventional threshold-type scheduling, and thus, the proposed scheduling can satisfy the different requirements of the different message classes, such as minimizing only queueing delay or total delay including resequencing delay.

  • Coded Nonuniform Phase/Frequency Modulation

    Aminuddin CHALID  Iwao SASASE  Hiroyuki YASHIMA  Shinsaku MORI  

     
    PAPER-Communication Theory

      Vol:
    E72-E No:8
      Page(s):
    903-911

    The nonuniformity of signal constellation on coded phase/frequency modulation is investigated to obtain further improvement on the error performance over conventional uniformly spaced coded phase/frequency modulation. The analytical method for evaluating the Euclidean distance of nonuniform FSK/PSK signal is presented. In particular, the joint design of m/(m1) systematic convolutional encoders and nonuniform 2FSK/2mPSK are considered, and especially for 2FSK/4PSK and 2FSK/8PSK the behavior of the free Euclidean distance is evaluated by varying the modulation index, the rotation angles which determine the nonuniform signal constellation, and the mapping rule by set partitioning. The results show that by designing compared with the conventional coded uniform phase/frequency modulation may be obtained without increasing average or peak power or changing the bandwidth of the transmitted signals. The maximum value of the free Euclidean distance of codes can be obtained when the PSK signal constellation of one carrier frequency is the same as those of the other carrier frequency, and the mapping rule used in coded uniform FSK/PSK system is not always good enough when the nonuniformity in the signal constellation is introduced.

  • Capacity and Effects of Reed-Solomon Codes on Multi-Pulse PPM in Optical Communications

    Masahiko TAKAHASHI  Hiroyuki YASHIMA  Iwao SASASE  Shinsaku MORI  

     
    PAPER-Optical Communication

      Vol:
    E72-E No:11
      Page(s):
    1198-1203

    The capacity of Multi-pulse PPM (MPPM) and performance of Reed-Solomon coded MPPM in optical photon communications are evaluated. Transmission rate, energy efficiency and error probability of MPPM are presented for noiseless channel. It is shown that MPPM yields higher limits of energy efficiencies as well as transmission rate than PPM in band limited channel. Moreover, it is shown that MPPM combined with Reed-Solomon (RS) codes achieves higher energy efficiency of more than twice as that of RS coded PPM, which McEliece studied, in practical range of error probability.

  • Low-Complexity Joint Antenna and User Selection Scheme for the Downlink Multiuser Massive MIMO System with Complexity Reduction Factors

    Aye Mon HTUN  Maung SANN MAW  Iwao SASASE  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2018/08/29
      Vol:
    E102-B No:3
      Page(s):
    592-602

    Multiuser massive multi-input multi-output (MU massive MIMO) is considered as a promising technology for the fifth generation (5G) of the wireless communication system. In this paper, we propose a low-complexity joint antenna and user selection scheme with block diagonalization (BD) precoding for MU massive MIMO downlink channel in the time division duplex (TDD) system. The base station (BS) is equipped with a large-scale transmit antenna array while each user is using the single receive antenna in the system. To reduce the hardware cost, BS will be implemented by limited number of radio frequency (RF) chains and BS must activate some selected transmit antennas in the BS side for data transmitting and some users' receive antennas in user side for data receiving. To achieve the reduction in the computation complexity in the antenna and user selection while maintaining the same or higher sum-rate in the system, the proposed scheme relies on three complexity reduction key factors. The first key factor is that finding the average channel gains for the transmit antenna in the BS side and the receive antenna in the user side to select the best channel gain antennas and users. The second key factor called the complexity control factor ξ(Xi) for the antenna set and the user set limitation is used to control the complexity of the brute force search. The third one is that using the assumption of the point-to-point deterministic MIMO channel model to avoid the singular value decomposition (SVD) computation in the brute force search. We show that the proposed scheme offers enormous reduction in the computation complexity while ensuring the acceptable performance in terms of total system sum-rate compared with optimal and other conventional schemes.

  • Interlace Coding System Involving Data Compression Code, Data Encryption Code and Error Correcting Code

    Takaya YAMAZATO  Iwao SASASE  Shinsaku MORI  

     
    PAPER

      Vol:
    E75-B No:6
      Page(s):
    458-465

    An Interlace Coding System (ICS) involving data compression code, data encryption code and error correcting code is proposed and its error performance on additive white Gaussian noise (AWGN) channel with quadrature phase shift keying (QPSK) is analyzed. The proposed system handles data compression, data encryption and error correcting processes together, i.e. adds error correcting redundancy to the block lists of the dictionary in which compression system constructs to reduce source redundancy. Each block list is encoded by Ziv-Lempel code and Data Encryption Standard (DES). As the catastrophic condition determined by the data compression procedure is not negligible, error correcting redundancy should be added so as to avoid catastrophic condition. We found that the catastrophic condition depends only on the size of the dictionary for our proposed system. Thus, by employing a large dictionary, good error performance can be applied by the proposed system and the catastrophic condition can be avoided.

  • Restricted Overflow Strategy in Integrated Services Network

    Tatsuya TANIAI  Azuchi MIKI  Takashi KOJIMA  Iwao SASASE  Shinsaku MORI  

     
    PAPER-Communication Networks and Service

      Vol:
    E75-B No:7
      Page(s):
    649-656

    In this paper, restricted overflow strategy is proposed as a novel channel access strategy for the queueable hierarchical channel structure, which has been proposed as one of "Wideband-ISDN" channel structures. In this policy, overflow from higher bit rate channels to lower bit rate channels is partly restricted by the number of waiting customers in the higher channel's buffer. Therefore, thresholds, which restrict overflow, are considered on the buffer. First, we present the system model with two types of services and restricted overflow strategy. Next, we provide a queueing analysis of this strategy. After that, some numerical results of both conventional overflow strategy and restricted overflow strategy are presented, and we compare the average holding times under these strategies. Finally, we show that, if we choose appropriate thresholds, the average holding time of higher level traffic is improved.

  • Trellis Coded 8PSK Modulation with Diversity on Spatially Correlated Rayleigh Fading Channel

    Gunawan WIBISONO  Iwao SASASE  

     
    PAPER-Mobile Communication

      Vol:
    E80-B No:1
      Page(s):
    156-165

    We have investigated the BER performance of TC 8PSK with 2 branch SC and MRC diversities on spatially correlated Rayleigh fading channel. The upper bounds using the transfer function bounding technique are derived several numerical results are shown. Although the correlation between branches causes signal-to-noise (SNR) loss (relative to uncorrelated fading case) for SC and MRC diversities, the diversity can lead to achieve the diversity gain compared to the system without diversity. It is found that the diversity gain of 4-state TC 8PSK is larger than 8-state TC 8PSK. It is also shown that the BER performance of TC 8PSK is decreased as the antenna separation is decreased.

  • Indoor Infrared Wireless Systems Using OOK-CDMA with Decision-Feedback Equalizer on Diffuse Channels

    Hiroe YAMAGUCHI  Ryoko MATSUO  Michihito MATSUO  Tomoaki OHTSUKI  Iwao SASASE  

     
    PAPER-Wireless Communication Technology

      Vol:
    E84-B No:4
      Page(s):
    960-966

    We evaluate the performance of indoor infrared wireless systems using on-off keying code division multiple access (OOK-CDMA) with decision-feedback equalizer (DFE) on diffuse channels. To estimate the impulse response, we use the training sequence that alternates '1' and '0. ' We show that the OOK-CDMA with DFE and the training sequence can achieve better performance than the OOK-CDMA without DFE. We also show that the OOK-CDMA with DFE and the training sequence can achieve almost the same performance as the OOK-CDMA with DFE and the known impulse response.

  • Target Detection with MSN Algorithm for the Bistatic Radar Using Digital Terrestrial Broadcasting Signals

    Junji ASADA  Iwao SASASE  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E94-B No:2
      Page(s):
    515-525

    In bistatic radar, it is important to suppress the undesired signals such as the direct propagated signal from transmitter and its multipath components. Conventionally, some suppression methods have been proposed. They are categorized into the method using a feedback system and the method which subtracts the replicas of the undesired signals. The former method may have the problem on the convergence of the suppression performance. The latter method requires the precise delay times of the undesired signals. In this paper we propose a new method to detect the target in digital terrestrial TV-based bistatic radar which is based on orthogonal frequency division multiplexing (OFDM), without any information on the undesired signals' delay times. In the proposed method, we adapt a scheme based on maximum signal to noise ratio (MSN) algorithm, which makes signal to interference plus noise ratio (SINR) maximum for the desired signal component. The maximum sensitivity is steered so as to match the path that exhibits the delay which relates to the target position, as if the search beam is steered along the direction in array signal processing. In the proposed method, "nulls" are also formed for other delay components to be suppressed simultaneously. In the frequency domain, the carrier components of the scattered signal divided by those of the reference signal indicate the delays caused by scattering. We call these divided carrier components "normalized received signal." The steered sensitivity and nulls are created by the weight which is applied to the normalized received signal in the frequency domain. We obtain the method to estimate the weight to achieve the maximum SINR in the delay estimation which also includes the compensation for the reduction of the weight's length caused by decorrelation among the delay components. The simulation results show that our proposed method without any information on the undesired signal's delays provides sufficient detection performance for the typical target compared to the conventional one.

1-20hit(110hit)