A modified system-based adaptive algorithm for a sparse reconfigurable photonic filter

Abstract

Adaptive algorithms can be an important component of a sparse reconfigurable adaptive filter (SRAF) for photonic switches. In this paper, we propose a modified systembased (MSB) algorithm that not only has good performance for white and non-white input signals, but also has a reduced computational complexity compared with conventional approaches such as the previous cross-correlation-based (CCB) and system-based (SB) algorithms. In order to improve the convergence rate of the system, the MSB algorithm separately updates each row or column of the switch weight matrix. We also consider a specific structure for the intermediate desired signals, and present a computer simulation example to demonstrate the performance of the proposed SRAF algorithm for a system identification application.

Sparse Reconfigurable Adaptive Filter with an Upgraded Connection Constraint Algorithm

“…In previous work [2], a cross-correlation-based (CCB) algorithm was investigated for selecting the specific switch connections and a system-based (SB) algorithm [8] which employs a system identification formulation was also be presented. The previous connection algorithm [9] based on sequentially choosing the maximum elements might not work well when the same values exist as computing the summation of the weight values.…”