Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
Research article Special Issues

An improved signal detection algorithm for a mining-purposed MIMO-OFDM IoT-based system

  • Received: 12 January 2023 Revised: 28 April 2023 Accepted: 05 May 2023 Published: 16 May 2023
  • 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

    Related Papers:

    [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 ΩR2,

    {(α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 fL2(Ω), the flux αu is in H(div):={vL2(Ω):vL2(Ω)}, which has less continuity constraint than the ones in [28,3] which are vertex-patch based with the recovered flux being H1(Ω)-conforming. The H(div)-flux recovery shows more robustness than vertex-patch based ones (e.g., [11,10]).

    However, these H(div)-flux recovery techniques work mainly on conforming meshes. For nonconforming discretizations on nonmatching grids, some simple treatment of hanging nodes exists by recovering the flux on a conforming mother mesh [22]. To our best knowledge, there is no literature about the local H(div)-flux recovery on a multilevel irregular quadtree meshes. One major difficulty is that it is impossible to recover a robust computable polynomial flux to satisfy the H(div)-continuity constraint, that is, the flux is continuous in the normal direction on edges with hanging nodes.

    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 H(div)-conforming finite dimensional approximation space on meshes with multilevel irregularities. We shall follow this approach to perform the flux recovery for a conforming Qk discretization of problem (1). Recently, arbitrary level of irregular quadtree meshes have been studied in [21,26,15]. Analyses of the residual-based error estimator on 1-irregular (balanced) quadtree mesh can be found, e.g., in [14]. In the virtual element context, Zienkiewicz-Zhu (ZZ)-type recovery techniques are studied for linear elasticity in [18], and for diffusion problems in [24]. In [18,24], the recovered flux is in H1 and associated with nodal DoFs, thus cannot yield a robust estimate when the diffusion coefficient has a sharp contrast [11,10]. The first equilibrated flux recovery in H(div) for virtual element methods is studied in [19]. While [19] recovers a flux by solving a mixed problem globally, we opt for a cheap and simple weighted averaging locally.

    The major ingredient in our study is an H(div)-conforming virtual element space modified from the ones used in [8,5] (Section 2.2). Afterwards, an H(div)-conforming flux is recovered by a robust weighted averaging of the numerical flux, in which some unique properties of the tensor-product type element Qk are exploited (Section 3). The a posteriori error estimator is constructed based on the projected flux elementwisely. The efficiency of the local error indicator is then proved by bounding it above by the residual-based error indicator (Section 4.1). The reliability of the recovery-based error estimator is then shown under certain assumptions (Section 4.2). These estimates are verified numerically by some common AMR benchmark problems implemented in a publicly available finite element software library iFEM [16] (Section 5).

    If Ω is not a rectangle, u is extended by 0 to an ˜Ω that is rectangular, therefore without loss of generality, we assume Ω is partitioned into a shape-regular T={K} with rectangular elements, and α:=αK is assumed to be a piecewise, positive constant with respect to T. The weak form of problem (1) is then discretized in a tensor-product finite element space as follows,

    (αuT,vT)=(f,vT),vTQk(T)H10(Ω), (2)

    in which the standard notation is opted. (,)D denotes the inner product on L2(D), and D:=(,)D, with the subscript omitted when D=Ω. The discretization space is

    Qk(T):={vH1(Ω):v|KQk(K),KT}.

    and on K=[a,b]×[c,d]

    Qk(K):=Pk,k(K)={p(x)q(y),pPk([a,b]),qPk([c,d])},

    where Pk(D) stands for the degree no more than k polynomial defined on D. Henceforth, we shall simply denote Qk(T)=:Qk when no ambiguity arises.

    On K, the sets of 4 vertices, as well as 4 edges of the same generation with K, are denoted by NK and EK, respectively. The sets of nodes and edges in T are denoted by N:=KTNK and E:=KTEK. A node zN is called a hanging node if it is on K but is not counted as a vertex of KT, and we denote the set of hanging nodes as NH

    NH:={zN:KT,zKNK} (3)

    Otherwise the node zN is a regular node. If an edge eE contains at most l hanging nodes, the partition T, as well as the element these hanging nodes lie on, is called l-irregular.

    For each edge eE, a unit normal vector ne is fixed by specifying its direction pointing rightward for vertical edges, and upward for horizontal edges. If an exterior normal of an element on this edge shares the same orientation with ne, then this element is denoted by K, otherwise it is denoted by K+, i.e., ne is pointing from K to K+. The intersection of the closures of K+,K is always an edge eE. However, we note that by the definition in (3) it is possible that eEK+ but not in EK or vice versa, if there exists a hanging node on e (see e.g., Figure 1). For any function or distribution v well-defined on the two elements, define [[v]]e=vv+ on an edge eΩ, in which v and v+ are defined in the limiting sense v±=lim for . If is a boundary edge, the function is extended by zero outside the domain to compute . Furthermore, the following notation denotes a weighted average of on edge for a weight ,

    Figure 1.  For the upper right element , . For , .

    In this subsection, the quadtree mesh of interest is embedded into a polygonal mesh . On any given quadrilateral element , for example we consider a , it has 4 degrees of freedom associated with 4 nodes . Its numerical flux is well-defined on the 4 edges locally on , such that on each edge it is a polynomial defined on the whole edge, regardless of the number of hanging nodes on that edge. Using Figure 1 as an example, on the upper right element , is a linear function in -variable.

    For the embedded element , which geometrically coincides with , it includes all the hanging nodes, while the set of edges are formed accordingly as the edges of the cyclic graph of the vertices. We shall denote the set of all edges on as . Using Figure 1 as example, it is possible to define a flux on with piecewise linear normal component on which now consists of three edges on .

    Subsequently, shall be denoted by simply in the context of flux recovery, and the notion denotes an edge on the boundary of , which takes into account of the edges formed with one end point or both end points as the hanging nodes.

    On , we consider the following Brezzi-Douglas-Marini-type virtual element modification inspired by the ones used in [8,5]. The local space on a is defined as for

    (4)

    An -conforming global space for recovering the flux is then

    (5)

    Next we turn to define the degrees of freedom (DoFs) of this space. To this end, we define the set of scaled monomials on an edge . is parametrized by , where is the starting point of , and is the unit tangential vector of . The basis set for is chosen as:

    (6)

    where representing the midpoint when using this parametrization. Similar to the edge case, 's basis set is chosen as follows (see e.g., [4]):

    (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 is locally curl-free since we have assumed that is a piecewise constant. The unisolvency of the set of DoFs (8) including the curl-part can be found in [8]. While for the modified space (4), a simplified argument is in the proof of Lemma 7.3.

    As the data , the true flux . Consequently, we shall seek a postprocessed flux in by specifying the DoFs in (8). Throughout this section, whenever considering an element , we treat it a polygon as .

    Consider which is the numerical flux on . We note that . The normal flux on each edge is in as and on vertical edges, and on horizontal edges. Therefore, the edge-based DoFs can be computed by a simple averaging thanks to the matching polynomial degrees of the numerical flux to the functions in .

    On each , define

    (9)

    where

    (10)

    First for both and cases, we set the normal component of the recovered flux is set as

    (11)

    In the lowest order case , is a constant on by (4), thus the construction (11) alone, which consists the edge DoFs in (8), can determine the divergence in as follows

    (12)

    If , after the normal component (11) is set, furthermore on each , denote stands for the -projection to , and we let

    (13)

    The reason to add is that we have set the normal components of the recovered flux first without relying on the divergence information. While in general as otherwise the divergence theorem will be rendered invalid in (12). As a result, an element-wise constant is added to ensure the compatibility of locally on each . It is straightforward to verify that has the following form, and later we shall show that does not affect the efficiency as well as the reliability of the error estimates.

    (14)

    Consequently for , the set of DoFs can be set as:

    (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 is defined as follows:

    (16)

    Next we are gonna show that this projection operator can be straightforward computed for vector fields in .

    When , we can compute the right hand side of (16) as follows:

    (17)

    By definition of the space (4) when , is a constant on and can be determined by edge DoFs in (8) similar to (12). Moreover, , thus the boundary term can be evaluated using DoFs in (8).

    When , the right hand side of (16) can be evaluated following a similar procedure as (17), if we exploit the fact that , we have

    (18)

    which can be evaluated using both DoF sets and .

    Given the recovered flux in Section 3, the recovery-based local error indicator and the element residual as follows:

    (19)

    then

    (20)

    A computable is defined as:

    (21)

    with the oblique projection defined in (16). The stabilization part is

    (22)

    Here is seminorm induced by the following stabilization

    (23)

    where is the index set for the monomial basis of with cardinality , i.e., the second term in (23) is dropped in the case. We note that this is a slightly modified version of the standard stabilization for an -function in [8] as we have replaced the edge DoFs by an integral. In Section 7.1 it is shown that the integral-based stabilization still yields the crucial norm equivalence result.

    The computable error estimator is then

    (24)

    In this section, we shall prove the proposed recovery-based estimator is efficient by bounding it above by the residual-based error estimator. In the process of adaptive mesh refinement, only the computable is used as the local error indicator to guide a marking strategy of choice.

    Theorem 4.1. Let be the solution to problem (2), and be the error indicator in (24). On , can be locally bounded by the residual-based ones:

    (25)

    where

    In the edge jump term, is the element on the opposite side of with respect to an edge . The constant depends on and the number of edges on .

    Proof. Let on , then and we have

    (26)

    By (11), without loss of generality we assume (the local orientation of agrees with the global one, i.e., ), and which is the element opposite to with respect to , and , we have on edge

    (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 , we have,

    As a result,

    For the bulk term on 's in (26), when , by (12), the representation in (28), and the Poincaré inequality for again with , we have

    When , by (13),

    (29)

    The first two terms can be handled by combining the weights and from . For , it can be estimated straightforwardly as follows

    (30)

    The two terms on can be treated the same way with the first two terms in (29) while the edge terms are handled similarly as in the case. As a result, we have shown

    and the theorem follows.

    Theorem 4.2. Under the same setting with Theorem 4.1, let as the estimator in (22), we have

    (31)

    The constant depends on and the number of edges on .

    Proof. This theorem follows directly from the norm equivalence Lemma 7.3:

    while evaluating the DoFs and using (11) and (15) reverts us back to the proof of Theorem 4.1.

    Theorem 4.3. Under the same setting with Theorem 4.1, on any with defined as the collection of elements in which share at least 1 vertex with

    (32)

    with a constant independent of , but dependent on and the maximum number of edges in .

    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 is reliable under two common assumptions in the a posteriori error estimation literature. For the convenience of the reader, we rephrase them here using a "layman" description, for more detailed and technical definition please refer to the literature cited.

    Assumption 1 ( is -irregular [14]). Any given is always refined from a mesh with no hanging nodes by a quadsecting red-refinement. For any two neighboring elements in , the difference in their refinement levels is for a uniformly bounded constant , i.e., for any edge , it has at most hanging nodes.

    By Assumption 1, we denote the father -irregular mesh of as . On , a subset of all nodes is denoted by , which includes the regular nodes on , as well as as the set of end points of edges with a hanging node as the midpoint. By [14,Theorem 2.1], there exists a set of bilinear nodal bases associated with , such that form a partition of unity and can be used to construct a Clément-type quasi-interpolation. Furthermore, the following assumption assures that the Clément-type quasi-interpolant is robust with respect to the coefficient distribution on a vertex patch, when taking nodal DoFs as a weighted average.

    Assumption 2 (Quasi-monotonicity of [6]). On , let be the bilinear nodal basis associated with , with . For every element , there exists a simply connected element path leading to , which is a Lipschitz domain containing the elements where the piecewise constant coefficient achieves the maximum (or minimum) on .

    Denote

    (33)

    We note that if is a constant on , . A quasi-interpolation can be defined as

    (34)

    Lemma 4.4 (Estimates for and ). Under Assumption 1 and 2, the following estimates hold for any

    (35)

    and for

    (36)

    in which , and here denotes the union of elements in sharing at least a node (hanging or regular) with .

    Proof. The estimate for follows from [6,Lemma 2.8]. For , its error estimates and stability only rely on the partition of unity property of the nodal basis set (see e.g., [27]), therefore the proof follows the same argument with the ones used on triangulations in [6,Lemma 2.8].

    Denotes the subset of nodes (i) on the boundary as and (ii) with the coefficient on patch as . For the lowest order case, we need the following oscillation term for

    (37)

    with .

    Theorem 4.5. Let be the solution to problem (2), and be the computable error estimator in (24), under Assumption 2 and 1, we have for

    (38)

    For ,

    (39)

    where the constant depends on and .

    Proof. Let , and be the quasi-interpolant in (34) of , then by the Galerkin orthogonality, , the Cauchy-Schwarz inequality, and the interpolation estimates (35), we have for ,

    Applying the norm equivalence of to by Lemma 7.3, as well as the fact that the number of elements in is uniformly bounded by Assumption 1, yields the desired estimate.

    When , the residual term on can be further split thanks to . First we notice that by the fact that form a partition of unity,

    (40)

    in which a patch-wise constant (weighted average of ) can be further inserted by the definition of (33) if is a constant on . Therefore, by the assumption of being a piecewise constant, splitting (40), we have

    Applied an inverse inequality in Lemma 7.2 on and the projection estimate for (36), the rest follows the same argument with the one used in the case.

    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 FEM [16]. The linear algebraic system on an -irregular quadtree is implemented following the conforming prolongation approach [15] by , where is the locally assembled stiffness matrix for all nodes in , and are the solution vector associated with and load vector associated with , respectively. is a prolongation operator mapping conforming -bilinear finite element function defined on regular nodes to all nodes, the weight matrix is assembled locally by a recursive NN query in , while the polygonal mesh data structure embedding is automatically built during constructing . For details we refer the readers to https://github.com/lyc102/ifem/tree/master/research/polyFEM.

    The adaptive finite element (AFEM) iterative procedure is following the standard

    The linear system is solved by MATLAB . In , the Dorfler -marking is used with the local error indicator in that the minimum subset is chosen such that

    Throughout all examples, we fix . is refined by a red-refinement by quadsecting the marked element afterwards. For comparison, we compute the standard residual-based local indicator for

    Let . The residual-based estimator is merely computed for comparison purpose and not used in marking. The AFEM procedure stops when the relative error reaches a threshold. The effectivity indices for different estimators are compared

    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 Gaussian quadrature to compute elementwisely. The orders of convergence for various 's and are computed, for which and are defined as the slope for the linear fitting of and in the asymptotic regime,

    where the subscript stands for the number of iteration in the AFEM cycles, . and are considered optimal when being close to .

    In this example, a standard AMR benchmark on the L-shaped domain is tested. The true solution in polar coordinates on . The AFEM procedure stops if the relative error has reached . The adaptively refined mesh can be found in Figure 2a. While both estimators show optimal rate of convergence in Figure 2b, the effectivity index for is , and is for .

    Figure 2.  The result of the L-shape example. (a) The adaptively refined mesh with 1014 DoFs. (b) Convergence in Example 1.

    The solution is defined on with , , and . The true solution shows a sharp transition layer (Figure 3a). The result of the convergence can be found in Figure 3b. In this example, the AFEM procedure stops if the relative error has reached . Additionally, we note that by allowing -irregular (), the AMR procedure shows to be more efficient toward capturing the singularity of the solution. A simple comparison can be found in Figure 4. The effectivity indices for and are and , respectively.

    Figure 3.  The result of the circular wave front example. (a) on a 3-irregular mesh with , the relative error is . (b) Convergence in Example 2.
    Figure 4.  Comparison of the adaptively refined meshes. (a) 1-irregular mesh, , the relative error is . (b) 4-irregular mesh, and , the relative error is .

    This example is a common benchmark test problem introduced in [9], see also [17,12]) for elliptic interface problems. The true solution is harmonic in four quadrants, and takes different values within four quadrants:

    While in the first and third quadrants, and in the second and fourth quadrants, and the true flux is glued together using -continuity conditions. We choose the following set of coefficients for

    By this choice, this function is very singular near the origin as the maximum regularity it has is . Through an integration by parts, it can be computed accurately that . For detailed formula and more possible choices of the parameters above, we refer the reader to [17].

    The AFEM procedure for this problem stops when the relative error reaches , and the resulting mesh and finite element approximation during the refinement can be found in Figure 5, and the AFEM procedure shows optimal rate of convergence in Figure 6. The effectivity index for is , and for .

    Figure 5.  The result of the Kellogg example. (a) The adaptively refined mesh with on which the energy error is , this number is roughly of the number of DoFs needed to achieve the same accuracy if using conforming linear finite element on triangular grid (see [17,Section 4]). (b) The finite element approximation with .
    Figure 6.  The convergence result of the Kellogg example.

    A postprocessed flux with the minimum continuity requirement is constructed for tensor-product type finite element. The implementation can be easily ported to finite element on quadtree to make use the vast existing finite element libraries in the engineering community. Theoretically, the local error indicator is efficient, and the global estimator is shown to be reliable under the assumptions that (i) the mesh has bounded irregularities, and (ii) the diffusion coefficient is a quasi-monotone piecewise constant. Numerically, we have observed that both the local error indicator and the global estimator are efficient and reliable (in the asymptotic regime), respectively. Moreover, the recovery-based estimator is more accurate than the residual-based one.

    However, we do acknowledge that the technical tool involving interpolation is essentially limited to -irregular meshes in reliability. A simple weighted averaging has restrictions and is hard to generalize to -finite elements, or discretization on curved edges/isoparametric elements. Nevertheless, we have shown that the flexibility of the virtual element framework allows further modification of the space in which we perform the flux recovery to cater the needs.

    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 , we opt for a mass matrix/DoF hybrid stabilizer approach. Let and

    (41)

    where is defined in (23).

    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 and an edge , let the height which measures how far from this edge one can advance to an interior subset of , and denote as a right triangle with height and base as edge .

    Proposition 1. Under Assumption 1, satisfies (1) The number of edges in every is uniformly bounded above. (2) For any edge on every , is uniformly bounded below.

    Lemma 7.1 (Trace inequality on small edges [13]). If Proposition 1 holds, for and we have

    (42)

    Proof. The proof follows essentially equation (3.9) in [13,Lemma 3.3] as a standard scaled trace inequality on toward reads

    Lemma 7.2 (Inverse inequalities). Under Assumption 1, we have the following inverse estimates for (4) on any with constants depending on and the number of edges in :

    (43)

    Proof. The first inequality in (43) can be shown using a bubble function trick. Choose be a bubble function of where is the longest edge on . Denote , we have

    and then can be estimated as follows

    Consequently, the first inequality in (43) follows above by the standard inverse estimate for polynomials , and the properties of the bubble function , and .

    To prove the second inequality in (43), by integration by parts we have

    (44)

    Expand in the monomial basis , and denote the mass matrix , , it is straightforward to see that

    (45)

    since for the off-diagonal entries of due to being geometrically a rectangle (with additional vertices). As a result, applying the trace inequality in Lemma 7.1 on (44) yields

    As a result, the second inequality in (43) is proved when apply an inverse inequality for and estimate (45).

    Remark 2. While the proof in Lemma 7.2 relies on being a rectangle, the result holds for a much broader class of polygons by changing the basis of from the simple scaled monomials to quasi-orthogonal ones in [25,7] and apply the isotropic polygon scaling result in [13].

    Lemma 7.3 (Norm equivalence). Under Assumption 1, let be the oblique projection defined in (16), then the following relations holds for (4) on any :

    (46)

    where both and depends on and the number of edges in .

    Proof. First we consider the lower bound, by triangle inequality,

    Since , it suffices to establish the following to prove the lower bound in (46)

    (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 . Moreover, since on , , we can further choose . As a result, by the assumption that for in the modified virtual element space (4), we can verify that

    Consequently, we proved essentially the unisolvency of the modified VEM space (4) and . We further note that in (48) can be chosen in and thus

    (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 , we have, on every ,

    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 , it suffices to establish the reversed direction of (47) on a single edge and for a single monomial basis :

    (50)

    To prove the first inequality, by Proposition 1 again, consider the edge bubble function such that . We can let on for . It is easy to verify that:

    (51)

    Denote , and extend it to by a constant extension in the normal direction rectangular strip with respect to (notice ), we have

    Now by the fact that , the scaling of the edge bubble function in (51), and the first inverse estimate of in Lemma 7.2 yields the first part of (50).

    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.
  • This article has been cited by:

    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
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2133) PDF downloads(103) Cited by(0)

Figures and Tables

Figures(8)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog