Outputs (36)

CFAR Adaptive PN Code acquisition for DSSS Systems (2008)
Journal Article
Wei, B., Sharif, M., Binnie, D., & Almaini, A. E. A. (2008). CFAR Adaptive PN Code acquisition for DSSS Systems. The Mediterranean journal of electronics and communications, 4, 37-45

Constant false alarm rate (CFAR) techniques can be used in Pseudo-Noise (PN) code acquisition in Spread Spectrum (SS) communication systems, and all the CFAR techniques perform well in homogeneous background PN code acquisition. However, in non-homog... Read More about CFAR Adaptive PN Code acquisition for DSSS Systems.

Efficient bidirectional conversion between RM and DFRM expansions (2008)
Journal Article
Xu, H., Yang, M., & Almaini, A. E. A. (2008). Efficient bidirectional conversion between RM and DFRM expansions. The Mediterranean journal of electronics and communications, 4, 84-89

A number of different representations of the Boolean function are used in order to find a good circuit representation in terms of area, speed and power performance. In this paper, an effective decomposition method is proposed for the bidirectional tr... Read More about Efficient bidirectional conversion between RM and DFRM expansions.

Techniques for dual forms of Reed-Muller expansion conversion. (2008)
Journal Article
Yang, M., Wang, L. Y., Tong, J. R., & Almaini, A. E. A. (2008). Techniques for dual forms of Reed-Muller expansion conversion. Integration, the VSLI Journal, 41, 113-122. https://doi.org/10.1016/j.vlsi.2007.02.001

Dual forms of Reed-Muller (DFRM) are implemented in OR/XNOR forms, which are based on the features of coincidence operation. Map folding and transformation techniques are proposed for the conversion between Boolean and DFRM expansions. However, map t... Read More about Techniques for dual forms of Reed-Muller expansion conversion..

Exact minimization of large fixed polarity dual form of reed-muller functions (2007)
Journal Article
Yang, M., Xu, H., Wang, L. Y., Tong, J. R., & Almaini, A. E. A. (2007). Exact minimization of large fixed polarity dual form of reed-muller functions. Solid-State and Integrated Circuit Technology, 1931-1933. https://doi.org/10.1109/ICSICT.2006.306532

Dual form of Reed-Muller (DFRM) expansions are implemented in OX/XNOR logic, which are based on the features of coincidence operation and are known as fixed polarity Canonical OR-Coincidence (COC) expansions. An efficient minimization method is propo... Read More about Exact minimization of large fixed polarity dual form of reed-muller functions.

An efficient transformation method for DFRM expansions. (2007)
Conference Proceeding
Xu, H., Yang, M., Wang, L. Y., Tong, J. R., & Almaini, A. E. A. (2007). An efficient transformation method for DFRM expansions. In 7th International Conference on ASIC, 2007. ASICON '07 (1158-1161). https://doi.org/10.1109/ICASIC.2007.4415839

Dual Form of Reed-Muller (DFRM) expansions with fixed poarity are derived from Reed-Muller (RM) expansions by using the operation of Kronecker matrix products. An efficient decomposition method is proposed based on the formulation. The method can be... Read More about An efficient transformation method for DFRM expansions..

Adaptive PN code acquisition in multi-path spread spectrum communications using FPGA. (2007)
Conference Proceeding
Wei, B., Sharif, M., Binnie, D., & Almaini, A. E. A. (2007). Adaptive PN code acquisition in multi-path spread spectrum communications using FPGA. In Proceedings of the 13th International Symposium on Signals, Circuits and Systems (573-576)

Performance of two pseudonoise (PN) code detectors was tested. Cell averaging (CA) and order Statistics (OS) constant false alarm rates (CFAR) were analysed against mean acquisition time (MAT) and against the probability of detection (Pd). Both detec... Read More about Adaptive PN code acquisition in multi-path spread spectrum communications using FPGA..

Optimal expression for fixed polarity dual Reed-Muller forms. (2007)
Journal Article
Faraj, K., & Almaini, A. E. A. (2007). Optimal expression for fixed polarity dual Reed-Muller forms. WSEAS Transactions on Circuits and Systems, 6, 364-371

An algorithm for converting between products of sum (POS) and fixed polarity dual Reed-Muller (FPDRM) is proposed in this paper. This algorithm is used to compute the coefficients of POS from FPDRM directly from the truth table of POS. This algorithm... Read More about Optimal expression for fixed polarity dual Reed-Muller forms..

Decision diagrams using 2 variable nodes. (2007)
Journal Article
Oh, P., & Almaini, A. E. A. (2007). Decision diagrams using 2 variable nodes. WSEAS Transactions on Circuits and Systems, 6, 372-379

This paper outlines two variations of Decision Digrams, the 2VBDD and 2VRMBDD. It outlines the background for BDD and RMBDD expanded with respect to one variable and the new 2V(RM)BDD when the expansion is with respect to two variables. Examples are... Read More about Decision diagrams using 2 variable nodes..

Minimization of dual Reed-Muller forms using dual property. (2007)
Journal Article
Faraj, K., & Almaini, A. E. A. (2007). Minimization of dual Reed-Muller forms using dual property. WSEAS Transactions on Circuits and Systems, 6, 9-15

We present two algorithms in this paper: the first is used to convert between Product of Sums (POS) and Positive Polarity Dual Reed-Muller (PPDRM) forms; while the second algorithm generates all the polarity sets from any polarity set for a single ou... Read More about Minimization of dual Reed-Muller forms using dual property..

Fast conversion for large Canonical OR-coincidence functions. (2006)
Journal Article
Yang, M., Wang, L. Y., & Almaini, A. E. A. (2006). Fast conversion for large Canonical OR-coincidence functions. Circuits and Systems, 1643-1646. https://doi.org/10.1109/APCCAS.2006.342080

Fixed Polarity Canonical OR-coincidence (COC) expansions based on inclusive-OR and OR operations are dual forms of fixed polarity Reed-Muller expansions. Traditionally, they are obtained from maxterms of Canonical Products-of-sum (CPOS) expansions. T... Read More about Fast conversion for large Canonical OR-coincidence functions..