Comparative study of kernel algorithms on SIMD vector processor for 5G massive MIMO Online publication date: Fri, 15-Nov-2024
by Ravi Sekhar Yarrabothu; Pitchaiah Telagathoti
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 29, No. 2/3, 2024
Abstract: Currently world is moving towards achieving Gigabit data rates via 5G mobile revolution. Massive multi-in-multi-out (MIMO) is one of the key enabler and recently lot of interest is evinced in this area. The efficiency of the algorithms to estimate and detect the channel plays a very crucial role for the success of Massive MIMO. The existing algorithms of LTE-A for this purpose are not efficient in terms of power consumption and lower latency, which is one of the foremost necessity of 5G communications. The biggest hurdle to achieve the ultra-low latency in 5G massive MIMO is - a very huge number of computations required for the matrix inversion while performing channel estimation and detection. In this paper, a comparative study has been done for two parallel processing schemes: Gauss-Jordan elimination and LU decomposition kernel algorithms on a single instruction multiple data (SIMD) stream vector processor for the realisation of matrix inversion with optimum latency, which is the pre-requisite for the 5G channel estimation and detection. In this paper both matrix inversion algorithms Gauss Jordan and LU decomposition are analysed and LU decomposition provides the required level of reduction of computational operations, which translates low latency and less battery power consumption.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com