CN117769035B

CN117769035B - Data processing method and device for physical downlink shared channel

Info

Publication number: CN117769035B
Application number: CN202410186900.3A
Authority: CN
Inventors: 黄峥; 罗森; 彭慧佳
Original assignee: Shenzhen Siglent Technologies Co Ltd
Current assignee: Shenzhen Siglent Technologies Co Ltd
Priority date: 2024-02-20
Filing date: 2024-02-20
Publication date: 2024-05-07
Anticipated expiration: 2044-02-20
Also published as: CN117769035A

Abstract

The present application relates to a data processing method and apparatus for a Physical Downlink Shared Channel (PDSCH). A data processing method for PDSCH, comprising: acquiring a target Resource Element (RE) index array; excluding indexes of REs unavailable to PDSCH from the target RE index array to obtain an available RE index array; determining a first RE index array for demodulation reference signals (DMRS) from available RE index arrays and obtaining corresponding DMRS data; determining a second RE index array for a phase tracking reference signal (PT-RS) from among available RE index arrays and obtaining corresponding PT-RS data; excluding index elements in the first RE index array and the second RE index array from the available RE index arrays to obtain a third RE index array for payload data; obtaining load data based on the number of elements in the third RE index array; and sequentially mapping the DMRS data, the PT-RS data and the load data to REs corresponding to index elements in the first RE index array, the second RE index array and the third RE index array respectively.

Description

Data processing method and device for physical downlink shared channel

Technical Field

The present application relates to mobile communications, and in particular, to a data processing method and apparatus for a physical downlink shared channel.

Background

Regarding the physical downlink shared channel (Physical Downlink SHARED CHANNEL, PDSCH) in the New Radio (NR) protocol, the existing NR protocol specifies the overall processing flow of data, including data generation, processing, mapping, etc., but the prior art does not disclose specific implementations, especially those lacking reserved resource avoidance in PDSCH data mapping. In addition, the prior art generally introduces reserved Resource avoidance in units of Resource Blocks (RBs), and there is no relation in how reserved resources in units of Resource Elements (REs) are handled.

Accordingly, there is a need for an improved data processing method for PDSCH.

Disclosure of Invention

The application provides a data processing method and device for a physical downlink shared channel in order to solve the problems.

According to a first aspect of the present application, an embodiment provides a data processing method for a physical downlink shared channel, including:

Acquiring an index array of target resource elements to which the data of the physical downlink shared channel is mapped;

excluding indexes of resource elements which are unavailable to the physical downlink shared channel from a target resource element index array to obtain an available resource element index array of the physical downlink shared channel;

Determining a first resource element index array for demodulation reference signals from the available resource element index arrays and obtaining demodulation reference signal data corresponding to the first resource element index array;

Determining a second resource element index array for phase tracking reference signals from the available resource element index arrays and obtaining phase tracking reference signal data corresponding to the second resource element index array;

Excluding index elements in the first resource element index array and index elements in the second resource element index array from the available resource element index arrays to obtain a third resource element index array for loading data of the physical downlink shared channel;

based on the number of elements in the third resource element index array, load data of the physical downlink shared channel is obtained;

and mapping the demodulation reference signal data, the phase tracking reference signal data and the load data to resource elements corresponding to index elements in the first resource element index array, the second resource element index array and the third resource element index array respectively in sequence.

In some embodiments, the obtaining the index array of the target resource element to which the data of the physical downlink shared channel is mapped includes:

Acquiring an initial resource element index array, wherein the initial resource element index array is an array formed by indexes of all resource elements allocated to the physical downlink shared channel in a time slot sequentially;

And acquiring a target resource element index array from the initial resource element index array, wherein the target resource element index array is identical to the initial resource element index array under the condition that interleaving operation is not needed, and the target resource element index array is obtained by interleaving the initial resource element index array by using a preset interleaving formula under the condition that interleaving operation is needed.

In some embodiments, the available resource elements of the physical downlink shared channel occupy N symbols, N being a positive integer and less than or equal to the total number of symbols in a slot;

The determining a first resource element index array for demodulation reference signals from the available resource element index arrays and obtaining demodulation reference signal data corresponding to the first resource element index array includes:

Continuously generating first demodulation reference signal data between a minimum resource element index indexed on the symbol and a maximum available resource element index on the symbol according to a preset demodulation reference signal data generation rule for each symbol in the N symbols, and obtaining a resource element index corresponding to the first demodulation reference signal data;

Combining the resource element indexes corresponding to the first demodulation reference signal data on each of the N symbols to obtain a fourth resource element index array corresponding to the demodulation reference signal data on all N symbols;

And acquiring an intersection of the available resource element index array and the fourth resource element index array to obtain the first resource element index array, and obtaining demodulation reference signal data corresponding to the first resource element index array.

In some implementations, before the step of combining the resource element indexes corresponding to the first demodulation reference signal data on each of the N symbols, the method further includes:

And deleting demodulation reference signal data with an index smaller than the minimum available resource element index on each symbol from the first demodulation reference signal data generated for each symbol in the N symbols, so as to reserve the first demodulation reference signal data with the index between the minimum available resource element index and the maximum available resource element index on the symbol and the resource element index corresponding to the reserved first demodulation reference signal data.

In some embodiments, the available resource elements of the physical downlink shared channel occupy N symbols, N being a positive integer and less than or equal to the total number of symbols in a slot; phase tracking reference signal data exists on M symbols in the N symbols, wherein M is an integer and M is more than or equal to 0 and less than or equal to N;

The determining a second resource element index array for phase tracking reference signals from the available resource element index arrays and obtaining phase tracking reference signal data corresponding to the second resource element index array includes:

Continuously generating first phase tracking reference signal data between a minimum resource element index indexed on the symbol and a maximum available resource element index on the symbol according to a preset phase tracking reference signal data generation rule for any one of the M symbols, and obtaining a resource element index corresponding to the first phase tracking reference signal data;

copying first phase tracking reference signal data on any symbol for each of the remaining M-1 symbols to obtain first phase tracking reference signal data on each of the M symbols and obtain a resource element index corresponding to the first phase tracking reference signal data;

Combining the resource element indexes corresponding to the first phase tracking reference signal data on each of the M symbols to obtain a fifth resource element index array corresponding to the phase tracking reference signal data on all the M symbols;

And acquiring an intersection of the available resource element index array and the fifth resource element index array to obtain the second resource element index array, and obtaining phase tracking reference signal data corresponding to the second resource element index array.

In some embodiments, prior to the step of copying the first phase tracking reference signal data on any of the remaining M-1 symbols for each symbol, the method further comprises:

and deleting phase tracking reference signal data with an index smaller than the minimum available resource element index on the symbol from the first phase tracking reference signal data generated for any one of the M symbols, so as to reserve the first phase tracking reference signal data between the minimum available resource element index and the maximum available resource element index on the symbol and the resource element index corresponding to the reserved first phase tracking reference signal data.

And storing only the first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data on any symbol, wherein the stored first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data are used for being read when needed to realize the copying operation, so that the first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data on each symbol in the remaining M-1 symbols are obtained.

Acquiring resource element indexes of demodulation reference signal data which are on the same subcarrier with the phase tracking reference signal data in symbols of the demodulation reference signal data which first appear in the symbol sequence in the N symbols,

Generating first phase tracking reference signal data between a minimum available resource element index and a maximum available resource element index of any one of the M symbols according to demodulation reference signal data and preset phase tracking reference signal data generation rules corresponding to the acquired resource element indexes, and acquiring the resource element index corresponding to the first phase tracking reference signal data;

copying first phase tracking reference signal data on any one symbol aiming at each symbol in the rest M-1 symbols to obtain first phase tracking reference signal data on each symbol in the M symbols and obtain a resource particle index corresponding to the first phase tracking reference signal data;

Combining the resource element indexes corresponding to the first phase tracking reference signal data on each of the M symbols to obtain a sixth resource element index array corresponding to the phase tracking reference signal data on all M symbols;

And acquiring an intersection of the available resource element index array and the sixth resource element index array to obtain the second resource element index array, and obtaining phase tracking reference signal data corresponding to the second resource element index array.

According to a second aspect of the application, an embodiment provides an apparatus comprising:

A memory for storing a program;

And a processor for executing the program to implement the method according to any of the method embodiments above.

According to a third aspect of the present application, an embodiment provides a computer readable storage medium having stored thereon a program executable by a processor to implement the method of any of the above method embodiments.

In the above embodiment, by introducing a Resource Element (RE) index array, the influence caused by the complete change of the mapping from the virtual Resource block (Virtual Resource Block, VRB) to the physical Resource block (Physical Resource Block, PRB) due to the reserved channel/signal occupation can be eliminated, so that the avoidance of Resource reservation in RE units can be better processed, and the forward data mapping process can be realized.

In addition, in some embodiments, in the whole interleaving and mapping process, the condition of interleaving and reservation is abstracted into a unified processing flow by utilizing RE position indexes corresponding to data, so that processing difference is eliminated.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.

Fig. 1 shows a schematic diagram of a Resource Grid (RG) in a New Radio (NR);

fig. 2 shows a schematic diagram of the relationship between frames in NR and RG;

Fig. 3 shows a schematic diagram before and after interleaving physical resource blocks (PhysicalResource Block, PRBs) within a time-frequency resource range of a delimited partial Bandwidth (BWP);

fig. 4 illustrates a data processing method for PDSCH of an embodiment;

Fig. 5 illustrates a data processing method for PDSCH of an embodiment;

Fig. 6 shows a schematic diagram of an apparatus for implementing a data processing method of PDSCH according to an embodiment.

Specific embodiments of the present application have been shown by way of the above drawings and will be described in more detail below. The drawings and the written description are not intended to limit the scope of the inventive concepts in any way, but rather to illustrate the inventive concepts to those skilled in the art by reference to the specific embodiments.

Detailed Description

The application will be described in further detail below with reference to the drawings by means of specific embodiments. Wherein like elements in different embodiments are numbered alike in association. In the following embodiments, numerous specific details are set forth in order to provide a better understanding of the present application. However, one skilled in the art will readily recognize that some of the features may be omitted, or replaced by other elements, materials, or methods in different situations. In some instances, related operations of the present application have not been shown or described in the specification in order to avoid obscuring the core portions of the present application, and may be unnecessary to persons skilled in the art from a detailed description of the related operations, which may be presented in the description and general knowledge of one skilled in the art.

Furthermore, the described features, operations, or characteristics of the description may be combined in any suitable manner in various embodiments. Also, various steps or acts in the method descriptions may be interchanged or modified in a manner apparent to those of ordinary skill in the art. Thus, the various orders in the description and drawings are for clarity of description of only certain embodiments, and are not meant to be required orders unless otherwise indicated.

The numbering of the components itself, e.g. "first", "second", etc., is used herein merely to distinguish between the described objects and does not have any sequential or technical meaning. The term "coupled" as used herein includes both direct and indirect coupling (coupling), unless otherwise indicated.

Regarding a physical downlink shared channel (Physical Downlink SHARED CHANNEL, PDSCH) in a New Radio (NR) protocol, the existing NR protocol specifies an intermediate processing flow of data, including data generation, processing, and mapping, where mapping needs to be mapped to a virtual resource block (Virtual Resource Block, VRB) first and then to a physical resource block (PhysicalResource Block, PRB), and mapping of VRB to PRB has two methods of interleaving and non-interleaving mapping. The non-interleaving mapping is a direct mapping method, which is relatively easy to implement, whereas the interleaving mapping is relatively complex, and particularly, the avoidance of reserved resources in this case is relatively complex.

Regarding interleaving and non-interleaving mapping and reserved resource avoidance in PDSCH, the existing NR protocol specifies an overall flow, but does not disclose technical implementation details, and lacks a specific and complete implementation scheme. The inventors noted that the following inverse implementation scheme exists in the prior art: the conversion of reserved resources in PRBs to VRBs is achieved by a "deinterleaver" and then these deinterleaved Resource Blocks (RBs) are avoided when assigning data. A disadvantage of this implementation is that an additional "deinterleaver" unit needs to be used.

In addition, in the prior art, RB is used as a unit to generally indicate that interleaving needs to be performed, reserved resources need to be avoided, and some reserved resources are used as a unit of Resource Elements (REs), so that no specific implementation scheme is proposed in the prior art for how such reserved resources need to be avoided.

The application introduces the RE index array corresponding to the data, thereby being capable of better processing the reserved resource avoidance taking RE as a unit. In addition, by introducing the RE index array, whether interleaving exists or not and whether resource reservation exists or not can be abstracted into a unified processing method in a forward implementation mode, and processing difference is eliminated.

1. Basic concept

1.1. Resource grid

Fig. 1 shows a schematic diagram of a resource grid (ResourceGrid, RG) in a New Radio (NR). Each column belongs to the same orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) symbol (hereinafter simply referred to as symbol). Each small unit is called a Resource Element (RE), 12 REs on the vertical axis are called a Resource Block (RB), 14 symbols on the horizontal axis are called a slot, and this 12×14 unit is called a Resource Grid (RG). It should be noted that a slot may also contain 12 symbols, which may be dependent on the specific arrangement of the person skilled in the art.

1.2. Frame and resource grid

Fig. 2 shows a schematic diagram of the relationship between frames in NR and Resource Grid (RG). In fig. 2, the left graph shows a frame, the abscissa shows a time slot, the ordinate shows a common Resource Block (Common Resource Block, CRB), the abscissa of this frame contains 20 time slots, and the ordinate contains 10 Resource Blocks (RBs). It should be noted that the 20 slots and 10 resource blocks shown are only examples and that a frame may contain other numbers of slots and resource blocks.

The right diagram in fig. 2 shows an RG, and the left black filled cell is an RG. The right-hand abscissa represents symbols, the ordinate represents subcarriers, wherein 14 symbols are plotted on the abscissa, 12 subcarriers are plotted on the ordinate, each cell represents Resource Element (RE), and 12 REs on the ordinate constitute one RB. It should be noted that the RG may also include 12 symbols in some cases.

The third and tenth rows of the right hand drawing in fig. 2 have Demodulation reference signal (Demodulation REFERENCE SIGNAL, DMRS) data assigned to them, phase-TRACKING REFERENCE SIGNAL, PT-RS data assigned to the first row of vertical hatched cells, and physical downlink shared channel (PhysicalDownlink SHARED CHANNEL, PDSCH) load data assigned to the other black-filled cells. It should be noted that the positions and numbers of DMRS data, PT-RS data, and PDSCH payload data shown in the right figure are only examples, and other numbers and positions of these signals may be contained in the RG. However, after the relevant parameters are predetermined, the positions and data of the DMRS signal, the PT-RS signal are determined in one RG, the positions of the load data of the PDSCH are also determined, and the specific load data is variable.

In addition, it is easily known to those skilled in the art that DMRS data is equally located in each RG in each symbol in one slot, PT-RS data appears at intervals of a pre-configuration, for example, may be separated by one RG, may be separated by two RGs, and so on. A more detailed description of these signals will be referred to below.

1.3. Interleaving map and non-interleaving map

In the mapping from virtual resource blocks (Virtual Resource Block, VRBs) to physical resource blocks (Physical Resource Block, PRBs), there are two mapping methods, interleaved mapping and non-interleaved mapping. The non-interleaving mapping is a direct mapping method, which is not described in detail herein. The interleaving mapping is relatively complex, requiring the following principles to be followed:

(1) Three types of data, namely PDSCH load data, DMRS data and PT-RS data, can exist in the PDSCH, wherein the DMRS data and the PT-RS data are not overlapped, and the load data need to be mapped into the rest VRB;

(2) PDSCH may include PRB ranges that coincide with PRBs and REs occupied by partial channels and signals when resources are allocated, but PDSCH is lower in priority and cannot be mapped onto these PRBs and REs when mapped, which may be referred to as reserved PRBs and reserved REs. When the reserved PRB or RE is encountered, the load data is mapped to the next PRB or RE, and the data mapped to the PRB and RE are discarded by the DMRS and PT-RS data;

(3) The interleaving method of the NR protocol gives an interleaving map of all PRBs within a time-frequency resource range contained in a partial Bandwidth (BWP).

In BWP, since both before and after interleaving are PRBs within the same time-frequency resource range, in order to distinguish between PRBs before and after interleaving, concepts of a source PRB and a destination PRB (or a target PRB) are presented herein, and are used to refer to PRBs before and after interleaving, respectively. A VRB is a virtual contiguous resource composed of source PRBs, a target PRB is an actual PRB, and a reserved PRB position is also a position in the target PRB.

Since the mapping is a mapping between all source PRBs to destination PRBs in BWP, when the destination PRBs are reserved or the PDSCH does not use all BWP, the PRBs available for PDSCH are reduced, but this does not affect the mapping relationship between each source PRB to destination PRB. That is, the source and destination PRBs for the PDSCH are subsets of the source and destination PRBs, respectively, of the corresponding BWP. In addition, since the VRBs are composed of the remaining source PRBs for the PDSCH, the number of VRBs is reduced as compared to those without reservation, and the mapping between the VRBs to the destination PRBs for the PDSCH is also changed.

In addition, it should be noted that, since there is a resource reservation in units of RE, the RB reserved in this section will be described more accurately from the perspective of RE, but the concept of physical resource elements (Physical Resource Element, PRE) and virtual resource elements (Virtual Resource Element, VRE) is not proposed in the NR protocol, so the description in this section is also temporarily from the perspective of PRB and VRB.

Fig. 3 shows schematic diagrams before and after interleaving PRBs in a delimited time-frequency resource range of BWP. Part (a) in fig. 3 is PRBs in BWP before interleaving, where the ordinate indicates a common resource block (Common Resource Block, CRB), the abscissa indicates a slot (slot), BWP is a rectangular range delimited on the abscissa, PDSCH is a certain range divided from inside BWP, the ordinate does not necessarily start from 0, the range of BWP ordinate in the figure is 0-30 RB, and the range of abscissa is 0-20 slots, which are merely examples. In the (a), diagonally filled cells represent time-frequency resources allocated to PDSCH, and vertical and horizontal filled portions represent reserved data of other signals and channels. Specifically, the vertical filled portion represents time-frequency resources reserved for the synchronization broadcast block (SynchronizationSignal/PBCH, SS/PBCH), and the horizontal filled portion represents time-frequency resources reserved for the channel state Information reference signal (CHANNEL STATE Information-REFERENCE SIGNAL, CSI-RS). It should be noted that the number and location of the various signals shown in section (a) are merely examples, and that one skilled in the art may make different settings as desired.

Part (b) in fig. 3 is PRBs in the BWP after interleaving. It can be seen that in a delineated BWP, interleaving will occur over the entire BWP and the ordinate in the entire BWP will be interleaved. When the PDSCH does not occupy PRBs in the entire BWP, as shown in parts (a) and (b) of fig. 3, a case of mapping to other positions after interleaving may occur. For example, 15-21 RB on the ordinate is not allocated to PDSCH before interleaving, whereas these RBs are allocated to PDSCH after interleaving. In contrast, reserved SS/PBCH and CSI-RS refer to the location in the target PRB before and after interleaving. It should be noted that the number and positions of the various signals shown in parts (a) and (b) and the interleaving situation are only examples, and that a person skilled in the art may make different settings as desired.

2. Data processing method for PDSCH

There are 12 Resource Elements (REs) in each RB, which is the actual unit of data mapping. Each RE of a PRB may be allocated an index in the following method embodiments. For example, within the range of REs included in BWP, indexes are sequentially allocated to upper right REs in a longitudinally prioritized manner starting from lower left REs.

Fig. 4 illustrates a data processing method for PDSCH of an embodiment, which may include the following steps.

Step 402: and generating an RE index array A of the range contained in the PDSCH according to the set mapping mode, and obtaining an index array C of the reserved resource. In step 402, the mapping manner is well defined in the NR protocol, and is not within the scope of the present method, and therefore not described in detail herein. Further, the index array a here corresponds to the source PRB of the PDSCH mentioned above, and the array C is an array of indexes of REs reserved by the PDSCH, corresponding to the reserved PRBs and REs mentioned above.

Step 404: and judging whether interleaving operation is performed. Whether or not to perform the interleaving operation is determined by the user according to externally input parameters, which are not within the scope of the present method and will not be described in detail herein.

Step 406: under the condition of interleaving, an interleaving formula (formula source NR protocol TS38.211 7.3.1.6) is used for the array A in step 405 to generate an interleaved index array B, namely mapping from a source PRB of a PDSCH to a target PRB, and under the condition of no interleaving, the array B is equal to the array A, so that the array B is finally obtained under the condition of interleaving operation or no interleaving operation, and the processing flow is unified.

Step 408: the index values present in array C in array B are deleted to obtain the index array i_pdsch of the REs available for PDSCH. This corresponds to the mapping of the target PRBs pointed to by the VRBs mentioned in the foregoing.

Step 410: DMRS data, PT-RS data, and their respective index arrays are generated.

In some embodiments, to generate DMRS data, according to a DMRS data generation rule, DMRS data between a minimum RE index and max (i_pdsch) indexed on each symbol is generated for each symbol, DMRS data d_dmrs on each symbol is finally obtained, and an RE index array i_dmrs corresponding to the d_dmrs is obtained.

Where max (i_pdsch) represents the maximum index element that gets the index array i_pdsch over a certain symbol. The maximum max (i_pdsch) index on the symbol is acquired in order to generate DMRS data. As known to those skilled in the art, DMRS and PT-RS are pseudo-random data, cannot be generated in a jumping manner, and require sequential generation. Therefore, in order to generate the latter data, even if unnecessary data is present in the middle, the middle data must be generated in its entirety. For example, assuming that the RE index element of the index array i_pdsch on a certain symbol is [3, 5, 6], the maximum PDSCH index element on the symbol is 6, and further assuming that the minimum RE index on the symbol is 1, the DMRS data sequence generated for the symbol is [ a, b, c, d, e, f ], and the corresponding index is [1,2, 3, 4, 5, 6]. It is easy to know that the index [1,2, 4] in the index array [1,2, 3, 4, 5, 6] does not belong to the index array i_pdsch, but according to the DMRS data generation rule, in order to generate the DMRS data corresponding to the index 6, the DMRS data corresponding to the index [1,2, 4] must still be generated.

In some embodiments, for DMRS data generated for each symbol, only DMRS data between min (i_pdsch) and max (i_pdsch) indexed on that symbol and its corresponding index are reserved to save storage space.

Where min (i_pdsch) represents the smallest index element over a certain symbol that gets the index array i_pdsch. As described above, the DMRS data is pseudo random data, and the DMRS data generated for each symbol starts from the minimum RE index on the symbol up to the max (i_pdsch) index, but it is actually required that the DMRS data is indexed between the min (i_pdsch) index and the max (i_pdsch) index on the symbol, so that when the min (i_pdsch) is large or both the min (i_pdsch) and the max (i_pdsch) are large, the generated unnecessary DMRS data occupies a large memory space. Accordingly, the generated DMRS data having an index smaller than min (i_pdsch) may be deleted to save storage space. For example, in the above example, the DMRS data required is actually [ c, e, f ], so only the data [ c, d, e, f ] and its corresponding index [3, 4, 5, 6] need be reserved.

It should be noted that only DMRS data having an index smaller than the max (i_pdsch) index on each symbol is generated in the above-described embodiment in order to reduce unnecessary calculation amount and save storage space. However, in some embodiments, all DMRS data on all symbols in a slot may be generated as d_dmrs according to a preset DMRS data generation rule, and an RE index array i_dmrs corresponding to the d_dmrs may be obtained. This way the data processing method for PDSCH of the present application can be implemented as well, which has the disadvantage of increasing the computational and memory load.

Further, other embodiments of generating DMRS data will also readily occur to those skilled in the art. For example, DMRS data is continuously generated for each symbol, and at the same time, whether the index falls in the index array i_pdsch of the REs available for PDSCH is confirmed for each generated DMRS data, if the index falls in the i_pdsch, the DMRS data and the corresponding index thereof are reserved, otherwise, the DMRS data is deleted. Finally, it is only necessary to obtain all DMRS data in the index array i_pdsch of REs whose indexes fall in PDSCH available and obtain their corresponding RE indexes.

Similar to generating DMRS data, in some embodiments, in order to generate PT-RS data, PT-RS data is generated between the minimum RE index and max (i_pdsch) indexed on each symbol according to a PT-RS data generation rule, PT-RS data is finally obtained on each symbol, and an RE index array i_ptrs corresponding to the d_ptrs is obtained. The rules and reasons for generating PT-RS data are similar to those in generating DMRS data, and will not be described again here.

In some embodiments, for PT-RS data generated for each symbol, only PT-RS data indexed between min (i_pdsch) and max (i_pdsch) on that symbol and its corresponding index are reserved to save storage space. The reason why the generated PT-RS data with the index smaller than min (i_pdsch) is deleted is similar to the generation process of the DMRS data above, and will not be described here again.

In some embodiments, since the PT-RS data on each symbol in each slot is the same according to the NR protocol rule, only the PT-RS data on the first symbol containing PT-RS data may be stored, and then PT-RS data on each symbol containing PT-RS data is obtained according to the PT-RS data generation rule and the PT-RS data and the corresponding i_ptrs are finally obtained according to the PT-RS data in the first symbol containing PT-RS data when needed.

For example, referring back to fig. 2, in the RG on the right, each vertical hatched cell in the first row represents PT-RS data, and the PT-RS data in each cell is the same. Therefore, only the PT-RS data on the first symbol can be saved, and then PT-RS data in the remaining cells on the first row can be obtained from the PT-RS data on the first row and the first column when needed. The specific locations at which cells are generated may be determined according to a preset PT-RS data generation rule.

In some embodiments, since PT-RS data on a symbol within a slot is generated using DMRS data on the first symbol within the slot that contains DMRS data (e.g., obtained from a truncation of the corresponding DMRS data), PT-RS data on each symbol is not saved, and only the mapping of the corresponding DMRS data to PT-RS data is saved for obtaining the desired i_ptrs and d_ptrs. Thereby, the storage space can be further saved.

Specifically, referring back to fig. 2, in the RG on the right, PT-RS data in each vertical hatched cell of the first row is generated from the first DMRS data on the same row (i.e., same subcarrier) as it, i.e., from the DMRS data in the first row and the third column. "only save the mapping of the corresponding DMRS data to the PT-RS data" means that only the indexes of the DMRS data in the first row and the third column need to be saved, the corresponding DMRS data can be obtained according to the indexes, and the corresponding PT-RS data can be generated according to the obtained DMRS data. As for which PT-RS data on the RE of which locations can be generated, it can be determined according to a preset PT-RS data generation rule.

It should be noted that only PT-RS data having an index smaller than the max (i_pdsch) index on each symbol is generated in the above-described embodiment in order to reduce unnecessary calculation amount and save storage space. However, in some embodiments, it is also possible to generate all PT-RS data on all symbols within a slot as d_ptrs according to a preset PT-RS data generation rule, and obtain an RE index array i_ptrs corresponding to the d_ptrs. This way the data processing method for PDSCH of the present application can be implemented as well.

Similarly, other embodiments of generating PT-RS data will also occur to those of skill in the art. For example, PT-RS data is continuously generated for each symbol, and for each generated PT-RS data, it is confirmed whether its index falls in the index array i_pdsch of the REs available for PDSCH, if it falls in the i_pdsch, the PT-RS data and its corresponding index are reserved, otherwise, it is deleted. Finally, it is only necessary to obtain all PT-RS data in the index array i_pdsch of REs whose index falls in PDSCH available and obtain its corresponding RE index.

Step 412: the indexes of DMRS and PT-RS in the index array i_pdsch of REs available for PDSCH are acquired and corresponding data thereof is obtained.

Specifically, in some embodiments, the index array i_pdsch and the i_dmrs are intersected to obtain an RE index of the DMRS in the index array i_pdsch of REs available for PDSCH, denoted as i_dmrs ', and DMRS data of a corresponding RE position is obtained, denoted as d_dmrs'; and intersection of the index arrays I_PDSCH and I_PTRS is taken to obtain RE indexes of PT-RS in the index array I_PDSCH of RE available in PDSCH, which are marked as I_PTRS ', and PT-RS data of corresponding RE positions are obtained, which are marked as D_PTRS'.

Step 414: the indexes of the DMRS and the PT-RS are deleted from the index array of RE available by PDSCH to obtain the index of the load of PDSCH.

Specifically, index elements in the arrays i_dmrs ' and i_ptrs ' are deleted from the index array i_pdsch to obtain an index array i_pdsch ', which is the RE index of the payload data of the PDSCH.

Step 416: PDSCH load data is obtained according to the length of the load index.

In some embodiments, after the index of PDSCH load data is obtained, the length of PDSCH load data that can be carried in this slot may be determined to be len (i_pdsch '), where len (i_pdsch ') represents the length of the obtained index array i_pdsch '. Then, a Pseudo-Noise (PN) sequence is generated according to a protocol by using a previously stored random number seed pn_init, and PDSCH load data D_PDSCH with a data length of len (I_PDSCH') is finally obtained through scrambling, modulation, layer mapping and antenna port mapping, and a new pn_init is stored for ensuring the continuity of PDSCH data generated subsequently. It is specifically noted that the original data source of PDSCH payload data is transmitted from an upper layer. It is also noted that more specific contents concerning the load data are not important to the present application, and a more specific description of these contents is omitted in order to avoid that these contents may obscure the gist of the present application.

Step 418: and mapping PDSCH load data, DMRS data and PT-RS data to REs corresponding to the respective indexes.

In some embodiments, PDSCH payload data d_pdsch is mapped sequentially onto REs corresponding to respective indices in the index array i_pdsch ', DMRS data d_dmrs ' is mapped sequentially onto REs corresponding to respective indices in the index array i_dmrs ', and PT-RS data d_ptrs ' is mapped sequentially onto REs corresponding to respective indices in the index array i_ptrs '.

Step 420: judging whether the data is generated completely, if the data which is not generated exists in the frame, jumping to a starting step to generate new data of one time slot, and if the data of the next frame is generated, jumping to the starting step to generate the data of the next frame.

In the above embodiment, a forward interleaving and mapping manner conforming to the NR protocol rule is adopted, where the indexes of all REs allocated to the PDSCH are interleaved to obtain corresponding RE indexes, and the RE indexes of reserved resources are avoided when data is assigned, so that an additional "deinterleaver" unit is not required.

In addition, through the above embodiment, the RE index array corresponding to the data is introduced, so that the influence caused by complete change of VRB mapping due to other channel/signal reservations is eliminated, and the processing flows of different mapping types and interleaving or not are combined.

Fig. 5 illustrates a data processing method for PDSCH of an embodiment, which includes the following steps.

Step 502: and acquiring an index array of the target RE to which the data of the PDSCH is mapped.

Step 504: indexes of REs unavailable to the PDSCH are excluded from the target RE index array to obtain an available RE index array of the PDSCH, wherein the REs unavailable to the PDSCH may refer to REs reserved for other channels and/or signals, for example, REs reserved for synchronized broadcast blocks and/or channel state information reference signals, and so on.

Step 506: and determining a first RE index array for the DMRS from the available RE index arrays and obtaining the DMRS data corresponding to the first RE index array.

Step 508: and determining a second RE index array for PT-RS from the available RE index arrays and obtaining PT-RS data corresponding to the second RE index array.

Step 510: the index elements in the first RE index array and the index elements in the second RE index array are excluded from the available RE index arrays to obtain a third RE index array for payload data of the PDSCH.

Step 512: and acquiring load data of the PDSCH based on the number of elements in the third RE index array.

Step 514: and sequentially mapping the DMRS data, the PT-RS data and the load data to REs corresponding to index elements in the first RE index array, the second RE index array and the third RE index array respectively.

In some embodiments, acquiring an index array of a target RE to which data of a PDSCH is to be mapped includes: acquiring an initial RE index array, wherein the initial RE index array is an array sequentially formed by indexes of all REs allocated to a PDSCH in a time slot; and acquiring a target RE index array from the initial RE index array, wherein the target RE index array is equal to the initial RE index array under the condition that the interleaving operation is not needed, and the target RE index array is obtained by interleaving the initial RE index array by using a preset interleaving formula under the condition that the interleaving operation is needed. Whether interleaving is performed or not may be determined by those skilled in the art according to circumstances using preset parameters, and the preset interleaving formula may be derived from 3GPP (Third Generation Partnership Project: third generation partnership project) TS38.211 7.3.1.6, which are outside the scope of the present discussion and are not described herein.

In some embodiments, available REs of PDSCH occupy N symbols, N being a positive integer and less than or equal to the total number of symbols within a slot; determining a first RE index array for DMRS from the available RE index arrays and obtaining DMRS data corresponding to the first RE index array may include: for each symbol in the N symbols, continuously generating first DMRS data between a minimum RE index on the symbol and a maximum available RE index on the symbol according to a preset DMRS data generation rule, and obtaining RE indexes corresponding to the first DMRS data; combining RE indexes corresponding to the first DMRS data on each of the N symbols to obtain a fourth RE index array corresponding to the DMRS data on all the N symbols; and acquiring an intersection of the available RE index array and the fourth RE index array to obtain a first RE index array, and obtaining the DMRS data corresponding to the first RE index array. Wherein, the maximum available RE index on the symbol may refer to the maximum RE index of the available RE index array on the symbol.

As known to those skilled in the art, one slot may include 12 or 14 symbols, which may be determined according to a preset. Assuming that there are 14 symbols in a slot, one skilled in the art can allocate N of them for PDSCH, N being less than or equal to 14. In addition, similar to symbols, one skilled in the art can also specify which slots and RBs to allocate for PDSCH.

In some embodiments, before the step of combining the RE indexes corresponding to the first DMRS data on each of the N symbols, the method may further include: and deleting the DMRS data with the index smaller than the minimum available RE index on each symbol from the first DMRS data generated for each symbol in the N symbols, so as to reserve the first DMRS data with the index between the minimum available RE index and the maximum available RE index on the symbol and the RE index corresponding to the reserved first DMRS data. Wherein, the minimum available RE index on the symbol may refer to the minimum RE index of the available RE index array on the symbol.

As described above, DMRS data having an index smaller than the minimum available RE index on each symbol may be unnecessary, and thus, may be deleted to save storage space.

Furthermore, as known to those skilled in the art, in the above embodiment, only DMRS data with an index smaller than the maximum available RE index on each symbol is generated in order to save computation amount and storage space, however, DMRS data with an index larger than the maximum available RE index on each symbol may also be generated, and finally, as long as all DMRS data with an index falling in the index array i_pdsch of the REs available for PDSCH and its corresponding RE index can be obtained.

In some embodiments, available REs of PDSCH may occupy N symbols, N being a positive integer and less than or equal to the total number of symbols within a slot; PT-RS data can exist on M symbols in N symbols, wherein M is an integer and 0.ltoreq.M.ltoreq.N; determining a second RE index array for PT-RS from the available RE index arrays and obtaining PT-RS data corresponding to the second RE index array, wherein the method comprises the following steps: continuously generating first PT-RS data between a minimum RE index indexed on any one of M symbols and a maximum available RE index indexed on the symbol according to a preset PT-RS data generation rule, and acquiring RE indexes corresponding to the first PT-RS data; copying the first PT-RS data on any symbol aiming at each symbol in the rest M-1 symbols to obtain the first PT-RS data on each symbol in the M symbols and obtain an RE index corresponding to the first PT-RS data; combining RE indexes corresponding to the first PT-RS data on each symbol of the M symbols to obtain a fifth RE index array corresponding to the PT-RS data on all the M symbols; intersection of the available RE index array and the fifth RE index array is taken to obtain a second RE index array, and PT-RS data corresponding to the second RE index array is obtained. Wherein, the maximum available RE index on the symbol may refer to the maximum RE index of the available RE index array on the symbol.

As described above, N is less than or equal to the total number of symbols (e.g., 12 or 14) within the time slot. Further, among N symbols allocated to the PDSCH, PT-RS data may exist among M symbols, M being less than or equal to N, according to a preset setting. As will be appreciated by those skilled in the art, PT-RS data may not exist in a certain slot according to a preset, and thus M may be 0.

As known to those skilled in the art, PT-RS data on each symbol in the RG within one slot is identical, so in order to save storage space, PT-RS data on any one of M symbols (e.g., the first symbol in symbol order of the M symbols is selected) may be first generated and stored, and then the generated PT-RS data on any one symbol is copied to obtain PT-RS data on all M symbols and obtain its corresponding index, if necessary.

In some embodiments, before the step of copying the first PT-RS data on any one symbol for each of the remaining M-1 symbols, the method may further include: and deleting PT-RS data with an index smaller than the minimum available RE index on the symbol from the first PT-RS data generated for any one of the M symbols, so as to reserve the first PT-RS data with the index between the minimum available RE index and the maximum available RE index on the symbol and the RE index corresponding to the reserved first PT-RS data. Wherein, the minimum available RE index on the symbol may refer to the minimum RE index of the available RE index array on the symbol.

Similar to DMRS data, PT-RS data having a generated index smaller than the minimum available RE index on the symbol may be unnecessary, and thus, may be deleted to save storage space.

In some embodiments, before the step of copying the first PT-RS data on any one symbol for each of the remaining M-1 symbols, the method may further include: and storing only the first PT-RS data and RE indexes corresponding to the first PT-RS data on any symbol, wherein the stored first PT-RS data and RE indexes corresponding to the first PT-RS data can be used for being read to realize copy operation when needed, so as to obtain the first PT-RS data and RE indexes corresponding to the first PT-RS data on each symbol of the rest M-1 symbols.

By storing only the PT-RS data and the corresponding RE index on one symbol of the M symbols, the storage space can be saved, but when the use is needed, the copy operation must be performed first, and then the PT-RS data and the corresponding RE index on all the M symbols can be obtained, which takes a certain time. In contrast, after the copy operation is performed, all PT-RS data and corresponding RE indexes on the obtained M symbols may be stored for direct reading and use when needed, thereby saving operation time, but consuming more storage space.

In some embodiments, available REs of PDSCH occupy N symbols, N being a positive integer and less than or equal to the total number of symbols within a slot; PT-RS data exists on M symbols in N symbols, wherein M is an integer and M is more than or equal to 0 and less than or equal to N; determining a second RE index array for PT-RS from the available RE index arrays and obtaining PT-RS data corresponding to the second RE index array may include: acquiring RE indexes of DMRS data, which are on the same subcarrier as PT-RS data, in symbols of the N symbols and are generated for the first time according to the symbol sequence, generating first PT-RS data between the minimum available RE index and the maximum available RE index of any symbol of the M symbols according to the DMRS data corresponding to the acquired RE indexes and a preset PT-RS data generation rule, and acquiring RE indexes corresponding to the first PT-RS data; copying the first PT-RS data on any symbol for each of the remaining M-1 symbols to obtain the first PT-RS data on each of the M symbols and obtain an RE index corresponding to the first PT-RS data; combining RE indexes corresponding to the first PT-RS data on each symbol of the M symbols to obtain a sixth RE index array corresponding to the PT-RS data on all the M symbols; intersection of the available RE index array and the sixth RE index array is taken to obtain a second RE index array, and PT-RS data corresponding to the second RE index array is obtained.

As known to those skilled in the art, PT-RS data on each symbol is identical in RG in one slot, and corresponding PT-RS data can be obtained from DMRS data on the same subcarrier as PT-RS data on a symbol where DMRS data occurs for the first time. For example, referring back to fig. 2, the PT-RS data in each RE element of the first row in the right part RG is the same, and the PT-RS data of each RE in the first row can be obtained from the DMRS data on the first subcarrier (i.e., the first row) on the third symbol where the DMRS data first appears. Therefore, only the index of DMRS data in the third column, the first row, may be saved. Then, when needed, corresponding DMRS data can be obtained according to the saved index, and corresponding PT-RS data can be restored according to the DMRS data. By obtaining the PT-RS data in this way, the direct generation of the PT-RS data according to the preset PT-RS data generation rule can be omitted, and the storage space can be further saved because only the index of the related DMRS data is saved, but when the PT-RS data needs to be used, a certain calculation time is required, and a certain calculation complexity is required to be born.

For example, according to the saved RE index of the DMRS data in the third column and the first row, the corresponding DMRS data may be acquired, and accordingly the corresponding PT-RS data in the current RG, that is, the PT-RS data in the first row, may be acquired. In addition, assuming that the RB distribution interval of the pre-configured PT-RS data is 4, there will be one PT-RS data every 4 RBs, and according to the saved RE index, each time the RE index in the corresponding RG can be obtained by accumulating 4×12, then it is determined whether the RE index exists between the minimum available RE index and the maximum available RE index on the current symbol, when the RE index belongs between the minimum available RE index and the maximum available RE index on the current symbol, DMRS data in the corresponding RG is obtained according to the RE index, and accordingly PT-RS data in the corresponding RG is obtained.

In some embodiments, the data processing method for PDSCH in some embodiments may be performed by a base station to enable downlink data transmission.

It should be noted that the steps or actions described in the above method embodiments may also be sequentially exchanged or adjusted in a manner that will be apparent to those skilled in the art. For example, one skilled in the art may determine a second RE index array for PT-RS from available RE index arrays of PDSCH, and then determine a first RE index array for DMRS. Thus, the various orders in the description and drawings are for clarity of description of only certain embodiments, and are not meant to be required orders unless otherwise indicated.

Through the above embodiment, the forward interleaving and mapping mode is realized, and the use of a deinterleaver unit is avoided.

In addition, through the above embodiment, the RE index array corresponding to the data is introduced, so that the influence caused by the complete change of VRB mapping due to other channel/signal reservations is eliminated, and the processing flows of different mapping types and interleaving or not are combined.

Fig. 6 shows a schematic diagram of an apparatus 600 for implementing a data processing method of PDSCH of an embodiment.

The apparatus 600 includes a processor 602 and a memory 604. The memory 604 is used for storing a program, and the processor 602 is used for executing the program to implement the data processing method for PDSCH described in any of the embodiments.

Those skilled in the art will appreciate that all or part of the functions of the various methods in the above embodiments may be implemented by hardware, or may be implemented by a computer program. When all or part of the functions in the above embodiments are implemented by means of a computer program, the program may be stored in a computer readable storage medium, and the storage medium may include: read-only memory, random access memory, magnetic disk, optical disk, hard disk, etc., and the program is executed by a computer to realize the above-mentioned functions. For example, the program is stored in the memory of the device, and when the program in the memory is executed by the processor, all or part of the functions described above can be realized. In addition, when all or part of the functions in the above embodiments are implemented by means of a computer program, the program may be stored in a storage medium such as a server, another computer, a magnetic disk, an optical disk, a flash disk, or a removable hard disk, and the program in the above embodiments may be implemented by downloading or copying the program into a memory of a local device or updating a version of a system of the local device, and when the program in the memory is executed by a processor.

The present invention has been described in terms of specific embodiments, which are intended to be illustrative of the invention and not limiting. Several simple deductions, modifications or substitutions may also be made by a person skilled in the art to which the invention pertains, based on the idea of the invention.

Claims

1. A data processing method for a physical downlink shared channel, comprising:

mapping the demodulation reference signal data, the phase tracking reference signal data and the load data to resource elements corresponding to index elements in the first resource element index array, the second resource element index array and the third resource element index array sequentially;

the available resource elements of the physical downlink shared channel occupy N symbols, wherein N is a positive integer and is less than or equal to the total number of symbols in a time slot; phase tracking reference signal data exists on M symbols in the N symbols, wherein M is an integer and M is more than or equal to 0 and less than or equal to N;

2. A data processing method for a physical downlink shared channel, comprising:

Acquiring resource element indexes of demodulation reference signal data which are on the same subcarrier with the phase tracking reference signal data in symbols in which the demodulation reference signal data occur for the first time according to a symbol sequence in the N symbols;

3. The method according to claim 1 or 2, wherein the obtaining the index array of the target resource element to which the data of the physical downlink shared channel is to be mapped comprises:

4. The method according to claim 1 or 2, wherein the available resource elements of the physical downlink shared channel occupy N symbols, N being a positive integer and being less than or equal to the total number of symbols in a time slot;

5. The method of claim 4, wherein prior to the step of combining the resource element indices corresponding to the first demodulation reference signal data on each of the N symbols, the method further comprises:

6. The method according to claim 1 or 2, characterized in that before the step of copying the first phase tracking reference signal data on any of the remaining M-1 symbols for each of the symbols, the method further comprises:

7. The method of claim 6, wherein prior to the step of copying the first phase tracking reference signal data on any of the remaining M-1 symbols for each symbol, the method further comprises:

and storing only the first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data on any symbol, wherein the stored first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data are used for being read to realize copy operation when needed, so as to obtain the first phase tracking reference signal data and the resource element index corresponding to the first phase tracking reference signal data on each symbol in the remaining M-1 symbols.

8. A data processing apparatus for a physical downlink shared channel, comprising:

A memory for storing a program;

A processor for executing the program to implement the method according to any one of claims 1-7.

9. A computer readable storage medium, characterized in that the medium has stored thereon a program executable by a processor to implement the method according to any of claims 1-7.