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.
A modified sphere decoding (SD) scheme is proposed for multiple-input multiple-output (MIMO) communication systems in this paper. The conventional SD goes from the lower dimension to the higher dimension to examine whether a lattice point lies inside the sphere of some radius, which remains fixed for all dimensions. Since the sphere radius directly affects the search range and thus the complexity,...
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...
This paper presents a low power VLSI implementation of a novel Multiple-Input Multiple-Output (MIMO) decoder which combines Fixed Complexity Sphere Decoder (FSD) algorithm, real-valued lattice formulation and Pair-wise sorted QR decomposition (P-SQRD) searching approach to simultaneously improve the throughput, bit error rate (BER) and complexity. Two-stage approximate sorting scheme with minimum...
Sphere Decoding algorithm has been shown to achieve near Maximum Likelihood (ML) performance with low complexity for MIMO communication systems, but still has higher complexity than other suboptimum detectors. Especially at low SNR, the complexity of sphere decoding algorithm gets much higher. In this paper, sphere decoding algorithms combined with other suboptimum detectors are proposed. Pre-estimated...
A fixed-throughput Wiener filter vector precoding (VP) approach specially suitable for hardware implementation in field programable gate array (FPGA) devices is introduced in this paper. The lattice decoding algorithm, which is based on the sphere decoder (SD) lattice search, performs in its first stage a reordering of the matrix to be used for the tree search. Afterwards, the search tree is configured...
Geometric decoding (GD) is a newly proposed decoding technique for multiple-input multiple-output (MIMO) transmission over the fading channels. With a complete search on all symbol vectors in the lattice structure, GD requires about the same decoding complexity to achieve the same optimum block-error rates (BLERs) as that of ML decoding. In this paper, we propose a simple implementation of GD for...
This paper presents a multiple-input multiple-output (MIMO) decoder which combines fixed complexity sphere decoder (FSD) algorithm with a new real-valued lattice formulation to simultaneously improve the throughput, bit error rate (BER), complexity and power. A pair-wise sorted QR decomposition (P-SQRD) approach is also introduced to enhance the lattice searching efficiency and BER while preserving...
In this paper, we proposed a joint design scheme between sphere decoding and user scheduling for multiuser MIMO uplink system. This is a cross layer design scheme which adopt the channel quality information based on user scheduling to reduced the search radius of sphere detector, it leads the better bit error ratio performance and low complexity than conventional sphere detection with fixed search...
There are many maximum likelihood (ML) solutions to the detection problem for multiple-input multiple-output systems (MIMO). Recently, sphere detection (SD) method has been used as a powerful mean to find ML point. This method searches closest lattice point using number theory tools. Several algorithms for SD method were presented and among them, the algorithm II is an efficient one. In different...
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.