Dear Researchers,
The overall cost of "my algorithm" is dominated by finding orthogonal basis, which costs (M p.^2) where p is less than M , for the input matrix. My concern is: is there nay alternative method (or low-cost QR decomposition) to find the orthogonal basis with lower cost, please?
Thank you so much for your consideration in advance
Best regards,
Bakhtiar
Dear Bakhtiar Karim,
I suggest you see links on the topic.
https://towardsdatascience.com/can-qr-decomposition-be-actually-faster-schwarz-rutishauser-algorithm-a32c0cde8b9b
https://hal.archives-ouvertes.fr/hal-01927616/file/IEEE%20TNNLS.pdf
https://arxiv.org/pdf/2009.10071.pdf
https://arxiv.org/pdf/2104.06659.pdf
Article Low Complexity QRD-M MIMO Detection Algorithm Based on Adapt...
Best regards
- Badges
- Science topic
- Similar topics
- Biological Science
- Bioecology
- Systems Ecology
- Landscape Ecology
- Connectivity