Abstract
The conventional problem of searching the shortest vector z of a N-dimensional lattice L(H) with generating matrix HisinRNtimesM is considered in a more general setting. There are P generating matrices HiisinRNtimesM(i=1,2,...,P) of the P lattices L(Hi). For a (bounded) integer vector bisinZM , we obtain P lattice points Hib. Let di be the Euclidean norm of Hib. The problem of interest is how to search for a vector b so that the maximum of di is minimized. We propose a new sphere decoder called combinatorial sphere decoder (CSD) to solve this problem. One of the applications of the new CSD is presented in detail to show its effectiveness
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
