Results 211 to 220 of about 1,786 (232)

Multi-polarity helix transform over GF(3)

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512), 2004
In this paper, the multi-polarity helix transform for ternary logic functions has been introduced. In addition, an extended dual polarity property that had been used to optimize Kronecker and quaternary fixed-polarity Reed-Muller (FPRM) expressions has been applied to calculate efficiently this new multi-polarity helix transform over GF(3).
null Cheng Fu, B.J. Falkowski
openaire   +1 more source

Self-Dual Codes over ${\text{GF}}( 3 )$

SIAM Journal on Applied Mathematics, 1976
This paper studies self-dual and maximal self-orthogonal codes over ${\text{GF}}( 3 )$. First, a number of Gleason-type theorems are given, describing the weight enumerators of such codes. Second, a table of all such codes of length $\leqq 12$ is constructed.
C. L. Mallows, V. Pless, N. J. A. Sloane
openaire   +1 more source

Marine targets detection using GF-3 SAR data

2017 IEEE International Geoscience and Remote Sensing Symposium (IGARSS), 2017
In this letter, we present a business process flow of marine target detection using GF-3 SAR data. It includes 12 kinds of imaging modes and 3 types of polarization. The detection method for the single polarization data is a Double-Parameter Constant False Alarm Ratio (DP-CFAR) algorithm.
Peng Chen, Jingsong Yang, Juan Wang
openaire   +1 more source

Fastest linearly independent arithmetic transforms over GF(3)

2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)., 2003
In this paper, the family of fastest ternary linearly independent arithmetic transforms, which possesses forward and inverse butterfly diagrams with lowest computational complexity have been identified. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices.
B.J. Falkowski, null Cheng Fu
openaire   +1 more source

Family of fast transforms over GF(3) logic

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings., 2004
New classes of recursive transforms over GF(3) have been introduced here. They are based on simple recursive equations what allows to obtain corresponding fast forward and inverse transforms and very regular butterfly diagrams. The classification is further extended into various transforms with horizontal and vertical permutations.
B.J. Falkowski, null Cheng Fu
openaire   +1 more source

SAR Tomographic Imaging Demonstration Using GF-3 Data

IGARSS 2019 - 2019 IEEE International Geoscience and Remote Sensing Symposium, 2019
Synthetic aperture radar (SAR) tomography (TomoSAR) is well established for three-dimensional (3D) reconstruction in urban buildings. There are many methods usually require a large data stacks for a reliable reconstruction and very few methods to handle small data stacks.
Hongliang Lu, Yunkai Deng, Heng Zhang, Weidong Yu, Robert Wang   +4 more
openaire   +1 more source

Kronecker based fixed polarity transforms over GF(3)

The 2004 IEEE Asia-Pacific Conference on Circuits and Systems, 2004. Proceedings., 2005
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams.
null Cheng Fu, B.J. Falkowski
openaire   +1 more source

Codesign of a Computationally Intensive Problem in GF(3)

18th IEEE/IFIP International Workshop on Rapid System Prototyping (RSP '07), 2007
A reprogrammable hardware platform is used for the co-design and implementation of a computational intensive mathematical problem, namely the listing of irreducible polynomials over Galois fields of order 3 (GF(3)), The main goal is to accelerate the performance compared to an existing software implementation.
Kenneth B. Kent, Beatriz C. Iaderoza, Micaela Serra   +2 more
openaire   +1 more source

Polynomial expansions over GF(3)based on fastest transformation

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings., 2004
A new fastest Linearly Independent (LI) transforms over GF(3) and its corresponding polynomial expansions have been introduced. The number of required additions and multiplications in new LI transform is advantageous when compared with ternary Reed-Muller transform, which was previously known as the most efficient transform over GF(3).
B.J. Falkowski, null Cheng Fu
openaire   +1 more source

Flag transitive planes of dimension four over GF(3)

Journal of Geometry, 1988
The authors construct flag transitive affine planes of order 81 with kernel GF(3). The methods are similar to those used by the authors to construct other examples of flag transitive affine planes. A more general paper [``A class of d-dimensional flag transitive planes''] by the same authors is due to appear in the same journal.
Narayana Rao, M. L., Kuppuswamy Rao, K., Durgaprasad, K. V.   +2 more
openaire   +1 more source