It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
In this paper, the decision-level data fusion techniques are extended to the multiuser detection (MUD) field. Then two novel MUD algorithms, that is the chairman arbitrating decision-level fusion criterion (CA-DFC) based MUD algorithm and the veto logic decision-level fusion criterion (VL-DFC) based MUD algorithm, are proposed for DS-UWB communication systems. In CA-DFC based method, the chairman can make his arbitration among the preliminary decisions from sub-optimal detectors by his own rule. In the VL-DFC based method, the undetermined bits in these preliminary decisions are considered to construct a simplified solution space, and then the chairman can make his final decision within this space. Simulation results demonstrate that the performances of CA-DFC and VL-DFC based MUD algorithms are superior to those of other sub-optimal MUD algorithms, and even close to that of OMD. Moreover, both of these proposed algorithms have lower computational complexity than OMD, which reveals their efficiency. Compared with CA-DFC, VL-DFC based algorithm achieves a little improvement in its performance, at the cost of the increment in its computational complexity. Thus, they can be applied to different practical situations.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer