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.
Multiuser detection can be implemented at the sink of a sensor network to receive the various signals of its sensor nodes. This is a viable approach as long as the number of sensor nodes is small. In case of many nodes, decoding can be considered technically infeasible, but assuming low transmission activities, the sparse nature of the sensor signals can be utilized. In this paper, we propose a sphere...
Time and frequency synchronisation are significant parts of the cell-search procedure and one of the first processing blocks within a mobile communication system. Particularly for an OFDM transmission within an initial synchronisation process, the algorithm has to deal with carrier frequency offsets up to several subcarrier spacings. To be able to still operate under those conditions, the cell-search...
The use of Orthogonal Frequency Division Multiplex (OFDM) modulation has become increasingly important for actual and future mobile communication systems [1]. Within this scope, Carrier Frequency Offset (CFO) compensation is indispensable [2]. Its underlying algorithm requires the calculation of trigonometric functions, which is difficult to achieve by hardware implementation in general. In this paper...
Due to the Multiple Input Multiple Output technology, applied in wireless communication, where a transceiver has to deal with multidimensional channels, the QR-decomposition is an often used preprocessing algorithm, especially for the design of iterative tree search detection algorithms. In this paper we introduce an efficient FPGA implementation of a QR-decomposition algorithm, which is designed...
To meet the requirements of modern, high throughput communication systems, like the 3GPP Long Term Evolution, which aims to achieve a peak throughput of 100 Mbit/s in the downlink and 50 Mbit/s in the uplink, MIMO is a key technology. Therefore, efficient MIMO detection algorithms have become of major interest. Iterative tree-search detectors offer a good trade-off between the computational complexity...
Iterative tree search algorithms like K-Best or sphere decoder algorithms are promising candidates for the upcoming wireless communications systems. In this paper a square root and division free Givens rotation (SDFG) algorithm is merged into a common sphere decoder algorithm to decrease the entire complexity. Furthermore, the algorithm is speeded up due to parallelizing the computation by taking...
Synchronization is a major topic in OFDM. Small remaining timing offsets, which are less than the cyclic prefix, are commonly compensated by the equalizer in the receiver. Therefore, separate detection and compensation of the timing offset, especially the fractional timing offset is not mandatory. Considering a reciprocal communication system, i.e., the uplink channel is assumed to be equal to the...
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.