Vol. 71
Latest Volume
All Volumes
PIERM 130 [2024] PIERM 129 [2024] PIERM 128 [2024] PIERM 127 [2024] PIERM 126 [2024] PIERM 125 [2024] PIERM 124 [2024] PIERM 123 [2024] PIERM 122 [2023] PIERM 121 [2023] PIERM 120 [2023] PIERM 119 [2023] PIERM 118 [2023] PIERM 117 [2023] PIERM 116 [2023] PIERM 115 [2023] PIERM 114 [2022] PIERM 113 [2022] PIERM 112 [2022] PIERM 111 [2022] PIERM 110 [2022] PIERM 109 [2022] PIERM 108 [2022] PIERM 107 [2022] PIERM 106 [2021] PIERM 105 [2021] PIERM 104 [2021] PIERM 103 [2021] PIERM 102 [2021] PIERM 101 [2021] PIERM 100 [2021] PIERM 99 [2021] PIERM 98 [2020] PIERM 97 [2020] PIERM 96 [2020] PIERM 95 [2020] PIERM 94 [2020] PIERM 93 [2020] PIERM 92 [2020] PIERM 91 [2020] PIERM 90 [2020] PIERM 89 [2020] PIERM 88 [2020] PIERM 87 [2019] PIERM 86 [2019] PIERM 85 [2019] PIERM 84 [2019] PIERM 83 [2019] PIERM 82 [2019] PIERM 81 [2019] PIERM 80 [2019] PIERM 79 [2019] PIERM 78 [2019] PIERM 77 [2019] PIERM 76 [2018] PIERM 75 [2018] PIERM 74 [2018] PIERM 73 [2018] PIERM 72 [2018] PIERM 71 [2018] PIERM 70 [2018] PIERM 69 [2018] PIERM 68 [2018] PIERM 67 [2018] PIERM 66 [2018] PIERM 65 [2018] PIERM 64 [2018] PIERM 63 [2018] PIERM 62 [2017] PIERM 61 [2017] PIERM 60 [2017] PIERM 59 [2017] PIERM 58 [2017] PIERM 57 [2017] PIERM 56 [2017] PIERM 55 [2017] PIERM 54 [2017] PIERM 53 [2017] PIERM 52 [2016] PIERM 51 [2016] PIERM 50 [2016] PIERM 49 [2016] PIERM 48 [2016] PIERM 47 [2016] PIERM 46 [2016] PIERM 45 [2016] PIERM 44 [2015] PIERM 43 [2015] PIERM 42 [2015] PIERM 41 [2015] PIERM 40 [2014] PIERM 39 [2014] PIERM 38 [2014] PIERM 37 [2014] PIERM 36 [2014] PIERM 35 [2014] PIERM 34 [2014] PIERM 33 [2013] PIERM 32 [2013] PIERM 31 [2013] PIERM 30 [2013] PIERM 29 [2013] PIERM 28 [2013] PIERM 27 [2012] PIERM 26 [2012] PIERM 25 [2012] PIERM 24 [2012] PIERM 23 [2012] PIERM 22 [2012] PIERM 21 [2011] PIERM 20 [2011] PIERM 19 [2011] PIERM 18 [2011] PIERM 17 [2011] PIERM 16 [2011] PIERM 14 [2010] PIERM 13 [2010] PIERM 12 [2010] PIERM 11 [2010] PIERM 10 [2009] PIERM 9 [2009] PIERM 8 [2009] PIERM 7 [2009] PIERM 6 [2009] PIERM 5 [2008] PIERM 4 [2008] PIERM 3 [2008] PIERM 2 [2008] PIERM 1 [2008]
2018-07-24
Interference Suppression Algorithm Based on Analog Circuits Combined with Transform Algorithm in ELF Communication
By
Progress In Electromagnetics Research M, Vol. 71, 31-40, 2018
Abstract
In order to effectively improve the communication quality in the extremely-low frequency (ELF) communication, a whole model of analog circuits and transform domain algorithm is constructed. Analog circuits include a pair of magnetic antennas, an amplifier and a group of filters. The distributed capacitance of the magnetic antenna is effectively reduced by the segmented winding method. Analog circuits used to amplify and filter received signal are designed. Besides, a magnetic sensor with high sensitivity is produced. The Karhunen Loève transform (KLT) algorithm applied to the field of interference suppression is deduced in detail. The transform successfully passes the received signal along the basis vector in sub-band, but the interference signal along the vector is attenuated. Therefore, the problem of the optimal filter converted into the solution of transform factor for each sub-band. Then the relationship between the KLT transform and the time domain algorithm in the interference suppression problem is given. Based on the KLT algorithm, Fourier transform (FT) that makes the correlation matrices of the received signal diagonalized approximately is applied to the interference suppression algorithm. Based on the deduction results, the final optimal filter expressions are basically the same as the KLT algorithm. Finally, the experiments are carried out by using the simulated signal and real collected data in the laboratory, respectively. The schematic diagram of the real collected device is presented. The experimental result shows that, no matter the analog signal or the real collected data, the proposed algorithm can effectively suppress the interference. For the simulation, the performance of KLT algorithm is basically same as that of FT algorithm, but KLT algorithm is obviously better than FT algorithm for real collected data.
Citation
Chunteng Li, Yu-Zhong Jiang, Fang-Jun Liu, and Ting-Ting Jiang, "Interference Suppression Algorithm Based on Analog Circuits Combined with Transform Algorithm in ELF Communication," Progress In Electromagnetics Research M, Vol. 71, 31-40, 2018.
doi:10.2528/PIERM18042701
References

1. Ying, W., Y. Jiang, and Y. Liu, "A blind detector for Rayleigh flat-fading channels with non-Gaussian interference via the particle learning algorithm," AEU-International Journal of Electronics and Communications, Vol. 67, No. 12, 1068-1071, 2013.
doi:10.1016/j.aeue.2013.06.009

2. Yan, B., W. Zhu, L. Liu, et al. "An optimization method for induction magnetometer of 0.1 mHz to 1 kHz," IEEE Trans. Magn., Vol. 94, No. 10, 5294-5300, 2013.
doi:10.1109/TMAG.2013.2264821

3. Coillot, C., J. Moutoussamy, M. Boda, et al. "New ferromagnetic core shapes for induction sensors," J. Sensors Sensor Syst., Vol. 3, 1-8, 2014.

4. Shao, Y., D. Cheng, and Y. Wang, "Research on high sensitivity inductive magnetic sensor," Chinese Journal of Scientific Instrucment, Vol. 33, No. 2, 345-355, 2012.

5. Van Veen, B. and K. Buckley, "Beamforming: A versatile approach to spatial filtering," IEEE ASSP Mag., Vol. 5, No. 2, 4-24, 1988.
doi:10.1109/53.665

6. Li, P. and K. B. Letaief, "A blind RAKE receiver with robust multiuser interference cancelation for DS/CDMA communications," IEEE Transactions on Communications, Vol. 55, No. 9, 1793-1801, 2009.
doi:10.1109/TCOMM.2007.904404

7. Masmoudi, A. and T. Le-Ngoc, "Channel estimation and self-interference cancelation in full-duplex communication systems," IEEE Transactions on Vehicular Technology, Vol. 66, No. 1, 321-334, 2017.
doi:10.1109/TVT.2016.2540538

8. Jamali, V., A. Ahmadzadeh, and R. Schober, "On the design of matched filters for molecule counting receivers," IEEE Communications Letters, Vol. 21, No. 8, 1711-1714, 2017.
doi:10.1109/LCOMM.2017.2702178

9. Narkedamilly, L., V. P. Evani, and S. K. Samayamantula, "Discrete multiwavelet-based video watermarking scheme using SURF," ETRI Journal, Vol. 37, No. 3, 595-605, 2015.
doi:10.4218/etrij.15.0114.0012

10. Doclo, S. and M. Moonen, "GSVD-based optimal filtering for single and multimicrophone speech enhancement," IEEE Transactions on Signal Processing, Vol. 50, No. 9, 2230-2244, 2002.
doi:10.1109/TSP.2002.801937

11. Kittler, J. and P. C. Young, "A new approach to feature selection based on the Karhunen-Loeve expansion," Pattern Recognition, Vol. 5, No. 4, 335-352, 1973.
doi:10.1016/0031-3203(73)90025-3

12. Chen, J., J. Benesty, and Y. Huang, "Study of the noise-reduction problem in the Karhunen-Loève expansion domain," IEEE Transactions on Audio, Speech, and Language Processing, Vol. 17, No. 4, 787-802, 2009.
doi:10.1109/TASL.2009.2014793

13. Abbas, S. A., Q. Sun, and H. Foroosh, "An exact and fast computation of discrete fourier transform for polar and spherical grid," IEEE Transactions on Signal Processing, Vol. 65, No. 8, 2033-2048, 2017.
doi:10.1109/TSP.2016.2645510