Receiving Device and Methods Thereof
20180083733 ยท 2018-03-22
Inventors
- Jianjun Chen (Lund, SE)
- Fredrik Rusek (Lund, SE)
- Junshi Chen (Shenzhen, CN)
- Peter Almers (Shenzhen, CN)
- Baicheng Xu (Shenzhen, CN)
Cpc classification
International classification
Abstract
A receiving device including a receiver configured to receive a communication signal (CS) in a current time frame, and a processor configured to determine a set of candidate Control Channels (CCHs), determine a decoding order for the candidate CCHs in the set, decode at least one candidate CCH in the set according to the decoding order, compute a possible Radio Network Temporary Identifier (RNTI) for the decoded candidate CCH, compute a metric value (MV) for the decoded candidate CCH, the MV provides an indication when the decoded candidate CCH might be an actual CCH, determine when the decoded candidate CCH is an actual CCH based on the computed possible RNTI and the MV, derive control information (CI) from the decoded candidate CCH when the decoded candidate CCH is determined as an actual CCH, and cancel or suppress interference in the CS based on the derived CI.
Claims
1. A receiver device for a wireless communication system, comprising: a receiver configured to receive a communication signal (CS) in a current time frame; and a processor coupled to the receiver and configured to: determine a set of candidate Control Channels (CCHs), wherein each candidate CCH in the set is addressed for another receiver device and associated with a Data Channel (DCH) of the CS; determine a decoding order for the candidate CCHs in the set; decode at least one candidate CCH in the set according to the decoding order; compute a possible Radio Network Temporary Identifier (RNTI) for the decoded at least one candidate CCH; compute a metric value (MV) for the decoded at least one candidate CCH, wherein the MV provides an indication when the decoded at least one candidate CCH might be an actual CCH; determine whether the decoded at least one candidate CCH is the actual CCH based on the computed possible RNTI and the MV; derive control information (CI) from the decoded at least one candidate CCH when the decoded candidate CCH is determined as the actual CCH; and cancel or suppress interference in the CS based on the derived CI.
2. The receiver device according to claim 1, wherein the processor is further configured to determine the decoding order based on energy levels of the candidate CCHs in the set.
3. The receiver device according to claim 1, wherein the processor is further configured to: check validity of the derived CI; and discard the decoded at least one candidate CCH from the set when the derived CI is invalid.
4. The receiver device according to claim 3, wherein the processor is further configured to discard other candidate CCHs from the set when the other candidate CCHs have been transmitted in the same Control Channel Elements (CCEs) as the decoded at least one candidate CCH and when the derived CI is valid.
5. The receiver device according to claim 3, wherein the processor is further configured to check the validity of the derived CI based on the computed possible RNTI, a subframe number for the decoded at least one candidate CCH, and Control Channel Element (CCE) constraints for the decoded at least one candidate CCH.
6. The receiver device according to claim 1, wherein the processor is further configured to: detect at least one current possible RNTI for the decoded candidate CCH in the current time frame; compute the MV for the detected at least one current possible RNTI; compute statistics for MVs associated with previously detected possible RNTIs for the decoded at least one candidate CCH; and determine whether the decoded at least one candidate CCH is the actual CCH further based on the computed statistics and the computed MV for the detected at least one current possible RNTI.
7. The receiver device according to claim 6, wherein the computed MV for the detected at least one current possible RNTI and the computed statistics are computed based one or more parameters in a group comprising: a type of RNTI; a point in time of detection of the RNTI; and a number of detections for the same RNTI.
8. The receiver device according to claim 6, wherein Random Access RNTIs (RA-RNTIs), Paging RNTIs (P-RNTIs), and System Information RNTIs (SI-RNTIs), are special types of RNTIs indicating high probability that the decoded at least one candidate CCH is the actual CCH, and wherein the processor is further configured to set the computed MV for the detected at least one current possible RNTI, which is from the special types, higher than the MV for a detected current possible RNTI which is not from the special types.
9. The receiver device according to claim 1, wherein the receiver device is served by at least one serving cell, and wherein the decoded at least one candidate CCH is addressed for the other receiver device associated with a non-serving cell.
10. The receiver device according to claim 1, wherein the receiver device is served by at least one serving cell, wherein the decoded at least one candidate CCH is addressed for the other receiver device associated with the at least one serving cell, and wherein the processor is further configured to store the CI in connection with mobility handling for the receiver device.
11. The receiver device according to claim 1, wherein the processor is further configured to compute the MV based on one or more information in a group comprising: path metric of a decoder of the receiver device; Log Likelihood Ratio (LLR) statistics of the decoder; amount of change of LLRs of the decoder; raw Bit Error Rate (BER) estimate of the decoder; estimated Signal to Noise Ratio (SNR) for the at least one candidate CCH; and effective coding rate for the at least one candidate CCH.
12. The receiver device according to claim 1, wherein the processor is further configured to compute the MV based on one or more information in a group comprising: path metric of a decoder of the receiver device; Log Likelihood Ratio (LLR) statistics of the decoder; amount of change of LLRs of the decoder; raw Bit Error Rate (BER) estimate of the decoder; estimated Signal to Noise and Interference Ratio (SNIR) for the at least one candidate CCH; and effective coding rate for the at least one candidate CCH.
13. The receiver device according to claim 1, wherein the processor is further configured to determine the decoding order based on control channel element (CCE) aggregation levels of the candidate CCHs in the set.
14. A method, comprising: receiving a communication signal (CS) in a current time frame; determining a set of candidate Control Channels (CCHs), wherein each candidate CCH in the set is addressed for a receiving device and associated with a Data Channel (DCH) of the CS; determining a decoding order for the candidate CCHs in the set; decoding at least one candidate CCH in the set according to the decoding order; computing a possible Radio Network Temporary Identifier (RNTI) for the decoded at least one candidate CCH; computing a metric value (MV) for the decoded at least one candidate CCH, wherein the MV provides an indication when the decoded at least one candidate CCH might be an actual CCH; determining whether the decoded at least one candidate CCH is the actual CCH based on the computed possible RNTI and the MV; deriving control information (CI) from the decoded at least one candidate CCH when the decoded at least one candidate CCH is determined as the actual CCH; and cancelling interference in the CS based on the derived CI.
15. A method, comprising: receiving a communication signal (CS) in a current time frame; determining a set of candidate Control Channels (CCHs), wherein each candidate CCH in the set is addressed for a receiving device and associated with a Data Channel (DCH) of the CS; determining a decoding order for the candidate CCHs in the set; decoding at least one candidate CCH in the set according to the decoding order; computing a possible Radio Network Temporary Identifier (RNTI) for the decoded at least one candidate CCH; computing a metric value (MV) for the decoded at least one candidate CCH, wherein the MV provides an indication when the decoded at least one candidate CCH might be an actual CCH; determining whether the decoded at least one candidate CCH is the actual CCH based on the computed possible RNTI and the MV; deriving control information (CI) from the decoded at least one candidate CCH when the decoded at least one candidate CCH is determined as the actual CCH; and suppressing interference in the CS based on the derived CI.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0056] The appended drawings are intended to clarify and explain different embodiments of the present disclosure.
[0057]
[0058]
[0059]
[0060]
[0061]
DETAILED DESCRIPTION
[0062] In LTE downlink, cell edge UE performance is limited by interference from neighbouring cells. Not knowing the parameters of the interfering PDSCH signals will degrade the interference mitigation performance at the receiver device. Parameter blind estimation can partly solve the problem, yet not satisfactory.
[0063] In embodiments of the present disclosure it is shown how to decode the CCHs of interferers and interpret the information of the associated DCHs signal in the interfering CCH. In this way, the performance of DCH interference mitigation and cancellation can be improved.
[0064]
[0065] According to the present solution, the receiver 104 is configured to receive a CS in a current time frame of the wireless communication system 300. The processor 102 is configured to determine a set of candidate CCHs, wherein each candidate CCH in the set is addressed for another receiver device (such as a receiver device 400 shown in
[0066] The MV may be a scalar value, such as an LLR value, in a predetermined rang. For example, there may be many LLRs values for the decoded CCH, and the LLR values for the CCH can be compared to one or more threshold values, such that a LLR value larger than the threshold value is considered as an MV. Hence, if there are many LLR values larger than the threshold value for a candidate CCH it can be determined that the candidate CCH is with high probability an actual CCH. Otherwise the candidate CCH is not considered as an actual CCH.
[0067] Furthermore, the processor 102 is further configured to determine if the decoded candidate CCH is an actual CCH based on the computed possible RNTI and the MV. The processor 102 is further configured to derive CI from the decoded candidate CCH if the decoded candidate CCH is previously determined as an actual CCH. The processor 102 is finally configured to cancel interference and/or suppress interference in the CS based on the derived CI.
[0068] The receiver device 100 may in one embodiment be a user device, such as a UE, mobile station, wireless terminal and/or mobile terminal enabled to communicate wirelessly in the wireless communication system 300, sometimes also referred to as a cellular radio system. The UE may further be referred to as mobile telephones, cellular telephones, computer tablets or laptops with wireless capability. The UEs in the present context may be, for example, portable, pocket-storable, hand-held, computer-comprised, or vehicle-mounted mobile devices, enabled to communicate voice and/or data, via the radio access network, with another entity, such as another receiver or a server. The UE can be a Station (STA), which is any device that contains the Institute of Electrical and Electronics Engineers (IEEE) 802.11-conformant Media Access Control (MAC) and Physical Layer (PHY) interface to the Wireless Medium (WM).
[0069] However, the receiver device 100 may in another embodiment be a (radio) network node or a base station, e.g. a Radio Base Station (RBS), which in some networks may be referred to as transmitter, eNB, eNodeB, NodeB or B node, depending on the technology and terminology used. The radio network nodes may be of different classes such as e.g. macro eNB, home eNB or pico base station, based on transmission power and thereby also cell size. The radio network node can be a STA, which is any device that contains an IEEE 802.11-conformant MAC and PHY interface to the WM.
[0070]
[0071] Step 202: Receiving a CS in a current time frame.
[0072] Step 204: Determining a set of candidate CCHs, wherein each candidate CCH in the set is addressed for another receiver device and associated with a DCH of the CS.
[0073] Step 206: Determining a decoding order for the candidate CCHs in the set.
[0074] Step 208: Decoding at least one candidate CCH in the set according to the decoding order.
[0075] Step 210: Computing a possible RNTI for the decoded candidate CCH.
[0076] Step 212: Computing an MV for the decoded candidate CCH, and the MV provides an indication if the decoded candidate CCH might be an actual CCH or not.
[0077] Step 214: Determining if the decoded candidate CCH is an actual CCH based on the computed possible RNTI and the MV.
[0078] Step 216: Deriving CI from the decoded candidate CCH if the decoded candidate CCH is determined as an actual CCH.
[0079] Step 218: Cancelling and/or suppressing interference in the CS based on the derived CI.
[0080] Embodiments of the present disclosure therefore provide improved knowledge about the parameters or information of the interfering DCH signals. The information about the interfering DCH may include but is not limited to transmission mode, transmission rank, precoding matrix, power level, modulation scheme, resource allocation, etc. Such information of the interfering DCH signals can be used for cancelling and/or mitigating the interfering DCH signals. An example of IC is Network Assisted Interference Cancellation and Suppression (NAICS), and an example of interference mitigation is Minimum Mean Square Error-Interference Rejective Combining (MMSE-IRC).
[0081]
[0082] In the following, the different steps of the method 500 will be described in detail.
[0083] Step 502: Determining a set of candidate PDCCHs received in the CS in a current subframe (e.g. defined by a radio frame structure of an underlying communication system). The PDCCH of the LTE system has a DCI which includes resource assignments for a UE or a group of UEs. There are several different types of DCIs, for example Format 1, 1A, 1B, 1C, 1D, 2, etc., in LTE systems. The PDCCH is transmitted on CCEs, and one PDCCH channel may occupy 1, 2, 4, or 8 CCEs for the reason of robust receiving performance by introducing different amount of redundancy. Therefore, in step 502 the resource element group (REG)/CCE mapping, CCE aggregation level, and LLR for each possible PDCCH bit is determined for the candidate PDCCHs of the candidate set.
[0084] Step 504: Determining the decoding order for the PDCCHs in the candidate set of PDCCHs. The main purpose for selecting an order is to make it possible to reduce the complexity of the present solution by reducing the number of candidates. For example, a candidate PDCCH which occupies 8 CCEs is decoded and the decoding result is considered to be very reliable (for example due to the corresponding RNTI is a known active RNTI in the interfering cell), then for complexity reason the other candidate PDCCHs in the set that occupy any of these 8 CCEs may be discarded from the set. In this way, many candidate PDCCCHs may be discarded from the set and thus the total complexity is significantly reduced. Moreover, in order to achieve very robust PDCCH receiving performance, there is a high probability that the eNBs will transmit PDCCH at the 4 or 8 CCE aggregation levels. Therefore, by decoding CCHs with higher aggregation levels first (e.g. 4 and 8 CCEs aggregation levels) and decoding CCHs with lower aggregations levels afterwards in general the total complexity will be reduced significantly. Another criterion for determining the decoding order is the energy levels of the candidate PDCCH for reducing the complexity. Therefore, according to an embodiment of the disclosure, the decoding order is based on the energy levels of the candidate CCHs in the set, wherein candidate CCHs with higher energy level get a higher decoding priority (are earlier decoded) than candidate CCHs with lower energy level. According to a further embodiment the decoding order is instead or additionally based on the aggregation level of the candidate CCHs, i.e. how many CCEs the candidate CCHs occupy, wherein candidate CCHs with higher aggregation level get a higher decoding priority (are earlier decoded) than candidate CCHs with lower aggregation level.
[0085] Step 506: Decoding the current PDCCH candidate. Based on the decoding results of a candidate PDCCH one RNTI value can be directly computed by assuming that the candidate PDCCH is actually a valid PDCCH and when the information bits and cyclic redundancy check (CRC) bits of the candidate PDCCH are detected correctly. Moreover, an MV for the candidate PDCCH is computed and used for determining if the candidate PDCCH is an actual PDCCH. The determination can for example be based on a comparison of the MV with a threshold value. If the MV is larger than the threshold value then the candidate PDCCH may be determined as an actual PDCCH otherwise, the candidate PDCCH would be discarded. The RNTI values for different RNTI types are allocated and given in specifications, such as the 3GPP 36.321 specification.
[0086] According to an embodiment of the present disclosure, the MV can be a function whose input can be based on one or more of the following information in the group including:
[0087] Path metrics of the decoder (not shown in
[0088] LLR statistics of the soft output of the decoder, which can be any kind of statistical information computed from the LLR, one typical example is the mean mutual information;
[0089] Ratio of the amount of bits whose LLR signs (+ or ) changed during the decoding;
[0090] Estimated SNR and/or SINR of the candidate PDCCH;
[0091] Effective coding rate considering the CCE aggregation level for the candidate PDCCH;
[0092] Raw BER estimate of the LLR input to the decoder. By comparing the LLR input and LLR output of the decoder and check how many bits have their sign changed (+ or ) after the decoding process, the raw BER estimate can be computed, since error correcting codes are usually supposed to operate well only at a certain BER range.
[0093] Step 508: Checking content validity. It is assumed that the decoded result of the step 506 is a PDCCH of a certain DCI format, and the information bits of the DCI format are fetched and of the corresponding detected RNTI. Thereafter, the content of the PDCCH DCI information can be validated to check whether the PDCCH DCI information comply with standard specifications, such as 3GPP specifications. For example, for a specific subframe number and a specific Cell-RNTI (C-RNTI), there is a constraint about the CCE range which must be followed. In other words, only a subset of CCEs and their aggregations can contain PDCCH for that C-RNTI at each subframe. If this is not satisfied, the decoded candidate PDCCH does not exist or contains error in the decoded bits. In the first case the computed RNTI is a false alarm meaning that the computed RNTI does not exist but was wrongly considered to exist, and in the second case the computed RNTI is incorrect. In either of these cases, the decoded candidate PDCCH is discarded, or a very small MV may be assigned to this decoded candidate PDCCH.
[0094] Step 510: Discarding candidate PDCCHs in the set. Based on the above validity check in step 508, if there is high confidence that a certain candidate PDCCH is correctly decoded, some of the candidate PDCCHs from the candidate set to be decoded can be removed (discarded). For example, if a PDCCH containing 8 CCEs is decoded and it is highly confident that the PDCCH is an actual PDCCH all those other possible PDCCH candidates that occupy any of these 8 CCEs may be removed or discarded from the candidate set. In this way a large number of PDCCH candidates can be removed and the total complexity can be significantly reduced.
[0095] In Step 511: Determining if all candidate PDCCHs in the set have been processed. If the answer is NO in step 511, the algorithm returns to step 506 and starts decoding the next PDDCH candidate according to the decoding order. If the answer is YES in step 511, the algorithm continues to step 512 in
[0096] Step 512: Cross checking and updating the metric. The obtained different kinds of information are combined and cross checking is performed to determine the final list of PDCCH candidates among the PDCCH candidates from the set. Moreover, the MV may also be adjusted in this step. The information that may be used in this step may include, but is not limited to the following.
[0097] Statistical information of the detected RNTIs and the MVs;
[0098] Blind estimation information of the interfering PDSCH signals. From the information about the PDSCH, the information of PDCCH associated with this PDSCH can be deduced. Hence, the algorithm can cross-verify whether the detected RNTI is correct or not; and
[0099] Cross dependence of the content of survival candidate PDCCHs. For example, if two survival candidate PDCCHs claim or occupy the same Physical Resource Block (PRB) resources, then something may be wrong if Non-Orthogonal Multiple-Access (NOMA)/Semi-Orthogonal Multiple-Access (SOMA) is not being used.
[0100] In step 514: Setting statistics of history information. The RNTI and MV information in the current subframe will be combined with the historical statistics such that the MV information will be filtered. Moreover, if a RNTI has not been detected for quite some time, and the MV associated with this particular RNTI is getting small, then this RNTI may be removed from the list of detected RNTIs in the current subframe.
[0101] Moreover, some RNTIs may be treated as so called special RNTIs. The special RNTIs are just a very small portion of all possible RNTIs, for example RA-RNTI (with value 00000009), P-RNTI (with value FFFE), SI-RNTI (with value FFFF). If a reported possible RNTI is a special RNTI, it should have a high MV, since a randomly reported error RNTI should fall in these special RNTI range is very small, of around 10(4) in probability. In other words, special RNTIs can be regarded as almost always active RNTIs in the interfering cells. Therefore, according to an embodiment of the present disclosure, RA-RNTIs, P-RNTIs, and SI-RNTIs, are special types of RNTIs indicating a very high probability that the decoded candidate CCH comprising such special RNTI is an actual CCH. Hence, the processor 102 of the receiver device 100 shown in
[0102] In the wireless communication system 300 shown in
[0103] Based on the above described behavior of burst communication, if a certain RNTI is detected multiple times as the possible RNTI for candidate interfering PDCCHs during a short time period, it is very probable that the possible RNTI is a real active RNTI in the interfering cell. One reason is that since for an example in LTE the RNTI contains 16 bits, the probability that a single RNTI is a false alarm reported for multiple times within a short period is extremely small. Therefore, the possibility that the detected RNTI is a false RNTI is very low, about 1/216.
[0104] Further, the possibility that the same RNTI occurs many times during a short time period and is a false alarm RNTI is extremely low. Because of the above reasons of burst communication behavior of the receiver device 100, the following general rules may be applied according to further embodiments of the present disclosure.
[0105] When a RNTI is detected in the current subframe and if the candidate PDCCH has passed the validity check at step 510 in
[0106] If a RNTI is detected and has passed the validity check at step 510 in
[0107] If a RNTI is detected and has passed the validity check at step 510 in
[0108] The RNTI may be removed from the list of detected RNTIs, for example when the point in time when the RNTI was last detected exceeds a certain time threshold, or when the MV for the RNTI fades out and becomes smaller than a threshold value.
[0109]
[0110] At time point A, an RNTI is detected for the first time and the statistic MV is set low.
[0111] At time point B, the same RNTI occurs again and the statistic MV is increased since the RNTI has been detected again.
[0112] At time point C, the same RNTI occurs once again which means that we have more confidence that the RNTI is a real RNTI, and therefore the statistic MV is increased even more.
[0113] At time point D, the statistic MV is held constant for a time period between D and F since the RNTI has not been detected during the time period from C to D.
[0114] Between time point E and time point F, the statistic MV is filtered and faded out since there is no more appearance of the RNTI.
[0115] At time point F, the RNTI is removed from the list of detected RNTIs since the statistic MV is below a threshold value.
[0116] In previous sections, it was described how to detect active RNTIs in the interfering cells and how to use statistical information of the MVs to improve the detection performance and/or reduce total complexity of the present solution. It should also be noted that the described methods can also be used in detecting active RNTIs of other UEs in the serving cell. It is easier to detect the UEs in the serving cell since the UE knows its own RNTI. Using resource conflicting information and conflicting rules together with the knowledge of the UE's own RNTI, it is easier to detect RNTIs of other UEs in the serving cell. When a UE is moving in a cellular network the UE will be handed over to other cells in the cellular network. The serving cell will very often become a strong interfering cell in typical moving scenario after handover. Thus, if the active RNTIs of the serving cell are detected and stored very good knowledge of the active RNTIs will immediately be available after handover. This will help to achieve a good interfering PDCCH detection performance after the handover.
[0117] However, there are critical timing requirements for a UE to decode the serving cell's PDSCH channel and report success/failure back to the eNB. Because of this, the UE also need to decode the serving cell's PDCCH channel in time such that the UE can use the DCI information in PDCCH to decode the PDSCH when necessary. As a consequence, when we want to suppress or cancel the interfering PDSCH channels from neighbouring cells the PDCCHs of the interfering cell also should decoded. In general there is no need to decode the PDSCH channels for the other UEs in the serving cell as the PDSCH channels for the other UEs in the serving cell do not interfere with the PDSCH channel for the UE. Hence, there is generally no need to decode the PDCCHs for the other UEs in the serving cell. In this case, if we want to decode the PDCCHs for the other UEs in the serving cell to obtain the active RNTI information, the detection can be performed in the background at a slower speed such that the hardware for decoding the interfering cells PDCCH can be reused, or else a low speed low power consuming hardware block can be used for this purpose.
[0118] Another alternative is to decode interfering PDCCH channels from multiple interfering cells. The reason for this is that when performing, e.g. NAICS, we may wish to cancel interfering PDSCH signals from more than one interferer. PDCCHs of interfering cells need to be decoded quickly since the timing requirement is tight. Interference for cells which the receiver device 100 may not be able to cancel due to lack of hardware resources may still be able to decode their PDCCHs in the background and therefore the receiver device 100 may obtain knowledge of the RNTIs gradually.
[0119]
[0120] Furthermore, any method according to the present disclosure may be implemented in a computer program, having code means, which when run by processing means causes the processing means to execute the steps of the method. The computer program is included in a computer readable medium of a computer program product. The computer readable medium may be comprised of essentially any memory, such as a ROM, a PROM, an EPROM, a Flash memory, an EEPROM, or a hard disk drive.
[0121] Moreover, it is realized by the skilled person that the present receiver device 100 comprises the necessary communication capabilities in the form of e.g., functions, means, units, elements, etc., for performing the present solution. Examples of other such means, units, elements and functions are processors, memory, buffers, control logic, encoders, decoders, rate matchers, de-rate matchers, mapping units, multipliers, decision units, selecting units, switches, interleavers, de-interleavers, modulators, demodulators, inputs, outputs, antennas, amplifiers, receiver units, transmitter units, digital signal processors (DSPs), mass storage devices (MSDs), trellis-coded modulation (TCM) encoder, TCM decoder, power supply units, power feeders, communication interfaces, communication protocols, etc. which are suitably arranged together for performing the present solution.
[0122] Especially, the processors of the present device may comprise, e.g., one or more instances of a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions. The expression processor may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones mentioned above. The processing circuitry may further perform data processing functions for inputting, outputting, and processing of data comprising data buffering and device control functions, such as call processing control, user interface control, or the like. Finally, it should be understood that the present disclosure is not limited to the embodiments described above, but also relates to and incorporates all embodiments within the scope of the appended independent claims.