摘要(英) |
In wireline communications, due to the fact that the twisted pair at the transmission end may be too close to each other when transmitting data, other lines may be inductively or capacitively coupled, causing other lines to couple current and voltage signals, resulting in crosstalk interference. phenomenon ( crosstalk ), There are four pairs of twisted pairs in the network transmission line, so the four pairs of lines will interfere with each other, affecting the integrity of the received signal, showing the necessity of a near-end crosstalk canceller. This paper designs a near-end crosstalk canceller for Ethernet networks based on the IEEE 802.3 bz™-2016[1] standard to deal with the influence of crosstalk interference from other pairs of twisted pairs on the signal at the receiving end, and eliminate the wrong signal. The filter used in this paper for the crosstalk interference channel model is an infinite impulse response filter with a lower cost than the traditional finite impulse response filter. Because as the channel effect lengthens, the finite impulse response filter needs to be lengthened to achieve an acceptable crosstalk cancellation effect, so the number of required multipliers will also increase, resulting in an increase in the circuit cost. With increasing attention, an infinite impulse response filter will be the best solution in terms of performance and cost. The algorithm part refers to the method of the existing literature to find a suitable algorithm for implementation, and improves the algorithm part to improve the performance of the algorithm, so as to achieve a good crosstalk cancellation effect and eliminate the crosstalk in the transmission line at the transmitting end.
Regarding the hardware implementation, first the Verilog HDL description is employed and the related simulations ,are conducted, then verify the circuit function through SMIMS VeriEnterprise Xilinx FPGA, and finally verify the circuit function under the TSMC-40nm process through Design Compiler and IC Compiler. |
參考文獻 |
[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] N. J. Fiege, “Multirate digital signal processing: multirate systems, filter banks, wavelets”, 1994.
[3] J.J. Shynk, "Adaptive IIR filtering, " IEEE ASSP Magazine, vol. 6, no. 2, pp. 4-21, April. 1989.
[4] M. M. Eusuff, K. E. Lansey, and F. Pasha, “Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization,” Eng. Optimiz., vol. 38, no. 2, pp. 129–154, 2006.
[5] D. E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," 1989.
[6] S. Jaballah, K. Rouis, F. Ben Abdallah, and J. B. H. Tahar, ³An improved Shuffled Frog Leaping Algorithm with a fast search strategy for optimization problems,´ in IEEE 10th International Conference on Intelligent Computer Communication and Processing (ICCP), 2014, pp. 23±27.
[7] Jiménez-Galindo D, Casaseca-de-la-Higuera P, San-José-Revuelta LM (2019) A novel design method for digital FIR/IIR filters based on the shuffle frog-leaping algorithm. In: 2019 27th European signal processing conference (EUSIPCO), pp 1–5
[8] E. Elbeltagi, T. Hegazy, and D. Grierson, “A modified shuffled frogleaping optimization algorithm: applications to project management,” Structure and Infrastructure Engineering, vol. 3, no. 1, pp. 53–60, 2007.
[9] R. Ursem, “Diversity-guided evolutionary algorithms,” Parallel Problem Solving from Nature—PPSN VII, pp. 462–471, 2002.
[10] S. Singh, A. Ashok, T. R. Rawat, and M. Kumar, “Optimal IIR System Identification Using Flower Pollination Algorithm,” In: IEEE First International Conference on Power Electronics, Intelligent Control and Energy Systems, pp. 1-6, 2016.
[11] Y. Y. Chen, “Design and Integration of Equalizer, Echo Canceller and Timing Recovery Circuit for IEEE 802.3bp™-2016 Automotive Ethernet Transceiver”, Jan 2021.
[12] C. Y. Tsai, “Design of Adaptive Equalizer and Timing Recovery Circuit with Particle Swarm Optimization Algorithm,” Jun 2021. |