Technical Lemma

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 225 Experts worldwide ranked by ideXlab platform

Prakash Narayan - One of the best experts on this subject based on the ideXlab platform.

  • ISIT - The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function
    2009 IEEE International Symposium on Information Theory, 2009
    Co-Authors: Himanshu Tyagi, Prakash Narayan
    Abstract:

    We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new Technical Lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This Technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Kurner book).

  • The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function
    2009 IEEE International Symposium on Information Theory, 2009
    Co-Authors: Himanshu Tyagi, Prakash Narayan
    Abstract:

    We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new Technical Lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This Technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Kurner book).

Jun Fu - One of the best experts on this subject based on the ideXlab platform.

  • Robust adaptive decoupling control based on a reduced order model
    2012 American Control Conference (ACC), 2012
    Co-Authors: Yue Fu, Tianyou Chai, Jun Fu
    Abstract:

    This paper considers a class of discrete time linear multivariable non-minimum systems with unknown structures. A robust adaptive decoupling controller is proposed. First, for the design of the decoupling controller, a reduced order model is introduced. Then, by combining one-step-ahead weighting adaptive control with a feedforward decoupling compensator, the robust adaptive decoupling controller is developed. The controller parameters are directly identified by a normalized project algorithm with deadzone. BIBO stability conditions of the closed-loop system are presented by resorting to Key Technical Lemma and the introduction of pseudo exchanging matrices. Finally, to illustrate the effectiveness of the proposed method, simulations are conducted.

  • ACC - Robust adaptive decoupling control based on a reduced order model
    2012 American Control Conference (ACC), 2012
    Co-Authors: Yue Fu, Tianyou Chai, Jun Fu
    Abstract:

    This paper considers a class of discrete time linear multivariable non-minimum systems with unknown structures. A robust adaptive decoupling controller is proposed. First, for the design of the decoupling controller, a reduced order model is introduced. Then, by combining one-step-ahead weighting adaptive control with a feedforward decoupling compensator, the robust adaptive decoupling controller is developed. The controller parameters are directly identified by a normalized project algorithm with deadzone. BIBO stability conditions of the closed-loop system are presented by resorting to Key Technical Lemma and the introduction of pseudo exchanging matrices. Finally, to illustrate the effectiveness of the proposed method, simulations are conducted.

Himanshu Tyagi - One of the best experts on this subject based on the ideXlab platform.

  • ISIT - The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function
    2009 IEEE International Symposium on Information Theory, 2009
    Co-Authors: Himanshu Tyagi, Prakash Narayan
    Abstract:

    We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new Technical Lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This Technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Kurner book).

  • The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function
    2009 IEEE International Symposium on Information Theory, 2009
    Co-Authors: Himanshu Tyagi, Prakash Narayan
    Abstract:

    We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new Technical Lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This Technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Kurner book).

Yue Fu - One of the best experts on this subject based on the ideXlab platform.

  • Robust adaptive decoupling control based on a reduced order model
    2012 American Control Conference (ACC), 2012
    Co-Authors: Yue Fu, Tianyou Chai, Jun Fu
    Abstract:

    This paper considers a class of discrete time linear multivariable non-minimum systems with unknown structures. A robust adaptive decoupling controller is proposed. First, for the design of the decoupling controller, a reduced order model is introduced. Then, by combining one-step-ahead weighting adaptive control with a feedforward decoupling compensator, the robust adaptive decoupling controller is developed. The controller parameters are directly identified by a normalized project algorithm with deadzone. BIBO stability conditions of the closed-loop system are presented by resorting to Key Technical Lemma and the introduction of pseudo exchanging matrices. Finally, to illustrate the effectiveness of the proposed method, simulations are conducted.

  • ACC - Robust adaptive decoupling control based on a reduced order model
    2012 American Control Conference (ACC), 2012
    Co-Authors: Yue Fu, Tianyou Chai, Jun Fu
    Abstract:

    This paper considers a class of discrete time linear multivariable non-minimum systems with unknown structures. A robust adaptive decoupling controller is proposed. First, for the design of the decoupling controller, a reduced order model is introduced. Then, by combining one-step-ahead weighting adaptive control with a feedforward decoupling compensator, the robust adaptive decoupling controller is developed. The controller parameters are directly identified by a normalized project algorithm with deadzone. BIBO stability conditions of the closed-loop system are presented by resorting to Key Technical Lemma and the introduction of pseudo exchanging matrices. Finally, to illustrate the effectiveness of the proposed method, simulations are conducted.

Ian Postlethwaite - One of the best experts on this subject based on the ideXlab platform.

  • Discrete-Time Adaptive Control for Systems With Input Time-Delay and Non-Sector Bounded Nonlinear Functions
    IEEE Access, 2019
    Co-Authors: Khalid Abidi, Ian Postlethwaite
    Abstract:

    This paper presents a discrete-time adaptive control approach for nonlinear systems with input delay. The nonlinearity is assumed to be non-sector bounded, resulting in the key Technical Lemma being inapplicable. The main aim of this paper is to present a general implementation inspired from Kanellakopoulos and Fu, et al. for italic uncertain scalar and multivariable input delay systems with uncertain parameters as well as uncertain input gain. While it has been shown by Kanellakopoulos and Fu, et al. that it is possible to design adaptive control laws that compensate for the growth of the nonlinearity for single parameter scalar systems, a rigorous analysis of multiple parameter systems is not shown. In this paper, it is shown that an adaptive controller design that compensates for the growth of the nonlinearity is possible for both multiple parameter scalar and multivariable systems with input delay. Rigorous stability proofs and simulations are presented to verify the validity of the approach.