Complex sequences with low periodic correlations
Complex sequences with low periodic correlations
复制标题
DOI：
--
复制
发表时间：
1980
期刊：
影响因子：
--
通讯作者：
W. Alltop
中科院分区：
文献类型：
--
作者：
W. Alltop
上界和下界的重要性在于，它们可以被证明对于很大范围的P1和M是一致的。R;（d），+ . .，R”-'（d）分别对M= 3，4，5，.，10和M100，其中2和P，满足Q < P，<1/2。当R*（d）= co（Ri，Rf）（d）时，最佳编码-解码过程是使解码器忽略边信息并且仅使用源信息以获得低失真;使解码器忽略源信息并且仅使用边信息以获得失真Pi;并且对失真的中间值时间共享两个方案。如何刻画严格源信息与严格边信息分时得到最优性能的相关源是一个有趣的公开问题。一般来说，存在最佳编码-解码方案不是分时方案的相关信源;例如，当信源对于某些x，y具有p（xl y）= 1时，这是真的。
The importance of the upper and lower bound lies in the fact that they can be shown to agree for a large range of P, and M. R;(d), + . . ,R”-‘(d) were evaluated for M=3,4,5,... ,lO and M100 wit 2 and P, satisfying Q < P, < l/2. When R*(d) = co(R,‘, Rf)(d), the optimum coding-decoding procedure is to have the decoder ignore side information and use only source information for low distortion; to have the decoder ignore source information and use only side information for distortion P,; and to time-share the two schemes for intermediate values of distortion. It is an interesting open problem to characterize the class of correlated sources for which the optimum performance is obtained by time-sharing strictly source information with strictly side information. In general, there exist correlated sources for which the optimum coding-decoding scheme is not a time-sharing scheme; for example, this is true when the source has p(xl y) = 1 for some x,y.