很高效的判断组合数C(n,k)的奇偶性。 巧妙的使用了位运算。时间复杂度为O(1). 避免使用大数类。-Very efficient to determine the number of combinations C (n, k) parity. Clever use of digital computing. Time complexity is O (1). To avoid the use of large numbers type.

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the bes