A frequency hopping configuration method can be applied to a base station. The base station can configure at least one bandwidth part BWP for a terminal. The method can include: configuring a frequency hopping rule for each configured BWP; when the terminal is instructed to perform uplink transmission hopping, determining, according to the configured hopping rule, a hopping rule corresponding to a BWP currently being used by the terminal; and sending the corresponding hopping rule to the terminal, such that the terminal determines a second frequency domain resource position after frequency hopping has been performed according to the corresponding frequency hopping rule and a first frequency domain resource position prior to performing frequency hopping, and performs uplink transmission at the second frequency domain resource position.

Methods, apparatus, and processor-readable storage media for generating a frequency hopping arrangement are provided herein. An example computer-implemented method includes determining a starting frequency channel for a frequency hopping arrangement to be used in a communication session by a designated group of devices; calculating a number of useable frequency channels between the starting frequency channel and a stopping frequency channel; calculating a frequency channel step value that is greater than a minimum number of frequency channels and is coprime with the number of devices in the designated group; and selecting the frequency channel values to be used in the communication session by iterating through frequency channel values for the useable frequency channels at intervals of a random frequency channel selection offset value until a number of frequency channel values equal to the frequency channel step value are selected.

A wireless communication apparatus includes a channel estimation circuit, a beamforming control circuit, and a transmit (TX) circuit. The channel estimation circuit estimates a channel between the wireless communication apparatus and another wireless communication apparatus during at least one first time slot. The beamforming control circuit determines beamforming coefficients according to the estimated channel. The TX circuit applies the beamforming coefficients to transmission of an output data during at least one second time slot later than the at least one first time slot. During the at least one second time slot, the output data is transmitted to another wireless communication apparatus via multiple antennae. The wireless communication apparatus performs communications according to a normal frequency hopping sequence in compliance with a communication specification.

A wireless communication device as an embodiment of the present invention is a wireless communication device for performing wireless communications with communication partners while switching channels to be used for each time slot, and includes a storage, an updater, a determinator, and a communicator. The storage stores pre-generated scheduling data indicating channels that can be used in each time slot. The updater determines whether or not each channel included in the scheduling data is usable, and registers the channel determined as unusable on a blacklist. The determinator determines the channel to be used in each time slot on the basis of the scheduling data and the blacklist. The communicator performs wireless communications with a communication partner by using the channel determined in each time slot.

A communications node operable to communicate with another communications node over a communications channel having a plurality of frequency resources, the communications node includes data defining a division of the communications channel into a plurality of contiguous sub-bands each having N frequency resources, wherein each frequency resource in a sub-band has a corresponding frequency resource in each of the other sub-bands, data defining an initial allocation of the frequency resources, a resource determination module operable to apply a frequency shift to the initially allocated frequency resources in accordance with a frequency hopping sequence to determine frequency resources to use for communicating information with the other communications node, wherein the frequency shift applied moves the initially allocated frequency resources to corresponding frequency resources in another sub-band, a transceiver for communicating information with the other communications node using the determined frequency resource.

This application provides a data transmission method, to help increase a data transmission success rate. The method includes: broadcasting, by a network device, first channel information, where the first channel information is used to indicate a channel state of each of N channels, the channel state is that the channel is available or that the channel is unavailable, and N1; and determining, by the network device, a channel for frequency hopping transmission based on the channel state of each channel.

A communications node operable to communicate with another communications node over a communications channel having a plurality of frequency resources, the communications node includes data defining a division of the communications channel into a plurality of contiguous sub-bands each having N frequency resources, wherein each frequency resource in a sub-band has a corresponding frequency resource in each of the other sub-bands, data defining an initial allocation of the frequency resources, a resource determination module operable to apply a frequency shift to the initially allocated frequency resources in accordance with a frequency hopping sequence to determine frequency resources to use for communicating information with the other communications node, wherein the frequency shift applied moves the initially allocated frequency resources to corresponding frequency resources in another sub-band, a transceiver for communicating information with the other communications node using the determined frequency resource.

A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.