Keyword Search Result

[Keyword] nonlinear optimization(6hit)

1-6hit
  • Joint Transmitter and Receiver Power Allocation under Minimax MSE Criterion with Perfect and Imperfect CSI for MC-CDMA Transmissions

    Chirawat KOTCHASARN  Poompat SAENGUDOMLERT  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E91-B No:6
      Page(s):
    1970-1979

    We investigate the problem of joint transmitter and receiver power allocation with the minimax mean square error (MSE) criterion for uplink transmissions in a multi-carrier code division multiple access (MC-CDMA) system. The objective of power allocation is to minimize the maximum MSE among all users each of which has limited transmit power. This problem is a nonlinear optimization problem. Using the Lagrange multiplier method, we derive the Karush-Kuhn-Tucker (KKT) conditions which are necessary for a power allocation to be optimal. Numerical results indicate that, compared to the minimum total MSE criterion, the minimax MSE criterion yields a higher total MSE but provides a fairer treatment across the users. The advantages of the minimax MSE criterion are more evident when we consider the bit error rate (BER) estimates. Numerical results show that the minimax MSE criterion yields a lower maximum BER and a lower average BER. We also observe that, with the minimax MSE criterion, some users do not transmit at full power. For comparison, with the minimum total MSE criterion, all users transmit at full power. In addition, we investigate robust joint transmitter and receiver power allocation where the channel state information (CSI) is not perfect. The CSI error is assumed to be unknown but bounded by a deterministic value. This problem is formulated as a semidefinite programming (SDP) problem with bilinear matrix inequality (BMI) constraints. Numerical results show that, with imperfect CSI, the minimax MSE criterion also outperforms the minimum total MSE criterion in terms of the maximum and average BERs.

  • A Method for Compensation of Image Distortion with Image Registration Technique

    Toru TAMAKI  Tsuyoshi YAMAMURA  Noboru OHNISHI  

     
    PAPER

      Vol:
    E84-D No:8
      Page(s):
    990-998

    We propose a method for compensating distortion of image by calibrating intrinsic camera parameters by image registration which does not need point-to-point correspondence. The proposed method divides the registration between a calibration pattern and a distorted image observed by a camera into two steps. The first step is the straightforward registration from the pattern in order to correct the displacement due to projection. The second step is the backward registration from the observed image for compensating the distortion of the image. Both of the steps use Gauss-Newton method, a nonlinear optimization technique, to minimize residuals of intensities so that the pattern and the observed image become the same. Experimental results show the usefulness of the proposed method. Finally we discuss the convergence of the proposed method which consists of the two registration steps.

  • A Range-Finder-Based Displacement Meter for Measuring Tooth Mobility in 6 Degrees of Freedom: Measurement Principle and Error Propagation Analysis

    Toyohiko HAYASHI  Kazuyuki KAZAMA  Takahiro ABE  Michio MIYAKAWA  

     
    PAPER-Medical Electronics and Medical Information

      Vol:
    E80-D No:8
      Page(s):
    808-816

    Efforts have been cumulated to measure tooth mobility, in order to accurately characterize the mechanical features of periodontal tissues. This paper provides a totally new technique for accomplishing the task of measuring tooth displacement in 6 degrees of freedom, using a range finder. Its intraoral equipment comprises two elements, a moving polyhedron and a referential device, both of which are secured to a subject tooth and several other teeth splinted together. The polyhedron has 6 planar surfaces, each oriented in a distinctly different direction, with each plane facing an opposing range finder mounted on the referential part. If the sensor geometry is provided, the position and orientation of the movable part, vis-a-vis the reference, can be determined theoretically from the distances between all the range finders and their opposing surfaces. This computation was mathematically formulated as a non-linear optimization problem, the numerical solution of which can be obtained iteratively. Its error-propagation formula was also provided as a linear approximation.

  • Design of Approximate Inverse Systems Using All-Pass Networks

    Md. Kamrul HASAN  Satoru SHIMIZU  Takashi YAHAGI  

     
    LETTER-Systems and Control

      Vol:
    E79-A No:2
      Page(s):
    248-251

    This letter presents a new design method for approximate inverse systems using all-pass networks. The efficacy of approximate inverse systems for input and parameter estimation of nonminimum phase systems is well recognized. in the previous methods, only time domain design of FIR (finite impulse response) type approximate inverse systems were considered. Here, we demonstrate that IIR (infinite impulse response) type approximate inverse systems outperform the previous methods. A nonlinear optimization technique is adopted for designing the proposed system in the frequency domain. Numerical examples are also presented to show the effectiveness of the proposed method.

  • Design of 2-D IIR Filter Using the Genetic Algorithm

    Masahiko KISHIDA  Nozomu HAMADA  

     
    LETTER-Digital Signal Processing

      Vol:
    E79-A No:1
      Page(s):
    131-133

    A design method of 2-D lattice digital filter using the Genetic Algorithm (GA) is proposed. By using the GA. 2-D all-pole lattice filter with the cascade connection of transversal (all-zoro) filter is designed directly from a given desired frequency responce.

  • Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks

    Hisao KAMEDA  Yongbing ZHANG  

     
    PAPER-Computer Networks

      Vol:
    E75-D No:4
      Page(s):
    535-542

    Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.