### Abstract

A method is presented for factorizing two-dimensional polynomials, with the aim of designing 2-D IIR filters in cascade form. A specialized neural network structure is employed which is a variation of a two-layer sigma-pi neural network paradigm. By training the network to emulate a given polynomial, the lower-order factor polynomials are generated whose coefficients are represented by the network's weights. While the simple learning rule based on gradient descent sometimes fails to give satisfactory results, a new modified learning rule is proposed which is based on constrained optimization techniques. The proposed method achieves minimization of the usual mean-square error criterion along with a simultaneous satisfaction of constraints between the coefficients of the given polynomial and the coefficients of the desired factor polynomials. Using this approach, suitably augmented by weight elimination techniques, we are able to obtain exact solutions for factorable polynomials and excellent approximate solutions for non-factorable polynomials. Simulations are presented to illustrate the good performance and efficiency of the proposed method.

Original language | English |
---|---|

Pages | 1276-1280 |

Number of pages | 5 |

State | Published - 1 Dec 1997 |

Event | Proceedings of the 1997 IEEE International Symposium on Industrial Electronics, ISIE. Part 3 (of 3) - Guimaraes, Portugal Duration: 7 Jul 1997 → 11 Jul 1997 |

### Other

Other | Proceedings of the 1997 IEEE International Symposium on Industrial Electronics, ISIE. Part 3 (of 3) |
---|---|

City | Guimaraes, Portugal |

Period | 7/07/97 → 11/07/97 |

### Fingerprint

### Cite this

*Factorization of 2-D polynomials using neural networks and constrained learning techniques*. 1276-1280. Paper presented at Proceedings of the 1997 IEEE International Symposium on Industrial Electronics, ISIE. Part 3 (of 3), Guimaraes, Portugal, .

}

**Factorization of 2-D polynomials using neural networks and constrained learning techniques.** / Perantonis, S. J.; Ampazis, N.; Varoufakis, S. J.; Antoniou, George.

Research output: Contribution to conference › Paper

TY - CONF

T1 - Factorization of 2-D polynomials using neural networks and constrained learning techniques

AU - Perantonis, S. J.

AU - Ampazis, N.

AU - Varoufakis, S. J.

AU - Antoniou, George

PY - 1997/12/1

Y1 - 1997/12/1

N2 - A method is presented for factorizing two-dimensional polynomials, with the aim of designing 2-D IIR filters in cascade form. A specialized neural network structure is employed which is a variation of a two-layer sigma-pi neural network paradigm. By training the network to emulate a given polynomial, the lower-order factor polynomials are generated whose coefficients are represented by the network's weights. While the simple learning rule based on gradient descent sometimes fails to give satisfactory results, a new modified learning rule is proposed which is based on constrained optimization techniques. The proposed method achieves minimization of the usual mean-square error criterion along with a simultaneous satisfaction of constraints between the coefficients of the given polynomial and the coefficients of the desired factor polynomials. Using this approach, suitably augmented by weight elimination techniques, we are able to obtain exact solutions for factorable polynomials and excellent approximate solutions for non-factorable polynomials. Simulations are presented to illustrate the good performance and efficiency of the proposed method.

AB - A method is presented for factorizing two-dimensional polynomials, with the aim of designing 2-D IIR filters in cascade form. A specialized neural network structure is employed which is a variation of a two-layer sigma-pi neural network paradigm. By training the network to emulate a given polynomial, the lower-order factor polynomials are generated whose coefficients are represented by the network's weights. While the simple learning rule based on gradient descent sometimes fails to give satisfactory results, a new modified learning rule is proposed which is based on constrained optimization techniques. The proposed method achieves minimization of the usual mean-square error criterion along with a simultaneous satisfaction of constraints between the coefficients of the given polynomial and the coefficients of the desired factor polynomials. Using this approach, suitably augmented by weight elimination techniques, we are able to obtain exact solutions for factorable polynomials and excellent approximate solutions for non-factorable polynomials. Simulations are presented to illustrate the good performance and efficiency of the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=0031373368&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0031373368

SP - 1276

EP - 1280

ER -