B. J. Falkowski

发表

Efficient algorithm to calculate Reed-Muller expansions over GF(4)

S. Rahardja, B. J. Falkowski, 2001 .

FFT and decision diagrams based methods for calculation of spectral transforms

Radomir S. Stankovic, B. J. Falkowski, R. Stankovic, 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

One more way to calculate generalized Reed-Muller expansions of boolean functions

Marek Perkowski, B. J. Falkowski, 1991 .

Transformation kernels and algorithms for the generation of forward and inverse Hadamard ordered multi-polarity generalized Walsh transforms

B. J. Falkowski, B. Falkowski, 1994, Proceedings of 1994 37th Midwest Symposium on Circuits and Systems.

Algorithm for the generation of disjoint cubes for completely and incompletely specified boolean functions

Marek Perkowski, B. J. Falkowski, B. Falkowski, 1991 .

Mutual conversions between generalised arithmetic expansions and free binary decision diagrams

Chip-Hong Chang, B. J. Falkowski, Chip-Hong Chang, 1998 .

Hybrid multi-polarity arithmetic-Walsh transform

Shixing Yan, B. J. Falkowski, B. Falkowski, 2006 .

Family of generalised multi-polarity complex Hadamard transforms

B. J. Falkowski, B. Falkowski, 1998 .

A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions

Marek Perkowski, I. Schafer, B. J. Falkowski, 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

Essential relations between classical and spectral approaches to analysis, synthesis, and testing of completely and incompletely specified Boolean functions

Marek Perkowski, B. J. Falkowski, M. Perkowski, 1990, IEEE International Symposium on Circuits and Systems.

A fast computer implementation of adding and arithmetic multi-polarity transforms for logic design

Marek Perkowski, I. Schafer, B. J. Falkowski, 1991, [1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems.

On the calculation of generalized Reed-Muller canonical expansions from disjoint cube representation of Boolean functions

Marek Perkowski, B. J. Falkowski, M. Perkowski, 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

Family of Ternary Arithmetic Polynomial Expansions Based on New Transforms

Cheng Fu, B. J. Falkowski, 2004 .

Properties and methods of calculating generalised arithmetic and adding transforms

Chip-Hong Chang, B. J. Falkowski, Chip-Hong Chang, 1997 .

Polynomial representation of spectral coefficients

B. J. Falkowski, 1993 .

Properties of Boolean functions in spectral domain of sign Haar transform

Susanto Rahardja, B. J. Falkowski, S. Rahardja, 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

One more way to calculate the Hadamard-Walsh spectrum for completely and incompletely specified boolean functions

Marek Perkowski, B. J. Falkowski, B. Falkowski, 1990 .

Properties and ways of calculation of multi-polarity generalized Walsh transforms

B. J. Falkowski, B. Falkowski, 1994 .

Recursive relationships, fast transforms, generalisations and VLSI iterative architecture for Gray code ordered Walsh functions

B. J. Falkowski, 1995 .

A family of all essential Radix-2 addition/subtraction multi-polarity transforms: algorithms and interpretations in Boolean domain

Marek Perkowski, B. J. Falkowski, B. Falkowski, 1990, IEEE International Symposium on Circuits and Systems.

Logical manipulations and design of tributary networks in the arithmetic spectral domain

Chip-Hong Chang, B. J. Falkowski, 1998 .

Algorithm and architecture for Gray code ordered fast Walsh transform

Marek Perkowski, B. J. Falkowski, B. Falkowski, 1990, IEEE International Symposium on Circuits and Systems.