摘要(英) |
This paper designs a near-end crosstalk canceller according to the IEEE 802.3bz™-2016 specification standard [1]. Near-end crosstalk (NEXT) can be suppressed in twisted pair, but it has influence on different pairs of twisted pair. In high-speed circuits, there is a higher requirement for signal quality, so near-end crosstalk needs to be solved. Generally, the adaptive filter used in the near-end crosstalk canceller is the finite impulse response filter (FIR filter), which has the characteristics of simple structure and easy algorithm. However, as the NEXT noise channel becomes longer, the order of the finite impulse response filter increases in order to match it, which increases the cost significantly.
In this paper, the infinite impulse response filter (IIR filter) is used to replace the finite impulse response filter. Using its impulse response properties, infinite impulse response filter can model channels with fewer orders. Adaptive infinite impulse response filter adopts an improved particle swarm optimization algorithm to overcome the problem of multiple local minima in the error plane, so that it can converge to the global minimum value and make the filter performance meet the specifications.
In hardware implementation, the circuit is written in Verilog and simulated with NC-Verilog, and the circuit function is verified through SMIMS VeriEnterprise Xilinx FPGA. Finally, Design Compiler and IC Compiler use TSMC 40 nm process to synthesize the circuit, and confirm that the operation speed and function meet the specifications. |
參考文獻 |
[1] IEEE Standard for Ethernet Amendment 7: Media Access Control Parameters, Physical Layers, and Management Parameters for 2.5 Gb/s and 5 Gb/s Operation, Types 2.5GBASE-T and 5GBASE-T.
[2] J. Kennedy and R. Eberhart, "Particle swarm optimization," Proceedings of ICNN′95 - International Conference on Neural Networks, 1995.
[3] N. J. Fiege, “Multirate digital signal processing: multirate systems, filter banks, wavelets”, 1994.
[4] J.J. Shynk, "Adaptive IIR filtering, " IEEE ASSP Magazine, vol. 6, no. 2, pp. 4-21, April. 1989.
[5] Zhi-Hui Zhan, Jun Zhang, Yun Li, Yu-Hui Shi, "Orthogonal Learning Particle Swarm Optimization, " IEEE Trans. Evol. comput., vol. 15, no. 6, pp. 832-847, Dec. 2011.
[6] K. Vaisakh, M. Sridhar and K. S. L. Murthy, "Adaptive PSO-DV Algorithm for Minimization of Power Loss and Voltage Instability," 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies, 2009, pp. 140-144.
[7] S. Das, A. Abraham, A. Konar, Particle swarm optimization and differential evolution algorithms: technical analysis, applications and hybridization perspectives, in: Ying Liu et al. (Eds.), Advances of Computational Intelligence in Industrial Systems, Studies in Computational Intelligence, Springer Verlag, Germany, 2008, pp. 1-38.
[8] Storn R., Price K., “Differential evolution: A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces,” Technical report,TR-95-012, International Computer Sciences Institute , 1995.
[9] Price K., “Differential Evolution vs. the functions of the ICEO,” Proceeding of 1997 IEEE International Conference on Evolutionary Computation, 1997.
[10] R. Ursem, “Diversity-Guided Evolutionary Algorithms,” Parallel Problem Solving from Nature — PPSN VII, pp. 462–471, 2002.
[11] S. Singh, A. Ashok, T. R. Rawat and M. Kumar, "Optimal IIR System Identification Using Flower Pollination Algorithm", IEEE First International Conference on Power Electronics Intelligent Control and Energy Systems, pp. 1-6, 2016.
[12] Y. Y. Chen, “Design and Integration of Equalizer, Echo Canceller and Timing Recovery Circuit for IEEE 802.3bp™-2016 Automotive Ethernet Transceiver,” Jan 2021.
[13] C. Y. Tsai, “Design of Adaptive Equalizer and Timing Recovery Circuit with Particle Swarm Optimization Algorithm,” Jun 2021. |