18255650. Data Transmission Method and Apparatus simplified abstract (Huawei Technologies Co., Ltd.)

From WikiPatents
Jump to navigation Jump to search

Data Transmission Method and Apparatus

Organization Name

Huawei Technologies Co., Ltd.

Inventor(s)

Yun Liu of Shenzhen (CN)

Lixia Xue of Beijing (CN)

Data Transmission Method and Apparatus - A simplified explanation of the abstract

This abstract first appeared for US patent application 18255650 titled 'Data Transmission Method and Apparatus

Simplified Explanation

The method involves determining N1 slots for sending a first redundancy version (RV) of a Physical Uplink Shared Channel (PUSCH) based on a PUSCH resource. N1 is an integer greater than 1.

  • N1 slots are allocated for sending the first RV of a PUSCH.
  • If the last bit of the first RV is sent on the last bit of the first slot, the 1bit in the first RV is sent on the second slot.
  • The first slot is the (n1) slot in the N slots, and the second slot is the (n1+1) slot in the N1 slots.
  • Bits in the first RV are continuously sent if the last bit sent on the first slot is not the last bit in the first RV.

---

      1. Potential Applications
  • Wireless communication systems
  • Mobile networks
  • Internet of Things (IoT) devices
      1. Problems Solved
  • Efficient transmission of data in wireless communication systems
  • Optimizing the use of resources in mobile networks
  • Enhancing reliability of communication in IoT devices
      1. Benefits
  • Improved data transmission efficiency
  • Enhanced reliability of communication
  • Optimal utilization of resources in wireless networks


Original Abstract Submitted

The method includes: determine N1 slots based on a physical uplink shared channel, PUSCH resource, wherein the N1 slots are used to send a first redundancy version, RV of a PUSCH, and N1 is an integer greater than 1; send the 1bit in the first RV on a second slot if the last bit in the first RV is sent on the last bit of a first slot, wherein the first slot is the (n1)slot in the N slots, the second slot is the (n1+1)slot in the N1 slots, n1=1, 2, . . . , or N1−1; and continuously send bits in the first RV if the last bit sent on the first slot is not the last bit in the first RV, wherein the last bit sent on the first slot and the 1bit sent on the second slot are two adjacent bits in the first RV.