Forming method and forming device of P-H multi-dimensional orthogonal matrix
An orthogonal matrix, P-H technology, applied in the field of P-H multi-dimensional orthogonal matrix-like construction devices, can solve the problems of limiting the number of channels and the number of accessible users, achieving good orthogonality, low bit error rate, and simple steps Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0057] This embodiment discloses a device for forming a P-H multidimensional orthogonal matrix, including a P matrix constructor, an H matrix constructor, and a direct product operator. The P matrix constructor generates a matrix P, and the H matrix constructor generates a completely orthogonal The matrix H, the above-mentioned matrix P and matrix H are input into the direct product operator to perform the Kronecker product operation to obtain a multi-dimensional quasi-orthogonal P-H matrix.
[0058] The H matrix is a square matrix composed only of elements "+1" and "-1", and it is also a completely orthogonal matrix, that is, each row (or column) in the matrix is an orthogonal code group, and the lowest The H matrix is of order 2, ie
[0059] The Kronecker product operation is performed on the P matrix and the second-order H matrix, namely:
[0060]
[0061] If the Kronecker product operation is performed on the P matrix and the N-order H matrix, that is
[0062]...
Embodiment 2
[0090] This embodiment discloses a method for forming a P-H multidimensional orthogonal matrix, including the following steps:
[0091] (1) Obtain matrix P and completely orthogonal matrix H, above-mentioned matrix H is Hadamard matrix;
[0092] (2) The above-mentioned matrix P and matrix H are input into the direct product operator to perform Kronecker product operation to obtain a multi-dimensional quasi-orthogonal P-H matrix.
[0093] The steps to obtain the matrix P are as follows:
[0094] (1.1) multiple BCH code original polynomials of the same group are screened, and the original polynomial f obtained by combining the screening is 1 (x), f 2 (x)... f n (x), obtain f(x) sequence: f(x)=F[f 1 (x), f 2 (x)...f n (x)]: For the same group of BCH code primitive polynomials, according to specific requirements, select one or more primitive polynomials, and combine them according to a certain functional relationship F(x) to obtain the combined polynomial f( x)=F[f 1 (x), ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



