A low-complexity space-time keying discrete matrix generation method
A space-time keying and low-complexity technology, which is applied in the field of communication, can solve the problem of high complexity of random search methods and achieve the effect of reducing complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017] Below in conjunction with specific embodiment, further illustrate the present invention. It should be understood that these examples are only used to illustrate the present invention and are not intended to limit the scope of the present invention. In addition, it should be understood that after reading the teachings of the present invention, those skilled in the art can make various changes or modifications to the present invention, and these equivalent forms also fall within the scope defined by the appended claims of the present application.
[0018] A low-complexity space-time keying discrete matrix generation method provided by the present invention first generates a set of discrete data, and then proposes an alternate optimal method to search for the optimal discrete matrix set, the method traverses the generated discrete data , optimize only one piece of data in the discrete matrix set each time, and then optimize the next piece of data on this basis until all th...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


