
The coal mine internet of things (IoT) communication system is used for real-time monitoring of mining production to ensure the safety and reliability of personnel and equipment in the mine. To eliminate multipath fading in the process of wireless communication in mines, multiple-output multiplexing (MIMO) and orthogonal frequency division multiplexing (OFDM) technologies are introduced. In this paper, a wireless communication system architecture of IoT in mining based on MIMO-OFDM is constructed. Aiming to solve the problems of intersymbol interference and frequency selective fading at the receiver, an improved minimum mean square error ordered successive interferences cancellation (MMSE-OSIC) signal detection algorithm is proposed. First, the signal-to-interference plus noise ratio of the received signal is calculated and the calculation results are sorted. The lowest signal-to-noise ratio is selected as the weakest signal layer. Then, the MMSE-OSIC algorithm is used to extract all of the signals, except the weakest layer. Finally, a maximum likelihood (ML) algorithm is used to traverse the whole signal domain; the signal symbol with the smallest distance from the weakest signal layer is found as the original signal of the weakest signal layer, and it is combined with the signal detected by MMSE-OSIC; then, the final signal detection result is obtained. The simulation results show that, compared with three benchmark algorithms, the proposed MMSE-OSIC algorithm has better signal detection performance under the conditions of different modulation methods and different channel numbers.
Citation: Jikun Guo, Qing Zhao, Lixuan Guo, Shize Guo, Gen Liang. An improved signal detection algorithm for a mining-purposed MIMO-OFDM IoT-based system[J]. Electronic Research Archive, 2023, 31(7): 3943-3962. doi: 10.3934/era.2023200
[1] | Guohui Zhang, Jinghe Sun, Xing Liu, Guodong Wang, Yangyang Yang . Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Mathematical Biosciences and Engineering, 2019, 16(3): 1334-1347. doi: 10.3934/mbe.2019065 |
[2] | Ruiping Yuan, Jiangtao Dou, Juntao Li, Wei Wang, Yingfan Jiang . Multi-robot task allocation in e-commerce RMFS based on deep reinforcement learning. Mathematical Biosciences and Engineering, 2023, 20(2): 1903-1918. doi: 10.3934/mbe.2023087 |
[3] | Shixuan Yao, Xiaochen Liu, Yinghui Zhang, Ze Cui . An approach to solving optimal control problems of nonlinear systems by introducing detail-reward mechanism in deep reinforcement learning. Mathematical Biosciences and Engineering, 2022, 19(9): 9258-9290. doi: 10.3934/mbe.2022430 |
[4] | Kongfu Hu, Lei Wang, Jingcao Cai, Long Cheng . An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem. Mathematical Biosciences and Engineering, 2023, 20(9): 17407-17427. doi: 10.3934/mbe.2023774 |
[5] | Jianguo Duan, Mengting Wang, Qinglei Zhang, Jiyun Qin . Distributed shop scheduling: A comprehensive review on classifications, models and algorithms. Mathematical Biosciences and Engineering, 2023, 20(8): 15265-15308. doi: 10.3934/mbe.2023683 |
[6] | Zilong Zhuang, Zhiyao Lu, Zizhao Huang, Chengliang Liu, Wei Qin . A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. Mathematical Biosciences and Engineering, 2019, 16(5): 4491-4505. doi: 10.3934/mbe.2019224 |
[7] | Shaofeng Yan, Guohui Zhang, Jinghe Sun, Wenqiang Zhang . An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints. Mathematical Biosciences and Engineering, 2023, 20(4): 7519-7547. doi: 10.3934/mbe.2023325 |
[8] | Zichen Wang, Xin Wang . Fault-tolerant control for nonlinear systems with a dead zone: Reinforcement learning approach. Mathematical Biosciences and Engineering, 2023, 20(4): 6334-6357. doi: 10.3934/mbe.2023274 |
[9] | Jin Zhang, Nan Ma, Zhixuan Wu, Cheng Wang, Yongqiang Yao . Intelligent control of self-driving vehicles based on adaptive sampling supervised actor-critic and human driving experience. Mathematical Biosciences and Engineering, 2024, 21(5): 6077-6096. doi: 10.3934/mbe.2024267 |
[10] | Lu-Wen Liao . A branch and bound algorithm for optimal television commercial scheduling. Mathematical Biosciences and Engineering, 2022, 19(5): 4933-4945. doi: 10.3934/mbe.2022231 |
The coal mine internet of things (IoT) communication system is used for real-time monitoring of mining production to ensure the safety and reliability of personnel and equipment in the mine. To eliminate multipath fading in the process of wireless communication in mines, multiple-output multiplexing (MIMO) and orthogonal frequency division multiplexing (OFDM) technologies are introduced. In this paper, a wireless communication system architecture of IoT in mining based on MIMO-OFDM is constructed. Aiming to solve the problems of intersymbol interference and frequency selective fading at the receiver, an improved minimum mean square error ordered successive interferences cancellation (MMSE-OSIC) signal detection algorithm is proposed. First, the signal-to-interference plus noise ratio of the received signal is calculated and the calculation results are sorted. The lowest signal-to-noise ratio is selected as the weakest signal layer. Then, the MMSE-OSIC algorithm is used to extract all of the signals, except the weakest layer. Finally, a maximum likelihood (ML) algorithm is used to traverse the whole signal domain; the signal symbol with the smallest distance from the weakest signal layer is found as the original signal of the weakest signal layer, and it is combined with the signal detected by MMSE-OSIC; then, the final signal detection result is obtained. The simulation results show that, compared with three benchmark algorithms, the proposed MMSE-OSIC algorithm has better signal detection performance under the conditions of different modulation methods and different channel numbers.
In this paper, we consider the following diffusion equation on
{−∇⋅(α∇u)=f,inΩ,u=0,on∂Ω. | (1) |
To approximate (1), taking advantage of the adaptive mesh refinement (AMR) to save valuable computational resources, the adaptive finite element method on quadtree mesh is among the most popular ones in the engineering and scientific computing community [20]. Compared with simplicial meshes, quadtree meshes provide preferable performance in the aspects of the accuracy and robustness. There are lots of mature software packages (e.g., [1,2]) on quadtree meshes. To guide the AMR, one possible way is through the a posteriori error estimation to construct computable quantities to indicate the location that the mesh needs to be refined/coarsened, thus to balance the spacial distribution of the error which improves the accuracy per computing power. Residual-based and recovery-based error estimators are among the most popular ones used. In terms of accuracy, the recovery-based error estimator shows more appealing attributes [28,3].
More recently, newer developments on flux recovery have been studied by many researchers on constructing a post-processed flux in a structure-preserving approximation space. Using (1) as an example, given that the data
However, these
More recently, a new class of methods called the virtual element methods (VEM) were introduced in [4,8], which can be viewed as a polytopal generalization of the tensorial/simplicial finite element. Since then, lots of applications of VEM have been studied by many researchers. A usual VEM workflow splits the consistency (approximation) and the stability of the method as well as the finite dimensional approximation space into two parts. It allows flexible constructions of spaces to preserve the structure of the continuous problems such as higher order continuities, exact divergence-free spaces, and many others. The VEM functions are represented by merely the degrees of freedom (DoF) functionals, not the pointwise values. In computation, if an optimal order discontinuous approximation can be computed elementwisely, then adding an appropriate parameter-free stabilization suffices to guarantee the convergence under common assumptions on the geometry of the mesh.
The adoption of the polytopal element brings many distinctive advantages, for example, treating rectangular element with hanging nodes as polygons allows a simple construction of
The major ingredient in our study is an
If
(α∇uT,∇vT)=(f,vT),∀vT∈Qk(T)∩H10(Ω), | (2) |
in which the standard notation is opted.
Qk(T):={v∈H1(Ω):v|K∈Qk(K),∀K∈T}. |
and on
Qk(K):=Pk,k(K)={p(x)q(y),p∈Pk([a,b]),q∈Pk([c,d])}, |
where
On
NH:={z∈N:∃K∈T,z∈∂K∖NK} | (3) |
Otherwise the node
For each edge
In this subsection, the quadtree mesh
For the embedded element
Subsequently,
On
(4) |
An
(5) |
Next we turn to define the degrees of freedom (DoFs) of this space. To this end, we define the set of scaled monomials
(6) |
where
(7) |
The degrees of freedom (DoFs) are then set as follows for a
(8) |
Remark 1. We note that in our construction, the degrees of freedom to determine the curl of a VEM function originally in [8] are replaced by a curl-free constraint thanks to the flexibility to virtual element. The reason why we opt for this subspace is that the true flux
As the data
Consider
On each
(9) |
where
(10) |
First for both
(11) |
In the lowest order case
(12) |
If
(13) |
The reason to add
(14) |
Consequently for
(15) |
To the end of constructing a computable local error indicator, inspired by the VEM formulation [8], the recovered flux is projected to a space with a much simpler structure. A local oblique projection
(16) |
Next we are gonna show that this projection operator can be straightforward computed for vector fields in
When
(17) |
By definition of the space (4) when
When
(18) |
which can be evaluated using both DoF sets
Given the recovered flux in Section 3, the recovery-based local error indicator
(19) |
then
(20) |
A computable
(21) |
with the oblique projection
(22) |
Here
(23) |
where
The computable error estimator
(24) |
In this section, we shall prove the proposed recovery-based estimator
Theorem 4.1. Let
(25) |
where
In the edge jump term,
Proof. Let
(26) |
By (11), without loss of generality we assume
(27) |
The boundary term in (26) can be then rewritten as
(28) |
By a trace inequality on an edge of a polygon (Lemma 7.1), and the Poincaré inequality for
As a result,
For the bulk term on
When
(29) |
The first two terms can be handled by combining the weights
(30) |
The two terms on
and the theorem follows.
Theorem 4.2. Under the same setting with Theorem 4.1, let
(31) |
The constant depends on
Proof. This theorem follows directly from the norm equivalence Lemma 7.3:
while evaluating the DoFs
Theorem 4.3. Under the same setting with Theorem 4.1, on any
(32) |
with a constant independent of
Proof. This is a direct consequence of Theorem 4.1 and 4.2 and the fact that the residual-based error indicator is efficient by a common bubble function argument.
In this section, we shall prove that the computable error estimator
Assumption 1 (
By Assumption 1, we denote the father
Assumption 2 (Quasi-monotonicity of
Denote
(33) |
We note that if
(34) |
Lemma 4.4 (Estimates for
(35) |
and for
(36) |
in which
Proof. The estimate for
Denotes the subset of nodes
(37) |
with
Theorem 4.5. Let
(38) |
For
(39) |
where the constant depends on
Proof. Let
Applying the norm equivalence of
When
(40) |
in which a patch-wise constant
Applied an inverse inequality in Lemma 7.2 on
The numerics is prepared using the bilinear element for common AMR benchmark problems. The codes for this paper are publicly available on https://github.com/lyc102/ifem implemented using
The adaptive finite element (AFEM) iterative procedure is following the standard
The linear system is solved by MATLAB
Throughout all examples, we fix
Let
i.e., the closer to 1 the effectivity index is, the more accurate this estimator is to measure the error of interest. We use an order
where the subscript
In this example, a standard AMR benchmark on the L-shaped domain is tested. The true solution
The solution
This example is a common benchmark test problem introduced in [9], see also [17,12]) for elliptic interface problems. The true solution
While
By this choice, this function is very singular near the origin as the maximum regularity it has is
The AFEM procedure for this problem stops when the relative error reaches
A postprocessed flux with the minimum
However, we do acknowledge that the technical tool involving interpolation is essentially limited to
The author is grateful for the constructive advice from the anonymous reviewers. This work was supported in part by the National Science Foundation under grants DMS-1913080 and DMS-2136075, and no additional revenues are related to this work.
Unlike the identity matrix stabilization commonly used in most of the VEM literature, for
(41) |
where
To show the inverse inequality and the norm equivalence used in the reliability bound, on each element, we need to introduce some geometric measures. Consider a polygonal element
Proposition 1. Under Assumption 1,
Lemma 7.1 (Trace inequality on small edges [13]). If Proposition 1 holds, for
(42) |
Proof. The proof follows essentially equation (3.9) in [13,Lemma 3.3] as a standard scaled trace inequality on
Lemma 7.2 (Inverse inequalities). Under Assumption 1, we have the following inverse estimates for
(43) |
Proof. The first inequality in (43) can be shown using a bubble function trick. Choose
and then
Consequently, the first inequality in (43) follows above by the standard inverse estimate for polynomials
To prove the second inequality in (43), by integration by parts we have
(44) |
Expand
(45) |
since
As a result, the second inequality in (43) is proved when apply an inverse inequality for
Remark 2. While the proof in Lemma 7.2 relies on
Lemma 7.3 (Norm equivalence). Under Assumption 1, let
(46) |
where both
Proof. First we consider the lower bound, by triangle inequality,
Since
(47) |
To this end, we consider the weak solution to the following auxiliary boundary value problem on
(48) |
By a standard Helmholtz decomposition result (e.g. Proposition 3.1, Chapter 1[23]), we have
Consequently, we proved essentially the unisolvency of the modified VEM space (4) and
(49) |
Proposition 1 allows us to apply an isotropic trace inequality on an edge of a polygon (Lemma 7.1), combining with the Poincaré inequality for
Furthermore applying the inverse estimate in Lemma 7.2 on the bulk term above, we have
which proves the validity of (47), thus yield the lower bound.
To prove the upper bound, by
(50) |
To prove the first inequality, by Proposition 1 again, consider the edge bubble function
(51) |
Denote
Now by the fact that
The second inequality in (50) can be estimated straightforward by the scaling of the monomials (7)
(52) |
Hence, (46) is proved.
[1] | Y. Liu, Application of 5G in mine communication (in Chinese), in Proceedings of the 29th National Coal Mine Automation and Informatization Academic Conference and the 10th China Coal Mine Informatization and Automation High Level Forum-Coal Mine Automation and Informatization, China, (2020), 4. https://doi.org/10.26914/c.cnkihy.2020.070056 |
[2] |
L. Cimini, Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing, IEEE Trans. Commun., 33 (1985), 665–675. https://doi.org/10.1109/TCOM.1985.1096357 doi: 10.1109/TCOM.1985.1096357
![]() |
[3] | D. Li, J. Yu, M. Wang, S. Zhang, An improved SLM scheme with low implementation complexity to reduce PAPR performance of OFDM systems, in 2013 6th International Congress on Image and Signal Processing (CISP), IEEE, Hangzhou, China, (2013), 1499–1503. https://doi.org/10.1109/CISP.2013.6743912 |
[4] | S. Yoon, Comparisons of two detectors for a trade-off between complexity and performance in MIMO-OFDM systems, in IEEE 7th International Conference on Computer and Automation Engineering (ICCAE), IEEE, Chongqing, China, (2011), 528–535. |
[5] | S. F. Zhao, Research on low-complexity signal detection Algorithms for uplink massive MIMO systems (in Chinese), Chongqing Univ. Posts Telecommun., (2018). https://doi.org/10.27675/d.cnki.gcydx.2018.000691 |
[6] | L. Mao, L Zhu, L. F. Cheng, Overview of signal detection algorithms in MIMO communication systems (in Chinese), Commun. Inf. Technol., 261 (2023), 13–15, 24. |
[7] |
J. P. Sun, H. P. Chen, Smart mine with 5G and WiFi6 (in Chinese), J. Mine Autom., 45 (2019), 1–4. https://doi.org/10.13272/j.issn.1671-251x.17517 doi: 10.13272/j.issn.1671-251x.17517
![]() |
[8] | Y. L. Wang, P. Zhang, J. Zhang, Application research of MIMO-OFDM technology in underground coal mine (in Chinese), Comput. Technol. dev., 8 (2014), 191–193,198. |
[9] | S. H. Yao, X. L. Wu, Research on MIMO-OFDM for improving wireless communication performance in mine (in Chinese), J. Hefei Univ. Technol. (Nat. Sci.), 32 (2009), 557–559+590. |
[10] |
S. H. Yao, X. L. Wu, Modeling and performance simulation for mine MIMO wireless channels (in Chinese), J. Syst. Simul., 22 (2010), 2432–2434. https://doi.org/10.16182/j.cnki.joss.2010.10.022 doi: 10.16182/j.cnki.joss.2010.10.022
![]() |
[11] |
X. G. Zhang, L. L. Li, H. D. Zheng, Z. J. Wang, Modeling and channel capacity analysis of underground MIMO system in coal mine (in Chinese), J. Xi'an Unive. Sci. Technol., 31 (2011), 366–370. https://doi.org/10.13800/j.cnki.xakjdxxb.2011.03.025 doi: 10.13800/j.cnki.xakjdxxb.2011.03.025
![]() |
[12] |
G. Y. Liu, X. M. Meng, S. H. Yao, Research on spatial correlation of MIMO channel model in coal mine (in Chinese), Saf. Coal Mines, 43 (2012), 106–107,110. https://doi.org/10.13347/j.cnki.mkaq.2012.09.028 doi: 10.13347/j.cnki.mkaq.2012.09.028
![]() |
[13] |
S. Zhang, C. S. Chen, B. Hu, Q. Q. Zhang, L. X. Wu, Study on MIMO information channel volume in mine roadway (in Chinese), Coal Sci. Technol., 41 (2013), 94–97,128. https://doi.org/10.13199/j.cst.2013.01.97.zhangsh.027 doi: 10.13199/j.cst.2013.01.97.zhangsh.027
![]() |
[14] |
Y. L. Wang, G. Z. Qu, A fast recursive interference cancellation algorithm with low complexity (in Chinese), Comput. Meas. Control, 22 (2014), 4028–4031. https://doi.org/10.16526/j.cnki.11-4762/tp.2014.12.050 doi: 10.16526/j.cnki.11-4762/tp.2014.12.050
![]() |
[15] | W. Xu, Z. Zhao, Research on sparse channel estimation algorithm based on MIMO-OFDM system, in 2020 International Conference on Communications, Information System and Computer Engineering (CISCE), IEEE, Kuala Lumpur, Malaysia, (2020), 403–406. |
[16] | D. Liyanaarachchi, C. B. Barneto, T. Riihonen, M. Heino, M. Valkama, Range-Angle processing for target detection in joint MIMO-OFDM communications and sensing, in 2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), IEEE, Lucca, Italy, (2021), 486–490. https://doi.org/10.1109/SPAWC51858.2021.9593229 |
[17] |
S. J. Choi, S. J. Shim, Y. H. You, J. Cha, H. K. Song, Novel MIMO detection with improved complexity for near-ML detection in MIMO-OFDM systems, IEEE Access, 7 (2019), 60389–60398. https://doi.org/10.1109/ACCESS.2019.2914707 doi: 10.1109/ACCESS.2019.2914707
![]() |
[18] |
S. Mondal, M. R. Laskar, A. K. Dutta, ML criterion-based signal detection of a MIMO-OFDM system using quantum and semi-quantum assisted modified DHA/BBHT search algorithm, IEEE Trans. Veh. Technol., 70 (2021), 1688–1698. https://doi.org/10.1109/TVT.2021.3055537 doi: 10.1109/TVT.2021.3055537
![]() |
[19] | P. Priya, D. Sen, Particle filter based nonlinear data detection for frequency selective mm-wave MIMO-OFDM systems, in 2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall), IEEE, Victoria, Canada, (2020), 1–6. https://doi.org/10.1109/VTC2020-Fall49728.2020.9348523 |
[20] | Y. Liang, L. Li, Y. Yi, L. Liu, Real-time machine learning for symbol detection in MIMO-OFDM systems, in IEEE INFOCOM 2022-IEEE Conference on Computer Communications, IEEE, London, UK, (2022), 2068–2077. https://doi.org/10.1109/INFOCOM48880.2022.9796854 |
[21] |
R. Wang, W. W. Zhu, J. Q. Zhang, Q. Chen, R. H. Xie, An improved ZF-OSIC signal detection algorithm in MIMO system (in Chinese), Inf. Technol., 4 (2017), 165–168,173. https://doi.org/10.13274/j.cnki.hdzj.2017.04.042 doi: 10.13274/j.cnki.hdzj.2017.04.042
![]() |
[22] | B. Wang, Q. Zhu, An improved algorithm for V-BLAST detection in MIMO-OFDM system (in Chinese), J. Signal Process., 25 (2009), 1409–1413. |
[23] |
A. Elgabli, A. Elghariani, V. Aggarwal, M. R. Bell, A low-complexity detection algorithm for uplink massive MIMO systems based on alternating minimization, IEEE Wireless Commun. Lett., 8 (2019), 917–920. https://doi.org/10.1109/LWC.2019.2899852 doi: 10.1109/LWC.2019.2899852
![]() |
[24] |
M. M. Wu, Y. H. Fu, Large-scale MIMO signal detection based on learnable weight attenuation (in Chinese), J. Nanjing Univ. Posts Telecommun. (Nat. Sci.), 42 (2022), 45–52. https://doi.org/10.14132/j.cnki.1673-5439.2022.01.007 doi: 10.14132/j.cnki.1673-5439.2022.01.007
![]() |
[25] | G. Q. Li, P. Yang, J. Z. Lin, Y. J. Xu, Y. Pang, Y. H. Xu, Deep learning-based joint optimization for MIMO systems (in Chinese), J. Chongqing Univ. Posts Telecommun. (Nat. Sci.), 31 (2019), 293–298. |
[26] |
X. Jin, H. N. Kim, Parallel deep learning detection network in the MIMO channel, IEEE Commun. Lett., 24 (2020), 126–130. https://doi.org/10.1109/LCOMM.2019.2950201 doi: 10.1109/LCOMM.2019.2950201
![]() |
[27] | S. Liao, C. Deng, L. Liu, B. Yuan, Structured neural network with low complexity for MIMO detection, in 2019 IEEE International Workshop on Signal Processing Systems (SiPS), IEEE, Nanjing, China, (2019), 290–295. https://doi.org/10.1109/SiPS47522.2019.9020365 |
[28] | H. X. Zhang, H. R. Han, W. B. Lv, Low-complexity generalized space shift keying signal detection algorithm based on compressed sensing (in Chinese), J. Comput. Appl., (2023), 1–8. |
[29] |
F. Han, J. W. Ji, C. P. Liu, H. Wu, A low complexity MIMO-OTFS signal detection algorithm (in Chinese), Comput. Meas. Control, 31 (2023), 190–195+203. https://doi.org/10.16526/j.cnki.11-4762/tp.2023.02.030 doi: 10.16526/j.cnki.11-4762/tp.2023.02.030
![]() |
[30] |
T. Dai, Z. Q. Li, Z. M. Wang, S. Xing, Massive MIMO signal detection based on improved Richardson method (in Chinese), J. Electron. Meas. Instrum., 37 (2023), 171–178. https://doi.org/10.13382/j.jemi.B2205399 doi: 10.13382/j.jemi.B2205399
![]() |
[31] | B. Shen, J. Yang, X. Z. Zeng, T. P. Cui, Massive MIMO signal detection based on interference cancellation assisted sparsely connected neural network (in Chinese), J. Electron. Inf. Technol., 45 (2023), 208–217. |
[32] | B. Shen, J. Yang, Y. Y. Tu, MIMO signal detection based on OAMP algorithm assisted sparsely connected neural networks (in Chinese), J. Signal Process., (2023), 1–9. |
[33] | X. Q. Wu, Y. J. Hu, F. Jiang, Detection algorithm based on block sparse adaptive matching pursuit in generalized spatial modulation MIMO system (in Chinese), Radio Eng., 52 (2022), 1695–1701. |
[34] | W. Abid, M. Hajjaj, A. Mejri, R. Bouallegue, Weighted Kalman based detection for uplink MIMO systems, IEEE, in 2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Split, Croatia, (2020), 1–6. https://doi.org/10.23919/SoftCOM50211.2020.9238325 |
[35] |
J. Jalden, B. Ottersten, On the complexity of sphere decoding in digital communications, IEEE Trans. Signal Process., 53 (2005), 1474–1484. https://doi.org/10.1109/TSP.2005.843746 doi: 10.1109/TSP.2005.843746
![]() |
[36] | M. Cheffena, Industrial indoor multipath propagation-A physical-statistical approach, in 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), IEEE, Washington, USA, (2014), 68–72, https://doi.org/10.1109/PIMRC.2014.7136134 |
[37] | H. J. Lee, D. Kim, A hybrid zero-forcing and sphere-decoding method for MIMO systems, in 2006 International Conference on Wireless Communications, Networking and Mobile Computing, IEEE, Wuhan, China, (2006), 1–4. https://doi.org/10.1109/WiCOM.2006.9 |
[38] | Z. Y. Gu, Y. L. Gao, W. L. Liu, M. L. Jin, Decision probability ordered successive interference cancellation for massive MIMO, in 2016 2nd IEEE International Conference on Computer and Communications (ICCC), IEEE, Chengdu, China, (2016), 2601–2605. https://doi.org/10.1109/CompComm.2016.7925168 |
[39] | Y. Zhu, Z. M. Yu, Research and performance analysis of MMSE detection algorithm for MIMO-OFDM system (in Chinese), Electron. Qual., 421 (2022), 5–10. |
[40] | Y. L. Xia, S. He, Research and simulation of OSIC detection algorithm in MIMO-OFDM (in Chinese), Commun. Technol., 50 (2017), 2643–2647. |
1. | Hengliang Tang, Jinda Dong, Solving Flexible Job-Shop Scheduling Problem with Heterogeneous Graph Neural Network Based on Relation and Deep Reinforcement Learning, 2024, 12, 2075-1702, 584, 10.3390/machines12080584 | |
2. | Chen Han, Xuanyin Wang, TPN:Triple network algorithm for deep reinforcement learning, 2024, 591, 09252312, 127755, 10.1016/j.neucom.2024.127755 | |
3. | Miguel S. E. Martins, João M. C. Sousa, Susana Vieira, A Systematic Review on Reinforcement Learning for Industrial Combinatorial Optimization Problems, 2025, 15, 2076-3417, 1211, 10.3390/app15031211 | |
4. | Tianhua Jiang, Lu Liu, A Bi-Population Competition Adaptive Interior Search Algorithm Based on Reinforcement Learning for Flexible Job Shop Scheduling Problem, 2025, 24, 1469-0268, 10.1142/S1469026824500251 | |
5. | Tianyuan Mao, A Review of Scheduling Methods for Multi-AGV Material Handling Systems in Mixed-Model Assembly Workshops, 2025, 5, 2710-0723, 227, 10.54691/p4x5a536 | |
6. | Peng Zhao, You Zhou, Di Wang, Zhiguang Cao, Yubin Xiao, Xuan Wu, Yuanshu Li, Hongjia Liu, Wei Du, Yuan Jiang, Liupu Wang, 2025, Dual Operation Aggregation Graph Neural Networks for Solving Flexible Job-Shop Scheduling Problem with Reinforcement Learning, 9798400712746, 4089, 10.1145/3696410.3714616 | |
7. | Yuxin Peng, Youlong Lyu, Jie Zhang, Ying Chu, Heterogeneous Graph Neural-Network-Based Scheduling Optimization for Multi-Product and Variable-Batch Production in Flexible Job Shops, 2025, 15, 2076-3417, 5648, 10.3390/app15105648 |