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

Author Search Result

[Author] Koji ISHII(3hit)

1-3hit
  • Nested Transmit Diversity Based on a Joint Network-Channel Coding

    Koji ISHII  Koji ISHIBASHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E96-B No:9
      Page(s):
    2261-2269

    In order to obtain higher diversity gain, the use of additional resources such as time, frequency, and/or antennas are necessary. The aim of this study is to achieve adequate temporal diversity gain without needing additional resources beyond decoding delay and decoding complexity. If the channel state information (CSI) is not available at the transmitter side, the transmitter sends information at a given constant transmission rate while the channel capacity varies according to the channel state. If the instantaneous channel capacity is greater than the given transmission rate, the system can successfully transmit information but it does not exploit the entire available channel capacity. We focus on this extra channel capacity to transmit other information based on a joint network-channel coding in order to obtain higher diversity and coding gains. This paper provides the basic concept of the transmit diversity with the joint network-channel coding and investigates its performances in terms of outage probability, additional decoding delay and complexity, and frame-error rate (FER).

  • Slotted-ALOHA Based Average Consensus Problem with Adaptive Call-Occurrence Probability

    Koji ISHII  

     
    PAPER-Communication Theory and Signals

      Vol:
    E103-A No:3
      Page(s):
    613-622

    This paper proposes an adaptive call-occurrence probability (COP) setting method for a slotted-ALOHA based consensus problem. Individual agents in the focused consensus problem control themselves in a distributed manner based on the partial information of overall control system which can be received only from the neighbor agents. In order to realize a reliable consensus problem based on wireless communications, we have to consider several constraints caused by the natures of wireless communications such as communication error, coverage, capacity, multi-user interference, half-duplex and so on. This work first investigates the impacts of wireless communication constraints, especially communication coverage, half-duplex, and multiple-access interference constraints, on the quality of control. To mitigate the impact of multiple-access constraint, we propose an adaptive COP setting method that changes the COP corresponding to the states of communication and control. The proposed adaptive COP based slotted-ALOHA needs the information about the number of neighbor agents at its own and neighbor agents, but can still work in a distributed manner. Computer simulations show that the proposed system can achieve better convergence performance compared to the case with the fixed COP based system.

  • Dirty Paper Coded Cooperation Utilizing Superposition Modulation

    Koji ISHII  Koji ISHIBASHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E91-B No:5
      Page(s):
    1540-1547

    In this paper, we design a new coded cooperation protocol utilizing superposition modulation together with iterative decoding/detection algorithms. The aim of the proposed system is to apply "dirty paper coding" theory in the context of half-duplex relay systems. In the proposed system, the node transmits a superposed signal which consists of its own coded information and other node's re-coded information. The destination node detects and decodes the signal using the received signals at two continuous time-slots with iterative decoding algorithm. Moreover, the destination node detects the received signal using the results of decoding, iteratively. This paper provides the outage probability of the proposed system under the assumption that the proposed system can ideally perform dirty paper coding, and it is shown from the comparison between outage probabilities and simulated results that the proposed system can get close to the dirty paper coding theory.