Versions of the multiple Nevanlinna-Pick interpolation problem in the class N involving both interior and boundary data are investigated. This leads to solvability criteria for the indicated problems and description o...Versions of the multiple Nevanlinna-Pick interpolation problem in the class N involving both interior and boundary data are investigated. This leads to solvability criteria for the indicated problems and description of their solutions.展开更多
文献[1]应用Lwner与Hankel矩阵解法得出一般有理插值问题的McMillan次数小于插值点个数N(含重数)的所有真有理解及其参数表示.沿用[1]中记号与术语,我们在本文中继续考虑这个插值问题并得到包括真与非真有理解在内的所有解及其参数表...文献[1]应用Lwner与Hankel矩阵解法得出一般有理插值问题的McMillan次数小于插值点个数N(含重数)的所有真有理解及其参数表示.沿用[1]中记号与术语,我们在本文中继续考虑这个插值问题并得到包括真与非真有理解在内的所有解及其参数表示(详情见[2]),因而完全解决该问题。给出一般有理插值问题{(x_i,Y_(ik)),i=1,…,t;k=0,…τ_i-1},其Hankel向量记为b∈Q^(N-J),N=sum from i=1 to tτ_i.设n_1,n_2为b的特征度;(p(λ),q(λ))为典型特征多项式对.令α(λ)=p(λ)ω(λ)展开更多
In general, there are three popular basis representations, standard （canonical, polynomial） basis, normal basis, and dual basis, for representing elements in GF（2^m）. Various basis representations have their disti...In general, there are three popular basis representations, standard （canonical, polynomial） basis, normal basis, and dual basis, for representing elements in GF（2^m）. Various basis representations have their distinct advantages and have their different associated multiplication architectures. In this paper, we will present a unified systolic multiplication architecture, by employing Hankel matrix-vector multiplication, for various basis representations. For various element representation in GF（2^m）, we will show that various basis multiplications can be performed by Hankel matrix-vector multiplications. A comparison with existing and similar structures has shown that time complexities. the proposed architectures perform well both in space and展开更多
基金Supported by the National Natural Sciences Foundation of China (No.19971009)
文摘Versions of the multiple Nevanlinna-Pick interpolation problem in the class N involving both interior and boundary data are investigated. This leads to solvability criteria for the indicated problems and description of their solutions.
文摘文献[1]应用Lwner与Hankel矩阵解法得出一般有理插值问题的McMillan次数小于插值点个数N(含重数)的所有真有理解及其参数表示.沿用[1]中记号与术语,我们在本文中继续考虑这个插值问题并得到包括真与非真有理解在内的所有解及其参数表示(详情见[2]),因而完全解决该问题。给出一般有理插值问题{(x_i,Y_(ik)),i=1,…,t;k=0,…τ_i-1},其Hankel向量记为b∈Q^(N-J),N=sum from i=1 to tτ_i.设n_1,n_2为b的特征度;(p(λ),q(λ))为典型特征多项式对.令α(λ)=p(λ)ω(λ)
文摘In general, there are three popular basis representations, standard （canonical, polynomial） basis, normal basis, and dual basis, for representing elements in GF（2^m）. Various basis representations have their distinct advantages and have their different associated multiplication architectures. In this paper, we will present a unified systolic multiplication architecture, by employing Hankel matrix-vector multiplication, for various basis representations. For various element representation in GF（2^m）, we will show that various basis multiplications can be performed by Hankel matrix-vector multiplications. A comparison with existing and similar structures has shown that time complexities. the proposed architectures perform well both in space and
