The search functionality is under construction.

Keyword Search Result

[Keyword] dual decomposition(2hit)

1-2hit
  • Energy-Efficient Resource Allocation in Sensing-Based Spectrum Sharing for Cooperative Cognitive Radio Networks

    Wanming HAO  Shouyi YANG  Osamu MUTA  Haris GACANIN  Hiroshi FURUKAWA  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E99-B No:8
      Page(s):
    1763-1771

    Energy-efficient resource allocation is considered in sensing-based spectrum sharing for cooperative cognitive radio networks (CCRNs). The secondary user first listens to the spectrum allocated to the primary user (PU) to detect the PU state and then initiates data transmission with two power levels based on the sensing decision (e.g., idle or busy). Under this model, the optimization problem of maximizing energy efficiency (EE) is formulated over the transmission power and sensing time subject to some practical limitations, such as the individual power constraint for secondary source and relay, the quality of service (QoS) for the secondary system, and effective protection for the PU. Given the complexity of this problem, two simplified versions (i.e., perfect and imperfect sensing cases) are studied in this paper. We transform the considered problem in fractional form into an equivalent optimization problem in subtractive form. Then, for perfect sensing, the Lagrange dual decomposition and iterative algorithm are applied to acquire the optimal power allocation policy; for imperfect sensing, an exhaustive search and iterative algorithm are proposed to obtain the optimal sensing time and corresponding power allocation strategy. Finally, numerical results show that the energy-efficient design greatly improves EE compared with the conventional spectrum-efficient design.

  • Probabilistic Treatment for Syntactic Gaps in Analytic Language Parsing

    Prachya BOONKWAN  Thepchai SUPNITHI  

     
    PAPER

      Vol:
    E94-D No:3
      Page(s):
    440-447

    This paper presents a syntax-based framework for gap resolution in analytic languages. CCG, reputable for dealing with deletion under coordination, is extended with a memory mechanism similar to the slot-and-filler mechanism, resulting in a wider coverage of syntactic gaps patterns. Though our grammar formalism is more expressive than the canonical CCG, its generative power is bounded by Partially Linear Indexed Grammar. Despite the spurious ambiguity originated from the memory mechanism, we also show that its probabilistic parsing is feasible by using the dual decomposition algorithm.