WO2010078801A1

WO2010078801A1 - Method for subband/miniband resources permutation, and method for subcarrier/subcarrier group permutation

Info

Publication number: WO2010078801A1
Application number: PCT/CN2009/075802
Authority: WO
Inventors: 刘向宇; 关艳峰; 刘颖
Original assignee: 中国广东省深圳市
Priority date: 2009-01-06
Filing date: 2009-12-21
Publication date: 2010-07-15
Also published as: CN101772033A; CN101772033B

Abstract

A method for subband/miniband resources permutation and a method for subcarrier/subcarrier group permutation are disclosed by the present invention. The method for subband/miniband resources permutation includes: the number of columns of a matrix is determined according to the number of subbands/minibands which need to be permutated and the number of rows of the matrix, or, the number of rows of the matrix is determined according to the number of subbands/minibands which need to be permutated and the number of columns of the matrix; the labels of subbands/minibands which need to be permutated are written into the matrix in turn according to a first predetermined sequence, the remnant elements of the matrix are filled with blanks after all labels of subbands/minibands which need to be permutated have been written into the matrix; the written labels are read in turn from the matrix according to a second predetermined sequence and the blanks are skipped, and the labels read in turn are regard as permutation table to perform the subsequent permutation. The present invention avoids the problem that the memory space is waste due to storage of the primitive root lists and the problem that the permutation sequence can not be generated because of incalculable Reed Solomon (RS) code, and the permutation mode is effectively improved.

Description

TECHNICAL FIELD The present invention relates to the field of communications, and in particular, to a resource subband/4 band replacement method, subcarrier/subcarrier group Replacement method. In a wireless communication system, a base station is a device that provides services for a terminal, and can communicate with a terminal through an uplink/downlink, where downlink refers to a direction from a base station to a terminal, and uplink refers to a direction from a terminal to a base station. . For data transmission, multiple terminals can simultaneously transmit data to the base station through the uplink, or can simultaneously receive data from the base station through the downlink. Generally, in a wireless communication system in which a base station implements radio resource scheduling control, scheduling allocation of system radio resources is performed by a base station. For example, the downlink resource allocation information when the base station performs downlink transmission and the uplink resource allocation information when the terminal performs uplink transmission may be given by the base station. In the currently applied wireless communication system, when scheduling the radio resources of the air interface, the base station usually takes one radio frame as a scheduling period, and divides the radio resources into thousands of radio resource units (for example, one time slot or one codeword). To perform scheduling, the base station may provide data or multimedia services to the terminals it covers by scheduling the radio resource unit during the scheduling period. For example, in a second generation wireless communication system represented by the Global System for Mobile communication (GSM), the base station divides the radio resources at each frequency point into time division multiple access with a period of 4.615 ms. (Time Division Multiple Address, referred to as TDMA) radio frame, each radio frame contains 8 time slots, one time slot can transmit a full rate or two half rate channels, and can also achieve idle data services; In the 2.5-generation wireless communication system represented by the General Packet Radio Service (GPRS), the data traffic rate is increased to 100 kbps or more by introducing fixed-slot-based packet switching; In the third generation wireless communication system represented by Time-Division Synchronization Code Division Multiple Address (TD-SCDMA), the base station also divides the radio resources of the air interface into radio frames with a period of 10 ms, each 10 ms 14 regular time slots and 6 special time slots, which are used to transmit specific services and signaling. On regular time slots, the base station to distinguish between users on different codewords. Orthogonal Frequency Division Multiplexing (OFDM) is used in future wireless communication systems represented by Long Term Evolution (LTE), Ultra Mobile Broadband (UMB), and IEEE 802.16m. Orthogonal Frequency Division Multiplexing (OFDM) and Orthogonal Frequency Division Multiple Address (OFDMA) technology provide technical support for high-speed data and smooth multimedia services, as well as wireless resource management. New requirements were put forward. As the amount of communication traffic increases, the system bandwidth occupied by future wireless communication systems becomes larger and larger, and the continuous large bandwidth will become less and less. At this time, in order to fully utilize the dispersed frequency resources, Future wireless communication systems need to support multi-carrier operation, which will increase the complexity of radio resource mapping. In addition, in order to support terminals of different types or different capabilities, the system needs to support a richer service type. However, different types of services have different requirements for quality of service (QoS) and wireless resource units, for example, the future. There will be a large number of Voice over IP (VoIP) packets and small control messages. How to adapt to these different needs is also a problem to be studied. In addition, the interference is the main factor restricting the development of the wireless communication system. In order to reduce or eliminate the interference, it is necessary to use the interference suppression measures such as Fractional Frequency Reuse (FFR) and the fourth generation of broadband multimedia ( Business such as EMBS), but these measures or services need to be implemented based on the new resource mapping method. In addition, since the channel environment of wireless communication usually changes, and there are many types of resource units, for example, centralized resource units and distributed resource units, how to enable resource mapping to support these features is also the focus of current research. Due to the above-mentioned requirements, traditional radio resource units (such as time slots, or codewords) and their corresponding sub-channelization and resource mapping processes can no longer meet the needs of future wireless communication systems, in order to ensure the spectrum of future wireless communication systems. Efficiency, it is necessary to design a new sub-channelization and resource mapping method for wireless resources. In the current wireless communication system, the conventional mapping method is as follows: In a wireless communication system based on OFDMA technology, a resource mapping process maps physical resources (such as physical subcarriers) into logical resources, for example, mapping physical subcarriers. For a Logical Resource Unit (LRU), the base station implements scheduling of radio resources by scheduling logical resource blocks. The main basis of resource mapping is the frame structure and resource structure of the OFDMA system. The frame structure divides the radio resources into different levels of units in the time domain, such as SuperFrame, Frame, Sub-Frame, and Symbol. For example, as shown in Figure 1, the radio resources are divided into superframes in the time domain, each superframe contains 4 frames, and each frame packet s Sub-frame, the sub-frame is composed of 6 basic OFDMA symbols, and each OFDMA symbol is in the frequency domain.

As shown in FIG. 1 , the actual system determines how many OFDM symbols are included in each level unit in the frame structure according to factors such as the speed, rate, and service type of the terminal to be supported. The resource structure divides the available frequency bands into frequency sub-bands according to factors such as coverage, terminal speed, rate, and service type supported in the frequency domain, and then divides the frequency resources in the frequency sub-band into centralized resource regions and/or Or distributed resource areas for scheduling. In each sub-frame, the entire sub-frame can be divided into corresponding resource units according to the time domain-frequency domain according to all subcarriers and time domain symbols, for example, a physical resource unit (Physical Resource Unit). , abbreviated as PRU). For example, as shown in FIG. 2, 18 carriers, 6 times i or symbols are constituent units of one PRU. In the entire resource mapping process, the available subcarriers of the OFDMA system are divided into n physical resource units (PRUs), and physical resource units (which may be called physical resource units) for n physical resource units. The group or subband (Subband) is a unit replacement operation, and the configuration information of the replaced physical resource unit in the frequency subband is mapped to the continuous resource region and the distributed resource region. All physical resource units in the microband resource area are replaced by N ₂ physical resource units according to system configuration information. The physical resource unit of the replaced microstrip resource region and the resource unit of the sub-band resource region are mapped to different frequency partitions. For each frequency partition, the resource units therein are divided into a continuous resource unit (CRU) and a distributed resource unit (DRU). All distributed resource units in each frequency partition are sub-carrier (subcarrier) (for downlink resource mapping) or Tile (can be understood as carrier group) (for uplink resource mapping), and will be replaced within the distributed resource group. The logical resource unit is replaced by a logical distributed resource unit (LDRU); the logical resource unit in the centralized resource group in each frequency partition is directly mapped to a centralized resource unit ( Logical Localized Resource Unit (LLRU for short); The above process is shown in Figure 3. In a wireless communication system based on OFDMA technology, its radio resource is a two-dimensional time-frequency domain resource composed of time domain symbols and frequency domain subcarriers, that is, the need to consider OFDMA system resource mapping and interference suppression. In the process of resource mapping, it may be necessary to perform multiple transposition operations (ie, the above-mentioned permutation) on resource elements or subcarriers. This transposition operation refers to the location of the original thousands of resource units or subcarriers. Chaos, but does not change the number of corresponding resource units or subcarriers. The permutation operation can be implemented by a permutation sequence (also referred to as a permutation table, in which "permutation sequence" and "permutation table" are treated as equivalent concepts. Generally, permutation sequences contain different, non-repetitive ones. Thousand elements, for example, N numbers from 0 to N-1 (where N is the length of the permutation sequence) can be used to represent the permutation method. The permutation sequence can be a table or can be generated by a formula. Corresponding to a specific permutation method. The input of the permutation is the index of the position of the element in the permutation table (from 0 to the output is the element corresponding to the position of the input in the permutation table. In addition, N numbers from 1 to N can also be used ( Here N is the length of the permutation sequence) to indicate the permutation method. For example, a displacement table of length 7 ί ⁵ ' ⁶ ' ^H ³ ' ² } means that if the input is 0, the permutation output is the number in the table. 0 element 5, if the input is 1, the permutation output is the first element 6 in the table. If the input is 2, the permutation output is the second element 4 in the table. If the input is 3, the permutation output is In the table 3 elements 0, and so on; in addition, the above substitution table can also be expressed as {6,7,5,1,2,4,3}, that is, if the input is L, the permutation output is the ith in the table. Element ₆ , if the input is 2, the permutation output is the second element 7 in the table. If the input is 3, the permutation output is the 3rd element 5 in the table. If the input is 4, the permutation output is in the table. The fourth element 1, and so on. The permutation sequence can be used to transpose thousands of elements (where the number of elements is the same as the length of the permutation sequence). The permutation sequence currently used can be based on the prime domain. The original generated, can also be generated based on Reed-Solomon code, can also be generated by row and column permutation. However, the current replacement methods have the following problems:

(1) Standard row and column permutation cannot be used for many lengths, and when you need to specify the number of rows (or the number of columns), there is no guarantee that the number of replaced elements can divide the specified number of rows (or the number of columns), for example, when When the number of replaced resource subbands / (microstrip) cannot be divisible by the specified number of rows or columns, standard row and column permutation will not be used; (2) If the RS code needs to calculate or find the primitive in the corresponding finite field or calculate (find) the primitive polynomial, use the primitive root on the prime domain to generate the substitution table, then you need to save the original. A root list (containing multiple primitive root elements) or a primitive root polynomial for lookup, wasting a lot of storage space. In view of the poor feasibility of the replacement operation in the related art and the need to occupy additional storage space, an effective solution has not been proposed yet. SUMMARY OF THE INVENTION The present invention has been made in view of the problem that the feasibility of the replacement operation in the related art is poor and that it takes up additional storage space. To this end, the main object of the present invention is to provide a replacement method of a resource subband/microstrip, Carrier/subcarrier group replacement method. According to one aspect of the invention, a resource subband/microstrip replacement method is provided. The resource subband/microstrip replacement method according to the present invention includes: determining the number of columns of the matrix according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, or the number of subbands/microstrips to be replaced according to needs And the number of columns of the matrix determines the number of rows of the matrix; sequentially writes the labels of the subbands/microstrips to be replaced in the first predetermined order in the matrix, after writing all the labels of the subbands/microstrips to be replaced The blank fills the remaining elements in the matrix; the written labels are sequentially read from the matrix in a second predetermined order and the blanks are skipped, and the sequentially read labels are used as replacement tables for subsequent replacement. Wherein, the number of rows of the matrix is determined according to the number of subbands/microstrips to be replaced and the number of columns of the matrix, including: number of rows of the matrix

Where N is the number of subbands/microstrips that need to be replaced, and m is the number of columns in the matrix. And, in the case of determining the number of rows of the matrix according to the number of subbands/microstrips to be replaced and the number of columns of the matrix, the first predetermined order is first from left to right and then from top to bottom, and the second predetermined order is First from top to bottom, then from left to right. The process of writing the label of the sub-band/micro-band to be replaced according to the first predetermined order includes: writing the sub-substitution required at the intersection of the row and the column in the matrix from left to right and back from top to bottom Label with / microstrip. On the other hand, the matrix is determined according to the number of subbands/microstrips to be replaced and the number of rows of the matrix. The number of columns includes: the number of columns of the matrix W where N is the number of subbands/microstrips to be replaced, n is the number of rows of the matrix. And, in the case where the number of columns of the matrix is determined according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, the first predetermined order is first from top to bottom, then from left to right, and the second predetermined order is Start from left to right and back from top to bottom. The processing of writing the label of the sub-band/micro-band to be replaced according to the first predetermined sequence includes: writing the sub-substitution required at the intersection of the row and the column in the matrix from top to bottom and back from left to right Label with / microstrip. According to another aspect of the present invention, a permutation method of a seed carrier/subcarrier group is provided. The permutation method of the subcarrier/subcarrier group of the present invention includes: passing the = c _n _ if the length N of the required permutation sequence satisfies N = 2"-l or N = 2", and n≥l _x Τ + c _n _ ₂ 2 ⁿ ~ ² + · · · + 2 + c ₀ E 13⁄4 [°' ^{2 _1} ] The decimal integer ^χ , where ^C j is 0 or 1 ; and use the "bit binary word (ί ^, ^,···^.;) to represent X, ie,

^ = {c _n c _n _ ₂ ---c _l c ₀ ) ₂ ; Specify the constants a, b, c in the set {1, 2, ··; N-1}, where b, c are positive odd numbers, a is an even number greater than zero; in the case of = ² "-1,

/ (k) = BitReverse ((c -(k + \)-(a-(k + \) + b) mod (N + l))_l)

And {/W'/W'/i ² )'''''/^- ¹ )} as a permutation sequence, where BitReverseO represents the bit inverse sequence operation; in the case of N _{= 2} ", /(A = BitRe _V er _S e(d( _a + 6) modN) , and { WJWJW '''' ^ ^^} as a permutation sequence. According to another aspect of the present invention, a seed carrier/subcarrier group is provided The permutation method of the subcarrier/subcarrier group according to the present invention includes: When the length N satisfies ^^P" ^-1 or W=P", and P is an odd prime number, "is a positive integer, and" ≥ ² , set an integer? , Make? Not equal to P and mutual prime to P- ¹ ;

And {/(G), /(l), /(2), '", /(N_l» as a permutation sequence. According to another aspect of the present invention, a permutation method of a seed carrier/subcarrier group is provided. The replacement method of the subcarrier/subcarrier group according to the present invention includes: if the length N of the required permutation sequence is satisfied, and wherein P is an odd prime number,

{/(0), /(l), /(2), , /(N-2), /(N-1)} are used as the permutation sequence. According to another aspect of the present invention, a permutation method of a seed carrier/subcarrier group is provided. The replacement method of the subcarrier/subcarrier group according to the present invention includes: in the case where the length N of the required permutation sequence satisfies W = P, and wherein P is an odd prime number, /( = ^ ^mGd , where, c is any positive integer that is a prime of Ρ_1;

As a replacement sequence. According to another aspect of the invention, a resource subband/microstrip replacement device is provided. The resource subband/microstrip permutation apparatus according to the present invention includes: a determining module for determining the number of columns of the matrix according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, or subbands to be replaced according to needs / the number of microstrips and the number of columns of the matrix determine the number of rows of the matrix;; a write module for sequentially writing the subband/microstrip labels to be replaced in the first predetermined order in the matrix, After replacing all the sub-bands/microstrips, the remaining elements in the matrix are filled with blanks; the reading module is configured to sequentially read the written labels from the matrix in a second predetermined order and illuminate the blanks, which will be read sequentially. Standard The number is used as a replacement table for subsequent replacement.

According to another aspect of the invention, a permutation device for a seed carrier/subcarrier group is provided. The permutation device of the subcarrier/subcarrier group according to the present invention includes: a representation module for the case where the length N of the required permutation sequence satisfies W = 2" -1 or N = ² ", and "≥ 2 Next, pass ^ = -x 2"" ¹ + ^c "_ ₂ 2" ^_2 + - + c _x 2 + c _{0 to} represent the decimal integer ^{x of the} interval [0, 2" _ 1], where ' is 0 or 1 And use the "bit binary word ( ¹ ' ² '...^ ¹ ^.) to represent X, ie, ^{x =} ( ^c "_i ^c "_2 '" ^c i ^c o) _2; specify the module, connect to the presentation module, Used to specify constants a, b, c in set ² ''"', where b, c are positive odd numbers, a is an even number greater than zero; the first configuration module, connected to the specified module, used in Λ^ ² " In the case of ^-1 , make / (k) = BitReverse ((c -(k + \)-(a-(k + \) + b) mod (N + l))_l) first determining module, connected to a first configuration module, configured to use {/(0), /(l), /(2), '", /(N_l as a permutation sequence, where BitReverseO represents a bit inverse sequence operation; a second configuration module, connected to specifying module, for the case where ² = "make / {k) = BitReverse (c -k- ak + mod N). the second Given module, connected to the second configuration module, for ^{i W 'W' i 2)} '''''^ - 1)} as a permutation sequence. According to another aspect of the invention, a permutation device for a seed carrier/subcarrier group is provided. A permutation apparatus for a subcarrier/subcarrier group according to the present invention includes: a configuration module for satisfying W = P" ^_1 or W = P" at a length of a required permutation sequence, and wherein P is an odd prime, In the case of a positive integer and "≥ ² , set an integer?, so that ? is not equal to P and is mutually prime with P- ¹ ;

a determining module for using "^(o)^ ¹ )^ ² )'''''^^ ¹ )} as a permutation sequence. According to another aspect of the present invention, a permutation of a seed carrier/subcarrier group is provided The apparatus for replacing a subcarrier/subcarrier group according to the present invention includes: a configuration module, configured to: when a length N of a required permutation sequence satisfies W = P ^_1 , and wherein P is an odd prime number,

The determining module is configured to use ^^ ¹ )^ ² ) '...' ^ — ² ) ' ^—^ as the permutation sequence. According to another aspect of the invention, a permutation device for a seed carrier/subcarrier group is provided. A permutation apparatus for a subcarrier/subcarrier group according to the present invention includes: a configuration module for causing f{k) = in a case where a length of a required permutation sequence N m ^N=p , and wherein p is an odd prime number k ^c moAp ^ where c is any positive integer with the prime; a determination module for using , 'J )^J, , J ^_ as the permutation sequence. With the above technical solution of the present invention, by filling the blank in the mapping matrix, the replacement can be performed by means of a similar determinant in the case where the specified sequence length cannot divide the number of rows or columns of the matrix. By redefining the acquisition method of the permutation sequence, the problem of wasted storage space due to the storage of the original list (polynomial) and the inability to calculate the RS code and the generation of the permutation sequence due to the lack of sequence length are avoided, and the improvement is effectively improved. The replacement method. The drawings described herein are provided to provide a further understanding of the invention and constitute a part of this application. The illustrative embodiments of the present invention and the description thereof are intended to explain the present invention and are not intended to limit the invention. 1 is a schematic diagram of radio resource partitioning according to the related art; FIG. 2 is a schematic diagram of physical resource unit partitioning on the carrier shown in FIG. 1 in the related art; FIG. 3 is a resource in an embodiment of the present invention; FIG. 4 is a flowchart of a resource subband/microstrip replacement method according to Embodiment 1 of the present invention; FIG. 5 is an example of a resource subband label in the embodiment of the present invention. Figure 6 is a schematic diagram of a processing example 1 of a resource sub-band/microstrip replacement method according to the first embodiment of the method of the present invention; Figure 7 is a resource sub-band/microstrip according to the first embodiment of the method of the present invention. FIG. 8 is a schematic diagram of another example of a resource sub-band label in the embodiment of the present invention; FIG. 9 is a resource sub-band/microstrip according to the first embodiment of the method of the present invention. Schematic diagram of a processing example 3 of a replacement method; FIG. 10 is a schematic diagram showing still another example of a resource sub-band label according to an embodiment of the present invention; FIG. 11 is a resource sub-band/microstrip according to the first embodiment of the method of the present invention. Replacement side FIG. 12 is a schematic diagram showing still another example of a resource sub-band label according to an embodiment of the present invention; FIG. 13 is a resource sub-band/microstrip according to the first embodiment of the method of the present invention. FIG. 14 is a schematic diagram of a processing example 6 of a resource subband/microstrip replacement method according to the first embodiment of the method of the present invention; FIG. 15 is a second embodiment of the method according to the present invention. Flowchart of a permutation method for a carrier/subcarrier group; FIG. 16 is a flowchart of a method for replacing a carrier/subcarrier group according to Embodiment 3 of the method of the present invention; FIG. 17 is a flowchart of a method for replacing a carrier/subcarrier group according to Embodiment 4 of the method of the present invention; 18 is a flowchart of a method for replacing a carrier/subcarrier group according to Embodiment 5 of the method of the present invention; FIG. 19 is a block diagram of a resource subband/microstrip replacement device according to Embodiment 1 of the present invention; Figure 20 is a block diagram of a permutation apparatus for a carrier/subcarrier group according to Embodiment 2 of the apparatus of the present invention; Figure 21 is a block diagram of a permutation apparatus for a carrier/subcarrier group according to Embodiment 2 of the apparatus of the present invention; A block diagram of a permutation device for a carrier/subcarrier group according to a third embodiment of the apparatus of the present invention; and FIG. 23 is a block diagram of a permutation device for a carrier/subcarrier group according to Embodiment 4 of the apparatus of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The problem is that the feasibility of the permutation operation in the related art is poor, and the problem of occupying additional storage space is required. The present invention does not divide the number of rows of the matrix in the specified sequence length by filling the blank in the mapping matrix. In the case of the number of columns, the replacement can be performed by means of standard determinant substitution, and the acquisition mode of the replacement sequence is redefined, thereby avoiding waste of storage space due to storage of the original list, and failure to calculate RS due to the sequence length not meeting the requirements. The code in turn cannot generate a replacement sequence. 3 is a flow chart of a resource mapping method according to the present invention. As shown in FIG. 3, the resource mapping method according to the present invention may include step S31, step S32, step S33, step S34, step S35, and step S36: Step S31, first, the available bandwidth in the OFDMA system, according to the system Configuration, partitioning resource units, subdivided into granular sub-bands, which are then replaced by a resource unit sub-band. Step S32, the resource unit after sub-band replacement is divided into different resource regions (continuous resource region and distributed resource region); Step S33, the resource unit of the distributed resource region passes the resource microstrip mapping with granularity ^Ν ι The continuous resources are directly mapped; in step S34, all resource units are re-divided into frequency partitions; step S35, in each frequency partition, logical partial resource units (LLRUs) and logically distributed resource units (LDRUs) are divided; step S36 In each frequency partition, subcarrier (group)/Tile level replacement is performed on all logical distributed resource units in the partition, and the logical centralized resource unit is directly mapped. The replacement processing in Fig. 3 will be described in detail below with reference to the accompanying drawings. First, the replacement method of the resource subband/microstrip in Fig. 3 will be described. Method Embodiment 1 In this embodiment, a resource subband/microstrip replacement method is provided. In the replacement of resource unit subbands and microstrips, standard row and column permutation can usually be used, but in the case where the number of rows or column number w is specified, if the number of subbands/(microstrips) to be replaced is N, When divisible or "w", the standard matrix form of the sub-band and the start-band sequence is generated, which will result in the failure of the existing standard row-column replacement. This problem can be solved according to the method of the embodiment. As shown in FIG. 4, the resource subband/microstrip replacement method according to the present embodiment includes step S402, step 4 aggregation S404, and step 4 aggregation S406. The specific processing procedure shown in FIG. 4 is as follows: Step S402, determining the number of columns or rows of the matrix according to the number of subbands/microstrips to be replaced and the number of rows or columns of the matrix; that is, the row of the given matrix In the case of a number, the number of columns of the matrix is determined; in the case where the number of columns of the matrix is given, the number of rows of the matrix is determined; and in step S404, the subbands to be replaced are sequentially written in the matrix in the first predetermined order/ The label of the microstrip, after filling all the labels of the subband/microstrip that need to be replaced, fill in the remaining matrix with blanks. Element; Step S406, sequentially reading the written label from the matrix in a second predetermined order and omitting the blank, and using the sequentially read label as a permutation table for subsequent replacement. On the one hand, in the case where the number of columns of the matrix is specified, if the number of replaced resource subbands/(microstrips) is equal to and ^ cannot be divisible by the specified number of columns, then n can be made to be the minimum positive not less than Integer, in the order of "from left to right, then from top to bottom", write 0, 1, 2, "., N-1 in the order of the rows in the row, TM column. Specifically, in the process of writing, 0 can be filled in the intersection of the first row and the first column, and 1 is filled in the intersection of the first row and the second column, ..., and finally Fill in the intersection of the first row and the third column, then fill in the intersection of the second row and the first column, fill + 1 into the intersection of the second row and the second column, and fill in the second row. The intersection with the third column, ..., the remaining "last row of the row" _ N column matrix element is left blank. After that, all the elements are read out in columns according to the order from top to bottom and back to left. Specifically, element 0 of the intersection of the first column and the first row is read first, element ∞ of the intersection of the second row of the first row is read for the second time, and the third row of the third row is read for the third time. Location element

² , ......, the element " ^x " at the intersection of the "first read first column" line, "the first + + read the element 1 of the intersection of the first row of the second column, the first" the next element of the matrix is read out after the ² + intersecting position of the second column of the second row ^{+ 1,} ......, if they are blank, the blank is skipped, directly reads the blank in this order The ordered elements whose elements are read by the above method directly constitute the required permutation table (or referred to as a permutation sequence), and the resource subband/(microstrip) can be replaced by the permutation table in subsequent processing. The above process can be implemented equivalently using a method such as a mathematical formula or a lookup table. For example, a permutation based on the above principle can also be implemented using the following mathematical formula. And the number of rows and columns can be a default value. Suppose the number of columns is m, the number of rows Is n, and the number of subbands/microstrips that are replaced N, here N

n: N>m-(n-\), then the subband with the label A before the permutation / the label of the microstrip after the replacement j m

Is m + , ifNmodw≡ 0 or < N mod m

7 = if k-N mod m k _ N modrn

m k - N oAm + modn else n-l n-\ The processing of obtaining a permutation sequence in the case of specifying the number of matrix columns will be described below with reference to Examples 1 to 5. Example 1 As shown in Figure 5, there are N = 7 resource subbands, and the labels are 0, 1, 2, 3, 4, 5, 6, respectively.

N

When you specify the number of columns in the matrix m = 3, you can get the number of rows in the matrix ": 3, then you can m

Generate a matrix of w columns "rows (3 rows and 3 columns), and fill the matrix with integers 0, 1, 2, 3, 4, 5, 6 in order from left to right and back to top. In the middle, get the following matrix:

(Q \ 2

3 4 5

6 5 5 B in the above matrix means blank, then read the order from top to bottom and back to left, then read 0, 3, 6 first, then read 1, 4, after reading 4 After encountering a blank, skipping the blank, directly reading 2, 5, and thus obtaining the permutation sequence {0, 3, 6, 1, 4, 2, 5}, and then using the permutation sequence to mark the above as 0,1 The resource subbands of 2, 3, 4, 5, and 6 are replaced, as shown in Fig. 6, the new positions of the resource subbands can be obtained: 0, 3, 6, 1, 4, 2, 5. Example 2 In this example, assume that there are N = 7 resource subbands, as shown in Figure 5, the labels are N

0,1,2,3,4,5,6 , the number of columns of the specified matrix m = 4, then the number of rows of the matrix is 2, so m

The matrix of the column w rows (2 rows and 4 columns) can be obtained, and then the integers 0, 1, 2, 3, 4, 5, 6 are filled in the matrix in order from left to right and then from top to bottom. , get the following matrix:

The Β in the above matrix represents blank, and then in the order of reading from top to bottom, left to right, first read 0, 4, then read 1, 5, then read 2, 6, and finally read 3, Thus obtaining a permutation sequence

{0, 4, 1, 5, 2, 6, 3}, by using the permutation sequence, the resource elements with the above-mentioned labels 0, 1, 2, 3, 4, 5, 6 can be replaced, as shown in FIG. , you can get the resource subband with a new location: 0,4,1,5,2,6,3. Example 3 In this example, as shown in Figure 8, assume that there are N = 9 resource microbands, the labels are

N

0,1,2,3,4,5,6,7,8 , the number of columns of the specified matrix m = 4 , the number of rows of the matrix ": 3 m m

歹'J «The row of rows (3 rows and 4 columns), then fill in the integers 0, 1, 2, 3, 4, 5, 6, 7, 8 in order from left to right and back to top. Into the matrix, the following matrix is obtained:

The Β in the above matrix represents blank, and then reads 0, 4, 8 first, then reads 1, 5, and then reads blanks after reading 5, in order of reading from top to bottom and then from left to right. Skip this blank, read 2, 6 , after reading 6 and encounter blank, then read 3, 7 , thus getting the permutation sequence {0, 4, 8, 1, 5, 2, 6, 3, 7} Then, the replacement sequence can be used to replace the resource band with the labels 0, 1, 2, 3, 4, 5, 6, 7, 8 as shown in FIG. 9, and the resource can be opened to a new location. : 0,4,8,1,5,2,6,3,7. Example 4 In this example, as shown in FIG. 10, it is assumed that there are N=10 resource microstrips with the following numbers, which are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 respectively. Specify the number of columns in the matrix m = 4, the number of rows in the matrix

V

n = 3 , which can produce a matrix of rows (3 rows and 4 columns), and then integers 0, 1, 2, 3, 4, 5, in order from left m right and back to top down. 6, 7, 8, and 9 are filled in the matrix to obtain the following matrix:

(0 \ 2 3

4 5 6 7

8 9 5 5 B in the above matrix means blank, then read the order from top to bottom and back to left, then read 0, 4, 8 first, then read 1, 5, 9, read After 9 encountered a blank, skip the blank, read 2,6, after reading 6 encountered blank, skip blank, then read 3,7, thus get the replacement sequence

{0,4,8,1,5,9,2,6,3,7}, after which the replacement sequence can be used to mark the above number as

The resource microstrips of 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 are replaced, as shown in Figure 11, the new location of the resource microstrip can be obtained: 0, 4, 8, 1, 5 , 9, 2, 6, 3, 7 „ Example 5 In this embodiment, as shown in FIG. 12, there are N = 13 resource microstrips, and the labels are 0, 1, 2, 3, 4, 5 respectively. ,6,7,8,9,10,11,12 , the number of columns of the specified matrix m = 4, the number of rows of the matrix

N

n■■ : 4 , by jt匕 can generate the matrix of the row (4 rows and 4 columns), then the integers 0,1,2,3,4 in the order from the left m right and the back from top to bottom. , 5, 6, 7, 8, 9, 10, 11, 12 are filled in the matrix to obtain the following matrix:

B in the above matrix represents a blank, and then reads 0, 4, 8, 12 first, then reads 1, 5, 9, and then reads 9 after reading the order from top to bottom and back to left. Encountered blank, skipped the blank, read 2,6,10, read blank after reading 10, skip blank, then read 3,7,11, thus get the permutation sequence {0,4,8, 12,1,5,9,2,6,10,3,7,11}, then the permutation sequence can be used to label the above as

The resource microstrips of 0,1,2,3,4,5,6,7,8,9,10,11,12 are replaced, as shown in Figure 13, the resource can be opened to a new location: 0,4 , 8, 12, 1, 5, 9, 2, 6, 10, 3, 7, 11. On the other hand, in the case where the number of rows of the matrix is specified, and the number of replaced resource subbands/microstrips cannot be divisible, let ∞ be the smallest positive integer not less than, first from top to bottom, After the order from left to right, in a matrix of rows and columns, sequentially write 0, 1, 2, . , N-1 in columns. Specifically, in the process of writing, 0 is filled in the intersection of the first row and the first column, that is, 1 is filled in the intersection of the second row and the first column, ..., will be "- ¹ Fill in the intersection of the first row and the first column, and fill in the intersection of the first row and the second column, and fill the intersection of the second row and the second column with + 1 , and " + ² Fill in the intersection of the third row and the second column, ..., and finally leave the matrix element of the last "_^ row of the remaining third column blank. After that, all the elements are read out in the order from left to right and from top to bottom. Specifically, the element 0 at the intersection of the first column and the first row is read first, and the element at the intersection of the first row of the second row is read out for the second time, and the first row of the third row is read for the third time. Element ^{2 of the} intersection position, "..., the element of the intersection of the first row and the first column is read for the first time", and the element 1 of the intersection of the first column of the second row is read for the +1st time, the first + ² times read the element of the intersection of the second row and the second column " + ¹ , ..., if the blank is encountered, skip the blank and read directly in the above reading order Taking the next matrix element of the blank, the ordered elements read by the above processing can directly constitute the required permutation table (permutation sequence), and then the resource subband/microstrip can be replaced by the permutation table. The process of determining the permutation sequence and performing the permutation in the case of specifying the number of matrix rows will be described below with reference to Example 6. Example 6 In this example, as shown in Figure 5, assume that there are N = 7 resource microbands, respectively

N

0,1,2,3,4,5,6, specify the number of rows in the matrix w = 3, then the number of columns in the matrix ^ = =3, so that n

To generate a matrix of rows (3 rows and 3 columns), then fill the matrix with integers 0, 1, 2, 3, 4, 5, 6 in order from top to bottom and back to left. , get the matrix below:

B in the above matrix represents a blank, and then reads 0, 3, 5 first, then reads 1, 4, 6 and then 2, in order of reading from left to right and then from top to bottom. Replacement sequence

{0,3,5,1,4,6,2}, the replacement sequence is used to replace the resources of the above-mentioned labels 0, 1, 2, 3, 4, 5, 6 as shown in FIG. , you can get the resource to bring a new location: 0,3,5,1,4,6,2. By means of the above processing, simple and convenient replacement can be performed within various distance ranges, and the standard row-column replacement method is effectively supplemented, and at the same time, good distance characteristics like row-column replacement are ensured. Next, the replacement method of the subcarrier (group) / tile in Fig. 3 will be described. In the subcarrier (group) / tile replacement, when you need to use a permutation sequence of length ^^^一¹ (where P ^{= 2} m ( ⁿ \ or an odd prime, "a positive integer"), usually Use ^ on

The RS code generates a permutation sequence. However, in the case of using this method, in order to ensure that the RS code can be constructed, it must be targeted The above calculation either finds a primitive element on a finite field ^(^), or calculates

(the sub-primitive polynomial, if using a computational method to find a finite field) or the "secondary polynomial" on the above, not only the complex detection process, but also the prime factorization of ^ ¹ - ¹ . If you use a pre-tabulation method, you need to target a different P,", store a lot

The primitive element on the top or the "secondary polynomial" on it leads to the consumption of memory space. In addition, in the process of actually calculating the RS code, the operation on the finite field is also required. However, ^ ^{Ν =} Ρ ^η ( "≥ 1), because the length of the constructor of the ^^ code will not match, resulting in the inability to directly generate the permutation sequence. In response to these problems, the method according to the second embodiment of the present invention gives an effective method and solution according to a third embodiment, the two embodiments described in detail in Example ¹ below ^. Method Embodiment 2 In this embodiment, a replacement method of a seed carrier/subcarrier group is provided. As shown in FIG. 15, the replacement method of the subcarrier/subcarrier group in this embodiment includes step S1502 and step S1504. The specific processing procedure shown in FIG. 15 is as follows: Step S1502: Perform a decimal representation on the permutation sequence, and perform a binary representation on the result of the decimal representation; Step S1504, perform a bit reverse order operation according to the sequence of the binary representation, and use the sequence after the operation as a permutation sequence. Specifically, when the length N of the required permutation sequence satisfies Λ^ ² "- ¹ or = ² "("≥ ² ), all the decimal integers in the interval [ ^Q , ^{2 _1} ] can use a "bit" at this time. A long binary word is used, that is, any ^Xe [ ^Q ' ² " ^_1 ] can be expressed as X = c _n 2"- + c _n _ ₂ 2"- ^z + · · · + 2 + c _n Among them, any 'takes a value of 0 or 1, after which, use the "bit binary word ^_ ₁ , ^_ ₂ , -„. ;) to represent X, that is, Χ = (^_Α_ ₂ ··· ί^.) ₂ . That is, at X = {c _n -, _n _ ₂ · · · c, c ₀ ) ₂ = (c _n _, 2" - ¹ + c _n _ ₂ 2" _ ² + ... + _Cl 2 + c. In the case of BitReverse (x) = (c ₀ c _x - - - ο _η _ ₂ ο _η _ _λ = (c ₀ 2 ⁿ + c _x 2"" ² + · · · + c _n _ ₂ 2 + c _n _ _x , where BitReverse ( x ) indicates the bit reverse order operation. At this time, three constants a, b, and c can be specified, all of which are in the set, and are positive odd numbers, "is an even number greater than zero; If Ν = 2 ^η -\ , make 2, ···, N- 1} , where, where c-{k + results for N

+ l modulo; if W ^{= 2} ", tf{k) = BitReverse (c -k-(ak + b) mod N); will {/(0), /(l), /(2), ,/ (Nl is the finally obtained permutation sequence. Alternatively, when implementing the method according to the present embodiment, the permutation sequence may be saved, or only the method of acquiring the permutation sequence may be saved, and in the case of saving the acquisition method, k may be used as Variable input, you can get the output f ( k ). When the length of the sequence being replaced is N = 2 ⁿ , or N = 2 ⁿ - 1, it is generally based on the primitive root on the finite field GF(2 ⁿ ) Sequence (RS code sequence) A method of permutation, but the main disadvantage of this method is the same as before, and it is necessary to pre-store (or temporarily calculate) the primitive root on GF(2 ⁿ ), or pre-store (or temporarily calculate) GF. (2) The primitive polynomial on the top, at the same time, the arithmetic efficiency on the calculation of GF(2 ⁿ ) on a common general-purpose CPU or embedded CPU is not high. If the look-up table method is used, then the storage space will be very wasted. the method of the present embodiment uses, may be substituted for the sequence length N = 2 ^n, or N = 2 ⁿ - 1 To achieve fast permutation, the method only needs to specify a corresponding even number a and two odd numbers b, c in the integer interval [1, N-1] to achieve permutation, and the odd number b, c can even be specified as 1 In order to increase the calculation speed. The method described in this embodiment only has the modulo 2 ⁿ addition, the modulo 2 ⁿ Multiplication and bit string inversion, suitable for general-purpose / embedded CPU instructions, can achieve fast replacement. In the present embodiment, when N = 2", c · Α · (the result of the calculation of α + mod N is still an n-bit string, but the nonlinearity of the n-bit string is different. The characteristic calculated by mod 2 ⁿ can be known that the least significant bit has the worst nonlinearity, and the most significant bit has the strongest nonlinearity, wherein the generation of the most significant bit depends on the parameters a, b, c, k. The JL is all low-order bits, we use the bit string inversion operation to ensure the lowest degree of non-linearity of thousands. The following will be combined with the sub-carrier/sub-carrier group replacement method according to the present embodiment. Description Example 7 Assuming that a permutation sequence of length 32 is required in subcarrier/subcarrier group permutation, the number between [ ^Q , ^{3 1} ] can be represented by a 5-bit word, so the selected word length 5, BitReverse(x) means to perform bit reverse sorting on a 5-bit long word, taking "=4, b=3, c=7, and

At this point you can get the following replacement sequence:

With the processing according to the present embodiment, it is possible to avoid the problem that the storage space is consumed due to the large amount of stored primitive roots, and the problem that the replacement sequence cannot be directly generated due to the inability to match the length of the construction method of the ^^ code. Method Embodiment 3 In this embodiment, a replacement method of a seed carrier/subcarrier group is provided. As shown in FIG. 16, the permutation of the subcarrier/subcarrier group in this embodiment includes step S1602 and step S1604. The specific processing shown in Figure 16 is as follows: Step S1602: In the case where the length N of the required permutation sequence satisfies W = P" ^_1 or W = P", and P is an odd prime number, "is a positive integer, and" ^{≥ 2} , an integer is set? , Make? Not equal to P and reciprocal with P- ¹ ; make f(k) formula (1)

In step S1604, {/(0), /(l), /(2), ..., /(N_l)} is taken as a replacement sequence. among them, ? Can be taken directly as a prime number greater than P. Preferably, when it is necessary to obtain different permutation sequences for different A", the exact same ? can be used, and only a simple prime is needed at this time, so that it is larger than all Ps in the different P, " Just fine. A replacement method of the subcarrier/subcarrier group according to the present embodiment will be described below with reference to Example 8. Example 8 In this example, it is assumed that a permutation sequence of length 7 ² = 49 is required in the subcarrier (group) /Tile permutation, and = 11 can be selected and

Then the replacement sequence is:

42, 1,39,12, 2, 17,27,35, 29, 46, 26, 16, 24, 6, 28, 8,

< 4, 40, 30, 31, 34, 21, 36, 11, 5, 44, 38, 13, 14, 15, 18, 19,

9, 45, 41, 7, 43, 25, 33, 23, 3, 20, 0, 22, 32, 47, 37, 10, 48 Alternatively, when the method according to the embodiment is implemented, the replacement can be saved The sequence may also save only the method of acquiring the permutation sequence. When the acquisition method is saved, k can be input as a variable, and the output f ( k ) can be obtained. With the processing according to the present embodiment, it is possible to avoid the problem that the storage space is consumed due to the large amount of stored primitive roots, and the problem that the replacement sequence cannot be directly generated due to the inability to match the length of the construction method of the ^^ code. In addition, in the subcarrier (group) /Tile replacement, some replacement sequences of different lengths will be used. When the length of the replaced resource unit is equal to and ^{+ 1 =} P is an odd prime number, according to the related art, it is necessary to first Find a primitive root of the prime number P, and then follow the order = m. Dp)-l method, resulting

For example, when the displacement length is 16, 16 + 1 = 17 is an odd prime number. At present, the method of obtaining the original talent can be a temporary calculation or a table lookup. For example, a table primitive can be found by searching the table, _B rr-3 , , , - , . _αη Λ = 0,1,2,·· ·, 15 _& . _ , . , 艮, and thus follow

, , , , get the replacement table:

{0, 2, 8, 9, 12, 4, 14, 10, 15, 13, 7, 6, 3, 11, 1, 5} However, the method of temporary calculation or finding the original root in the related art cannot Suitable for all application scenarios. For example, in a scenario where the length of the replacement often changes, it is necessary to find or temporarily calculate the original root for each different length ^ (where ^{+ 1 =} Ρ is an odd prime, the same below), which needs to be stored at this time. All the permutation tables of different lengths, or all primitive roots of different lengths, are stored in the device, which will take up a lot of memory space. The above method can be solved by the method embodiment 4 and the method embodiment 5 which will be described below. Method Embodiment 4 In this embodiment, a replacement method of a seed carrier/subcarrier group is provided. As shown in FIG. 17, the replacement method of the carrier/subcarrier group in this embodiment includes the steps.

S1702 and step S1702. The specific processing procedure shown in FIG. 17 is as follows: Step S1702, the length N of the required permutation sequence satisfies ^{7 V =} P ^_1 , and wherein P is odd : ((t + l ^_1 mod(N + l))-l

In the case of a prime number, make , , ^} '! ; in step S1704, {/(0), /(l), /(2),..., /(N_2), /(N_l)} as a permutation sequence. , ^{(+ 1)} represents _ ^{+ 1)} th 1, ^{(+ 1)} ^MOD _ ^{(+ 1)} ⁺ represents a result of ¹⁾ the power N_ mod N + 1. A replacement method of the subcarrier/subcarrier group according to the present embodiment will be described below with reference to Example 9. Example 9 Assuming that a permutation sequence of length N = 37 - 1 = 36 is needed in the subcarrier (group) /Tile permutation, then ( ) ^mod ( ³⁷ )) ^_1 ₅ can now obtain the following permutation sequence:

By the processing according to the present embodiment, a method of acquiring a permutation sequence is proposed, which avoids the problem of occupying memory space due to storing the primitive root in the memory. Method Embodiment 5 As shown in FIG. 18, the replacement method of the carrier/subcarrier group in this embodiment includes step S 1802 and step S 1802. The specific processing procedure shown in FIG. 18 is as follows: Step S1802, in the case where the length N of the required permutation sequence satisfies ⁼ , and where P is an odd prime number, /( = ^ ^mGd , where c is a mutual prime Any positive integer; Step S1804, {/(0), /(1), /(2), ···, /(ρ-1 is used as a permutation sequence. Preferably, c can directly select a prime number greater than Ρ And, when needed for different Ρ When obtaining different permutation sequences, you can use the exact same c. In this case, you only need to take a prime number q so that it is larger than all the above p. The method according to the present embodiment will be described below with reference to Example 10. Example 10 Assuming that a permutation sequence of length = P = ⁵³ is required in the subcarrier (group) /Tile permutation, then c = ⁵ is selected, so that /( ⁼ ^ mGd , the following permutation sequence can be obtained:

0, 1, 32, 31, 17, 51, 38, 6, 14, 7, 42, 37, 50, 28, 33, 44, 24, 40, ~

< 12, 45, 19, 27, 18, 23, 10, 4, 48, 5, 49, 43, 30, 35, 26, 34, 8, 41, >

13, 29, 9, 20, 25, 3, 16, 11, 46, 39, 47, 15, 2, 36, 22, 21, 52 By the processing according to the present embodiment, a method of acquiring a permutation sequence is proposed, avoiding The problem of occupying memory space due to storing the primitive root in the memory. Apparatus Embodiment 1 In this embodiment, a resource subband/microstrip permutation apparatus is provided for performing permutation processing of a carrier/subcarrier group in the flow shown in FIG. As shown in FIG. 19, the replacement of the resource subband/microstrip according to the present embodiment includes: a determination module 192, a write module 194, and a read module 196. The function of each module in the apparatus shown in FIG. 19 is as follows: a determining module 192, configured to determine the number of columns or rows of the matrix according to the number of subbands/microstrips to be replaced and the number of matrix rows or columns, that is, The number of subbands/microstrips to be replaced and the number of rows of the matrix determine the number of columns of the matrix, or the number of rows of the matrix is determined according to the number of subbands/microstrips to be replaced and the number of columns of the matrix; Connected to the determining module 192, for sequentially writing the label of the sub-band/microstrip to be replaced in the first predetermined order in the matrix, and filling the matrix with the blank after writing all the labels of the sub-band/micro-band to be replaced The remaining elements in the reading module 196 are connected to the writing module 194 for sequentially reading the written labels from the matrix in a second predetermined order and skipping the blanks, and using the sequentially read labels as a permutation table. Subsequent placement Change. The apparatus according to the present embodiment can complete the processing procedures described in the examples 1 to 6, and the specific processing thereof will not be repeated here. With the apparatus according to the present embodiment, it is possible to perform simple and convenient replacement within various distance ranges, effectively complementing the manner of standard row and column replacement, and at the same time ensuring good distance characteristics similar to row and column permutation. Apparatus Embodiment 2 In this embodiment, a seed carrier/subcarrier group permutation apparatus is provided for performing permutation processing of a carrier/subcarrier group in the flow shown in FIG. As shown in FIG. 20, the replacement device of the subcarrier/subcarrier group according to this embodiment includes: a representation module 201, a designation module 202, a first configuration module 203, a first determination module 204, a second configuration module 205, and a second The module 206 is determined. The functions of the respective modules in the apparatus shown in Fig. 20 are as follows: The representation module 201 is configured to pass the JC:^ in the case where the length N of the required permutation sequence satisfies W = 2"_l or N = 2 and "≥2"^^"— ¹ †^^^"— ² †" ^^†^.

The decimal integer X of [ ^Q ' ² " ^_1 ] , where ' is 0 or _1; and is represented by a bit binary word (^—^^,...^.;!, ie, x = {c _n _,c _n _ ₂ --c _l c ₀ ) ₂ ; a specifying module 202, connected to the representation module 201, for specifying the constants a, b, c in the set {1, 2, ···, N-1}, wherein b, c is a positive odd number, a is an even number greater than zero; the first configuration module 203 is connected to the designated module 202, for the case of Λ^ ² "- ¹

/ (k) = BitReverse ((c - (k + \) - (a - (k + \) + b) mod (N + l)) - l) , the first determining module 204 is connected to the first configuration module 203 For {/(0), /(l), /(2), '", /(N_l)} as a permutation sequence, where BitReverse() represents a bit inverse sequence operation; a second configuration module 205, connected to the designation module 202 , in the case of = ² ", make = BitReverse {ck-{ak + mod N); the second determining module 206 is connected to the second configuration module 205 for

{/(0), /(l), /(2), ..., /(N_l)} as a permutation sequence. The apparatus according to the present embodiment is capable of performing the processing of the example 7 and implementing the permutation of the carrier/subcarrier group. With the apparatus according to the present embodiment, it is possible to avoid the problem of storage space consumption due to a large amount of stored primitive roots, and to avoid the problem that the replacement sequence cannot be directly generated due to the inability to match the length of the construction method of the RS code. Apparatus Embodiment 3 In this embodiment, a seed carrier/subcarrier group permutation apparatus is provided for performing permutation processing of a carrier/subcarrier group in the flow shown in FIG. As shown in FIG. 21, the replacement device of the subcarrier/subcarrier group in this embodiment includes: a configuration module 212 and a determination module 214. The functions of the various modules in the apparatus shown in Figure 21 are as follows: Configuration module 212, for satisfying the length N of the required permutation sequence ⁼ Ρ" ^_1 or ^N = and where P is an odd prime, "is a positive integer and" ≥ ² In the case of setting an integer ?, so that q is not equal to P and is mutually prime with P- ¹ ;

(p"~ ^l (^-l)-^)niod p", if A:≡ 0 mod p

k ^q mod p" , else

Make The determination module 214 is coupled to the configuration module 212 for using i ⁰ ) ' ! ¹ ) ' ! ² ) '-' ^- ¹ )} as a permutation sequence. The apparatus according to the present embodiment can perform the processing of the example 8 and implement the permutation of the carrier/subcarrier group. With the apparatus according to the present embodiment, it is possible to avoid the problem of storage space consumption due to a large amount of stored primitive roots, and to avoid the problem that the replacement sequence cannot be directly generated due to the inability to match the length of the construction method of the code. Apparatus Embodiment 4 In this embodiment, a seed carrier/subcarrier group permutation apparatus is provided for performing permutation processing of a carrier/subcarrier group in the flow shown in FIG. As shown in FIG. 22, the replacement device of the subcarrier/subcarrier group according to this embodiment includes: a configuration module 222, and a determination module 224. The functions of the various modules in the apparatus shown in Figure 22 are as follows: The configuration module 222 is configured to satisfy the W = P ^_1 at the length N of the required permutation sequence, and wherein

" + ^ , f(k) = l(k + if" ¹ mod (N + 1)) - 1

When P is an odd prime number, make ; , ) "; determination module 224 , and connect to configuration module 222 for {/(0), /(1), /(2), ···, /^ _2), /^_1 as a permutation sequence. The apparatus according to the present embodiment can perform the processing of the example 9 and implement the permutation of the carrier/subcarrier group. With the apparatus according to the embodiment, it is possible to avoid the storage of the primitive due to the large amount The root causes the problem of storage space consumption, and avoids the problem that the replacement method cannot be directly generated due to the length of the construction method of the ^^ code. Device Embodiment 5 In this embodiment, a seed carrier/subcarrier group is provided. Displacement device, for performing 3 Displacement processing of carrier/subcarrier groups in the illustrated flow. As shown in FIG. 23, the replacement device of the subcarrier/subcarrier group according to this embodiment includes: a configuration module 232, and a determination module 234. The configuration module 232 is configured to enable /(=^ ^mGd , where c is any positive integer with the prime, if the length N of the required permutation sequence satisfies ^{7 V} = P, and wherein P is an odd prime number; The determining module 234 is coupled to the configuration module 232 for using i ⁰ ) ' ^) ' ^) '-' ^ ^-1 )} as a permutation sequence. The apparatus according to the present embodiment is capable of performing the processing of the example 10 and implementing the permutation of the carrier/subcarrier group. With the apparatus according to the present embodiment, it is possible to avoid the problem of storage space consumption due to a large amount of stored primitive roots, and to avoid the problem that the replacement sequence cannot be directly generated due to the inability to match the length of the construction method of the code. In summary, by means of the technical solution of the present invention, by filling the blank in the mapping matrix, it is possible to replace the standard determinant by a standard determinant in the case where the specified sequence length cannot divide the number of rows or columns of the matrix. By performing the permutation, the method of re-defining the acquisition of the permutation sequence avoids the waste of storage space due to the storage of the original list (polynomial), and the inability to calculate the RS code and thus the replacement sequence due to the insufficiency of the sequence length. The problem is that the replacement method is improved, so that the replacement method can adapt to various needs of future wireless communication systems. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or they may be Multiple modules or steps are made into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Where in the invention ^" God and Within the principles, any modifications, equivalent substitutions, improvements, etc., are intended to be included within the scope of the present invention.

Claims

1 A resource subband/microstrip replacement method, comprising:

Determining the number of columns of the matrix according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, or determining the matrix according to the number of subbands/microstrips to be replaced and the number of columns of the matrix Number of lines;

Write the label of the sub-band/microstrip to be replaced sequentially in the matrix in a first predetermined order, and fill the matrix with blank after writing all the labels of the sub-band/micro-band to be replaced Remaining elements in ;

The written marks are sequentially read from the matrix in a second predetermined order and the blanks are skipped, and the labels sequentially read are used as replacement tables for subsequent replacement.

2. The method according to claim 1, wherein determining the number of rows of the matrix according to the number of subbands/microstrips to be replaced and the number of columns of the matrix comprises:

The number of rows of the matrix

Where N is the number of subbands/microstrips that need to be replaced, and m is the number of columns of the matrix.

3. The method according to claim 1, wherein, in the case where the number of rows of the matrix is determined according to the number of subbands/microstrips to be replaced and the number of columns of the matrix, the first The predetermined order is from left to right and from top to bottom, and the second predetermined order is from top to bottom and then from left to right.

4. The method according to claim 3, wherein - the processing of writing the label of the sub-band/microstrip to be replaced according to the first predetermined order comprises:

The label of the sub-band/microstrip to be replaced is written at the intersection of the row and the column in the matrix from left to right and back from top to bottom. The method according to claim 1, wherein determining the number of columns of the matrix according to the number of subbands/microstrips to be replaced and the number of rows of the matrix comprises: a number of columns of the matrix, wherein N is the sub-band/micro n that needs to be replaced

The number of bands, n is the number of rows of the matrix.

6. The method according to claim 1, wherein, in the case where the number of columns of the matrix is determined according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, the first predetermined The order is first from top to bottom and then from left to right. The second predetermined order is from left to right and from top to bottom.

7. The method of claim 6, wherein - the processing of writing the label of the sub-band/microstrip to be replaced according to the first predetermined order comprises:

The label of the sub-band/microstrip to be replaced is written at the intersection of the row and the column in the matrix from top to bottom and back to left.

A method for replacing a subcarrier/subcarrier group, comprising: passing a length N of a required permutation sequence that satisfies W = ² "^-1" or N = ² ", and "≥ ² " ^ ^+ ^^+...+ ^^ + ^ denotes the decimal integer ^{x of the} interval ^' ^{2 _1} ] , where ' is 0 or 1; and uses the bit binary word ^, ^^, ...^. ;) to represent X, ie, Χ = (^_Α_ _{2 -} ί^ ₀ ) ₂ ; specify the constants a, b, c in the set {1, 2, ···, N-1}, where b, c Is a positive odd number, a is an even number greater than zero;

In the case of N = ² "_l, make

/ (k) = BitReverse ((c -(k + \)-(a-(k + \) + b) mod (N + l))_l) , and {/(0), /(l), /(2), '", /(N_l)} as a permutation sequence, where BitReverse() represents a bit inverse sequence operation;

In the case of N = ² ", let f [k, = BitReverse {ck-{ak + b) mod N) , and put {/(0), /(1), /(2), , /^_1 As a replacement sequence.

Replacing 9. A method of sub-carriers / sub-carriers, characterized in that, comprising: Ν meet ^{= Ρ} length desired replacement sequence of ^"_1 or ^{= Ρ",} and wherein P is an odd prime number, "is a positive integer and" In the case of ≥ ² , set the integer to make? Not equal to P and mutual prime;

And {/(0), /(1), /(2), , /^_1 is used as the replacement sequence. A method for replacing a subcarrier/subcarrier group, comprising: if a length N of a required permutation sequence satisfies W = P ^_1 , and wherein P is an odd prime number,

; {/(0), /(l), /(2), /(N_2), /(N_l as the permutation sequence.

11. A method for permuting a subcarrier/subcarrier group, comprising: causing /(= ϋ , where the length N of the required permutation sequence satisfies W = P, and wherein P is an odd prime number , c is any positive integer with the prime;

As a replacement sequence.

12. A resource subband/microstrip replacement device, comprising:

a determining module, configured to determine a number of columns of the matrix according to the number of subbands/microstrips to be replaced and the number of rows of the matrix, or according to the number of subbands/microstrips to be replaced and the columns of the matrix Number determining the number of rows of the matrix;

a writing module, configured to sequentially write, in the matrix, the label of the sub-band/microstrip to be replaced in a first predetermined order, after writing all the labels of the sub-band/micro-band to be replaced Filling in the remaining elements of the matrix with blanks;

And a reading module, configured to sequentially read the written label from the matrix in a second predetermined order and skip the blank, and use the label sequentially read as a permutation table for subsequent replacement.

13. A subcarrier/subcarrier group permutation apparatus, comprising: a representation module, configured to: when a length N of a required permutation sequence satisfies = ² "-1 or N = 2 and "≥ 2" , by ^ ^^+ ^^+...+ ^^ + ^. Representation interval

a decimal integer X of L ' , where ' is 0 or 1; and is represented by a bit binary word (^—^^,...^.;!, ie, x = {c _n _, c _n _ ₂ - -c,c ₀ ) ₂ ; a specifying module, connected to the representation module, for specifying constants a, b, c in the set {1, 2, ···, N-1}, wherein b, c are positive odd numbers, and a is an even number greater than zero a first configuration module, connected to the designated module, for use in the case of Λ^ ² " ^-1

/ (k) = BitReverse ((c - (k + \) - (a - (k + \) + b) mod (N + l)) - l), the first determining module, connected to the first configuration module , for {/(0), /(l), /(2),.", /(N-1 as a permutation sequence, where BitReverseO represents bit reverse order 歹¹ J operation; second configuration module, connected to The specifying module is configured to enable /{k) = BitReverse (c -k- ak + mod N) in the case of = ² "; a second determining module, connected to the second configuration module, for {/(0), /(l), /(2), ..., /(N_l)} as a permutation sequence. A subcarrier/subcarrier group permutation apparatus, comprising: a configuration module, configured to satisfy a length N of a required permutation sequence

Or N =

And where P is an odd prime number, "is a positive integer and "≥ ² ", set an integer? , Make? Not equal to P and mutual prime to P- ¹ ;

Mod p", ifA:≡0mod 7

Let [k ^q mod p" , else determine the module, for {/(0), /(l), /(2), . , /(N_l as a permutation sequence. A subcarrier/subcarrier group permutation device And characterized by comprising: a configuration module, configured to satisfy a length N of the required permutation sequence, W = P ^_1 , and wherein

" + ^ , f(k) = l(k + if" ¹ mod (N + 1)) - 1

When P is an odd prime number, make ; , , , ;

A determination module is used to use {/(0), /(l), /( ² ), ., /(N_ ² ), /(N_l)} as a permutation sequence.

16. A replacement device for a seed carrier/subcarrier group, comprising: a configuration module for using /( = ^ ^mGd , where c is any positive integer with the prime, in the case where the length N of the desired permutation sequence satisfies ^{7 V =} P, and where P is an odd prime number; Module,