US20210345169A1 - Retransmission of wireless data - Google Patents
Retransmission of wireless data Download PDFInfo
- Publication number
- US20210345169A1 US20210345169A1 US17/237,510 US202117237510A US2021345169A1 US 20210345169 A1 US20210345169 A1 US 20210345169A1 US 202117237510 A US202117237510 A US 202117237510A US 2021345169 A1 US2021345169 A1 US 2021345169A1
- Authority
- US
- United States
- Prior art keywords
- receiver
- transmitter
- bitmap
- frame
- frames
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 claims abstract description 44
- 230000015654 memory Effects 0.000 claims description 31
- 238000004891 communication Methods 0.000 claims description 23
- 238000012545 processing Methods 0.000 description 23
- 238000003860 storage Methods 0.000 description 13
- 230000004044 response Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 7
- 238000013500 data storage Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 108700026140 MAC combination Proteins 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000003745 diagnosis Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 1
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
- H04L5/0041—Frequency-non-contiguous
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0058—Allocation criteria
- H04L5/006—Quality of the received signal, e.g. BER, SNR, water filling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/08—Access point devices
- H04W88/085—Access point devices with remote components
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1854—Scheduling and prioritising arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
- H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/18—TPC being performed according to specific parameters
- H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
- H04W52/242—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account path loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
Definitions
- the transmitter 102 includes a host processor 106 coupled to a network interface 108 .
- the network interface 108 includes a medium access control (MAC) layer that includes a MAC processor 110 with or coupled to a MAC buffer 112 (e.g., a MAC-level transmit (TX) and/or receive (RX) buffer), and a physical (PHY) layer that includes a PHY processor unit 114 .
- the PHY processor unit 114 includes one or more transceivers 116 a - 116 n (collectively transceivers 116 ), and the transceivers 116 are coupled to one or more antennas 118 a - 118 n (collectively antennas 118 ).
- the transmitter 102 and receiver 104 may engage in an iterative session in which retransmissions and feedback are exchanged between the transmitter 102 and the receiver 104 until all the wireless data is received correctly or until a timeout is reached.
- the retransmission wireless data may be sent to the receiver 104 together with new wireless data.
- the RX window size may be further decreased (such as to less than 16 as in the previous example). In this manner, the receiver 104 may use the RX receive window size as a mechanism to provide flow control to the transmitter 102 . In another example, the receiver 104 may identify any type of constraint, such as a local hardware or software constraint, network congestion, or any other constraint that may affect an ability of the receiver 104 to receive wireless data from the transmitter 102 .
- the RX window size may be adjusted to any number and may be adjusted based on any constraint, including the constraints described.
- FIGS. 5-6 illustrate flow diagrams of example methods related to wireless communication.
- the methods may be performed by processing logic that may include hardware (circuitry, dedicated logic, etc.), software (such as is run on a computer system) which processing logic may be included in any transmitter 102 or receiver 104 , or another computer system or device.
- processing logic may include hardware (circuitry, dedicated logic, etc.), software (such as is run on a computer system) which processing logic may be included in any transmitter 102 or receiver 104 , or another computer system or device.
- another system, or combination of systems may be used to perform the methods.
- methods described herein are depicted and described as a series of acts. However, acts in accordance with this disclosure may occur in various orders and/or concurrently, and with other acts not presented and described herein. Further, not all illustrated acts may be used to implement the methods in accordance with the disclosed subject matter.
- One or more of the modules may include code and routines configured to enable a computing system to perform one or more of the operations described therewith. Additionally or alternatively, one or more of the modules may be implemented using hardware including any number of processors, microprocessors (e.g., to perform or control performance of one or more operations), DSPs, FPGAs, ASICs or any suitable combination of two or more thereof. Alternatively or additionally, one or more of the modules may be implemented using a combination of hardware and software. In the present disclosure, operations described as being performed by a particular module may include operations that the particular module may direct a corresponding system (e.g., a corresponding computing system) to perform.
- a corresponding system e.g., a corresponding computing system
- An example apparatus can be a multiple-input multiple-output (MIMO) apparatus supporting as many as N ⁇ N discrete communication streams over N antennas.
- MIMO apparatus signal processing units can be implemented as N ⁇ N.
- the value of N can be 4, 6, 8, 12, 16, etc.
- Extended MIMO operation enables the use of up to 2N antennae in communication with another similarly equipped wireless system. It should be noted that extended MIMO systems can communicate with other wireless systems even if the systems do not have the same number of antennae, but some of the antennae of one of the stations might not be utilized, reducing optimal performance.
Abstract
Description
- The implementations discussed herein relate to retransmission of wireless data.
- Unless otherwise indicated in the present disclosure, the materials described in the present disclosure are not prior art to the claims in the present application and are not admitted to be prior art by inclusion in this section.
- Some wireless communication standards, such as some Wi-Fi standards, implement acknowledgement schemes to ensure that transmitted data is received by the intended recipient.
- The subject matter claimed in the present disclosure is not limited to implementations that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one example technology area where some implementations described in the present disclosure may be practiced.
- In an implementation, a method includes receiving a message indicative of a block of frames that were sent to the receiver. The method includes determining that a particular frame associated with the block of frames was not received. The method further includes sending a feedback message to a transmitter with a bitmap indicating that the particular frame was not received by the receiver. The method also includes receiving the particular frame from the transmitter.
- In another implementation, a transmitter for wireless communication with a receiver in a wireless network includes a memory and a processor coupled to the memory, the processor to perform or control performance of operations The operations include sending wireless data to the receiver. The operations include receiving a feedback message from the receiver with a bitmap that identifies a subset of the wireless data that the receiver failed to receive. The operations include constructing retransmission wireless data that includes the subset of the wireless data in view of the bitmap. The operations include sending the retransmission wireless data to the receiver.
- In another implementation, a receiver for wireless communication with a transmitter in a wireless network includes a memory and a processor coupled to the memory, the processor to perform or control performance of operations. The operations include receiving a message indicative of a block of frames that were sent to the receiver. The operations include determining that a particular frame associated with the block of frames was not received. The operations include sending a feedback message to a transmitter with a bitmap indicating that the particular frame was not received by the receiver. The operations include receiving the particular frame from the transmitter.
- Example implementations will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
-
FIG. 1 is a block diagram of an example wireless local area network (WLAN) in which a negative acknowledgement scheme for wireless data may be implemented; -
FIGS. 2A-2C illustrate example feedback messages; -
FIGS. 3A and 3B illustrate example NACK bitmaps; -
FIG. 4 illustrates an example sequence diagram for wireless data communication between a transmitter and a receiver; -
FIGS. 5-6 illustrate flow diagrams of example methods related to wireless communication; and -
FIG. 7 illustrates a block diagram of an example computing system that may be used to perform or direct performance of one or more operations described according to at least one implementation of the present disclosure. - A transmitter may send wireless data, such as a wireless frame, to a receiver. In response, the receiver may send an acknowledgement message (ACK) message to the transmitter to acknowledge receipt of the frame. If the transmitter does not receive an acknowledgement message from the receiver within a period of time, (such as within a frame gap called a short interframe spacing (SIFS)), then the transmitter may assume the frame is lost, and then will start retransmission. Under this scheme, the transmitter may continue to attempt to send the frame indefinitely until the transmitter positively receives the acknowledgement frame, or the transmitter may retry until a number of retries exceeds a threshold after which the transmitter will give up and then discard this frame.
- The IEEE 802.11 set of standards defines one type of wireless frame as a MAC protocol data unit (MPDU). For ease in explanation, the terms “frame” and “MPDU” may be used interchangeably with the understanding that the present disclosure may be used with any type of frame and is not limited to MPDUs.
- Multiple MPDUs may be aggregated to an A-MPDU. Previously, the same acknowledgement scheme as described above has been used for MPDU and A-MPDUs.
- For A-MPDUs, the transmitter may expect to receive a particular acknowledgement, such as a block ACK. A block ACK may function as an ACK for the multiple MPDUs that are aggregated in the A-MPDU. The block ACK may, for each individual MPDU in the A-MPDU (or for each frame in the MPDUs), include a bitmap position to indicate that each individual MPDU is successfully received or not. For example, 16 MPDUs may be aggregated in an A-MPDU and sent to the receiver. The transmitter expects a corresponding block ACK to include a bitmap of 16 bits to indicate whether each of the 16 MPDUs are successfully received or not. Successful receipt of each MPDU may be indicated by a corresponding bit position in the bitmap set to 1. For MPDUs that were not successfully received, their positioning may be indicated by a “0” in the corresponding bit position in the bitmap.
- Recently, the number of MPDUs aggregated in an A-MPDU has increased significantly. For example, a large amount of MPDUs may be aggregated in a single A-MPDU. In some schemes, 256 MPDUs may be aggregated in an A-MPDU, which would result in a 256-bit block ACK. In other schemes, 1024 MPDUs may be aggregated, which would result in a 1024-bit block ACK. In yet other schemes, 4096 MPDUs (4k) may be aggregated, which would result in a 4096-bit block ACK. For example, a system that uses 320 megahertz or 4k QAM may send 4096 MPDUs in a single aggregation. Using conventional techniques that require positive acknowledgement of receipt, an A-MPDU with 4096 MPDUs would mean a 4096 bit block ACK bitmap, which is 512 bytes in size. With these increasing A-MPDU sizes, the amount of data needed just to acknowledge receipt may be proportionally large and inefficient. As A-MPDUs continue to include increasingly more MDPUs, this problem of large acknowledgment message sizes grows.
- To remedy these and other shortcomings, a receiver in the proposed system may send negative acknowledgements “NACKs” to identify wireless data that the receiver is missing. A NACK may identify, for example, one or more MPDUs. By including the missing MPDUs without including the received MPDUs, the bitmap size may be reduced. As a comparison, for a 4k A-MPDU where the receiver does not receive one of the MPDUs, the conventional approach would use a 4k bit bitmap to request the one missing MPDU. In contrast, the present disclosure may use a NACK with a SEQ number of the missing MPDU that may be 1 bit in size, which is significantly smaller than a 4k-bit ACK that would be used under conventional systems. Under the present disclosure, the receiver may not positively acknowledge receipt of every MPDU, so long as the receiver has enough information to let the transmitter know what the receiver has missed and/or what the receiver is expecting to receive.
- As another benefit, the present disclosure may reduce a number of transmissions as well as reduce an amount of data being communicated between a receiver and transmitter. For example, the receiver may use the NACK for flow control. For example, the receiver may adjust a window parameter, such as a RX window size, or any other RX window parameter to influence the transmitter. In response to the adjusted window parameter, the transmitter may increase or decrease an amount of data that is sent to the receiver.
- These and other implementations of the present disclosure will be explained with reference to the accompanying figures. It is to be understood that the figures are diagrammatic and schematic representations of such example implementations, and are not limiting, nor are they necessarily drawn to scale. In the figures, features with like numbers indicate like structure and function unless described otherwise.
-
FIG. 1 is a block diagram of an example wireless local area network (WLAN) 100 in which a negative acknowledgement scheme for wireless data may be implemented. TheWLAN 100 includes multiple wireless nodes, atransmitter 102 and areceiver 104. In general, thewireless nodes - Each of the
wireless nodes transmitter 102 may transmit and retransmit data to thereceiver 104 and thereceiver 104 may receive data and request retransmission of at least some of the data from thetransmitter 102. - As illustrated, the
transmitter 102 is implemented as an access point (AP) and thereceiver 104 is implemented as a wireless client device or station (STA). For example, thetransmitter 102 may include a gateway, a repeater, a mesh node, and/or other suitable AP for wireless stations or devices. Thetransmitter 102 may connect to the Internet and/or a core network via a bridge, a backhaul link, a base station, and/or other suitable devices or connections. - The
receiver 104 may include a desktop computer, a laptop computer, a tablet computer, a mobile phone, a smartphone, a printer, a smart television, a digital video disc (DVD) player, a security camera, a smart device, or any other device configured for wireless communication. - In these and other implementations, each of the
wireless nodes - As illustrated in
FIG. 1 , thetransmitter 102 includes ahost processor 106 coupled to anetwork interface 108. Thenetwork interface 108 includes a medium access control (MAC) layer that includes aMAC processor 110 with or coupled to a MAC buffer 112 (e.g., a MAC-level transmit (TX) and/or receive (RX) buffer), and a physical (PHY) layer that includes aPHY processor unit 114. ThePHY processor unit 114 includes one or more transceivers 116 a-116 n (collectively transceivers 116), and the transceivers 116 are coupled to one or more antennas 118 a-118 n (collectively antennas 118). ThePHY processor unit 114 includes or is coupled to a PHY buffer 120 (e.g., a PHY-level TX and/or RX buffer). Although two transceivers 116 and two antennas 118 are illustrated inFIG. 1 , thetransmitter 102 can include different numbers (e.g., 1, 2, 4, 5, etc.) of transceivers 116 and antennas 118 in other implementations. - As illustrated, the
receiver 104 includes ahost processor 122 coupled to anetwork interface 124. Similar to thenetwork interface 108, thenetwork interface 124 may include both a MAC layer and a PHY layer. In particular, thenetwork interface 124 includes aMAC processor unit 126 with or coupled to aMAC buffer 128 and aPHY processor unit 130 with or coupled to aPHY buffer 132. ThePHY processor unit 130 includes one or more transceivers 134 a-134 n (collectively transceivers 134A), and the transceivers 134 are coupled to one or more antennas 136A-136N (collectively antennas 136). Although two transceivers 134 and two antennas 136 are illustrated inFIG. 1 , thereceiver 104 can include different numbers (e.g., 1, 2, 4, 5, etc.) of transceivers 134 and antennas 136 in other implementations. - In the
WLAN 100, wireless data is sent from thetransmitter 102 to thereceiver 104, such as viaantennas receiver 104 fails to correctly receive some or all of the wireless data, retransmission wireless data that includes some or all of the wireless data may be sent by thetransmitter 102 to thereceiver 104. In some embodiments, thereceiver 104 may specify specific portions of the wireless data that failed to receive correctly to request that generally only those portions of the wireless data be included in the retransmission packet. - In more detail, the
transmitter 102 prepares data for transmission as MAC protocol data units (MPDUs) in an aggregate MPDU (A-MPDU) at the MAC (e.g., at the MAC processor unit 110) which A-MPDU can be transmitted as wireless data, e.g., in a wireless packet, to thereceiver 104. The A-MPDU may be transmitted with a header that identifies a sequence number (SEQ) for each MPDU in the A-MPDU. Additionally or alternatively, the header may identify a sequence number (SEQ) for each frame (e.g., MPDU) in the A-MPDU. The frames may be buffered in theMAC buffer 112, e.g., for MPDU-level retransmissions. - In at least one embodiment, the
transmitter 102 may send a set of multiple A-MPDUs as wireless data to thereceiver 104. The multiple A-MPDUs may be transmitted with a header that identifies a SEQ for each MPDU in the set of multiple A-MPDUs. - The
receiver 104 receives the wireless data and theMAC processor unit 126 may inspect the header that identifies each MPDU in the A-MPDU to determine whether each MPDU in the A-MPDU (or set of A-MPDUs) was received by thereceiver 104. Thereceiver 104 may also error check the MPDUs for MPDU-level errors and may identify one or more MPDU-level errors (e.g., undecodable or incorrectly decoded MPDUs) and/or one or more correctly received MPDUs (e.g., successfully decoded MPDUs). TheMAC processor unit 126 may buffer one or more MPDUs in theMAC buffer 128. - The
receiver 104 may then generate feedback based on any MPDU that was not received, and/or based on the error checking. The feedback may identify one or more missing MPDUs, and/or MPDU-level errors. Example feedback may include a negative acknowledgement (NACK) that indicates and/or identifies at least one of failed MPDUs or received MPDUs. - When the feedback includes MPDU-level feedback, a selective NACK message may be used to inform the
transmitter 102 of any MPDUs to retransmit to thereceiver 104. For example, each MPDU in the A-MPDU may be associated with a sequence identifier (SEQ) and the feedback may include SEQs numbers for each missing MPDU. The receiver may determine a next expected SEQ and may release any stored frames with SEQ numbers below the next expected SEQ. - The
transmitter 102 receives the feedback from thereceiver 104 and may send a retransmission of the wireless data based on the feedback. For example, where the feedback identifies failed MPDUs and/or requests retransmission of the failed MPDUs, thetransmitter 102, may resend the failed MPDUs. Alternatively, thetransmitter 102, (e.g., the PHY layer and/or the MAC layer of the transmitter 102) may construct retransmission wireless data, e.g., in the form of one or more retransmission packets, that may include retransmission MPDUs that correspond to the failed MPDUs. The retransmissions can be sent to the receiver without new data. In at least one embodiment, thetransmitter 102 andreceiver 104 may engage in an iterative session in which retransmissions and feedback are exchanged between thetransmitter 102 and thereceiver 104 until all the wireless data is received correctly or until a timeout is reached. Alternatively, the retransmission wireless data may be sent to thereceiver 104 together with new wireless data. - In at least one embodiment, the
receiver 104 may reduce the frequency of sending the feedback. For example, the feedback (e.g., a selective NACK) can be sent after being solicited by thetransmitter 102, or after the receiver side has detected a missing MPDU. - In at least one embodiment, a RX window scheme may be used to track and handle missing wireless data. For example, the RX window may initially include each MPDU in a particular A-MPDU or in a set of multiple A-MPDUs. Starting at the beginning of the window, the
receiver 104 may determine whether each MPDU in the window has been received. If thereceiver 104 identifies an MPDU that has not been received, any MPDUs that have been received may be released such that the missing MPDU may be at the beginning of the window. If the window stays the same size, additional MPDUs may be added to the end of the window. Thereceiver 104 may send the feedback, e.g., a NACK, that indicates a receive window parameter that at least one of: a SEQ of the frame at the head of the RX window (Win_start_seq), a size of the RX window (Win_size), and a SEQ of the frame at the end of the RX window (Win_end_seq). Example feedback messages (e.g., selective NACK frame structures) are illustrated inFIGS. 2A and 2B . - In at least one embodiment, the
receiver 104 may communicate with thetransmitter 102 in view of local constraints at thereceiver 104 or any other constraint identified by thereceiver 104. For example, thereceiver 104 may have a local constraint of not having sufficient room in a buffer (e.g.,buffer 128, buffer 132) to receive a particular amount of data from thetransmitter 102. In response to a determination thatreceiver 104 may not have sufficient room in a buffer, the receiver can adjust the RX window size. For example, for an initial 4k RX window size, thereceiver 104 may only be able to receive a subset of the 4k data because of local memory constraints. Thereceiver 104 may adjust the RX window size to inform thetransmitter 102 to not send more than what thereceiver 104 can handle. The RX window size may be adjusted to any size that is smaller than the initial RX window size. For example, the RX window size may be adjusted to 1 to receive the data at the beginning of the RX window size. In another example, the RX window size may be adjusted to 16, such that thetransmitter 102 may retransmit 16 frames (or MPDUs) to thereceiver 104. Any size adjustment to the RX window size is contemplated. Thetransmitter 102 can adjust the next transmission to be a retransmission of those MPDU which are missing. In at least one embodiment, thetransmitter 102 may transmit a number of MPDUs that thereceiver 104 can handle. In at least one embodiment, in the event that the retransmission results in missing wireless data, the RX window size may be further decreased (such as to less than 16 as in the previous example). In this manner, thereceiver 104 may use the RX receive window size as a mechanism to provide flow control to thetransmitter 102. In another example, thereceiver 104 may identify any type of constraint, such as a local hardware or software constraint, network congestion, or any other constraint that may affect an ability of thereceiver 104 to receive wireless data from thetransmitter 102. The RX window size may be adjusted to any number and may be adjusted based on any constraint, including the constraints described. - In at least one embodiment, the
receiver 104 can influence thetransmitter 102 throughput control by adjusting the RX window size. For a 4K window size, if thereceiver 104 has an unlimited amount of memory (or an amount of memory that is unlikely to be fully used), then thereceiver 104 may set the RX window size at or near the memory size. In the event that thereceiver 104 momentarily experiences some kind of constraint on the memory, for example, thereceiver 104 can reduce the RX window size to any number of window size that the local memory of thereceiver 104 can handle. The RX window size may be changed anytime. For example, the RX window size may be dynamically changed every time receiver sends a selective NACK. - In another example of how the
receiver 104 may influence data flow control of thetransmitter 102, in response to thereceiver 104 identifying a constraint, thereceiver 104 can reduce the RX window size to any number, even to zero, which informs thetransmitter 102 to stop transmission of data to thereceiver 104 until thetransmitter 102 receives another acknowledgement from the receiver with a RX window size that is non-zero. - In at least one embodiment, to reduce data being transferred with the NACK, the NACK bitmap may include one bit, which is for a first frame in the RX window. The bitmap length could one byte for the first frame.
- In at least one embodiment, the
receiver 104 may add or append the feedback message to a management frame or to any other message which may even further reduce the amount of data that is sent by thereceiver 104 to thetransmitter 102. The feedback message, for example, may be appended, combined, concatenated, encapsulated, or otherwise included with any other message. -
FIG. 2A illustrates anexample feedback message 200. Thereceiver 104 ofFIG. 1 may be configured to generate feedback according to thefeedback message 200. In at least one embodiment, thefeedback message 200 may be referred to as aselective NACK frame 200. - The
feedback message 200 may include any number of fields, such as a frame control (FC)field 202, a duration/ID 204, a receiver address (RA) 206, abitmap length 208, a start SEQ 210, aNACK bitmap 212, an expected next SEQ (e.g., next frame or MPDU in a sequence) 214, aRX window size 216, and a last field (FCS) 218. - The
FC field 202 and the duration/ID 204 may include any number of bits and may be used, for example, for virtual carrier sense, power management, to indicate a contention-free period, etc. - The
RA 206 may include a MAC address of the intended recipient of the feedback frame (e.g., thetransmitter 102 ofFIG. 1 ). Thebitmap length 208 may be used to indicate a bitmap size for the NACK bitmap, which may be variable in size. Thebitmap length 208 may be sized such that the number of bits in the bitmap falls on a byte boundary, where one byte has 8 bits. In at least one embodiment, the number of bits in the bitmap may be any number in multiples of 8. Thebitmap length 208 may be set to any number. - The
RX window size 216 may include any window size, such as any size between 1 and 4069 according to the IEEE 802.11be standard. For example, for a 1k window size (e.g., 1024), then transmitter can, without receiving an ACK or a NACK, continue to transmit up to 1k frames to thereceiver 104. The expectednext SEQ 214 may indicate a next SEQ that is outside of the window or inside the window. For the 1k window size in the above example, the next expected SEQ may be 1025, which is 1024+1. - In an example where wireless data associated with SEQ=1 is missing, the
bitmap length 208 may be set to 1 byte (8 bits), the start SEQ 210 may be set to “0”, theNACK bitmap 212 may be a binary bitmap with the 8 bits indicated by thebitmap length 208, and the RX window size may be set to “1” which may indicate to thetransmitter 102 to send one frame (e.g., MPDU), because the RX window is full due to the loss of the frame with SEQ=1. In this example, the NACK bitmap may=10111111, where the bit[1] location is set to “0” to indicate that the SEQ=1 frame has not been received by thereceiver 104. In this example, 300 frames have been received (SEQs=0-299). The expected next SEQ may be set to “300”, which may indicate to thetransmitter 102 that the next frame to send after retransmitting SEQ=1, is a frame with SEQ=300. The RX window size may be increased and thetransmitter 102 may continue to send wireless data to thereceiver 104. - In another example where the
bitmap length 208 may be set to 1 byte (8 bits), thereceiver 104 may determine that the frame with SEQ=2 is missing. Thereceiver 104 may generate the feedback message with the start SEQ=0, because SEQ=2 would be included in a bitmap that started at SEQ=0 and also would fall on a byte boundary. The resultingNACK bitmap 212 would be 11011111, which may indicate to thetransmitter 102 that SEQ=2 missing and to send the wireless data that corresponds to SEQ=2. - Continuing the above example, the
receiver 104 may determine that a second frame is missing, such as a frame that corresponds to SEQ=100. As in the above example,receiver 104 has lost SEQ=2, but instead of using a large bitmap to cover 0-100, thebitmap length 208 may still be set to 1, as in the above example, which results in an 8-bit bitmap that covers SEQ=2. To indicate that the frame that corresponds to SEQ=100 is missing, the next expectedSEQ 214 may be set to “100”. In response to receiving such feedback, thetransmitter 102 may send two at least two frames, including the frames that correspond to SEQ=2 and SEQ=100. In this manner, thereceiver 104 may request more than one missing frame without creating a relatively large bitmap. - As an alternative to the above example, in the event that the
receiver 104 determines that it is missing more than one frame that would fall on the same bitmap, a single bitmap may be used without adjusting the next expectedSEQ 214 field. For example, thereceiver 104 may determine that the frames with SEQ=2 and SEQ=7 are missing. The resultingNACK bitmap 212 may be 11011110, where bit[2] and bit[7] have been set to “0” to indicate that the frames with SEQ=2 and SEQ=7 are missing. In response to receiving this bitmap, thetransmitter 102 may send the wireless data that corresponds to SEQ=2 and SEQ=7. In this manner, thereceiver 104 may indicate up to 8 missing frames in a single 8-bit bitmap by setting any of the bits to 0 to indicate a missing SEQ. This feedback scheme also provides a benefit of being able to request multiple missing frames while minimizing the size of the feedback message. - In a different example, where the missing SEQ numbers are 2 and 11, the
bitmap length 208 may be set to 2 which may encompassbit positions 0 through 15. Bit[2] and bit[11] may be set to “0” to indicate thatSEQ numbers 2 and 11 are missing. The resulting bitmap may, for example, be 1101111111101111 and may be 2 bytes in size. -
FIG. 2B illustrates another example feedback message 230. The feedback message 230 may be similar to thefeedback message 200 and may include any number of fields, such as theFC field 202, the duration/ID 204, theRA 206, an expectednext SEQ 214, theRX window size 216, and the FCS 218. - The feedback message 230 may be used to identify multiple missing frames that may not be within a close SEQ range of each other (such as within a same byte boundary), while also minimizing the size of the feedback message. For example, for a 1k window size, and where the
receiver 104 determines that frames corresponding toSEQ numbers receiver 104 may generate a feedback message that includes multiple, smaller bitmaps. - To provide the feedback message that includes multiple, smaller bitmaps, the feedback message 230 may include a bitmap field count 240 and multiple bitmap group fields 250. Any number of bitmap group fields 250 may be included, as illustrated by bitmap group fields 250 a-250 n. The bitmap field count 240 may indicate how many bitmap group fields 250 are included in the feedback message.
- Each bitmap group field 250 may include a bitmap length 252 (which may be similar to the
bitmap length 208 ofFIG. 2 ), a start SEQ 254 (which may be similar to the start SEQ 210 ofFIG. 2 ), and a NACK bitmap 256 (which may be similar to theNACK bitmap 212 ofFIG. 2 ). - The
receiver 104 ofFIG. 1 may be configured to generate feedback according to the feedback message 230. Thereceiver 104 may use the feedback message 230 to generate a feedback message to indicate multiple missing frames that span multiple byte boundaries. As in the above example, where thereceiver 104 determined that frames corresponding toSEQ numbers SEQ numbers - For SEQ=2, the
bitmap length 252 a may be set to “1”, thestart SEQ 254 a may be set to “0”, and theNACK bitmap 256 a may have bit[2] set to “0” to indicate that SEQ=2 is missing, as in “11011111”. - For SEQ=100, the
bitmap length 252 b may be set to “1”, thestart SEQ 254 b may be set to “96”, and theNACK bitmap 256 b may have bit[4] set to “0” to indicate that SEQ=100 is missing, as in “11110111”. - For SEQ=700 and SEQ=705, the
bitmap length 252 n may be set to “2”, thestart SEQ 254 n may be set to “696”, and theNACK bitmap 256 n may have bit[4] set to “0” to indicate that SEQ=700 is missing and bit[9] set to “0” to indicate that SEQ=705 is missing, as in “1111011110111111”. - For SEQ=750, the expected
next SEQ 214 may be set to 750. In this manner, thereceiver 104 may indicate to thetransmitter 102 thatSEQ numbers transmitter 102 can sendSEQ numbers receiver 104. -
FIG. 2C illustrates anotherexample feedback message 270. Thefeedback message 270 may be similar to thefeedback messages 200, 230 and may include any number of fields, such as theFC field 202, the duration/ID 204, theRA 206, an expectednext SEQ 214, theRX window size 216, the FCS 218, and the bitmap field count 240. - As compared to the feedback message 230 of
FIG. 2B , thefeedback message 270 may have the bitmap field count set to “0”, which may indicate to thetransmitter 102 that no bitmap fields are included in thefeedback message 270. Additionally or alternatively, thefeedback message 270 may not include the bitmap field count 240 when no bitmaps are present in thefeedback message 270. This type offeedback message 270 may be used by thereceiver 104 to adjust the receive window size and, in some embodiments, the expectednext SEQ 214. In an example usage of the feedback message 230, thereceiver 104 may have initially closed its RX window in a previous NACK feedback message, such as by setting the RX window size 216 (as inFIG. 2A ) to “0”. Thetransmitter 102 may send any number of retransmission wireless data to thereceiver 104 and no new wireless data in view of the RX window size being set to “0”. Thereceiver 104 may receive all of the retransmitted frames successfully, and in response to receiving all of the retransmitted frames successfully, thereceiver 104 may release all of the received frames. Thereceiver 104 may then send thefeedback message 270 without any bitmap fields to reopen the RX window (e.g., by setting the RX window size to any non-zero number) and to indicate the expectednext SEQ 214 to thetransmitter 102. -
FIGS. 3A and 3B illustrate example NACK bitmaps 300, 350, respectively. The NACK bitmaps 300, 350 may be embodiments of theNACK bitmap 212 ofFIG. 2 . - The NACK bitmap 300 may be a Tx/Rx sliding window bitmap. The NACK bitmap 300 may include any number of bits. For example, the NACK bitmap 300 may include a first bit, bit[0], that may represent a start position of the Tx/Rx sliding window (win_start_seq). For a NACK bitmap 300 that includes “n” bits, the “nth” bit may indicate the end position of the Tx/Rx sliding window (win_end_seq). Bits in-between bit[0] and bit[n] may indicate the other bits in the bitmap, where bit[n−1] may represent the win_start_seq+n−1 position.
- In at least one embodiment, the RX window may be a sliding window. For example, for a 1K window with 1024 bits, the starting sequence number may be 100 (which may be indicated in Start SEQ 210 of
FIG. 2 ) and the ending sequence number in that receive window may be the 100 plus 1023. Thereceiver 102 may receive everything within this window, for example, except the frame sequence number equal to 100 and the frame sequence number equal to 1023+100. In other words, those two frames may be missing. To handle this situation, it may not be efficient or productive for thereceiver 104 to send a NACK bitmap that is 1K in size. Instead, thereceiver 104 may send a bitmap with a length equal to one, which is one byte in size. In such a bitmap bit[0] may indicate “1” and the other bits may indicate “0”, which indicates that the wireless data that corresponds to bit[0] is missing. Continuing with the above example, this bitmap indicates to thetransmitter 102 that thereceiver 104 is missingSEQ number 100. Thetransmitter 102 can send the wireless data that corresponds toSEQ number 100 to thereceiver 104. In at least one embodiment, the NACK may also indicate an expected next SEQ, such as in the expectednext SEQ 216 field in theNACK frame 200 ofFIG. 2 ), which may be the 1023+100 frame. TheNACK frame 200 may include any number of fields that are similar to the expectednext SEQ 216 field where thereceiver 104 may indicate missing frames to thetransmitter 102. Using the NACK, thetransmitter 102 may determine what frames to send to thereceiver 104. - In at least one embodiment, the because the NACK includes both the start SEQ and the RX window size, the last frame of the window may be implied. The
transmitter 102 may retransmit the last frame of the window as well, which result in the entire sliding window being filled. With the entire sliding window being filled, thereceiver 104 may release all of the frames in the sliding window. Thereceiver 104 may update the sliding window with the next SEQ number. - In the event that a frame in the middle of the window is not received, such as
frame 600 in the above example with a 1K window, frames 1-599 may be released and the sliding window may be updated to have a start SEQ of 600. The NACK may include the starting SEQ number of 600. -
FIG. 4 illustrates an example sequence diagram 400 for wireless data communication between atransmitter 102 and areceiver 104. At 402, thetransmitter 102 may send wireless data to thereceiver 104. The wireless data may include a header that indicates that wireless data that is in the transmission. At 404, thereceiver 104 may determine if any frames were not received, such as by inspecting the header to determine what wireless data to expect and comparing the received wireless data to the expected wireless data. At 406, thereceiver 104 may send a NACK that identifies the missing wireless data to thetransmitter 102. At 408, thetransmitter 102 may retransmit the missing wireless data to the receiver. At 410, thereceiver 104 may release wireless data that is successfully received. -
FIGS. 5-6 illustrate flow diagrams of example methods related to wireless communication. The methods may be performed by processing logic that may include hardware (circuitry, dedicated logic, etc.), software (such as is run on a computer system) which processing logic may be included in anytransmitter 102 orreceiver 104, or another computer system or device. However, another system, or combination of systems, may be used to perform the methods. For simplicity of explanation, methods described herein are depicted and described as a series of acts. However, acts in accordance with this disclosure may occur in various orders and/or concurrently, and with other acts not presented and described herein. Further, not all illustrated acts may be used to implement the methods in accordance with the disclosed subject matter. In addition, those skilled in the art will understand and appreciate that the methods may alternatively be represented as a series of interrelated states via a state diagram or events. Additionally, the methods disclosed in this specification are capable of being stored on an article of manufacture, such as a non-transitory computer-readable medium, to facilitate transporting and transferring such methods to computing devices. The term article of manufacture, as used herein, is intended to encompass a computer program accessible from any computer-readable device or storage media. Although illustrated as discrete blocks, various blocks may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. -
FIG. 5 illustrates a flowchart of anexample method 500 to direct wireless communication at a transmitter. Themethod 500 may be performed by any suitable system, apparatus, or device. For example, one or more of thewireless nodes FIG. 1 may perform or direct performance of one or more of the operations associated with themethod 500. For purposes of discussion, themethod 500 may be discussed as being performed by thetransmitter 102 ofFIG. 1 . Themethod 500 may begin atblock 505 where processing logic may aggregate wireless data frames into a block of frames. In at least one embodiment, the processing logic may aggregate multiple MPDUs into an A-MPDU or multiple A-MPDUs. Atblock 510, the processing logic may send the block of frames to a receiver (e.g., thereceiver 104 ofFIG. 1 ). Atblock 515 the processing logic may receiver a message indicating that a frame in block of frames was not received by the receiver. The message may include a feedback message which may be structured according to thefeedback message structures 200 or 250. Atblock 520, the processing logic may send the missing frame to the receiver. -
FIG. 6 illustrates a flowchart of anexample method 600 to direct wireless communication at a receiver. Themethod 600 may be performed by any suitable system, apparatus, or device. For example, thereceiver 104 ofFIG. 1 may perform or direct performance of one or more of the operations associated with themethod 600. - The
method 600 may begin atblock 605 where processing logic may receive a message indicative of a block of frames. Atblock 610, the processing logic may determine that a particular frame was not received. Atblock 615 the processing logic may determine a sequence number for the particular frame that was not received. Atblock 620, the processing logic may adjust a receive window parameter. - At
block 625 the processing logic may send a message to a transmitter indicative of the particular frame. Atblock 630, the processing logic may receive the particular frame. - At
block 635 the processing logic may determine whether there are more missing frames in the block of frames. In response to a determination that there are more missing frames in the block of frames (“Yes” at block 635), the processing logic may proceed to any ofblock 615, block 620, or block 625. In response to a determination that there are no more missing frames in the block of frames (“No” at block 635), the processing logic may proceed to block 640 where the processing logic may release at least one frame in the block of frames. Atblock 645 the processing logic may reset the receive window parameter. - The subject technology of the present disclosure is illustrated, for example, according to various aspects described below. Various examples of aspects of the subject technology are described as numbered examples (1, 2, 3, etc.) for convenience. These are provided as examples and do not limit the subject technology. The aspects of the various implementations described herein may be omitted, substituted for aspects of other implementations, or combined with aspects of other implementations unless context dictates otherwise. For example, one or more aspects of example 1 below may be omitted, substituted for one or more aspects of another example or examples (e.g., example 2), or combined with aspects of another example. The following is a non-limiting summary of some example implementations presented herein.
- Example 1. A method, including receiving a message indicative of a block of frames that were sent to the receiver, determining that a particular frame associated with the block of frames was not received, sending a feedback message to the transmitter with a bitmap indicating that the particular frame was not received by the receiver, and receiving the particular frame from the transmitter.
- Example 2. A transmitter for wireless communication with a receiver in a wireless network includes a memory and a processor coupled to the memory, the processor to perform or control performance of operations The operations include sending wireless data to the receiver. The operations include receiving a feedback message from the receiver with a bitmap that identifies a subset of the wireless data that the receiver failed to receive. The operations include constructing retransmission wireless data that includes the subset of the wireless data in view of the bitmap. The operations include sending the retransmission wireless data to the receiver.
- Example 3. A receiver for wireless communication with a transmitter in a wireless network includes a memory and a processor coupled to the memory, the processor to perform or control performance of operations. The operations include receiving a message indicative of a block of frames that were sent to the receiver. The operations include determining that a particular frame associated with the block of frames was not received. The operations include sending a feedback message to the transmitter with a bitmap indicating that the particular frame was not received by the receiver. The operations include receiving the particular frame from the transmitter.
-
FIG. 7 illustrates a block diagram of anexample computing system 2002 that may be used to perform or direct performance of one or more operations described according to at least one implementation of the present disclosure. Thecomputing system 2002 may include aprocessor 2050, amemory 2052, and adata storage 2054. Theprocessor 2050, thememory 2052, and thedata storage 2054 may be communicatively coupled. - In general, the
processor 2050 may include any suitable special-purpose or general-purpose computer, computing entity, or processing device including various computer hardware or software modules and may be configured to execute instructions stored on any applicable computer-readable storage media. For example, theprocessor 2050 may include a microprocessor, a microcontroller, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a Field-Programmable Gate Array (FPGA), or any other digital or analog circuitry configured to interpret and/or to execute computer-executable instructions and/or to process data. Although illustrated as a single processor, theprocessor 2050 may include any number of processors configured to, individually or collectively, perform or direct performance of any number of operations described in the present disclosure. - In some implementations, the
processor 2050 may be configured to interpret and/or execute computer-executable instructions and/or process data stored in thememory 2052, thedata storage 2054, or thememory 2052 and thedata storage 2054. In some implementations, theprocessor 2050 may fetch computer-executable instructions from thedata storage 2054 and load the computer-executable instructions in thememory 2052. After the computer-executable instructions are loaded intomemory 2052, theprocessor 2050 may execute the computer-executable instructions. - The
memory 2052 and thedata storage 2054 may include computer-readable storage media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable storage media may include any available media that may be accessed by a general-purpose or special-purpose computer, such as theprocessor 2050. By way of example, and not limitation, such computer-readable storage media may include tangible or non-transitory computer-readable storage media including Random Access Memory (RAM), Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Compact Disc Read-Only Memory (CD-ROM) or other optical disk storage, magnetic disk storage or other magnetic storage devices, flash memory devices (e.g., solid state memory devices), or any other storage medium which may be used to carry or store particular program code in the form of computer-executable instructions or data structures and which may be accessed by a general-purpose or special-purpose computer. Combinations of the above may also be included within the scope of computer-readable storage media. Computer-executable instructions may include, for example, instructions and data configured to cause theprocessor 2050 to perform a certain operation or group of operations. - Some portions of the detailed description refer to different modules configured to perform operations. One or more of the modules may include code and routines configured to enable a computing system to perform one or more of the operations described therewith. Additionally or alternatively, one or more of the modules may be implemented using hardware including any number of processors, microprocessors (e.g., to perform or control performance of one or more operations), DSPs, FPGAs, ASICs or any suitable combination of two or more thereof. Alternatively or additionally, one or more of the modules may be implemented using a combination of hardware and software. In the present disclosure, operations described as being performed by a particular module may include operations that the particular module may direct a corresponding system (e.g., a corresponding computing system) to perform. Further, the delineating between the different modules is to facilitate explanation of concepts described in the present disclosure and is not limiting. Further, one or more of the modules may be configured to perform more, fewer, and/or different operations than those described such that the modules may be combined or delineated differently than as described.
- Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations within a computer. These algorithmic descriptions and symbolic representations are the means used by those skilled in the data processing arts to convey the essence of their innovations to others skilled in the art. An algorithm is a series of configured operations leading to a desired end state or result. In example implementations, the operations carried out require physical manipulations of tangible quantities for achieving a tangible result.
- Unless specifically stated otherwise, as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as detecting, determining, analyzing, identifying, scanning or the like, can include the actions and processes of a computer system or other information processing device that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system's memories or registers or other information storage, transmission or display devices.
- Example implementations may also relate to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may include one or more general-purpose computers selectively activated or reconfigured by one or more computer programs. Such computer programs may be stored in a computer readable medium, such as a computer-readable storage medium or a computer-readable signal medium. Computer-executable instructions may include, for example, instructions and data which cause a general-purpose computer, special-purpose computer, or special-purpose processing device (e.g., one or more processors) to perform or control performance of a certain function or group of functions.
- Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter configured in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
- An example apparatus can include a Wireless Access Point (WAP) or a station and incorporating a VLSI processor and program code to support. An example transceiver couples via an integral modem to one of a cable, fiber or digital subscriber backbone connection to the Internet to support wireless communications, e.g. IEEE 802.11 compliant communications, on a Wireless Local Area Network (WLAN). The WiFi stage includes a baseband stage, and the analog front end (AFE) and Radio Frequency (RF) stages. In the baseband portion wireless communications transmitted to or received from each user/client/station are processed. The AFE and RF portion handles the upconversion on each of transmit paths of wireless transmissions initiated in the baseband. The RF portion also handles the downconversion of the signals received on the receive paths and passes them for further processing to the baseband.
- An example apparatus can be a multiple-input multiple-output (MIMO) apparatus supporting as many as N×N discrete communication streams over N antennas. In an example the MIMO apparatus signal processing units can be implemented as N×N. In various implementations, the value of N can be 4, 6, 8, 12, 16, etc. Extended MIMO operation enables the use of up to 2N antennae in communication with another similarly equipped wireless system. It should be noted that extended MIMO systems can communicate with other wireless systems even if the systems do not have the same number of antennae, but some of the antennae of one of the stations might not be utilized, reducing optimal performance.
- Channel State Information (CSI) from any of the devices described herein can be extracted independent of changes related to channel state parameters and used for spatial diagnosis services of the network such as motion detection, proximity detection, and localization which can be utilized in, for example, WLAN diagnosis, home security, health care monitoring, smart home utility control, elder care, automotive tracking and monitoring, home or mobile entertainment, automotive infotainment, and the like.
- Unless specific arrangements described herein are mutually exclusive with one another, the various implementations described herein can be combined in whole or in part to enhance system functionality and/or to produce complementary functions. Likewise, aspects of the implementations may be implemented in standalone arrangements. Thus, the above description has been given by way of example only and modification in detail may be made within the scope of the present invention.
- With respect to the use of substantially any plural or singular terms herein, those having skill in the art can translate from the plural to the singular or from the singular to the plural as is appropriate to the context or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity. A reference to an element in the singular is not intended to mean “one and only one” unless specifically stated, but rather “one or more.” Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the above description.
- In general, terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc.). Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general, such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that include A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B, and C together, etc.). Also, a phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to include one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”
- Additionally, the use of the terms “first,” “second,” “third,” etc., are not necessarily used herein to connote a specific order or number of elements. Generally, the terms “first,” “second,” “third,” etc., are used to distinguish between different elements as generic identifiers. Absence a showing that the terms “first,” “second,” “third,” etc., connote a specific order, these terms should not be understood to connote a specific order. Furthermore, absence a showing that the terms first,” “second,” “third,” etc., connote a specific number of elements, these terms should not be understood to connote a specific number of elements.
- The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described implementations are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17/237,510 US20210345169A1 (en) | 2020-05-01 | 2021-04-22 | Retransmission of wireless data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US202063019220P | 2020-05-01 | 2020-05-01 | |
US17/237,510 US20210345169A1 (en) | 2020-05-01 | 2021-04-22 | Retransmission of wireless data |
Publications (1)
Publication Number | Publication Date |
---|---|
US20210345169A1 true US20210345169A1 (en) | 2021-11-04 |
Family
ID=78292255
Family Applications (7)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/176,547 Active US11368896B2 (en) | 2020-05-01 | 2021-02-16 | Flexible distributed antenna array |
US17/237,383 Pending US20210344472A1 (en) | 2020-05-01 | 2021-04-22 | Wireless communication with coded data frames |
US17/237,469 Active US11647444B2 (en) | 2020-05-01 | 2021-04-22 | Spatial reuse in wireless communication |
US17/237,510 Pending US20210345169A1 (en) | 2020-05-01 | 2021-04-22 | Retransmission of wireless data |
US17/237,421 Pending US20210344465A1 (en) | 2020-05-01 | 2021-04-22 | Wireless communication using multiple frequencies segments |
US17/664,273 Active US11758461B2 (en) | 2020-05-01 | 2022-05-20 | Flexible distributed antenna array |
US18/194,404 Pending US20230239764A1 (en) | 2020-05-01 | 2023-03-31 | Spatial reuse in wireless communication |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/176,547 Active US11368896B2 (en) | 2020-05-01 | 2021-02-16 | Flexible distributed antenna array |
US17/237,383 Pending US20210344472A1 (en) | 2020-05-01 | 2021-04-22 | Wireless communication with coded data frames |
US17/237,469 Active US11647444B2 (en) | 2020-05-01 | 2021-04-22 | Spatial reuse in wireless communication |
Family Applications After (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/237,421 Pending US20210344465A1 (en) | 2020-05-01 | 2021-04-22 | Wireless communication using multiple frequencies segments |
US17/664,273 Active US11758461B2 (en) | 2020-05-01 | 2022-05-20 | Flexible distributed antenna array |
US18/194,404 Pending US20230239764A1 (en) | 2020-05-01 | 2023-03-31 | Spatial reuse in wireless communication |
Country Status (1)
Country | Link |
---|---|
US (7) | US11368896B2 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11387935B2 (en) * | 2021-02-19 | 2022-07-12 | Ultralogic 6G, Llc | Error detection and correction by modulation quality in 5G/6G |
US11456821B2 (en) | 2021-02-19 | 2022-09-27 | Ultralogic 6G, Llc | Retransmission of selected PAM-modulated message portions in 5G/6G |
US20240063947A1 (en) * | 2022-08-17 | 2024-02-22 | George W. Kuriyan | Method and System for Guaranteeing Reliability and Data Transfer Delay Range for Data Applications requiring Synchronized Data Transfer Between Sender and Receiver Over a Cellular Network |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130223345A1 (en) * | 2012-02-29 | 2013-08-29 | Qualcom Incorporated | Apparatus and methods for block acknowledgment compression |
US20170310601A1 (en) * | 2016-04-21 | 2017-10-26 | Qualcomm Incorporated | Radio-aware transmission control protocol rate control |
US20180337866A1 (en) * | 2017-05-17 | 2018-11-22 | Samsung Electronics Co., Ltd. | Tcp proxy device-assisted communication method and apparatus in wireless communication |
US20190104011A1 (en) * | 2017-10-02 | 2019-04-04 | Qualcomm Incorporated | Apparatus and methods for uniform constellations and non-uniform constellations in wireless local area networks |
US20190253296A1 (en) * | 2017-10-11 | 2019-08-15 | Qualcomm Incorporated | Systems and methods of communicating via sub-bands in wireless communication networks |
US20190268099A1 (en) * | 2018-02-26 | 2019-08-29 | Marvell World Trade Ltd. | Block acknowledgment operation |
US20200014495A1 (en) * | 2017-03-09 | 2020-01-09 | Intel IP Corporation | Method and apparatus for cross retransmission between gul and sul |
US20200336254A1 (en) * | 2019-04-19 | 2020-10-22 | Nxp Usa, Inc. | Hybrid automatic repeat request acknowledgement and upload multiuser operation |
US20200344007A1 (en) * | 2019-04-23 | 2020-10-29 | Qualcomm Incorporated | Harq sequences in wireless networks |
Family Cites Families (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6301249B1 (en) * | 1998-08-04 | 2001-10-09 | Opuswave Networks, Inc | Efficient error control for wireless packet transmissions |
US10644916B1 (en) * | 2002-05-14 | 2020-05-05 | Genghiscomm Holdings, LLC | Spreading and precoding in OFDM |
WO2006011718A1 (en) * | 2004-07-26 | 2006-02-02 | Samsung Electronics Co., Ltd. | Location tracking method in coordinator-based wireless network |
US11184037B1 (en) * | 2004-08-02 | 2021-11-23 | Genghiscomm Holdings, LLC | Demodulating and decoding carrier interferometry signals |
WO2006132328A1 (en) * | 2005-06-10 | 2006-12-14 | Matsushita Electric Industrial Co., Ltd. | Wireless communication apparatus and wireless communication method |
US20090175210A1 (en) * | 2007-07-26 | 2009-07-09 | Qualcomm Incorporated | Multiplexing and transmission of multiple data streams in a wireless multi-carrier communication system |
US20110286403A1 (en) * | 2009-11-20 | 2011-11-24 | Qualcomm Incorporated | Method and apparatus of confirming reception of clear-to-send frame for virtual carrier sensing |
US8355389B2 (en) * | 2010-03-12 | 2013-01-15 | Nokia Corporation | Simultaneous transmissions during a transmission opportunity |
US8473821B2 (en) * | 2010-11-09 | 2013-06-25 | Qualcomm, Incorporated | Packet-level erasure protection coding in aggregated packet transmissions |
EP2676476B1 (en) * | 2011-02-16 | 2018-10-31 | Nokia Solutions and Networks Oy | Radio link control |
EP2845335A1 (en) * | 2012-05-04 | 2015-03-11 | Corning Optical Communications Wireless Ltd. | Determining noise levels in frequency band(s) in distributed antenna systems and adjusting frequency band(s) of communications signals in response, and related components, systems, and methods |
US8644417B2 (en) * | 2012-05-08 | 2014-02-04 | Au Optronics Corporation | Methods and systems for multi-level data transmission |
US9419732B2 (en) * | 2012-09-28 | 2016-08-16 | Intel Corporation | Systems and methods for optimized decoding of in-band on-channel (IBOC) services |
US9344123B2 (en) * | 2012-11-19 | 2016-05-17 | Huawei Technologies Co., Ltd. | Systems and methods for historical signal interference cancellation (SIC) |
US9485777B2 (en) * | 2013-03-14 | 2016-11-01 | Qualcomm Incorporated | Systems and methods for scheduling wireless communications |
CN105340333B (en) * | 2013-10-18 | 2019-07-19 | 华为技术有限公司 | A kind of method and device of power and channel the joint configuration of WLAN |
US10247808B2 (en) * | 2015-01-12 | 2019-04-02 | Qualcomm Incorporated | Location reporting for extremely high frequency (EHF) devices |
US10291299B2 (en) * | 2015-09-07 | 2019-05-14 | Kabushiki Kaisha Toshiba | Wireless communication device |
US20170251488A1 (en) * | 2016-02-26 | 2017-08-31 | Comcast Cable Communications, Llc | Network Scheduling For Improved Reliability |
US10582455B2 (en) * | 2016-08-31 | 2020-03-03 | Qualcomm Incorporated | System and method for reducing interference from neighboring wireless devices |
WO2018057638A1 (en) * | 2016-09-20 | 2018-03-29 | Marvell World Trade Ltd. | Spatial reuse transmissions in wlans |
CN116709529A (en) * | 2016-11-17 | 2023-09-05 | 三星电子株式会社 | Method and apparatus in a wireless communication system |
FR3066342A1 (en) * | 2017-05-11 | 2018-11-16 | Orange | SINGULARIZATION OF FRAMES TO BE EMITTED BY A CONNECTED OBJECT AND BLOCKING OF REWARDED FRAMES ON A LOW CONSUMPTION WIRELESS COMMUNICATION NETWORK |
EP3626023B1 (en) * | 2017-05-16 | 2023-03-08 | Telefonaktiebolaget LM Ericsson (publ) | Method and apparatus for managing carrier sensing |
JP2019057763A (en) * | 2017-09-19 | 2019-04-11 | 株式会社東芝 | Radio communication apparatus and radio communication method |
CN111149385B (en) * | 2017-10-02 | 2023-07-25 | 索尼公司 | Communication device and communication method |
US10469140B1 (en) | 2017-10-09 | 2019-11-05 | Quantenna Communications, Inc. | WAP uplink optimization by selection of MIMO antennas spatial states |
CN110267350B (en) * | 2018-03-12 | 2022-09-20 | 中兴通讯股份有限公司 | Downlink and uplink transmission method and device, base station, terminal and storage medium |
KR102424190B1 (en) * | 2018-07-13 | 2022-07-21 | 후아웨이 테크놀러지 컴퍼니 리미티드 | NSA and SA networking mode selection method and terminal equipment |
WO2020028425A1 (en) * | 2018-07-30 | 2020-02-06 | Marvell World Trade Ltd. | Media access control for punctured/aggregated communication channels in wlan |
WO2020034100A1 (en) * | 2018-08-14 | 2020-02-20 | Qualcomm Incorporated | Interference layer categorization and non zero power interference measurement resource for non linear precoding |
CN113056958A (en) * | 2018-09-28 | 2021-06-29 | 马维尔亚洲私人有限公司 | WLAN operation using multiple component channels |
US10878697B2 (en) * | 2018-10-05 | 2020-12-29 | Cubic Corporation | Method and system to control traffic speed through intersections |
US11082156B2 (en) * | 2018-10-30 | 2021-08-03 | Nxp Usa, Inc. | Method and apparatus for generating a physical layer (PHY) data unit for hybrid automatic repeat request (HARQ) |
US11258500B2 (en) | 2018-11-05 | 2022-02-22 | Semiconductor Components Industries, Llc | Hybrid sector selection and beamforming |
US10797795B2 (en) * | 2018-11-27 | 2020-10-06 | Facebook, Inc. | System and method of satellite communication |
WO2020118501A1 (en) * | 2018-12-11 | 2020-06-18 | Qualcomm Incorporated | Basis report for compressed csi feedback with non-contiguous subband configuration |
JP2022033369A (en) * | 2018-12-18 | 2022-03-01 | ソニーグループ株式会社 | Communication apparatus and communication method |
CN113906698A (en) * | 2019-01-11 | 2022-01-07 | 马维尔亚洲私人有限公司 | WIFI Multiband communications |
EP3912422B1 (en) * | 2019-01-16 | 2023-07-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods, apparatus and device-readable mediums for scheduling transmissions in a wireless network |
US11432247B2 (en) * | 2019-04-22 | 2022-08-30 | Cypress Semiconductor Corporation | Methods, systems and devices for varying wireless transmit power based on path loss information |
US10999653B2 (en) * | 2019-05-07 | 2021-05-04 | Dahm Endeavor LLC | Detecting and monitoring location of wireless-enabled devices in a physical space |
WO2021071149A1 (en) * | 2019-10-07 | 2021-04-15 | 엘지전자 주식회사 | Signaling for data duplication transmission |
US20210136700A1 (en) * | 2019-10-30 | 2021-05-06 | International Business Machines Corporation | Dynamic optimization of transmitter power output (tpo) in portable wireless devices |
US20210288768A1 (en) * | 2020-03-13 | 2021-09-16 | Qualcomm Incorporated | Distributed tone mapping for power spectral density (psd) limits |
-
2021
- 2021-02-16 US US17/176,547 patent/US11368896B2/en active Active
- 2021-04-22 US US17/237,383 patent/US20210344472A1/en active Pending
- 2021-04-22 US US17/237,469 patent/US11647444B2/en active Active
- 2021-04-22 US US17/237,510 patent/US20210345169A1/en active Pending
- 2021-04-22 US US17/237,421 patent/US20210344465A1/en active Pending
-
2022
- 2022-05-20 US US17/664,273 patent/US11758461B2/en active Active
-
2023
- 2023-03-31 US US18/194,404 patent/US20230239764A1/en active Pending
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130223345A1 (en) * | 2012-02-29 | 2013-08-29 | Qualcom Incorporated | Apparatus and methods for block acknowledgment compression |
US20170310601A1 (en) * | 2016-04-21 | 2017-10-26 | Qualcomm Incorporated | Radio-aware transmission control protocol rate control |
US20200014495A1 (en) * | 2017-03-09 | 2020-01-09 | Intel IP Corporation | Method and apparatus for cross retransmission between gul and sul |
US20180337866A1 (en) * | 2017-05-17 | 2018-11-22 | Samsung Electronics Co., Ltd. | Tcp proxy device-assisted communication method and apparatus in wireless communication |
US20190104011A1 (en) * | 2017-10-02 | 2019-04-04 | Qualcomm Incorporated | Apparatus and methods for uniform constellations and non-uniform constellations in wireless local area networks |
US20190253296A1 (en) * | 2017-10-11 | 2019-08-15 | Qualcomm Incorporated | Systems and methods of communicating via sub-bands in wireless communication networks |
US20190268099A1 (en) * | 2018-02-26 | 2019-08-29 | Marvell World Trade Ltd. | Block acknowledgment operation |
US20200336254A1 (en) * | 2019-04-19 | 2020-10-22 | Nxp Usa, Inc. | Hybrid automatic repeat request acknowledgement and upload multiuser operation |
US20200344007A1 (en) * | 2019-04-23 | 2020-10-29 | Qualcomm Incorporated | Harq sequences in wireless networks |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11387935B2 (en) * | 2021-02-19 | 2022-07-12 | Ultralogic 6G, Llc | Error detection and correction by modulation quality in 5G/6G |
US11456821B2 (en) | 2021-02-19 | 2022-09-27 | Ultralogic 6G, Llc | Retransmission of selected PAM-modulated message portions in 5G/6G |
US11469856B2 (en) | 2021-02-19 | 2022-10-11 | Ultralogic 6G, Llc | Retransmission of selected message portions in 5G/6G |
US11522637B2 (en) | 2021-02-19 | 2022-12-06 | Ultralogic 6G, Llc | Selection of faulted message elements by modulation quality in 5G/6G |
US11522636B2 (en) | 2021-02-19 | 2022-12-06 | Ultralogic 6G, Llc | Modulation quality and fault mitigation in 5G/6G |
US11616679B2 (en) | 2021-02-19 | 2023-03-28 | Ultralogic 6G, Llc | Detection and mitigation of 5G/6G message faults |
US11770207B2 (en) | 2021-02-19 | 2023-09-26 | Ultralogic 6G, Llc | Method for mitigating branch-amplitude faults in 5G and 6G messages |
US11811579B2 (en) | 2021-02-19 | 2023-11-07 | David E. Newman | Recovery of corrupted 5G/6G messages by modulation quality |
US20240063947A1 (en) * | 2022-08-17 | 2024-02-22 | George W. Kuriyan | Method and System for Guaranteeing Reliability and Data Transfer Delay Range for Data Applications requiring Synchronized Data Transfer Between Sender and Receiver Over a Cellular Network |
Also Published As
Publication number | Publication date |
---|---|
US20210345217A1 (en) | 2021-11-04 |
US20210344465A1 (en) | 2021-11-04 |
US20230239764A1 (en) | 2023-07-27 |
US20210344388A1 (en) | 2021-11-04 |
US11647444B2 (en) | 2023-05-09 |
US20210344472A1 (en) | 2021-11-04 |
US11368896B2 (en) | 2022-06-21 |
US20220279418A1 (en) | 2022-09-01 |
US11758461B2 (en) | 2023-09-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20210345169A1 (en) | Retransmission of wireless data | |
US10153868B2 (en) | Hybrid automatic repeat request (H-ARQ) for a wireless local area network | |
US11424862B2 (en) | Data retransmission method and device, data response method and device, and storage medium | |
US9253290B2 (en) | Apparatus and methods for block acknowledgment compression | |
US9219578B2 (en) | Device, system and method of communicating aggregate data units | |
EP2923514B1 (en) | Method and system for improving wireless link efficiency | |
EP3070867B1 (en) | Apparatus and methods for block acknowledgment compression | |
WO2017084364A1 (en) | Communication device, and communication method for frame aggregation and transmission | |
US20070058566A1 (en) | Fast Control Messaging Mechanism For Use In Wireless Network Communications | |
US10985874B2 (en) | HARQ framing and retransmission with two-tier feedback | |
KR101133817B1 (en) | Wireless network and method for communicating aggregated packets | |
WO2021218435A1 (en) | Multi-link communication method and related apparatus | |
US20230299889A1 (en) | Feedback and retransmission format of harq protocol | |
CN112543036B (en) | MAC-based hybrid automatic repeat request (HARQ) | |
JP5738883B2 (en) | Method and apparatus for seamless transition between wireless links using different frequency bands for data transmission | |
CN107548104B (en) | Data transmission method, access point and station |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SEMICONDUCTOR COMPONENTS INDUSTRIES, LLC, ARIZONA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AGRAWAL, ABHISHEK KUMAR;WANG, HUIZHAO;AMINI, PEIMAN;AND OTHERS;SIGNING DATES FROM 20210316 TO 20210420;REEL/FRAME:056007/0296 |
|
AS | Assignment |
Owner name: DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT, NEW YORK Free format text: SECURITY INTEREST;ASSIGNORS:SEMICONDUCTOR COMPONENTS INDUSTRIES, LLC;FAIRCHILD SEMICONDUCTOR CORPORATION;REEL/FRAME:057054/0706 Effective date: 20210728 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
AS | Assignment |
Owner name: SEMICONDUCTOR COMPONENTS INDUSTRIES, LLC, ARIZONA Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH;REEL/FRAME:063516/0756 Effective date: 20230501 |
|
AS | Assignment |
Owner name: MAXLINEAR, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SEMICONDUCTOR COMPONENTS INDUSTRIES, LLC;REEL/FRAME:063572/0701 Effective date: 20230502 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
AS | Assignment |
Owner name: FAIRCHILD SEMICONDUCTOR CORPORATION, ARIZONA Free format text: RELEASE OF SECURITY INTEREST IN PATENTS RECORDED AT REEL 057054, FRAME 0706;ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:064083/0001 Effective date: 20230622 Owner name: SEMICONDUCTOR COMPONENTS INDUSTRIES, LLC, ARIZONA Free format text: RELEASE OF SECURITY INTEREST IN PATENTS RECORDED AT REEL 057054, FRAME 0706;ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:064083/0001 Effective date: 20230622 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STCV | Information on status: appeal procedure |
Free format text: NOTICE OF APPEAL FILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |