On Moments and Walsh Characteristic Functions

This correspondence treats the derivation of natural moments from their corresponding Walsh characteristic function via the dyadic derivative operator. The derivation of a result concerning Walsh transforms of dyadic derivatives of functions is also considered. However, some established ideas such as Walsh transform, dyadic stationarity, and dyadic correlation are introduced first.     

并元序列研究

对并元码偶作出进一步研究,首先提出了一类新的区组设计——并元加集偶的概念,研究了并元加集偶的一些特性。然后给出了并元加集偶与并元码偶的等价关系,应用这一等价关系给出了并元码偶存在的必要条件,也为并元加集偶的构造提供了理论依据。最后还研究了并元码偶的Walsh谱特性和重量分布特性。通过这些问题的研究,展示了Walsh变换新的应用。这些存在条件在这类码的理论研究和计算机搜索中有重要的作用。     

Short-time spectral and autocorrelation analysis in the Walsh domain

A short-time dyadic autocorrelation function (dacf) and a short-time Walsh energy spectrum of the first kind are defined in the Walsh-Fourier domain. The "natural" choice of the short-time functions does not lead to a Walsh-Fourier transform pair (dyadic Wiener-Khintchine theorem), and thus a second kind of short-time dacf and short-time Walsh energy spectrum are defined as the Walsh-Fourier transforms of the first kind. This leads to a meaningful and convenient Walsh transform pair between the first short-time Walsh energy spectrum and the second short-time dacf. The measurement procedures for both kinds of functions are discussed, and the mean values of these short-time functions are shown to be related to the corresponding long-time functions.     

Walsh Functions and Gray Code

Gray code is a natural way of ordering binary vectors in dyadic space, hence it appears frequently in connetion with Walsh functions. In Paley's definition of Walsh functions their sequencies are arranged in Gray code. Gray code also appears in a new Walsh function generation algorithm which obtains a function by locating all its sign changes. There are certain computational advantages in using Gray code rather than sequency ordering. Examples in fast Walsh transform, dyadic convolution and digital filtering are given. Methods of Gray code to binary conversion are discussed.     

Walsh-Transform Analysis of Discrete Dyadic-Invariant Systems

This short paper shows how the sampled output of a dyadic-invariant linear system with a given sequency-domain transfer function, in response to a sampled input, can be determined by 1) a term-wise multiplication of the sampled transfer function and the discrete Walsh transform of the sampled input function, followed by an inverse Walsh transform, or 2) a discrete dyadic convolution of the sampled impulse response and the sampled input directly in the time domain. Functions in both time and sequency domains are represented by column matrices, and discrete Walsh transformation is effected simply by the multiplication with a Walsh matrix. An example is included to illustrate both procedures. The validity of the solutions is further verified by showing that the governing dyadic differential equation of the system is satisfied.     

On Walsh differentiable dyadically stationary random processes

Some basic properties of dyadically stationary (DS) processes are introduced, including continuity and spectral representation. A sampling theorem based on the Walsh functions is investigated for random signals that are not necessarily sequency-limited. By using the concept of a dyadic derivative, the resulting aliasing error is calculated together with the speed of convergence. An example gives a glimpse into the possibilities of applying the sampling theorem as well as the dyadic derivative.     

Comparison of Walsh and Fourier spectroscopy of geomagneticreversals and nonsinusoidal palaeoclimatic time series

Higher resolving capabilities and theoretical appropriateness of Walsh spectral techniques as compared to Fourier spectral analyses are presented for synthetic and nonsinusoidal geotime series. Theoretical developments of Walsh transform techniques and a comparative study of Walsh and Fourier spectral estimates are presented. The Walsh spectral technique is applied specifically to two actual time series data of geomagnetic reversals in binary telegraphic wave form and nonsinusoidal palaeomagnetic and palaeoclimate time series. Walsh spectra reveal periodicities in Milankovitch frequency bands and provide exceptionally well-resolved spectral lines. The possible physical significance of these orbital periodicities is discussed. A comparative example of autocorrelation analysis in the real time domain and dyadic time domain is also presented using a telegraphic signal model of actual geomagnetic reversal time series. and the result is briefly discussed. The computational efficiency of the Walsh function could be exploited further for many other binary and nonsinusoidal geophysical/geological time series     

Research on perfect dyadic binary sequence pair

In this paper, the perfect dyadic binary sequence pair with one-value dyadic correlation functions is presented. That is, the perfect dyadic binary sequence pair is a perfect discrete signal, for its dyadic relative function is δ-function. The transformation features and some existing admissibility conditions of perfect dyadic binary sequence pair are discussed, and the properties for this kind of code in Walsh transformation spectrum and weight spectrum are also analyzed. From above, It is found that the perfect dyadic binary sequence pair can easily differentiate from its dyadic shifting. So these good signals can used in engineering as synchronization code, multi-user code and so on.     

Design of a Walsh Function Generator

To develop a sequency-division multiplex system for telemetry at the Beijing Institute of Aeronautics and Astronautics, it was necessary to design a Walsh function generator that produces ?almost pure? Walsh functions, just as a generator for almost pure sinusoidal functions is needed for frequency-division multiplex system. In this paper, a symbol function s(n, t) is discussed, and the dyadic increment d(k, t) of the Gray code is defined. The relation between s(n, t) and d(h, t) is deduced. A method for the design of a Walsh function generator based on the symbol function s(n, t) is presented. This method has been used to design a Walsh function generator with order number up to n = 64.     

Walsh Spectrum Measurement in Natural, Dyadic, and Sequency Ordering

Walsh spectra may have natural, dyadic, or sequency ordering. This paper describes an improved processor design to provide spectra in any selected ordering. The incoming data are stored either directly or in a permuted sequence, and then are followed by a fast Walsh-Hadamard transform. For sequency ordering, the permutation operation is that of a Gray-to- binary code conversion, followed by bit reversal. For dyadic ordering, the operation is only a bit reversal. First a Hadamard processor that uses long shift registers is described. It is adapted to yield coefficients in either of the other two orderings by way of the permuting module (PM).     

Iterated filter banks with rational rate changes connection withdiscrete wavelet transforms

Some properties of two-band filter banks with rational rate changes (“rational filter banks”) are first reviewed. Focusing then on iterated rational filter banks, compactly supported limit functions are obtained, in the same manner as previously done for dyadic schemes, allowing a characterization of such filter banks. These functions are carefully studied and the properties they share with the dyadic case are highlighted. They are experimentally observed to verify a “shift property” (strictly verified in the dyadic ease) up to an error which can be made arbitrarily small when their regularity increases. In this case, the high-pass outputs of an iterated filter bank can be very close to samples of a discrete wavelet transform with the same rational dilation factor. Straightforward extension of the formalism of multiresolution analysis is also made. Finally, it is shown that if one is ready to put up with the loss of the shift property, rational iterated filter banks can be used in the same manner as if they were dyadic filter banks, with the advantage that rational dilation factors can be chosen closer to 1     

基于Walsh变换的GPS C/A码快速捕获算法

根据m序列的相移组合多项式,给出Walsh序列与m序列行对应关系的计算方法.利用Walsh序列与Gold序列的映射关系,提出利用移位相加电路减小矩阵运算量的方法,解决Gold序列的快速相关运算问题.采用连续帧相关的方法,消除导航信号符号跳变对相关运算的影响,同时,针对GPS卫星码字的特点,提出了一种多星捕获方法,利用第...     

Quasi-cyclic dyadic codes in the Walsh-Hadamard transform domain

A code is s-quasi-cyclic (s-QC) if there is an integer s such that cyclic shift of a codeword by s-positions is also a codeword. For s = 1, cyclic codes are obtained. A dyadic code is a code which is closed under all dyadic shifts. An s-QC dyadic (s-QCD) code is one which is both s-QC and dyadic. QCD codes with s = 1 give codes that are cyclic and dyadic (CD). We obtain a simple characterization of all QCD codes (hence of CD codes) over any field of odd characteristic using Walsh-Hadamard transform defined over that finite field. Also, it is shown that dual a code of an s-QCD code is also an s-QCD code and s-QCD codes for a given dimension are enumerated for all possible values of s.     

Introduction to Bridge Functions

In this paper, a bridge function system is introduced, where bridge functions make up a three-valued function system, only taking the values +1, -1, and 0, and they are orthogonal. It is constructed with the concepts of sequence shift and sequence copying. The notation, waveforms, and recursive relation of the bridge functions are given. Walsh functions are a special case of the bridge functions. Block pulses are another special case. The bridge functions connect the Walsh functions and the block pulse functions. The bridge functions have the property of modulo 2 sum.     

基于二进小波直方图的纹理图像检索

为了进一步提高小波直方图的检索性能，提出了一种二进小波直方图算法。该算法根据二进小波的特点，从能量角度出发．通过子带组合，0／1量化等运算生成二进小波直方图。与单小波直方图相比，二进小波利用模局部极大值来提取图像的多尺度边缘信息并具有时移不变的特性。因此二进小波直方图具有特征提取快和检索精度高等特点．纹理图像检索的对比实验结果表明二进小波直方图的检索精度比单小波直方图提高了12％。     

Group Codes and Walsh Functions

The set of Walsh functions, wal(j,?), is the character group of the dyadic group. For O?j?2k it is shown that they may also be derived from the character table of the abstract Abelian group Ck generated by k elements of order two. The method uses Slepians modular representation table[3] to compute the 2k irreducible representations (each of degree one) of Ck. The character table, K, is a 2kx2k square array of +1's and -l's and, considered as a matrix, the orthogonality relationships for characters show that K has the Hadamard property, [K][K]T = 2K [I]. In fact, for the proper ordering of the group elements in the construction of the modular representation table it is the Hadamard matrix, the entries of whose ith row take on the values of the Walsh function wal (i,?) in each of ?/2k subintervals. In a similar way other permutations of the modular representation table define different functions taking on the values +l, -l, also orthogonal and in a one to one relationship to the Walsh functions. Since an n place binary group code with k information places is isomorphic to Ck,[3] each code can thus be used to generate real functions orthogonal over a given interval or period ?. In the special case of cyclic codes where the elements of the code interpreted as polynomials form an ideal in a polynomial ring of characteristic two, the group operation used in deriving the character table is of course, addition.     

Phaselets of framelets

Phaselets are a set of dyadic wavelets that are related in a particular way such that the associated redundant wavelet transform is nearly shift-invariant. Framelets are a set of functions that generalize the notion of a single dyadic wavelet in the sense that dyadic dilates and translates of these functions form a frame in L/sup 2/(IR). This paper generalizes the notion of phaselets to framelets. Sets of framelets that only differ in their Fourier transform phase are constructed such that the resulting redundant wavelet transform is approximately shift invariant. Explicit constructions of phaselets are given for frames with two and three framelet generators. The results in this paper generalize the construction of Hilbert transform pairs of framelets.     

Ordering of Walsh Functions

The construction of Walsh functions is derived by means of the concepts of "symmetric copy" and "shift copy." Recursive relations based on the Kronecker product of matrices are also deduced from these concepts. There is a fourth useful ordering of the Walsh functions, called here X-ordering, in addition to the three known orderings usually referred to as Walsh-, Paley-, and Hadamardordering. An X-ordering function has the following features: lower order numbers of X-ordering correspond to even functions; higher order numbers of X-ordering correspond to odd functions; even order numbers of X-ordering correspond to lower sequencies; odd number of X-ordering correspond to higher sequencies. Finally, relations between the four orderings are given.     

广义沃尔什函数复制理论及其应用

本文在进一步探讨广义沃尔什函数构造特点的基础上，提出了广义沃尔什函数的复制理论。然后利用复制理论导出了不同编序广义沃尔什函数用广义拉德梅克函数连乘表示的统一定义式，最后，将广义沃尔什函数的复制生成方式与方块脉冲函数的移位方式相结合，构造了一类更为广泛的多值正交函数系，称之为广义桥函数，广义沃尔什函数、沃特利函数等都是它的一个子集。     

天波超视距雷达海杂波模型修正与特性分析

因受电离层调制影响,传统的高频海杂波模型难以全面描述天波超视距雷达海杂波的空域非均匀性和时域非平稳性。该文首先基于传统的Walsh 高频海杂波模型分析了洋流的影响,提出电离层子反射面模型的概念,揭示了相干处理间隔内电离层对高频信号频谱的调制机理;然后通过建立电离层等效反射面,并将其分解为多个子反射面的方式,给出可以综合反映不同海态、不同电离层状态的天波超视距雷达海杂波修正模型。最后结合数学描述,利用该文修正模型反演分析了由电离层的空域非均匀、时域非平稳引起的典型高频海杂波多普勒偏移、展宽、分裂和多径复杂现象的实测数据多普勒谱,仿真与实测数据多普勒谱验证了所提修正模型的准确性与鲁棒性。