USPatent applicationPatented

Apparatus, system and method capable of aggregate compression in a wireless LAN

Granted 23 Nov 2010 · 5 office actions

Assignee: Intel Corporation

Law firm: Law firm · Log in to unlock

Attorney: Attorney · Log in to unlock

Inventors: Adrian P. Stephens · Examiner: Aung S Moe · AU 2474 · TC 2400

Life of the application

16 dated events
⤢ drag to zoom20062008201020122014201620182020202220242026ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

An embodiment of the present invention provides an apparatus, comprising a transmitter capable of compressing header information in an aggregate of Media Access Control Service Data Units (MSDUs) by using one or more flags fields to describe which address fields are present in said aggregate.

Description

4 parts
›BACKGROUND

Wireless networks and wireless communication have become prevalent throughout society creating the need for increased capacity and faster and more reliable wireless communication techniques. TGn Sync is a multi-industry group working together to rapidly introduce a unified proposal for the next generation of high performance wireless networks.

A proposal to 802.11 TGn may dramatically improve the capabilities of wireless networks while supporting the antenna configurations, product designs and protocol requirements of hundreds of millions of cellular handsets, enterprise base stations, and Wi-Fi enabled computers already in use. Key Features of the TGn Sync Proposal may include: MIMO Spatial Division Multiplexing to support 315 Mbps reliably with two antennas, up to 630 Mbps with larger systems; Scalable Architecture for different spatial stream (2 to 4) and spectrum configurations (10, 20, 40 MHz); seamless interoperability between 802.11a/b/g and new modes of operation; timed receive mode switching and multiple receiver addressing to reduce power for battery-operated devices; and flexible architecture offering product compliance for all major regulatory domains while preserving interoperability.

In the TGnSync proposal, there is included a Media Access Control Service Data Units (A-MSDU) aggregation, which is a way of “batching together” multiple higher-layer packets (MSDUs) into a single transmission unit, such as Media Access Control Protocol Data Units (MPDU). However, the subframe header in this proposal may be a fixed length and may contain information that is redundant if the A-MSDU contains multiple MSDUs for the same destination address/source address (DAISA) pair.

Thus, a strong need exists for the ability to remove the redundant information by providing an apparatus, system and method capable of aggregate compression in a wireless local area network (WLAN).

›BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:

FIG. 1 illustrates a structure of a subframe header with A-MSDU aggregation of an embodiment of the present invention;

FIG. 2 is a flow chart illustrating the process used of aggregate compression of one embodiment of the present invention.

It will be appreciated that for simplicity and clarity of illustration, elements illustrated in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements are exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals have been repeated among the figures to indicate corresponding or analogous elements.

›DETAILED DESCRIPTION · 1 of 2

In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.

Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data bits or binary digital signals within a computer memory. These algorithmic descriptions and representations may be the techniques used by those skilled in the data processing arts to convey the substance of their work to others skilled in the art.

An algorithm is here, and generally, considered to be a self-consistent sequence of acts or operations leading to a desired result. These include physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be understood, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.

Embodiments of the present invention may include apparatuses for performing the operations herein. An apparatus may be specially constructed for the desired purposes, or it may comprise a general purpose computing device selectively activated or reconfigured by a program stored in the device. Such a program may be stored on a storage medium, such as, but not limited to, any type of disk including floppy disks, optical disks, compact disc read only memories (CD-ROMs), magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), electrically programmable read-only memories (EPROMs), electrically erasable and programmable read only memories (EEPROMs), magnetic or optical cards, or any other type of media suitable for storing electronic instructions, and capable of being coupled to a system bus for a computing device.

The processes and displays presented herein are not inherently related to any particular computing device or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct a more specialized apparatus to perform the desired method. The desired structure for a variety of these systems will appear from the description below. In addition, embodiments of the present invention are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein. In addition, it should be understood that operations, capabilities, and features described herein may be implemented with any combination of hardware (discrete or integrated circuits) and software.

Use of the terms “coupled” and “connected”, along with their derivatives, may be used. It should be understood that these terms are not intended as synonyms for each other. Rather, in particular embodiments, “connected” may be used to indicate that two or more elements are in direct physical or electrical contact with each other. “Coupled” my be used to indicated that two or more elements are in either direct or indirect (with other intervening elements between them) physical or electrical contact with each other, and/or that the two or more elements co-operate or interact with each other (e.g. as in a cause and effect relationship).

It should be understood that embodiments of the present invention may be used in a variety of applications. Although the present invention is not limited in this respect, the devices disclosed herein may be used in many apparatuses such as in the transmitters and receivers of a radio system. Radio systems intended to be included within the scope of the present invention include, by way of example only, cellular radiotelephone communication systems, satellite communication systems, two-way radio communication systems, one-way pagers, two-way pagers, personal communication systems (PCS), personal digital assistants (PDA's), wireless local area networks (WLAN), personal area networks (PAN, and the like).

Turning now to FIG. 1 , as shown generally at 100 , is an A-MSDU 105 aggregation, which is a way of “batching together” multiple higher layer packets (MSDUs) into a single transmission unit (MPDU). It batches multiple MSDUs as though there were a single MSDU from the higher layer. The resulting A-MSDU is transported in one (unfragmented) or more (fragmented) Data MPDUs. In order to compress the header information, the subframe header 115 may be replaced by a new structure that is variable in length. Two unnecessary bits from the length field 125 may be used to created a flags 120 field that defines the layout of the new structure. The two bits are unnecessary since the MSDU may be limited in length ( 2304 B) so that 12 bits suffices to indicate the length. Further, there are actually 4 spare bits, and the present invention may use only 2 of them and leave 2 in an over-generous length field. The transmitter may use this feature to remove unnecessary address fields from the aggregate. As shown in FIG. 1 , address 1 ( 127 ) may be 0 or 48 bits and address 2 ( 130 ) may also be 0 or 48 bits in one exemplary embodiment of the present invention. However, it is understood that the present invention is not limited in this respect. The following table is one illustration of the Flags and address presence or not of one embodiment of the present invention.

›DETAILED DESCRIPTION · 2 of 2

Further, one embodiment of the present invention as an option may provide for an optimum compression with the optimal compression technique requiring the transmitter to have Temp_DA (temporary destination address) and Temp_SA (temporary source address) variables that may contain a short range (wireless technique address, such as an Institute of Electrical and Electronic Engineers (IEEE) 802.11 MAC address.

The transceiver or transmitter may initialize these variables from the Address fields of the MPDU header according to the state of the TODS and FromDS bits in the MPDU header as shown below (although it is understood that this table is merely illustrative of one embodiment of the present invention).

Following this initialization, the temporary destination address (Temp_DA) and temporary source address (Temp_SA) variables either contain an address, or contain the value unspecified. An unspecified value will not match any address in the algorithm or process described below. Then, for each Media Access Control Service Data Units (MSDU) with requested destination address called Media Access Control Service Data Units Destination Address (MSDU_DA) and source address called Media Access Control Service Data Units Source Address (MSDU_SA) that the transmitter wishes to add, it may perform the following logic

An embodiment of the present invention provides Receiver support for this feature. The receiver may keep the temporary destination address (Temp_DA) and temporary source address (Temp_SA) variables that are initialized from the Media Access Control Protocol Data Units (MPDU) header as defined by the same table above. It then may perform the following steps for each MSDU in the aggregate in order to determine MSDU_DA and MSDU_SA which are the addresses it indicates to the higher layers with the MSDU.

In an embodiment of the present invention, the algorithm may be described as follows:

Indicate MSDU to higher layers using Temp_SA as the source address and Temp_DA as the destination address

And:

Indicate MSDU to higher layers using Temp_SA as the source address and Temp_DA as the destination address.

Turning now to FIG. 2 , shown generally as 200 , is a flowchart of the operation of the algorithm of one embodiment of the present invention. New Aggregate 205 is initialized as Temp_DA and Temp_SA from the MPDU header at 210 . At 220 , it is determined if another MSDU in Aggregate. If no, the process ends at 215 , and if Yes, at 225 , it is determined if the format contains a Destination Address (DA). If no at 225 , it is determined at 240 if the format contains SA immediately, but if yes, Temp_DA is set to DA from subframe header first at 230 and then determined if the format contains SA at 240 . If no at 240 , indicate MSDU to higher layers using Temp_SA and Temp_DA as source and destination addresses at 255 . If yes at 240 , Temp_SA is set to SA from subframe header at 235 and then indicates MSDU to higher layers using Temp_SA and Temp_DA as source and destination addresses at 245 . After 245 , the process returns to 220 to determine if there is another MSDU in Aggregate. Thus, by adding subframe header compression, it is possible to save 12 B per MSDU.

While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.

›Tables in the description — 2
FlagsAddress 1Address 2
00Not presentNot present
01DANot present
10SANot present
11DASA
To DSFrom DSTemp_DATemp_SA
00Address 1Address 2
01Address 1Unspecified
10UnspecifiedAddress 2
11UnspecifiedUnspecified

Claims as granted

21 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

6 codes
IPC · International Patent Classification
Section H — Electricity
  • H04L12/28
USPC · US Patent Classification
370/389370/473370/474370/392370/393

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoomJul 2005Jan 2006Jul 2006Jan 2007Jul 2007Jan 2008Jul 2008Jan 2009Jul 2009Jan 2010Jul 2010Jan 2011USPTOApplicantNon-final rejectionResponse after non-finalRequest for continued examinationResponse after non-finalResponse after non-finalRequest for continued examination
USPTOApplicanthover for detail · click to open
Pendency
5.4 y
1,975 days filing → grant
Office actions
5
non-final + final
Responses
3
2 RCE
Interviews
2
examiner interview summaries
Examiner
Aung S Moe
art unit 2474 · TC 2400
Citations: 26 back · 8 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom20062008201020122014201620182020202220242026Owner 1
Titlehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock