Minimum Mean Square Error (MMSE) multiuser detection yields the highest output SINR among all linear detectors. The blind MMSE linear detector can be implemented with batch processes or sequential processes. In this p...Minimum Mean Square Error (MMSE) multiuser detection yields the highest output SINR among all linear detectors. The blind MMSE linear detector can be implemented with batch processes or sequential processes. In this paper, according to the different implementations of blind detectors, the authors analyze two schemes of the blind MMSE multiuser receiver for space-time coded CDMA Systems and make a comparison between both schemes by the theoretical analysis and numerical simulations.展开更多
Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years...Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the r展开更多
The common endogenous security problems in cyberspace and related attack threats have posed subversive challenges to conventional theories and methods of functional safety.In the current design of the cyber physical s...The common endogenous security problems in cyberspace and related attack threats have posed subversive challenges to conventional theories and methods of functional safety.In the current design of the cyber physical system(CPS),functional safety and cyber security are increasingly intertwined and inseparable,which evolve into the generalized functional safety(S&S)problem.The conventional reliability and cybersecurity technologies are unable to provide security assurance with quanti able design and veri cation metrics in response to the cyberattacks in hardware and software with common endogenous security problems,and the functional safety of CPS facilities or device has become a frightening ghost.The dynamic heterogeneity redundancy(DHR)architecture and coding channel theory(CCT)proposed by the cyberspace endogenous security paradigm could handle random failures and uncertain network attacks in an integrated manner,and its generalized robust control mechanism can solve the universal problem of quantitative design for functional safety under probability or improbability perturbation.As a generalized functional safety enabling structure,DHR opens up a new direction to solve the common endogenous security problems in the cross-disciplinary elds of cyberspace.展开更多
To support mission-critical applications, such as factory automation and autonomous driving, the ultra-reliable low latency communications (URLLC) is adopted in the fifth generation (5G) mobile communications network,...To support mission-critical applications, such as factory automation and autonomous driving, the ultra-reliable low latency communications (URLLC) is adopted in the fifth generation (5G) mobile communications network, which requires high level of reliability and low latency. Naturally, URLLC in the future 6G is expected to have a better capability than its 5G version which poses an unprecedented challenge to us. Fortunately, the potential solution can still be found in the well-known classical Shannon information theory. Since the latency constraint can be represented equivalently by blocklength, channel coding at finite blocklength plays an important role in the theoretic analysis of URLLC. Applying these achievements in rapidly development of massive MIMO techniques gives rise to a new theory on space time exchanging. It tells us that channel coding can also be performed in space domain, since it is capable of providing the same coding rate as that in time domain. This space time exchanging theory points out an exciting and feasible direction for us to further reduce latency in 6G URLLC. .展开更多
文摘Minimum Mean Square Error (MMSE) multiuser detection yields the highest output SINR among all linear detectors. The blind MMSE linear detector can be implemented with batch processes or sequential processes. In this paper, according to the different implementations of blind detectors, the authors analyze two schemes of the blind MMSE multiuser receiver for space-time coded CDMA Systems and make a comparison between both schemes by the theoretical analysis and numerical simulations.
文摘Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the r
基金the National Natural Science Foundation Innovation Group Project(61521003).
文摘The common endogenous security problems in cyberspace and related attack threats have posed subversive challenges to conventional theories and methods of functional safety.In the current design of the cyber physical system(CPS),functional safety and cyber security are increasingly intertwined and inseparable,which evolve into the generalized functional safety(S&S)problem.The conventional reliability and cybersecurity technologies are unable to provide security assurance with quanti able design and veri cation metrics in response to the cyberattacks in hardware and software with common endogenous security problems,and the functional safety of CPS facilities or device has become a frightening ghost.The dynamic heterogeneity redundancy(DHR)architecture and coding channel theory(CCT)proposed by the cyberspace endogenous security paradigm could handle random failures and uncertain network attacks in an integrated manner,and its generalized robust control mechanism can solve the universal problem of quantitative design for functional safety under probability or improbability perturbation.As a generalized functional safety enabling structure,DHR opens up a new direction to solve the common endogenous security problems in the cross-disciplinary elds of cyberspace.
文摘To support mission-critical applications, such as factory automation and autonomous driving, the ultra-reliable low latency communications (URLLC) is adopted in the fifth generation (5G) mobile communications network, which requires high level of reliability and low latency. Naturally, URLLC in the future 6G is expected to have a better capability than its 5G version which poses an unprecedented challenge to us. Fortunately, the potential solution can still be found in the well-known classical Shannon information theory. Since the latency constraint can be represented equivalently by blocklength, channel coding at finite blocklength plays an important role in the theoretic analysis of URLLC. Applying these achievements in rapidly development of massive MIMO techniques gives rise to a new theory on space time exchanging. It tells us that channel coding can also be performed in space domain, since it is capable of providing the same coding rate as that in time domain. This space time exchanging theory points out an exciting and feasible direction for us to further reduce latency in 6G URLLC. .
