The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Sphere decoding (SD) is an efficient algorithm which has been proposed in Multiple-input Multiple-output(MIMO) digital communications. Sphere decoding can avoids to search for the element like maximum-likelihood (ML) decoder thus reduces the decoding order of complexity effectively. However, SD also has high complexity in some situations. The complexity of the algorithm are controlled by radius and...
Sphere Detection (SD) method has been used as a powerful mean to find Maximum Likelihood (ML)solution to the detection problem of Multiple-Input Multiple-Output (MIMO) channels with lower complexity. This method searches closest lattice point inside a sphere. This paper discusses the effect of initial radius of the sphere on the complexity and performance of SD in different noise variances, constellation...
In order to further decrease the detection complexity, a joint detection method based on both zero forcing and sphere decoding is proposed. When the signal-to-noise ratio is high enough, such detector results in zero forcing detection, otherwise it subtracts the decoded signals from the receiving signal and then decodes them by sphere decoding algorithm. In the multiple input multiple output LAS-CDMA...
One of the practical challenges of Wireless communications over Multiple-input Multiple-output (MIMO) channels is to reduce the complexity of the decoding algorithm without sacrifice in performance degradation. Geometric decoding (GD) is an emerging technique which can offer substantially lower complexity while maintaining about the same error rate as that of Maximum likelihood (ML) decoding. In this...
This paper proposes a new reduced-complexity joint detection algorithm based on sphere decoder for MIMO LAS-CDMA system. This algorithm can approach ML performance in polynomial complexity. Special zero correlation window property of LAS code can reduce complexity of this algorithm greatly. Simulation indicates it is more insensitive to the choice of initial radius. Thus, by making the choice of radius...
In this paper, we discuss three applications of the QR decomposition algorithm to decoding in a number of Multi-Input Multi-Output (MIMO) systems. In the first application, we propose a new structure for MIMO Sphere Decoding (SD). We show that the new approach achieves 80% reduction in the overall complexity compared to conventional SD for a 2 times 2 system, and almost 50% reduction for the 4 times...
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity trade-off. Unlike the case of maximum-likelihood decoding, in this case, even the perfect lattice space-time codes which have the non-vanishing determinant property can...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.