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

Zhao Zhengang - One of the best experts on this subject based on the ideXlab platform.

  • On the design of nearest optimal recursive Linear Shift-variant digital filters
    IEEE International Symposium on Circuits and Systems, 1990
    Co-Authors: Dejung Wang, Zhao Zhengang
    Abstract:

    A technique of designing recursive Linear Shift-variant digital filters is described for which the filter coefficients are simple functions of the cutoff frequency of the filter. It is shown that the filters designed by this method are optimal for the criterion of least square errors at the cutoff frequency of the prototype filter, and nearest or approximated optimal at other cutoff frequencies. Details of the design technique are discussed. An example is included to illustrate that the method proposed is computationally efficient.

Kun-peng Wang - One of the best experts on this subject based on the ideXlab platform.

  • A lattice-based Linear Shift register synthesis for multisequences of varying length
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Li-ping Wang, Quan-long Wang, Kun-peng Wang
    Abstract:

    In this paper we propose a Linear Shift register synthesis algorithm for a multisequence of varying length by modifying the lattice basis reduction multisequence synthesis (Wang-Zhu-Pei for short) algorithm (L.-P. Wang et al., 2004). After a few simple modifications to it we can obtain the Schmidt-Sidorenko algorithm in (G. Schmidt and V.R. Sidorenko, 2006). In addition, we give the necessary and sufficient condition for the uniqueness of the minimal-length Linear Shift-register for generating a multisequence of varying length.

  • ISIT - A lattice-based Linear Shift register synthesis for multisequences of varying length
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Li-ping Wang, Quan-long Wang, Kun-peng Wang
    Abstract:

    In this paper we propose a Linear Shift register synthesis algorithm for a multisequence of varying length by modifying the lattice basis reduction multisequence synthesis (Wang-Zhu-Pei for short) algorithm (L.-P. Wang et al., 2004). After a few simple modifications to it we can obtain the Schmidt-Sidorenko algorithm in (G. Schmidt and V.R. Sidorenko, 2006). In addition, we give the necessary and sufficient condition for the uniqueness of the minimal-length Linear Shift-register for generating a multisequence of varying length.

Vladimir R. Sidorenko - One of the best experts on this subject based on the ideXlab platform.

  • Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case
    2006 IEEE International Symposium on Information Theory, 2006
    Co-Authors: Georg Schmidt, Vladimir R. Sidorenko
    Abstract:

    The problem of Linear Shift-register synthesis for a single sequence is solved by the well known Berlekamp-Massey algorithm. The problem of multi-sequence Shift-register synthesis is already addressed by Feng and Tzeng. The Feng-Tzeng algorithm can be considered as a generalization of the Berlekamp-Massey algorithm which takes a set of t different sequences of length N and yields a Linear Shift-register of length l capable of generating all t sequences. However, for the case of multiple sequences of varying length, the Feng-Tzeng algorithm generally does not give the correct solution. We demonstrate this by means of an example and explain, why the Feng-Tzeng algorithm does not work properly in the unequal length case. We propose a modification of the fundamental iterative algorithm (FIA) from Feng and Tzeng, which overcomes the problem with varying length sequences. Based on this algorithm we derive an efficient Berlekamp-Massey like algorithm for solving the multi-sequence Shift-register synthesis problem for sequences of varying length

  • ISIT - Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case
    2006 IEEE International Symposium on Information Theory, 2006
    Co-Authors: Georg Schmidt, Vladimir R. Sidorenko
    Abstract:

    The problem of Linear Shift-register synthesis for a single sequence is solved by the well known Berlekamp?Massey algorithm. The problem of multi-sequence Shift-register synthesis is already addressed by Feng and Tzeng. The Feng-Tzeng algorithm can be considered as a generalization of the Berlekamp? Massey algorithm which takes a set of t different sequences of length N and yields a Linear Shift-register of length l capable of generating all t sequences. However, for the case of multiple sequences of varying length, the Feng-Tzeng algorithm generally does not give the correct solution. We demonstrate this by means of an example and explain, why the Feng-Tzeng algorithm does not work properly in the unequal length case. We propose a modification of the Fundamental Iterative Algorithm (FIA) from Feng and Tzeng, which overcomes the problem with varying length sequences. Based on this algorithm we derive an efficient Berlekamp? Massey like algorithm for solving the multisequence Shift-register synthesis problem for sequences of varying length.

  • Linear Shift-Register Synthesis for Multiple Sequences of Varying Length
    arXiv: Information Theory, 2006
    Co-Authors: Georg Schmidt, Vladimir R. Sidorenko
    Abstract:

    The problem of finding the shortest Linear Shift-register capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed by Feng and Tzeng. They presented an iterative algorithm for solving this multi-sequence Shift-register synthesis problem, which can be considered as generalization of the well known Berlekamp-Massey algorithm. The Feng-Tzeng algorithm works indeed, if all t sequences have the same length. This paper focuses on multi-sequence Shift-register synthesis for generating sequences of varying length. It is exposed, that the Feng-Tzeng algorithm does not always give the correct solution in this case. A modified algorithm is proposed and formally proved, which overcomes this problem.

Dejung Wang - One of the best experts on this subject based on the ideXlab platform.

  • On the design of nearest optimal recursive Linear Shift-variant digital filters
    IEEE International Symposium on Circuits and Systems, 1990
    Co-Authors: Dejung Wang, Zhao Zhengang
    Abstract:

    A technique of designing recursive Linear Shift-variant digital filters is described for which the filter coefficients are simple functions of the cutoff frequency of the filter. It is shown that the filters designed by this method are optimal for the criterion of least square errors at the cutoff frequency of the prototype filter, and nearest or approximated optimal at other cutoff frequencies. Details of the design technique are discussed. An example is included to illustrate that the method proposed is computationally efficient.

Li-ping Wang - One of the best experts on this subject based on the ideXlab platform.

  • A lattice-based Linear Shift register synthesis for multisequences of varying length
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Li-ping Wang, Quan-long Wang, Kun-peng Wang
    Abstract:

    In this paper we propose a Linear Shift register synthesis algorithm for a multisequence of varying length by modifying the lattice basis reduction multisequence synthesis (Wang-Zhu-Pei for short) algorithm (L.-P. Wang et al., 2004). After a few simple modifications to it we can obtain the Schmidt-Sidorenko algorithm in (G. Schmidt and V.R. Sidorenko, 2006). In addition, we give the necessary and sufficient condition for the uniqueness of the minimal-length Linear Shift-register for generating a multisequence of varying length.

  • ISIT - A lattice-based Linear Shift register synthesis for multisequences of varying length
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Li-ping Wang, Quan-long Wang, Kun-peng Wang
    Abstract:

    In this paper we propose a Linear Shift register synthesis algorithm for a multisequence of varying length by modifying the lattice basis reduction multisequence synthesis (Wang-Zhu-Pei for short) algorithm (L.-P. Wang et al., 2004). After a few simple modifications to it we can obtain the Schmidt-Sidorenko algorithm in (G. Schmidt and V.R. Sidorenko, 2006). In addition, we give the necessary and sufficient condition for the uniqueness of the minimal-length Linear Shift-register for generating a multisequence of varying length.