An exact performance evaluation of the free-access stack collision resolution algorithm is given under the hypotheses of carrier-sense multiple access with collision detection (CSMA-CD) local area network communicatio...
详细信息
An exact performance evaluation of the free-access stack collision resolution algorithm is given under the hypotheses of carrier-sense multiple access with collision detection (CSMA-CD) local area network communication with packets of different length. In particular, the packet delay moments (mean and variance) and the maximum throughput that the system achieves for any given packet length distribution are precisely described.
Bidirectional sequential decoding (BSD) substantially reduces the computational variability of conventional sequential decoding without compromising the error performance. However. BSD does not completely eliminate th...
详细信息
Bidirectional sequential decoding (BSD) substantially reduces the computational variability of conventional sequential decoding without compromising the error performance. However. BSD does not completely eliminate the erasure problem, We propose in this paper an erasure-free decoding algorithm which combines the idea of BSD in conjunction with that of the multiple stack algorithm (MSA). It is found that the nerv bidirectional multiple stack algorithm (BMSA) offers substantial advantages over the MSA in terms of computational effort, memory requirements, and error performance. The BMSA appears as an attractive alternative to the Viterbi algorithm (VA) where low error probabilities and high decoding speeds are required.
A branching process analysis in random environment is presented for bounding the average number of computations of sequential decoding over a finite state channel. Closed-form expressions applicable to specific cases ...
详细信息
A branching process analysis in random environment is presented for bounding the average number of computations of sequential decoding over a finite state channel. Closed-form expressions applicable to specific cases are derived and evaluated. These unique bounds substantially reduce the need for lengthy simulations.
In this paper, we propose a parallel stack algorithm for MIMO detection to reduce memory and achieve high throughput. Through partitioning the global stack into multiple local stacks and assigning them to each non-lea...
详细信息
ISBN:
(纸本)9781467362382
In this paper, we propose a parallel stack algorithm for MIMO detection to reduce memory and achieve high throughput. Through partitioning the global stack into multiple local stacks and assigning them to each non-leaf layer of the tree, the proposed algorithm performs the best-first strategy on all stacks in parallel. The parallel processing reduces the iteration loops per detection, and the node pruning rule and the leaf enumeration method help decrease the total stack size. Moreover, a Dual-term APP approach is designed for the proposed algorithm to improve BER performance without extra iteration loops. The simulation results demonstrate that the proposed algorithm reduces the minimum required stack size and the average number of iteration loops per detection of advanced stack algorithm by 50% and 30% respectively to achieve the same BER performance with STS-SD for a 4x4 64QAM MIMO system.
This paper presents a reduced-complexity soft-input softoutput parallel stack algorithm (SISO-PSA) for multiple-input multiple-output (MIMO) wireless communication systems employing Turbo iterative processing at the r...
详细信息
ISBN:
(纸本)9783662458150;9783662458143
This paper presents a reduced-complexity soft-input softoutput parallel stack algorithm (SISO-PSA) for multiple-input multiple-output (MIMO) wireless communication systems employing Turbo iterative processing at the receiver. The proposed algorithm incorporates hybrid enumeration and a modified tree pruning criterion to support soft-inputs, which results in significant computational complexity saving. Moreover, a leaf enumeration scheme is proposed to reduce the number of expanded leaf nodes. In addition, the parallelism at algorithm level provides high throughput while reduces area compared to hardware level parallelism, which is very suitable for VLSI implementation. The simulation results show that the proposed algorithm can achieve better performance than SISO K-Best algorithm (K=50) and SISO-FSD with 60% memory saving and significantly reduced computational complexity in terms of the number of visited nodes in a 4x4 64QAM MIMO system.
Multiple input multiple output (MIMO) systems could increase wireless communication system capacity enormously. The best optimal detection algorithm for MIMO systems was maximum likelihood (ML) detection algorithm, wh...
详细信息
ISBN:
(纸本)9783037857502
Multiple input multiple output (MIMO) systems could increase wireless communication system capacity enormously. The best optimal detection algorithm for MIMO systems was maximum likelihood (ML) detection algorithm, which could provide the best bit error rate (BER) performance for MIMO systems. However, the computational complexity of ML detection algorithm grew exponentially with the number of transmit antennas and the order of modulation, which resulted in difficult using for practice. A modified MIMO signal detection algorithm which combined ML detection with stack algorithm was presented in this paper. After performing QR decomposition of the channel matrix, the ML detection with length L was done firstly. The partial accumulated metrics were calculated and sorted, which produced an ordered set secondly. Based on the ordered set, stack algorithm was performed to search for the symbol with the minimum accumulated metrics. The proposed algorithm reduced the probability of look back in stack algorithm.
stack algorithm (SA) has been proved to be the most efficient one among the existing sphere decoding algorithms, although it needs a large amount of time-consuming comparisons. In this paper, a pruning stack algorithm...
详细信息
ISBN:
(纸本)9781424414482
stack algorithm (SA) has been proved to be the most efficient one among the existing sphere decoding algorithms, although it needs a large amount of time-consuming comparisons. In this paper, a pruning stack algorithm (PSA) is proposed to decrease the size of the border node list in SA by. statistical pruning. With a proper configuration, a good tradeoff is achieved between the performance and complexity. For high order modulations, PSA is able to reduce the number of comparisons by at least 30% as compared to SA without much penalty of the performance.
The use of multiple antennas at both transmitter and receiver can increase wireless communication system capacity enormously. The optimal detection algorithm for MIMO system is Maximum likelihood detection (MLD) algor...
详细信息
ISBN:
(纸本)9783642181337
The use of multiple antennas at both transmitter and receiver can increase wireless communication system capacity enormously. The optimal detection algorithm for MIMO system is Maximum likelihood detection (MLD) algorithm, which provides the best bit error rate (BER) performance for MIMO system. However, the computational complexity of MLD algorithm grows exponentially with the number of transmit antennas and the order of modulation. An improved MIMO detection algorithm which combined M-algorithm with stack algorithm was presented in this paper. The proposed algorithm was a multistage detection which was consisted with three parts: MLD, M-algorithm and stack algorithm. In MIMO communication system with in transmit antennas, after performing QR decomposition of the channel matrix, the MLD with length L was done firstly. The partial accumulated metrics were calculated and sorted, which produced an ordered set. Then selecting the first M partial symbol vectors to form a new ordered set. Based on the new ordered set, stack algorithm was performed to search for the symbols with the minimum accumulated metrics. The proposed algorithm combining M algorithm and stack algorithm reduced numbers of ordering with the original stack algorithm, the probability of look back and improving the detection performance.
Using multiple antennas at the transmitter and receiver,multiple-input multiple-output(MIMO) system can increase wireless communication system capacity *** optimal detection algorithm for MIMO system was Maximum likel...
详细信息
Using multiple antennas at the transmitter and receiver,multiple-input multiple-output(MIMO) system can increase wireless communication system capacity *** optimal detection algorithm for MIMO system was Maximum likelihood detection(MLD) algorithm,which could provide the best bit error rate(BER) performance for MIMO ***,the computational complexity of MLD algorithm grew exponentially with the number of transmit antennas and the order of modulation,which resulted in difficult using for practice.A modified MIMO signal detection algorithm which combined MLD with stack algorithm was presented in this *** MIMO communication system with M transmit antennas,after performing QR decomposition of the channel matrix,the MLD with length L was done *** partial accumulated metrics were calculated and sorted,which produced an ordered set *** on the ordered set,stack algorithm was performed to search for the symbols with the minimum accumulated *** proposed algorithm reduced numbers of ordering with the original stack algorithm and reduced the probability of look back.
A computationally efficient soft-output detector with lattice-reduction (LR) for the multiple-input multiple-output (MIMO) systems is *** the proposed scheme,the sorted QR decomposition is applied on the lattice-reduc...
详细信息
A computationally efficient soft-output detector with lattice-reduction (LR) for the multiple-input multiple-output (MIMO) systems is *** the proposed scheme,the sorted QR decomposition is applied on the lattice-reduced equivalent channel to obtain the tree *** the aid of the boundary control,the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced *** proposed soft-output algorithm achieves near-optimal performanca in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.
暂无评论