The disclosed embodiments relate, in general, to wireless communication and include methods and apparatus for signal broadcasting which is augmented by individual signals.
A mobile station may comprise a receiver to receive, from a base station, a broadcast signal indicating a time division duplex (TDD) configuration of uplink Orthogonal Frequency Division Modulation (OFDM) symbols and downlink OFDM symbols. The receiver may receive an indication of a symbol range and a subchannel range for use in transmission of channel quality index (CQI) feedback. The mobile station may be further configured to receive first downlink data and transmit first uplink data, using the TDD configuration, wherein the first uplink data comprises CQI feedback information transmitted in accordance with the symbol range and the subchannel range. The receiver may receive second downlink data, from the base station, on a different frequency as the first uplink data is transmitted, while the first uplink data is transmitted.
The evolution of wireless systems has followed two different paths: radio and television broadcasting. Wireless communication started with paging and dispatch systems. Wireless voice communication became a booming industry in the past two decades. The last five years has witnessed many wireless data communication systems such as wireless local area network (WLAN) and broadband wireless access (BWA) systems. With digitalization and the advancements of the digital communication technology, digital broadcasting has become a new trend with digital video broadcast (DVB) and digital audio broadcast (DAB) systems as examples.
Recently, there is a trend of merging wireless technologies to provide support to multimedia applications in integrated environments. The third generation (3G) wireless communication systems have already integrated voice and data services. The recent WiMax technology is focused on a single platform to support broadband application with quality of service (QoS).
Naturally, the integration of the broadcast and the communication systems is the next step in the evolution of the wireless systems, but involves many challenges. For example, the broadcast system needs to deal with broadcast channels that have different characteristics. Also, the scheduler needs to optimally work with two downlink transmission paths: the broadcast channel and the regular (individual) channel. However, integration of a broadcast system with a communication system without sharing certain control information is not an optimized solution.
In a broadcasting system, content data from the source is delivered to multiple transmission base stations, which broadcast to receivers using a particular transmission method such as Orthogonal Frequency Division Modulation (OFDM). To alleviate the problem of interference from different base stations, the broadcasting data is simultaneously transmitted by all the base stations using same time/frequency resource. This type of network configuration is commonly known as the single frequency network (SFN), which has been used in applications such as the digital video broadcasting (DVB) system.
In the case of the DVB, the broadcasting video data, which is in the format of Moving Picture Experts Group 2 (MPEG-2) transport streams, is coded into a mega-frame format and is distributed to the base stations with a time stamp in the synchronized bit stream. The base stations are all synchronized to a common time source and use the time stamp to synchronize exact transmission time of the broadcast data. However, recently more and more new wireless data network infrastructures use packet data networks as their backbone. A packet data network has a bursty packet arrival pattern, random receiving packet order and multiple distribution paths, which is significantly different from those of the MPEG-2 transport streams. Therefore, the DVB approach is not suitable for a packet data network and for a SFN video broadcasting that uses a packet data network backbone.
Various embodiments of the invention will now be described. The following description provides specific details for a thorough understanding and enabling description of these embodiments. One skilled in the art will understand, however, that the invention may be practiced without many of these details. Additionally, some well-known structures or functions may not be shown or described in detail, so as to avoid unnecessarily obscuring the relevant description of the various embodiments
The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific embodiments of the invention. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
The disclosed embodiments of this invention present methods and apparatus for cellular broadcasting and communication systems. The multiple access technology mentioned herein can be of any special format such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), or Multi-Carrier Code Division Multiple Access (MC-CDMA).
Without loss of generality, OFDMA is employed herein as an example to illustrate different aspects of these embodiments. The cellular broadcasting and communication system can operate with both the time division duplexing (TDD) and frequency division duplexing (FDD).
In a wireless network, there are a number of base stations, each of which provides coverage to its designated area, normally called a cell. If a cell is divided in to sectors, from system engineering point of view each sector can be considered as a cell. In this context, the terms “cell” and “sector” are interchangeable.
A base station serves as a focal point for distributing information to and collecting information from its mobile stations by radio signals. The mobile station is the communication interface between the user and the wireless network. The transmission from a base station to a mobile station is called a “downlink” and the transmission from a mobile station to a base station is called an “uplink.” The terms “user” and “receiver” have been used interchangeably. The term “mobile station” represents the user terminal in a fixed wireless system or a portable device with the wireless communication interface.
There is at least one control server (CS) in a multi-cell wireless network, which controls one or multiple base stations (BS). The control server is connected to the base stations via the backbone network. The backbone network can be either wired network or wireless network. It can also be either a circuit switched network or a packet data network. The backbone network may also connect to other servers in the system, such as a number of authentication/authorization/accounting (AAA) servers, content servers, and network management servers.
A “Cellular Broadcasting and Communication System” is a special type of cellular wireless system. In the following description, the term “Cellular System” is used as an abbreviation of the “Cellular Broadcasting and Communication System.” The Cellular System employs at least three radio channels, as described below:
In many multimedia applications, the application data is encoded into multiple application bit streams by the content server, using source coding schemes. The disclosed embodiments also define a system component called IMA (Intelligent Scheduling Agent) in the transmitter of a base station, which maps multiple application streams into the underlying wireless channels based on the system control information and the feedback from the receivers.
The base station transmits broadcasting data to mobile stations via the downlink broadcast channel or the downlink regular channel. The choice of scheduling method for a particular bit stream and for a specific radio channel directly impacts the system behavior, such as the system capacity and performance. This is because the two types of downlink channels have different characteristics. Special arrangements can be made for a group of individual mobile stations to improve the overall coverage. Furthermore, based on the feedback information transmitted by individual mobile stations through the uplink channel, augment signals can be sent to selected individual mobile stations if their received signals need improvement.
For each cell, the (downlink) broadcast signal can be transmitted independently or in coordination. In one embodiment, multiple base stations are coordinated to transmit the same broadcast signal simultaneously using single frequency network (SFN) technology. The modulation and coding scheme (MCS) of the downlink broadcast channel is usually affected by general statistics of the wireless system, possibly obtained through pre-deployment site survey or cellular network planning.
The downlink regular channel, which is usually defined for a single cell, carries signals that are designated to one mobile station. Typically, for each mobile station the regular channel signal content and/or format is different. The data content also includes downlink data and control information such as digital rights management messages. The MCS of the downlink regular channel is determined by individual user's downlink signal quality, which is obtained from the user feedback. Antenna beam forming can enhance the signal quality of the downlink regular channel. Data transmission to multiple mobile stations in the downlink regular channel may also be combined to use multicast schemes.
The mobile stations use the uplink channel to transmit uplink data to the base station, which includes both data and control information such as digital rights management messages. The uplink channel can also be used to send feedback information that may include:
In a Cellular System, as illustrated in
The following embodiments are examples of Cellular Systems using different frame structure and transmission schemes.
In some embodiments an adaptable frame structure (AFS) system is employed wherein a transmission frame comprises multiple subframes, each containing a downlink transmission period and an uplink transmission period. A downlink broadcasting signal is used to indicate to the receivers the configuration of each subframe.
The downlink and uplink period configuration in each subframe can be independently adapted to support applications with a variety of traffic patterns, from symmetric to highly asymmetric. A frame is divided into multiple subframes with flexible mix of subframe types. Therefore, a great variety of applications such as normal two-way data communications, voice communications, video, and data broadcasting are efficiently supported in a single frequency band. Using multiple frequency bands increases capacity or adds more flexibility. As shown in the embodiment of
In one embodiment, a cellular system uses AFS, the frame of which has two different types of subframes: the video and the data subframes. The video subframe is used as the downlink broadcast channel. The data subframe includes a downlink period that is used as downlink regular channel, and an uplink period that is used for transmitting uplink feedback information.
In another embodiment, the video subframe of the AFS system uses SFN to simultaneously broadcast the same radio signal from the base stations.
In yet another embodiment, there are multiple frequency bands in an AFS Cellular System. Without loss of generality,
With a more generic definition for adaptive frame structure, a Cellular System can have two types of 5 ms frames: the video frame and the data frame. As shown in
Frame configuration 4 in
In many multimedia applications, using a source coding scheme, the application data is encoded by the content server into multiple application bit streams.
In the presented embodiments, these streams are identified by S1, S2, . . . Sn, where n≥1.
In one embodiment, a digital TV program is encoded and compressed into three bit streams; namely, an audio stream, a basic video stream containing low resolution video information, and a complementary video stream that carries differential information for a receiver to reproduce, together with the basic bit stream, high-resolution images of the same video content.
In another embodiment, the broadcast data is encoded into two bit streams for reliable transmission. The original bit stream is broadcasted in sequence. If a receiver fails to receive the original data, it can request retransmission bit stream which contains those lost packets.
In yet another embodiment, high definition television (HDTV) broadcast data is encoded into three streams using hierarchical source code. S1 contains a basic video stream for low resolution receivers in mobile devices such as cell phones and personal data assistants (PDA). S2 is a complementary video stream that carries the differential information for a receiver to replay the same program with standard definition television (SDTV) quality. And S3 carries the differentiation information between SDTV and HDTV.
The bit streams generated by the content server may be forwarded to the base stations directly or relayed to the base stations via their control server. The bit streams may also be modified by the control server to add control information. The control information will be removed when transmitted from the base stations to the mobile stations.
In one embodiment for SFN based broadcast, the original streams S1, S2, . . . Sn, are first transmitted to the control servers. The control servers insert time synchronization information tags and attach them to the streams. The modified streams S1′, S2′, . . . Sn′ are transmitted to the base stations via the backbone network. The base stations use the tag to synchronize their transmission time. The attached tags are removed from the streams when they are broadcasted to the mobile stations.
The multiple bit streams are mapped into the underlying two downlink radio channels in a Cellular System by a system component called an “Intelligent Scheduling Agent” (IMA).
The input application bit streams are first stored in the Application Bit Stream Queues. A scheduling data or decision is made by the Scheduler, which consults with the Decision Making Database for system control information, and generates scheduling decisions based on system objectives. The Transmission Mapping Engine multiplexes the bit streams into different channels based on the scheduling decisions. The Feedback Collector forwards receiver feedback to the Decision Making Database, which will be used by a scheduling algorithm of the Scheduler.
In one embodiment, the Application Bit Stream Queues, Scheduler, and Decision Making Database are implemented in the control server and the Transmission Mapping Engine and the Feedback Collector are implemented in the base station. The scheduling decision is forwarded to the Transmission Mapping Engine together with the application data stream. The Feedback Collector reports the user feedback information back to the central control server, where the Decision Making Database is updated.
In another embodiment, all the IMA system components are integrated with the base station in an AFS Cellular System. As illustrated in
The adaptable frame structure has a video subframe which performs 16QAM with SFN. The tags in the streams are removed by the base stations and the original S1, S2 and S3 are broadcasted simultaneously. The IMA in each base station buffers the S1 in its application bit stream queue. For a user who cannot decode the video subframe correctly, the base station will establish a downlink regular channel to the user based on the user's request and a channel quality report. The regular channel is defined in the AFS data subframe using QPSK modulation.
The application bit streams generated by the content server are first stored in the queues of the IMA. However, queuing may not be necessary for some applications. In one embodiment, the video broadcast application bit stream is mapped into broadcast channel directly. In another embodiment, the application bit stream remains in the queue for reliable data transmission until acknowledgements from all receivers come back.
In a wireless system with a feedback channel on the reverse link direction, the Feedback Collector collects all the feedback information and relays them to the Decision Making Database. Feedback information is part of the control information the Scheduler will use to make optimal scheduling decisions.
A scheduling decision is made by the IMA agent based on the information from the Decision Making Database and the scheduling algorithm. The information stored in the Decision Making Database include:
In accordance with the embodiments of this invention, the IMA, either jointly or individually, applies relevant tables in the database to make scheduling decisions.
Since the environment of the system is changing, the information stored in the Decision Making Database is updated, sometimes frequently, to reflect the changes. Some information is derived locally from other systems. In one embodiment, when an application stops, the application information table is updated. Some information, such as the channel quality feedback and the receiver request, is fed back from the receivers through the uplink channel.
The Scheduler tries to make optimal scheduling decisions to achieve certain system objectives. It consults the Decision Making Database and uses its data as the input to the scheduling algorithm. First, the scheduler decides if the broadcast channel and the regular channel should be used for the data transmission. If both channels are used, the incoming data is dispatched into different channel message queues. Then the scheduler determines the MCS and transmission technologies used for the channels and allocates the air link resource to both channels. Finally, the data is mapped into the underlying physical channels and transmitted to the mobile stations after the physical layer finishes coding and modulation.
The scheduling decisions are forwarded to the Transmission Mapping Engine, which is in charge of retrieving the application bit stream and putting it into the correspondent wireless channel.
The mobile terminals measure the downlink signal quality for both the downlink broadcast channel and the downlink regular channel.
In one embodiment, in an AFS Cellular System, the broadcast channel and the regular channel occupy different subframes. Their signal quality can be measured in a time sharing fashion by the mobile terminal using the same radio frequency (RF) receiver circuitry.
In another embodiment, in a multiple frequency band AFS Cellular System, using subframe configuration 1 shown in
In yet another embodiment wherein configuration 2 of
The base station allocates the uplink channel resource to the mobile terminals, such as time/symbol and frequency/subchannel, for sending the measurement reports.
In one embodiment, the base station defines channel quality index (CQI) feedback regions for both the downlink broadcast channel and the downlink regular channel. The AFS CQI feedback regions are specified in the uplink channel by their subframe number, symbol index range, and subchannel index range.
By using the uplink channel, the base station can collect both the downlink broadcast channel and the downlink regular channel quality information from the mobile stations. The quality report can be updated by the mobile stations periodically. The mobile stations can also be polled by the base station or be triggered to send their reports by a predefined system event or threshold.
In one embodiment, with the real-time channel quality information, the MCS of the downlink broadcast channel is updated accordingly, which can override the default MCS derived from the pre-deployment site survey result.
The two types of downlink channels in the Cellular System have different characteristics. The MCS of the downlink regular channel is selected by the Medium Access Control (MAC) based on the received signal quality of the individual user. Most of the time the MCS of the broadcast channel is determined by general statistics of the wireless system, possibly obtained through pre-deployment site survey or cellular network planning.
When SFN is used, the broadcast channels of the neighboring base stations are coordinated to transmit simultaneously. However, the regular channel is always defined in a single cell. Additionally, advanced antenna transmission technology, such as beam forming, can be utilized in a regular channel to improve the SNR for a particular user.
Because of the differences of the channel characteristics, the choice of the scheduling method for a particular bit stream and for a specific radio channel will directly impact the system behavior, such as the system capacity. For example, the system bandwidth to transmit the same N bits of data to M users using the regular channel with 16QAM is N*M/4 Hz. However, using QPSK in the downlink broadcast channel will take the system bandwidth up to N/2 Hz. Therefore, the broadcast channel is more bandwidth efficient if M>2.
Special arrangements can be made for selected individual mobile stations to improve the overall coverage. In one embodiment, the mobile station caches the broadcast data from the content server in the downlink broadcast channel. When it detects a missing packet, it will send to the base station a NACK control message via the uplink channel. The base station then retransmits the missing packet via the regular channel using the MCS according to the fed back downlink signal quality of the mobile station.
System augments can also be made based on the feedback information transmitted by the individual mobile stations in their uplink channel. In another embodiment, a mobile station reports the downlink signal quality to the base station. The base station may determine that the reported SNR is insufficient for this particular mobile station whenever data is broadcasted via the downlink broadcast channel in the SFN. In such a case, the base station will adjust MCS, the MAC resource allocation (time, frequency, subchannels), and power, etc. to send the signal to the mobile station in the regular channel. The base station can also use beam forming to improve the downlink signal quality for the user. The transmission parameters are specifically selected for that user, based on the feedback.
In yet another embodiment, the SFN enabled broadcast channel is used to transmit SDTV program (S1+S2) using hierarchy modulation scheme. If a user experiences difficulties decoding S1 from the broadcast channel, it sends a feedback signal via the uplink regular channel. The feedback contains the channel quality report and the user request. Upon receiving the feedback report, the serving base station starts to forward S1 to the user through a downlink regular channel, with or without beam forming. In another embodiment, if a user wishes to receive an HDTV signal, it sends a request along with a feedback report with the channel signal quality to the serving base station. A downlink regular channel is used to transmit S3 to the user after the base station validates the request.
Hierarchy modulation may also be used to transmit bit streams in a wireless communication system. Table 1 illustrates an example of the scheduling between the hierarchical bit streams and its correspondent modulation schemes for HDTV broadcast using multiple bit streams.
Methods and apparatus are also provided for synchronized data distribution in a packet data network. Simultaneous broadcasting of the same content by the base stations, using the same time/frequency resource, allows the receivers to combine the received signals from different base stations and improve their reception quality. As mentioned above, in each multi-cell wireless deployment, there is at least one control server (CS) that controls one or multiple base stations (BS). The control server is connected to the base stations via the backbone network. In the presented embodiments, the backbone network is a packet data network that can either be a wired or a wireless network. Without loss of generality, IPv4 is used to illustrate these embodiments.
The wireless system described herein is associated with a certain transmission format. The frame duration and its structure can be described by a mathematical function of time. All the base stations are aligned in transmission time at the frame boundary. The sequence of the frame and its relationship to the time is known to all the BSs and CSs.
In each base station, a device called the Receiving Adapter (RA) ensures simultaneous data transmission among the base stations by using the same data content and the same time/frequency resource. The RA will retrieve the time synchronization information in the distribution data packet and use it to control the start time of data transmission. All the packets will be buffered and sorted to re-establish the delivery sequence before they are broadcasted over the air. A synchronization distribution protocol is defined for the SPDN. Both the RA and the DA may synchronize with the same time reference, such as the global position system (GPS) signals.
The SPDN distribution network protocol is carried out on top of the underlying data network protocol. The distribution network protocol is transparent to the underlying data network devices. Segmentation and reassembly may be necessary at the DA and the RA at each base station.
In wireless applications such as digital video broadcasting, SFN technology is used to alleviate the problem of interference between base stations. Even if OFDM is used in the system, simultaneous transmission of the same broadcasting content by the base stations, using the same time/frequency resource, allows a receiver to combine the receiving signals from different base stations and boost its SNR. The underlying wireless system is associated with a certain transmission format. All the base stations are aligned in transmission time at the frame boundary. The sequence of the frame is known to all the BSs and CSs via a synchronization distribution mechanism.
In one embodiment, the base stations are synchronized with each other for transmission. Furthermore, the system frame structure is defined by a distributed frame number synchronization mechanism while a common frame number scheme is shared between the CS and BSs. The common frame number is increased every frame by both the CS and the BSs. The distributed frame number synchronization mechanism makes sure the frame number is always in sync within the network.
The same mechanism can be used to derive common super-frame and subframe numbers as long as the frame structure is predefined in the system with some mathematical relationship between the numbers. For example, if each frame has 4 subframes, the subframe number can be expressed by 4N+M, where N is the common frame number and M is the sequence number of a subframe within the frame.
In another embodiment when adaptable frame structure (AFS) is used in a TDD wireless system, each TDD frame has multiple subframes. Each subframe, as shown in
The CS and the BSs are connected by a packet data network (PDN). The PDN is designed with the maximum PDN transmission delay known to both CS and BS. In a packet data network, information is transmitted in a data packet with source and destination addresses in the header. The disclosed embodiments do not impose any restriction on the network protocol or transmission technologies used in the packet data networks, such as Ethernet, Internet Protocol version 4 (IPv4), IPv6, and ATM. Therefore, without loss of generality, IPv4 is employed herein to illustrate the operations of these embodiments.
The SPDN, with its two system components DA and RA, is built on top of the underlying packet data network that connects the CS and the BSs. DA is located in the network and is in charge of producing the distribution network packets with additional protocol control information. RA is located in the base station. It first retrieves the time synchronization information from the distribution data packet and then delivers the original data to the BS at the exact frame based on the time synchronization information.
The distribution data packets must arrive at the RA before the transmission start time specified in the packet. The DA has to take into account the maximum PDN transmission delay when calculating the time control information for the distribution data packet. Distribution data packets are buffered at the RA before they are sent to the BS for broadcasting at the exact time.
The architecture of the SPDN and the description of some of its components are presented below. While specific embodiments and examples are hereby described for illustrative purposes, various equivalent modifications are possible within the scope of the invention. Some aspects of these embodiments can be applied to other systems. Also, the elements and acts of the various embodiments described here can be combined to provide further embodiments.
The DA receives original data packets and distributes them across SPDN to the RAs in the base stations. Distribution takes place after adding the supplementary protocol information using the synchronization distribution protocol. Therefore, the input to the DA is the original data packets and the output to the DA is the distribution data packets.
The DA may distribute original data packets from multiple application data sources. For example, in IPTV applications, each TV channel is an application data source that generates its own data packets. Hence, the DA may need to be aware of the application data source.
On the other hand, the SPDN may have multiple DAs; each of them taking care of the original data packets from one or multiple application data sources. In such a case, the DAs may need to coordinate with each other. The typical protocol information added by the DA can include:
The SPDN protocol guarantees the in-order distribution data packet delivery. SPDN may also verify the distribution data packet integrity by adding redundant error detection protocol control information. In one embodiment, a new cyclic redundancy check (CRC) is added to the distribution data packet. In another embodiment, the error detection code of the original data packet is recalculated to protect the whole new distribution data packet.
The DA can insert the additional protocol information in the beginning, in the middle, or at the end of the original data packet. Packet-specific information, such as the packet sequence and time synchronization information, is inserted into every data packet. The information common to multiple packets, such as the resource indication for several data packets, is only inserted once every N packet, where N is greater than or equal to one.
The distribution network protocol defines rules for distribution data packets delivery to the base stations. The protocol is built on top of the underlying data network protocol. Without loss of generality, IPv4 is used to illustrate the design of the distribution network protocol.
A distribution data packet is formed by inserting the additional/supplementary protocol information to an original data packet. The additional protocol information is inserted in the beginning, in the middle, or at the end of the original data packet. Without loss of generality, in some embodiments, the distribution protocol header contains all the additional protocol information. It may also contain the source and destination addresses of the distribution protocol.
In one embodiment, the distribution protocol header is inserted between the original data packet header and the original data packet payload. In this embodiment, the source and destination addresses of the original data packet remain unchanged and the SPDN relies on the underlying routing protocol to distribute the distribution data packet. The original data packet checksum is recalculated to reflect the change of packet payload.
In another embodiment, encapsulation is used to generate the distribution data packet. A new distribution protocol header is added at the beginning of the original data packet. The header contains the additional protocol information for the base station RA to recover time synchronization information, such as the frame number index for data broadcasting by all the base stations. A CRC is also appended at the end of the distribution packet, as illustrated in
In yet another embodiment, the DA, based on the knowledge of the exact air-link resources for data broadcasting, assembles multiple original data packets together in the new distribution data packet. The distribution data packet payload fits in the broadcasting air link resources. A new protocol header is constructed to carry the additional protocol information together with the source and destination addresses. The new CRC is also generated and appended, as shown in
In another embodiment, the DA segments the original data packet into several pieces and transmits them across PDN with the distribution protocol header. At the base station RA, they will be reassembled together.
The distribution network protocol is implemented on top of the underlying data network protocol. The protocol runs between the DA and the RA in the base stations. Only the end systems, namely the DA and the RA, are aware of the protocol. It is transparent to the underlying data network devices, such as routers in an IP data network.
The packet transmission is based on the multicast technology. If the underlying network architecture does not support multicast, such as PPP (point to point protocol), the multicasting function is simulated by transmission of duplicated distribution packets over multiple unicast network links.
In one embodiment, the DA segments the original data packet to fit into the maximum transfer unit (MTU) of the underlying data network protocol and the RA reassembles the original data packet from its fragments.
The distribution network protocol may also try to achieve reliable data transmission on top of the underlying network protocol, implying that a retransmission based on the acknowledgement may be necessary. In another embodiment, the reliable multicast techniques are used in the distribution network protocol. For example, the RA reports to the DA about any packet loss, based on the protocol control information such as checksum and sequence number. The DA will then retransmit the requested distribution packet.
The RA in a base station ensures that the synchronized data transmission among all base stations carries the same data content, with the same time/frequency resource, and at the same time. When a distribution data packet arrives at the base station, the RA will retrieve the necessary information needed for transmission over the air link. Since the underlying packet data network may alter the packet arrival order, the RA needs to buffer the distribution data packets and restore the delivery sequential order based on the protocol control information in the distribution protocol header. It may also reassemble the original data packets if segmentation is performed at the DA. Similarly, when header compression is performed at the DA to the original data packet header, the RA is responsible for restoring the original packet header by decompression.
In case the RA is not able to recover all the distribution packets due to errors, it activates the error protection mechanism to avoid the interference with the transmission by base stations. For example, a base station must not transmit a distribution data packet if its transmission time has already passed when it arrives at the base station. Instead, the base station discards the overdue packet and remains silent for the duration of the transmission period for the overdue packet.
In this section, an illustration is provided to understand the design of SPDN. Without loss of generosity an AFS TDD wireless system is employed. The multi-cell deployment has one CS and multiple BSs. They are connected with IPv4 packet data network with the assumed maximum PDN transmission delay of 500 ms. IP multicast is supported for data transmission between CS and BSs. All the BSs are aligned in their transmission time at the TDD frame boundary. The frame duration is 10-ms long and each frame consists of 4 subframes. The subframe duration is 2.5 ms. A synchronization mechanism for the distributed frame number is in place so that the CS and BSs share a common frame number and, based on it, a common subframe number is derived. Based on the video subframe duration, the usable data bandwidth of the subframe, and the predefined coding/modulation scheme (QPSK with ½ rate coding) the CS calculates that N bytes of data can be transmitted in a video subframe.
In one embodiment, the DA, with the knowledge of the video subframe capacity of N bytes, assembles the incoming video packets into a distribution data packet with data payload length of N. When the RA receives such a distribution data packet, forwards its data payload to the physical layer directly at the broadcasting subframe, which should fit exactly into the resource after coding and modulation. The distribution data packet header contains the starting subframe number for the SFN broadcast, which is generated base on the common subframe number scheme.
Since the maximum PDN transmission delay is 500 ms or equivalently 200-subframe long, the starting subframe number will not exceed 256 in a modular operation. Therefore, only 8 bits are needed to identify the starting subframe number within the SPDN. For example, when the current common subframe number is 0, the DA sends out a distribution packet and assigns to it the starting subframe number of 200. When the RA receives the distribution packet, because of the PDN transmission delay (e.g., 495 ms), the common subframe number has advanced from 0 to 198. The RA waits for 2 subframes so that the common subframe number is equal to the specified value 200 and forwards the data packet to the BS for transmission.
The subframe number is based on a modular 256 calculation in the example. If the distribution data packet length is larger than the MTU of the PDN, the DA further segments the packet into several transmission packets. The distribution data packet header contains an 8 bits common subframe index. In this case, segment information is also included in each transmission data packet.
Across the PDN, on the RA side, the RA first assembles the distribution data packet from multiple transmission data packets. It then retrieves the subframe number information in the distribution data packet header. Since the RA shares the same common subframe number with the BS, it forwards the N byte data payload to the BS at the correspondent video subframe.
In another embodiment, instead of assembling the incoming video packets, the DA adds the necessary information to an individual video packet, as it arrives at the DA, and then sends it out as a distribution data packet. Since multiple video packets can fit into one video subframe, the DA needs to indicate their sequential order to the RA. Therefore, the distribution data packet header must contain the common subframe number and the packet sequence number. If one video subframe can transmit maximum 16 video packets, then 4 bits are needed in the header to identify the sequence number. In addition, the DA also includes one bit in the header to indicate the last distribution data packet to be transmitted in the subframe.
When the RA receives the distribution data packet, it sorts the data based on the subframe number and the packet sequence. If the last distribution data packet of the video subframe is received, it assembles them into N bytes payload for the video subframe and pads the unfilled bytes with a predefined byte pattern, such as 0×00. The RA then forwards the N bytes payload to the BS at the correspondent video subframe.
The subframe can be further divided into multiple video broadcast slots. In this case, the common subframe number does not have enough resolution to identify the resource. If the slot configuration is known to both the CS and the BSs, the DA can provide the video slot number in the distribution data packet header to identify it.
Furthermore, the video broadcast slot can be dynamically allocated by the CS based on the properties of the video program. In this case, the slot can be identified by its construction subchannel numbers. The DA should indicate these numbers to the RA as well. For efficiency reasons, the subchannel numbers may be expressed using compression format. In one embodiment, all the subchannels in a video slot are consecutive. The DA only indicates the start subchannel number and the total number of subchannels in the video slot. In another embodiment, the subchannels are distributed. The DA uses bitmap to express their distribution patterns.
For the described embodiments, the distributed frame number synchronization mechanism is at the core of the SFN operation. The mechanism sets up a synchronized mapping function between the time and the common frame number. It can be developed based on the same time reference known to all the base stations and the CSs.
In one embodiment, the global positioning system (GPS) is used as the common time reference. A GPS receiver is integrated with each BS or CS. The GPS receiver generates a pulse periodically (e.g., every second). Since the AFS frame structure has a 2.5 ms subframe, every second 400 subframes are transmitted. In order to establish a common subframe number within the network, each BS or CS will track its own subframe counter in the following manner:
The maximum PDN transmission delay is also known to BSs and CSs. In one embodiment, the value is measured during the pre-deployment network design and is stored in CSs and BSs during its initial configuration. The quality of service mechanism in the PDN ensures that the actual PDN transmission delay is always less than the maximum delay. However, if the maximum PDN transmission delay is changed when the PDN infrastructure updates, the new latency value needs to be updated for all the CSs and BSs accordingly.
In another embodiment, the maximum value is transmitted together with the distribution packet as part of the time synchronization information. In this way, each packet can have a different maximum delay value, which provides an update mechanism when the maximum PDN transmission delay changes.
The following description provides specific details for a thorough understanding of the various embodiments and for the enablement of one skilled in the art. However, one skilled in the art will understand that the invention may be practiced without such details. In some instances, well-known structures and functions have not been shown or described in detail to avoid unnecessarily obscuring the description of the embodiments.
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” Words using the singular or plural number in this Detailed Description section also include the plural or singular number respectively. Additionally, the words “herein,” “above,” “below” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. When the claims use the word “or” in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
The above detailed description of the embodiments of the invention is not intended to be exhaustive or to limit the invention to the precise form disclosed above or to the particular field of usage mentioned in this disclosure. While specific embodiments of, and examples for, the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. Also, the teachings of the invention provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.
All of the above patents and applications and other references, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the invention can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further embodiments of the invention.
Changes can be made to the invention in light of the above “Detailed Description.” While the above description details certain embodiments of the invention and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Therefore, implementation details may vary considerably while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated.
In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the invention under the claims.
While certain aspects of the invention are presented below in certain claim forms, the inventors contemplate the various aspects of the invention in any number of claim forms. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention.
This application is continuation of, and incorporates by reference in its entirety, U.S. patent application Ser. No. 17/152,284, filed on Jan. 19, 2021, which is a continuation of U.S. patent application Ser. No. 16/899,319, filed on Jun. 11, 2020, which is a continuation of U.S. patent application Ser. No. 16/055,873, filed Aug. 6, 2018, now U.S. Pat. No. 10,862,696 filed Dec. 8, 2020, which is a continuation of U.S. patent Ser. No. 14/160,420, now U.S. Pat. No. 10,044,517, file Jan. 21, 2014, which is a divisional of U.S. patent application Ser. No. 13/605,784, now U.S. Pat. No. 8,634,375, filed Sep. 6, 2012, which is a divisional of U.S. patent application Ser. No. 13/301,595, now U.S. Pat. No. 8,374,115, filed Nov. 21, 2011, which is a divisional of U.S. patent application Ser. No. 11/571,468, now U.S. Pat. No. 8,089,911, having a 371 date of Nov. 28, 2007, which is a National Phase Application of PCT/US06/11088, filed Mar. 24, 2006, which claims the benefit of U.S. Provisional Patent Applications Nos. 60/665,184 and 60/665,205, filed on Mar. 25, 2005.
Number | Name | Date | Kind |
---|---|---|---|
5170413 | Hess et al. | Dec 1992 | A |
5506615 | Awaji | Apr 1996 | A |
5659545 | Sowles et al. | Aug 1997 | A |
5726978 | Frodigh et al. | Mar 1998 | A |
5734444 | Yoshinobu | Mar 1998 | A |
5794116 | Matsuda et al. | Aug 1998 | A |
5878324 | Borth et al. | Mar 1999 | A |
5898338 | Proctor et al. | Apr 1999 | A |
5929704 | Proctor, Jr. et al. | Jul 1999 | A |
6023725 | Ozawa et al. | Feb 2000 | A |
6052145 | Macrae | Apr 2000 | A |
6078216 | Proctor, Jr. | Jun 2000 | A |
6081697 | Haartsen | Jun 2000 | A |
6201970 | Suzuki et al. | Mar 2001 | B1 |
6256509 | Tanaka et al. | Jul 2001 | B1 |
6292474 | Ali | Sep 2001 | B1 |
6370153 | Eng | Apr 2002 | B1 |
6381250 | Jacobson et al. | Apr 2002 | B1 |
6493331 | Walton et al. | Dec 2002 | B1 |
6529146 | Kowalski et al. | Mar 2003 | B1 |
6603979 | Hirsch | Aug 2003 | B1 |
6701528 | Arsenault et al. | Mar 2004 | B1 |
6788959 | Jokinen et al. | Sep 2004 | B2 |
6836664 | McGovern et al. | Dec 2004 | B2 |
6886042 | Watahiki et al. | Apr 2005 | B1 |
6904550 | Sibecas et al. | Jun 2005 | B2 |
6950624 | Kim et al. | Sep 2005 | B2 |
6965580 | Takagi et al. | Nov 2005 | B1 |
7031348 | Gazit | Apr 2006 | B1 |
7050511 | Jeong et al. | May 2006 | B2 |
7085576 | Ranganathan | Aug 2006 | B2 |
7142864 | Laroia et al. | Nov 2006 | B2 |
7184726 | Shibata | Feb 2007 | B2 |
7197025 | Chuah | Mar 2007 | B2 |
7200124 | Kim et al. | Apr 2007 | B2 |
7203158 | Oshima et al. | Apr 2007 | B2 |
7260079 | Chapman et al. | Aug 2007 | B1 |
7324832 | van Rooyen | Jan 2008 | B2 |
7336646 | Muller | Feb 2008 | B2 |
7339882 | Schaefer et al. | Mar 2008 | B2 |
7352722 | Malladi et al. | Apr 2008 | B2 |
7391751 | Lee et al. | Jun 2008 | B2 |
7406104 | Yang et al. | Jul 2008 | B2 |
7418193 | Miyagawa et al. | Aug 2008 | B2 |
7428385 | Lee et al. | Sep 2008 | B2 |
7500261 | Myers | Mar 2009 | B1 |
7548506 | Ma et al. | Jun 2009 | B2 |
7630356 | Zhang et al. | Dec 2009 | B2 |
7633971 | Butler et al. | Dec 2009 | B1 |
7660229 | Papasakellariou et al. | Feb 2010 | B2 |
7680094 | Liu | Mar 2010 | B2 |
7683664 | Gaide | Mar 2010 | B1 |
7684807 | Schmidt | Mar 2010 | B2 |
7734762 | Hundscheidt et al. | Jun 2010 | B2 |
7801490 | Scherzer | Sep 2010 | B1 |
7961609 | Teague et al. | Jun 2011 | B2 |
8014264 | Li et al. | Sep 2011 | B2 |
8046801 | Ellis et al. | Oct 2011 | B2 |
8089911 | Huang et al. | Jan 2012 | B2 |
8194574 | Shinozaki | Jun 2012 | B2 |
8374115 | Huang et al. | Feb 2013 | B2 |
8400951 | Nangia et al. | Mar 2013 | B2 |
8514793 | Gauvreau et al. | Aug 2013 | B2 |
8547883 | Jung et al. | Oct 2013 | B2 |
8547884 | Lo et al. | Oct 2013 | B2 |
8553589 | Hui et al. | Oct 2013 | B2 |
8582592 | Gorokhov et al. | Nov 2013 | B2 |
8634375 | Huang et al. | Jan 2014 | B2 |
8687608 | Soliman | Apr 2014 | B2 |
9363066 | Lo et al. | Jun 2016 | B2 |
10638468 | Nelson et al. | Apr 2020 | B2 |
20010017853 | Kikuchi et al. | Aug 2001 | A1 |
20010039663 | Sibley | Nov 2001 | A1 |
20010041594 | Arazi et al. | Nov 2001 | A1 |
20010055322 | Domon | Dec 2001 | A1 |
20020031097 | Jung | Mar 2002 | A1 |
20020080887 | Jeong et al. | Jun 2002 | A1 |
20020118666 | Stanwood | Aug 2002 | A1 |
20020122406 | Chillariga et al. | Sep 2002 | A1 |
20020126780 | Oshima et al. | Sep 2002 | A1 |
20020147978 | Dolgonos | Oct 2002 | A1 |
20020150387 | Kunii et al. | Oct 2002 | A1 |
20020162114 | Bisher, Jr. et al. | Oct 2002 | A1 |
20020163695 | Unitt et al. | Nov 2002 | A1 |
20020166128 | Ikeda | Nov 2002 | A1 |
20030032389 | Kim et al. | Feb 2003 | A1 |
20030037331 | Lee | Feb 2003 | A1 |
20030045254 | Shibata | Mar 2003 | A1 |
20030072255 | Ma et al. | Apr 2003 | A1 |
20030076812 | Benedittis | Apr 2003 | A1 |
20030117980 | Kim et al. | Jun 2003 | A1 |
20030119452 | Kim et al. | Jun 2003 | A1 |
20030125025 | Lim | Jul 2003 | A1 |
20030152094 | Colavito et al. | Aug 2003 | A1 |
20030206541 | Yun et al. | Nov 2003 | A1 |
20030207696 | Willenegger et al. | Nov 2003 | A1 |
20030214928 | Chuah | Nov 2003 | A1 |
20030224731 | Yamaura et al. | Dec 2003 | A1 |
20040001429 | Ma | Jan 2004 | A1 |
20040032836 | Grilli | Feb 2004 | A1 |
20040062222 | Seidel et al. | Apr 2004 | A1 |
20040082356 | Walton et al. | Apr 2004 | A1 |
20040120285 | Paila et al. | Jun 2004 | A1 |
20040131084 | Bing | Jul 2004 | A1 |
20040141502 | Corson et al. | Jul 2004 | A1 |
20040184471 | Chuah et al. | Sep 2004 | A1 |
20040192342 | Ranganathan | Sep 2004 | A1 |
20040224691 | Hadad | Nov 2004 | A1 |
20040259503 | Ogura | Dec 2004 | A1 |
20050025039 | Hwang et al. | Feb 2005 | A1 |
20050028208 | Ellis et al. | Feb 2005 | A1 |
20050037795 | Aaltonen et al. | Feb 2005 | A1 |
20050055723 | Atad et al. | Mar 2005 | A1 |
20050063345 | Wu et al. | Mar 2005 | A1 |
20050068990 | Liu | Mar 2005 | A1 |
20050078680 | Barrett et al. | Apr 2005 | A1 |
20050085197 | Laroia et al. | Apr 2005 | A1 |
20050085214 | Laroia et al. | Apr 2005 | A1 |
20050108763 | Baran et al. | May 2005 | A1 |
20050111397 | Attar et al. | May 2005 | A1 |
20050113099 | Eriksson et al. | May 2005 | A1 |
20050128993 | Yu et al. | Jun 2005 | A1 |
20050135295 | Walton et al. | Jun 2005 | A1 |
20050135416 | Ketchum et al. | Jun 2005 | A1 |
20050141475 | Vijayan et al. | Jun 2005 | A1 |
20050152409 | Zhao et al. | Jul 2005 | A1 |
20050152697 | Lee et al. | Jul 2005 | A1 |
20050174964 | Orlik et al. | Aug 2005 | A1 |
20050175070 | Grob et al. | Aug 2005 | A1 |
20050193309 | Grilli et al. | Sep 2005 | A1 |
20050195823 | Chen | Sep 2005 | A1 |
20050204388 | Knudson et al. | Sep 2005 | A1 |
20050254427 | Leon et al. | Nov 2005 | A1 |
20050265280 | Roh et al. | Dec 2005 | A1 |
20060007930 | Dorenbosch | Jan 2006 | A1 |
20060013168 | Agrawal et al. | Jan 2006 | A1 |
20060013325 | Agrawal et al. | Jan 2006 | A1 |
20060018347 | Agrawal | Jan 2006 | A1 |
20060019677 | Teague et al. | Jan 2006 | A1 |
20060069799 | Hundscheidt et al. | Mar 2006 | A1 |
20060088023 | Muller | Apr 2006 | A1 |
20060098567 | Willenegger | May 2006 | A1 |
20060128428 | Rooyen | Jun 2006 | A1 |
20060146745 | Cai et al. | Jul 2006 | A1 |
20060146822 | Kolakowski et al. | Jul 2006 | A1 |
20060146853 | Paila | Jul 2006 | A1 |
20060176966 | Stewart et al. | Aug 2006 | A1 |
20060182022 | Abedi | Aug 2006 | A1 |
20060193338 | Zheng et al. | Aug 2006 | A1 |
20060198325 | Gao et al. | Sep 2006 | A1 |
20060211436 | Paila et al. | Sep 2006 | A1 |
20060223520 | Laroia et al. | Oct 2006 | A1 |
20060251045 | Okubo | Nov 2006 | A1 |
20060256884 | Tomioka et al. | Nov 2006 | A1 |
20070002858 | Bichot et al. | Jan 2007 | A1 |
20070058595 | Classon et al. | Mar 2007 | A1 |
20070064588 | Kisoda et al. | Mar 2007 | A1 |
20070081538 | Ganji | Apr 2007 | A1 |
20070218889 | Zhang et al. | Sep 2007 | A1 |
20080130483 | Khandekar et al. | Jun 2008 | A1 |
20080137562 | Li et al. | Jun 2008 | A1 |
20080170530 | Connors et al. | Jul 2008 | A1 |
20090023469 | Tomioka et al. | Jan 2009 | A1 |
20090028109 | Huang et al. | Jan 2009 | A1 |
20090067403 | Chan et al. | Mar 2009 | A1 |
20090215499 | Moon et al. | Aug 2009 | A1 |
20090258628 | Lindoff et al. | Oct 2009 | A1 |
20100067465 | Miki et al. | Mar 2010 | A1 |
20100130137 | Pelletier et al. | May 2010 | A1 |
20100165893 | Edwards | Jul 2010 | A1 |
20100173586 | McHenry et al. | Jul 2010 | A1 |
20100227622 | Mody et al. | Sep 2010 | A1 |
20100265905 | Lee et al. | Oct 2010 | A1 |
20110002311 | Wang et al. | Jan 2011 | A1 |
20110103243 | Larsson et al. | May 2011 | A1 |
20110194515 | Nakao et al. | Aug 2011 | A1 |
20110267978 | Etemad | Nov 2011 | A1 |
20120063381 | Huang et al. | Mar 2012 | A1 |
20120176952 | Huang et al. | Jul 2012 | A1 |
20120230265 | Lee et al. | Sep 2012 | A1 |
20120257551 | Diao et al. | Oct 2012 | A1 |
20120269148 | Hultell et al. | Oct 2012 | A1 |
20120327897 | Huang et al. | Dec 2012 | A1 |
20130012191 | Charbit et al. | Jan 2013 | A1 |
20130121232 | Huang et al. | May 2013 | A1 |
20130343239 | Damnjanovic et al. | Dec 2013 | A1 |
20140254609 | Petry et al. | Sep 2014 | A1 |
20160286556 | Lo et al. | Sep 2016 | A1 |
Number | Date | Country |
---|---|---|
1332556 | Jan 2002 | CN |
1571512 | Jan 2005 | CN |
1571531 | Jan 2005 | CN |
1678068 | Oct 2005 | CN |
101197655 | Jun 2008 | CN |
2005-0053377 | Jun 2005 | KR |
200205506 | Jan 2002 | WO |
2006001671 | Jan 2006 | WO |
2006086878 | Aug 2006 | WO |
2007052995 | May 2007 | WO |
Entry |
---|
Baxley et al., “Power Savings Analysis of Peak-to-Average Power Ratio Reduction in OFDM,” IEEE Transactions on Consumer Electronics, vol. 50, No. 3 (Aug. 2004). |
Definition of “frequency-division multiplexing,” McGraw-Hill, Dictionary of Scientific and Technical Terms, 6th Edition (2003). |
Dell Technologies Inc. et al. v. NEO Wireless LLC, Declaration of Dr. Ding, IPR 2022-00616 (Feb. 18, 2022). |
Dell Technologies Inc. et al. v. NEO Wireless LLC, Petition for Inter Partes Review of U.S. Pat. No. 10,044,517 pursuant to 35 U.S.C. §§ 311-219, 37 C.F.R. §42, IPR 2022-00616 (Feb. 18, 2022). |
Final Office Action for U.S. Appl. No. 11/571,468, Examiner Shen, Qun, dated Mar. 18, 2011, 24 pages. |
Guo et al., “Reducing Peak-to-Average Power Ratio in OFDM Systems by Adaptive Dynamic Range Companding,” 2002 World Wireless Congress, San Francisco, CA (2002). |
IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements; Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications Amendment 4: Further Higher Data Rate Extension in the 2.4 GHz Band, IEEE Std 802.11g-2003 (Jun. 27, 2003). |
IEEE Standard for Local and metropolitan area networks; Part 16: Air Interface for Fixed Broadband Wireless Access Systems—Amendment 2: Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands and Corrigendum 1, IEEE Std. 802.16e-2005 (Feb. 28, 2006). |
International Search Report and Written Opinion for International Application No. PCT/US06/11088, filed Mar. 24, 2006, Application Neocific, Inc., dated Jul. 28, 2006, 9 pages. |
International Search Report and Written Opinion for International Application No. PCT/US06/22376, Filed Jun. 6, 2006, Applicant: Neocific, Inc., dated Mar. 27, 2007, 8 pages. |
Johnson et al., Telecommunication Breakdown Concepts of Communication Transmitted via Software Defined Radio, 2004, Pearson Prentice Hall, pp. 43-48 and 81-82. |
Koffman et al., “Broadband Wireless Access Solutions Based on OFDM Access in IEEE 802.16,” IEEE Communications Magazine, pp. 96-103 (Apr. 2002). |
Lathi, Modern Digital and Analog Communication Systems 3rd Edition, 1998, Oxford University Press, pp. 189-191. |
NEO Wireless LLC v. American Honda Motor Co., Inc et al., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Southern District of Ohio Eastern Division at Columbus, Case No. 2:22-cv-01824-EAS-KAJ (Mar. 29, 2022). |
NEO Wireless LLC v. Apple Inc., Apple Inc's Answer to Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-00026-ADA (Jun. 17, 2021). |
NEO Wireless LLC v. Apple Inc., Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-0026 (Apr. 28, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Declaration of Roger Fulgham in Support of Defendants' Opening Claim Construction, Civil Action No. 6:21-cv-0024 (Oct. 28, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Declaration of James Proctor in Support of Defendants' Opening Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Oct. 27, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Declaration of William Alberth in Support of Neo Wireless's Responsive Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Nov. 18, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Defendant's Answer, Affirmative Defenses, and Counterclaims to Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-0024 (Jun. 18, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Defendants' Opening Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Oct. 28, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Defendants' Reply Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Dec. 2, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Joint Claim Construction Statement, Civil Action No. 6:21-cv-0024 (Dec. 21, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Neo Wireless's Answer to Dell's Counterclaims, Civil Action No. 6:21-cv-0024 (Jul. 9, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Plaintiff Neo Wireless LLC's Responsive Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Nov. 18, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Plaintiff Neo Wireless LLC's Claim Construction Sur Reply Brief, Civil Action No. 6:21-cv-0024 (Dec. 16, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Plaintiff Neo Wireless LLC's Response to Defendants' Supplemental Claim Construction Brief, C.A. No. 1:22-cv-60-DAE (Jun. 8, 2022). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Stipulated Constructions, Civil Action No. 6:21-cv-0024 (Oct. 27, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Supplemental Declaration of James Proctor in Support of Defendants' Reply Claim Construction Brief, Civil Action No. 6:21-cv-0024 (Dec. 2, 2021). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-0024 (Apr. 28, 2021). |
NEO Wireless LLC v. Ford Motor Company, Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Western District of Missouri Western Division, Case No. 4:22-cv-00210-GAF (Mar. 29, 2022). |
NEO Wireless LLC v. General Motors Company et al., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Eastern District of Texas Marshall Division, Case No. 2:22-cv-00094 (Mar. 29, 2022). |
NEO Wireless LLC v. LG Electrincs Inc., Defendant LG's Answer to Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-00025-ADA (Jun. 17, 2021). |
NEO Wireless LLC v. LG Electronics, Inc. et al., Plaintiff's First Amended Complaint, Civil Action No. 6:21-cv-0025 (Apr. 28, 2021). |
NEO Wireless LLC v. Nissan North America Inc. et al., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Middle District of Tennessee Nashville Division, Case No. 3:22-cv-00220 (Mar. 29, 2022). |
NEO Wireless LLC v. Tesla Inc., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Eastern District of Texas Marshall Division, Case No. 2:22-cv-00095 (Mar. 29, 2022). |
NEO Wireless LLC v. Toyota Motor North America, Inc. et al., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Eastern District of Texas Marshall Division, Case No. 2:22-cv-00093 (Mar. 29, 2022). |
NEO Wireless LLC v. Volkswagen Group of America, Inc., et al., Plaintiff NEO Wireless LLC's Complaint for Patent Infringement, United States District Court for the Eastern District of Tennessee Chattanooga District, Case No. 1:22-cv-00076 (Mar. 29, 2022). |
NEO Wireless LLC v. Dell Technologies Inc. et al., Defendants' Supplemental Claim Construction Brief, Civil Action No. 1:22-cv-00060-DAE (May 18, 2022). |
Non-Final Office Action for U.S. Appl. No. 11/571,468. Examiner Shen, Qun, dated Jun. 24, 210, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 13/605,784, Examiner Q. Shen, dated Mar. 4, 2013, 14 pages. |
Notice of Allowance for U.S. Appl. No. 11/571,468, Examiner Shen, Qun, dated Nov. 15, 2011, 15 pages. |
Notice of Allowance for U.S. Appl. No. 13/301,595, Examiner Shen, Qun, dated Dec. 28, 2012, 13 pages. |
Panta et al., “Use of Peak-to-Average Power Reduction Technique in HIPERLAN2 and its Performance in a Fading Channel.” Proc. 6th International Symposium on DSP for Communication Systems, pp. 113-117, (2002). |
Prasad, “Chapter 6—The Peak Power Problem,” in OFDM for Wireless Communications Systems, Artech House (2004). |
Supplement to IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements; Part 11: Wireless LAN Medium. Access Control (MAC) and. Physical Layer (PHY) specifications High-speed Physical Layer in the 5 GHz Band, IEEE Std 802.11a-1999(R2003) (Jun. 12, 2003). |
Supplement to IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements; Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications: Higher-Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std 802.11b-1999 (R2003) (Jun. 12, 2003). |
Third Generation Partnership Project, “Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service (MBMS); Protocols and codecs (Release 6),” 3GPP TS 26.346 V2.0.0 (Mar. 2005). |
Third Generation Partnership Project, “Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service (MBMS); Protocols and codecs (Release 6),” 3GPP TS 26.346 V6.3.0 (Mar. 2005). |
Van Nee et al., OFDM for Wireless Multimedia Communications, Artech House (2000). |
You et al., “A Simple Construction of OFDM-CDMA Signals with Low Peak-to-Average Power Ratio,” IEEE Transactions on Broadcasting, vol. 49, No. 4 (Dec. 2003). |
Number | Date | Country | |
---|---|---|---|
20220231874 A1 | Jul 2022 | US |
Number | Date | Country | |
---|---|---|---|
60665205 | Mar 2005 | US | |
60665184 | Mar 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13605784 | Sep 2012 | US |
Child | 14160420 | US | |
Parent | 13301595 | Nov 2011 | US |
Child | 13605784 | US | |
Parent | 11571468 | US | |
Child | 13301595 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 17152284 | Jan 2021 | US |
Child | 17713562 | US | |
Parent | 16899319 | Jun 2020 | US |
Child | 17152284 | US | |
Parent | 16055873 | Aug 2018 | US |
Child | 16899319 | US | |
Parent | 14160420 | Jan 2014 | US |
Child | 16055873 | US |