TW200838234A - Beacon coding in wireless communications systems - Google Patents

Abstract

Systems and methodologies are described that facilitate transmitting beacon symbols of a beacon message such that a sequence of symbols can satisfy a linear constraint over a field where the field elements can be identified with carriers. In this regard, a coding scheme can be applied to a beacon message; the coding scheme can produce a plurality of beacon symbols to transmit on given subcarriers. A receiving device of the beacon symbols can decode a beacon message by receiving less than the total number of symbols in a beacon message and determining the remaining symbol subcarriers based on the linear constraint. Thus, more efficient decoding of beacons is facilitated as well as resolving beacon ambiguity by figuring out which symbols satisfy linear constraints for the symbols, and resolving time and frequency shift by detecting an offset that would result in satisfaction of the linear constraint.

Description

200838234 IX. INSTRUCTIONS: [Technical field to which the invention pertains] The following description relates generally to wireless communication, and is based on the coding of beacon symbols in a wireless communication system for direct, /, more efficient Decoding and parsing. [Prior Art] Wireless communication systems are widely deployed to provide communication content such as voice, material, and the like. A typical wireless communication system can be a multi-directional access system capable of supporting communication with multiple users by sharing available system resources (e.g., 'bandwidth, transmission power, ...'). Examples of such multi-directional access systems may include code division multi-directional access (CDMA) systems, time division multi-directional access (tdma) systems, frequency division multi-directional access (FDMA) systems, orthogonal frequency division multi-directional Access (OFDMA) systems and similar systems. In general, a wireless multi-directional access communication system can simultaneously support communication of multiple mobile devices. Each mobile device can communicate with one or more base stations via transmissions on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base station to the mobile device, and the reverse link (or uplink) refers to the communication link from the mobile device to the base station. In addition, communication between the mobile device and the base station can be established via a single-input single-output (SISO) system, a multiple-input single-output (MIS〇) system, a multiple-input multiple-output (ΜΙΜΟ) system, and the like. The ΜΙΜΟ system typically uses multiple (Ντ) transmit antennas and multiple (Nr) receive antennas for data transmission. In one example, the antenna can be associated with both a base station (e.g., an [access point] and a mobile device (e.g., an access terminal), and the base station of 126234.doc 200838234 can provide a communication channel to the mobile device. The base station can signal for interpretation by an attempt to identify the base station and/or its transmission carrier or fan station. The beacon symbol is transmitted at a given time in the hyperframe, so that the number of sectors in the range increases beyond the available subtitles' resulting in a letter (four) burst. In addition, because of the need to transmit more information in the beacon and because the number of transmission devices grows in a given area, the mobile device can be overloaded due to the beacon message to be decoded and often misses messages that it cannot handle.发明: ϋ [Summary] A brief overview of the embodiments, or a plurality of embodiments, is presented below to provide a basic understanding of the embodiments. This Summary is not an extensive overview of the various embodiments, and is not intended to identify key or critical elements of the embodiments. The sole purpose is to present some concepts of the embodiment or embodiments In accordance with one or more embodiments and their respective disclosures, the description of various aspects associated with facilitating the encoding of beacon messages transmitted by sectors of a base station or base station may be encoded to satisfy a domain. Certain conditions or constraints of a plurality of beacon symbols to allow efficient decoding of the symbols in the event that the set of symbols is incomplete, and to efficiently and accurately resolve the conflicting symbols and time/frequency offsets. In accordance with a related aspect, a method of facilitating transmission of beacon messages into a plurality of beacon symbols is described herein. The method can include encoding a beacon message as a plurality of beacon symbols ' such that a number of symbols less than the total number of symbols of the beacon message 126234.doc 200838234 can be utilized to determine the remaining symbols of the beacon message. The method may also include transmitting a plurality of beacon symbols on respective subcarriers in a period of time and sign.勹 Also related to a wireless communication device. The wireless communication device can be configured as a processor that is configured to encode a beacon message into a plurality of 'symbols' such that after transmitting a number of tokens that are less than the total number of symbols of the beacon message, the beacon message becomes definite. The wireless communication device can also include a memory coupled to the at least processor. The -state is a type of wireless communication device that encodes and transmits a beacon = beacon symbol. The wireless communication device can include: (10) an initialization signal 5~# and means for encoding the beacon message into a plurality of beacon symbols according to an encoding mechanism, wherein the encoding can be solved from the small (four) number of symbols - part 2 mechanism. Additionally, the wireless communication device can include means for transmitting beacon symbols on respective subcarriers in the system. And a bad example is about a female computer. A computer program with a computer readable medium. The shameful drinkable media includes a beacon for enabling at least the computer to initialize the information of the transmitter with the = standard message. The code of the message. The process=1 is to obtain at least one computer-encoded beacon message as the performance information, and the number of beacon symbols 'selecting the letter according to an encoding mechanism' can be obtained by obtaining a part of the beacon symbol. In addition, the decoded beacon signal W °, in addition, the code can be used to transmit the beacon symbol on the subcarrier in the symbol period of the judgment. According to the other aspect, a kind of wireless communication k system, The device in the system may include -where - it is configured to encode a beacon message to the ... location in accordance with the available location, so that the available location is associated with a domain such that 126234.doc 200838234 is satisfied A linear constraint on the field, receiving a portion of the beacon symbol position may cause the remaining h-mark message to be determined and transmitting the beacon symbol. Again, the shoveling may include coupling to one of the processors' memory. Aspects also describe a method for receiving a portion of a beacon symbol, the portion of the beacon symbol being used to decode the beacon message. The method can include a partial subset of the beacon symbol including the encoded beacon. Coded beacon, The subcarrier position of the number satisfies a linear constraint on one of the total number of subcarrier positions available for the beacon symbol. Additionally, the method can include at least partially subdividing the subcarrier position based on the encoded beacon symbol and the resulting pair Information about the encoded beacon symbol is determined by solving the linear constraint. Another aspect relates to a wireless communication device. The wireless communication device can include at least one processor configured to receive a coded message of a beacon message a subset of the symbol, wherein the subcarrier position of the encoded beacon symbol satisfies a linear constraint on one of a total number of subcarrier positions available for the ## symbol. The wireless communication device can also include a coupled to the at least A processor's memory.

A further aspect relates to a wireless communication device for determining a beacon message based on a subset of received beacon symbols. The apparatus may comprise means for receiving a single beacon message that is less than a total number of beacon symbols in the beacon message. A component of the beacon symbol. The apparatus can also include means for satisfying a linear constraint on one of the total number of available subcarriers for the beacon message based on the received subcarrier position of the beacon symbol. The apparatus can further include means for determining remaining beacon symbols in the beacon message based on the linear constraints. Another aspect relates to a computer program 126234.doc 200838234 product having a computer readable medium, the computer readable medium comprising an incomplete collection of beacon symbols for causing at least one computer to receive beacon messages A code that satisfies a linear constraint on one of the available subcarriers used to transmit the beacon symbol broadcast. The program SHI &amp; t, the horse can also cause at least one computer to solve the linear constraint on the incomplete set of beacon symbol broadcasts to determine the remaining beacon symbols in the beacon message. According to another aspect, a device in a wireless communication system can be provided that directly includes a processor configured to receive an incomplete collection of beacon symbols for beacon messages. The processor can also be configured to determine the remaining beacon symbols of the beacon message and to decode the beacon message based on utilizing the received beacon symbols to satisfy linear proximity and ambiguity constraints on a domain to distinguish the transmission fan District information. Alternatively, the device can include a memory that interfaces to the processor.实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施. The following description and the annexed drawings are set forth in < Rather, the <RTI ID=0.0>> </ RTI> </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; [Embodiment] Various embodiments are described with reference to the drawings, in which like reference numerals are used to refer to the like. In the following description, numerous specific details are set forth However, it will be apparent that the embodiment can be practiced without such specific details. In other instances, well-known structures and 126234.doc 200838234 devices are shown in block diagram form to facilitate describing one or more embodiments. As used in this application, the terms &quot;components,, &quot;modules, and the like are intended to refer to a computer-related entity = and ^ software... software or an executing software component can be (but not Restricted to the execution of the tongue, the executable, the thread, the theft, the nD, and/or the computer. Both the application and the computing device executed on the device can be ^. * or multiple components may reside in a process and/or execution thread, ' and the components may be located on a computer and/or distributed between two or more computers. In addition, you can execute these components by 苴μ 六 々 六 Έ 〜 ... ... 袖 袖 袖 袖 袖 - - - - - - - - - - - - - - - - Such components may (for example, data from a component that interacts with the local system, two;;; another component in the system) and/or by means of a number in The signals of the components of the network on the network interacting with the (four) system are communicated by means of the local and/or remote processes. Furthermore, various embodiments are described herein in connection with mobile devices. System, subscriber unit, subscriber station, mobile station, mobile phone, remote station, remote terminal, access terminal, user terminal, terminal, wireless communication device, user agent, user device or user Equipment (UE). Mobile devices can be cellular phones, wireless phones, Session Initiation Protocol (SIP) phones, Wireless Area Loop (WLL) stations, Personal Digital Assistants (PDAs), Handheld devices with wireless connectivity, Computing A device or other processing device connected to the wireless data machine. Additionally, various embodiments are described herein in connection with a base station. The base station can be used to communicate with a mobile device and 126234.doc -11 - 200838234 This may be referred to as an access point, node, or some other terminology: The various deficiencies or features described herein may be implemented as a method, apparatus, or article of manufacture using standard stylized and/or work-in-progress techniques. The term &quot;article&quot; It is intended to cover computer programs that can be accessed from any computer-readable device. For example, computer-readable media can include, without limitation, magnetic storage (eg, hard disk, floppy disk, magnetic stripe) Etc.), CD (such as 'compact disc (four), digitally versatile disc (dvd), etc.), (4)

Ο Cards and flash memory devices (for example, EPR (10), cards, sticks, secure magnets, etc.). In addition, the various storage media described herein can be used to store information - or multiple injure and/or other machine-readable media. 4 s readable media » 7 4 k &quot; Bellows may include, but is not limited to, wireless channels and various other media capable of storing 'including and/or bearing (4) orders and/or materials. Referring now to Figure 2, a wireless communication system 100 is illustrated in accordance with various embodiments presented herein. System 100 includes a base station 102 that can include multiple antenna groups. For example, one antenna group can include antennas 104 and 106, another group can include antennas 108 and 11A, and additional groups can include antennas and ports. For each antenna group and t, two antennas are illustrated; however, more or fewer antennas are available for each group. As will be appreciated by those skilled in the art, base station 1 2 may additionally include a transmitter chain and a receiver chain, each of which may include a plurality of components associated with signal transmission and reception (eg, a processor) , modulators, multiplexers, demodulators, demultiplexers, antennas, etc.). The base station 102 can be in communication with one of the mobile devices 116 and the mobile devices 122 or the mobile device; however, it should be appreciated that the base station 102 can interact with virtually any number of mobile devices similar to the mobile devices 116 and 122. 126234.doc -12· 200838234 Line communication. Mobile devices 116 and 122 can be, for example, cellular phones, smart phones, laptops, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, Pdas, and/or for use in wireless communication systems Any other suitable device that communicates on 100. As depicted, mobile device 16 is in communication with antennas 112 and 114, wherein antennas 112 and 114 transmit information to mobile device U6 on forward link 118 and receive information from mobile device 116 on reverse link 120. . In addition, mobile device 122 is in communication with antennas 104 and 1 'where antennas 1〇4 and 1〇6 transmit information to mobile device 122 on forward link 124 and from mobile device 122 on reverse link 126. Receive information. For example, in a frequency division duplex (FDD) system, the forward link 118 can utilize a frequency band different from the frequency band used by the reverse link 12A and the forward link 124 can be used differently than by the reverse The frequency band of the frequency band used by link 126. Additionally, in a time division duplex (TDD) system, forward link 118 and reverse link 120 can utilize a common frequency band and forward link 124 and reverse link 126 can utilize a common frequency band. Each group of antennas and/or an area designated by the antenna to communicate therein may be referred to as a sector of base station 102. For example, an antenna group can be designed to communicate with mobile devices in sectors of the area covered by base station 102. In communication via forward link ports 8 and 124, the transmission antennas of base station 1〇2 can utilize beamforming to improve the signal-to-noise ratio for forward links 118 and 124 of mobile devices 116 and 122. Moreover, when the base station ι〇2 uses beamforming to transmit to the mobile devices 1丨6 and 丨22 randomly dispersed in the associated coverage area, the base station transmits to all of its mobile devices via a single antenna, adjacent to each other. Mobile devices in a cell can experience less interference. 126234.doc -13 - 200838234 In an example, base station 102 can transmit beacon messages or codewords from each of antennas 104, 106, 108, 110, 112, and 114 and/or antenna groups, including antennas and/or Information about the corresponding base station 1, such as identification information and/or other metrics or general information associated with the antenna and/or base station 102. A beacon message or codeword or (more generally) a beacon is a signal transmitted using substantially all available power to achieve a device having a low to high signal to interference ratio (SNr), the #标 message or codeword may include identification information to Allow disparate devices to identify sectors (beacons are associated with this sector). The beacon message or codeword can be represented by a number of beacon symbols (which in the example can be 〇FDM symbols) transmitted in beacon mode or sequence. The beacon mode is represented by a plurality of beacon symbols transmitted to convey information in the beacon message, and may be a repeating or infinite mode in various examples. According to an example, mobile devices 116 and 122 can receive and decode one or more beacon symbols to identify information about the antenna, associated sector, base station 1〇2, and/or underlying system or network. In one example, the beacon symbol can be one of the initial signals that the mobile devices 116 and 122 can interpret about the base station 1 or 2 or the antenna (eg, with respect to power on or within the broadcast range). To this end, beacon symbols can be transmitted such that they are easily recognized by mobile devices 116 and 122. In one example, the beacon symbol may represent the entire beacon codeword, which may be a plurality of beacon symbols (or patterns) indicating information, which may be required prior to proper decoding. According to an example, base station 1 自 2 can be self-giving antennas 1 〇 4, 1 〇 6, 1 〇 8, 11 〇 by transmitting substantially all available power on its single subcarrier channel (or a few channels). 112 and / or 114 send a beacon symbol. Mobile devices 116 and/or 122 can receive signals and perform fast Fourier transform (FFT) or other decoding algorithms on the signals to determine that one channel has a very high frequency compared to other channels. The mobile device 11 6 and/or 丨 22 may infer that this is a beacon symbol for a given antenna, sector, base station, and/or base network or system and interprets the symbols accordingly. In addition, for example, mobile devices 116 and 122 can infer that the beacon symbol is one of a set of symbols used in the beacon codeword. To facilitate the versatility of a plurality of antennas (as shown in the figure) and/or a plurality of base stations (not shown), the base station 1 〇 2 can have a broadcast to the mobile device 116 in range and 122 associates the beacon code and uniquely identifies itself. The beacon code indicates the manner in which the beacon message is encoded; as described herein, the receiver of the information-available beacon message or its symbol predicts specific details about the beacon message. The beacon code can be a single symbol transmitted in each superframe, which is broadcast on the only-subcarrier in the superwire. In addition, the beacon code can be a plurality of such symbols broadcast on different subcarriers in the mother-cycle to indicate a beacon codeword or mode, and the mobile devices 116 and 122 can derive the relevant information from the beacon codeword or mode. The information of the transmitter of the code word. In an example, the broadcast ^ symbol, the subcarriers of the Satoshi broadcast, and their order may be encoded, defined, and indexed based at least in part on the desired beacon message and symbol time. τ = the aspect described herein, the beacon code can be designed to allow the mobile device to quickly identify the base station 102 based on the broadcast beacon without having to receive all the symbols of the # code word. The beacon encoding mechanism: the wide-range devices 116 and 122 eliminate the ambiguity of the beacons upon receiving one or more symbols. In addition, the following 126234.doc -15-200838234 beacon code may allow the mobile devices 116 and 122 to detect the frequency shift of the device and properly correct the shift to interpret the transmitted beacon code as well as possible. Thus, mobile devices 116 and 122 are allowed to read and decode many symbols. In this regard, mobile devices 116 and 122 can extend the options of base station 102 to which they can connect by broadening their interpretable beacon quantities. Turning to Figure 2, illustrated is a communication device 200 for use within a wireless communication environment. Communication device 200 can be a base station or a portion thereof, a mobile device or a portion thereof, or substantially any communication device that transmits one or more beacon symbols. The communication device 200 can include a beacon encoder 2〇4 that encodes the beacon message as one or more beacon symbols (such as a beacon 〇fdm symbol) and a transmitter 206 that broadcasts the beacon symbol or A plurality of symbols. In an example, the device 200 can compose a beacon message and encode the message as, for example, - or a plurality of symbols using the beacon encoder 2〇4, the plurality or symbols being associated with the communication device 200. News. In an example, the beacon may be sent in a synchronous or asynchronous configuration and may have different properties for identifying it depending on the configuration. The communication device 2 can transmit the beacon symbol on the transmitter 2〇6 at a specified time interval (and in a certain period during a specified time it). In this regard, according to an example, a device can receive a beacon as one or more of the transmitted symbols and distinguish information about the communication device. In a single example, the beacon symbol can be transmitted by the transmitter 206 for a given period of time, such as between two symbol periods, to ensure that the device can receive the entire symbol even when not properly timed or in an asynchronous configuration. After receiving several beacon symbols of the packet (eg, beacon message or codeword), the device can self-correct or adjust its timing to communicate in the wireless system. 126234.doc -16- 200838234 Letter ' Communication device 200 is part of the wireless system. In this case, Fangshan (4) has certain properties known to the device. In the case of sorrow, the symbol of the beacon signal can be transmitted at a given time interval (periodic) and/or in every superframe. Towel (during the second day of the payment period)

C (Example ' can choose to transmit the beacon or its benefits, the beacon (four) symbol for the desired beacon signal. The symbol can be selected, determined or otherwise to satisfy several properties. The nature can be determined by other devices in the mobile device system. Knowing to effectively interpret the broadcasted death number. For example, by means of the syllables ^^ ^ ^ symbol (where the necessary number of beacons can be used = communication device for sending signals. For example = = communication device The beacon can be fully decoded and this situation is described for the device becoming a determined 2 heart after depleting the 3 symbols from the ^ symbol. It should be understood that the symbol in the beacon signal is, and periodically The transmission, or the discrimination of two or more beacon signals transmitted in the instance for an indeterminate (4) device and cancelled by another known beacon signal of the device, communicates using the coding mechanism described below The device 200 can transmit the strict symbol and determine that one of the beacons receives the time period of the necessary number of $3. It is necessary that the R-person can be smaller than the signal of the signal Yin and the aforementioned functionality. Allow setting By effective implementation, according to yet another example, by beacon encoder 204 (as in this article 126234.doc -17- 200838234

C, the nature of the beacon encoding mechanism of the beacon message encoding the communication device 200 can be = or - the device corrects the offset frequency component or the timing component. For example, the nature of the mechanism can be known for mobile devices, so after receiving several symbols in the beacon signal, it is easy to detect the frequency and/or the deviation of the day-to-day offset. Or a beacon transmitted by the plurality of communication devices 200. It should be understood that 'the foregoing properties may allow the mobile device to self-communication device-listen: several beacons' and facilitate effective identification of its transmission^ (communication device 2 called information so that the maximum number of beacons can be heard and decoded, and can be performed Regarding an effective decision to communicate with the communication device(s) 200. Referring now to Figure 3, illustrated is a wireless communication system implementing a beacon encoding one or more base stations. System 3 includes a base Station 3〇2, which communicates with mobile device 304 (and/or any number of disparate mobile devices (not shown)). Base station 3G2 can transmit to mobile device 3〇4 on the forward link channel In addition, the base station 3〇2 can receive information from the mobile device 304 on the reverse link channel. In addition, the system 3 can be a system. In addition, in the κ example, the system 300 can be in the OFDMA wireless network. For example, base station 302 can include a timer 3〇6 that facilitates communication in a synchronized environment or transmits symbols in a non-synchronized system for a given time period. Base station 302 can also include Beacon coding 3, 8, the encoded beacon message is a plurality of symbols that can be transmitted by the transmitter 310. For example, as previously described, the beacon code can be related to the beacon message to be transmitted and the time index, and based on the to-be-sent The beacon message and the time index are selected. It should be understood that the beacon message may include an identifier of one or more sectors of the base station 3〇2 or the base station 3〇2, a preferred carrier and/or information about the beacon and / or pass 126234.doc -18- 200838234 other information about the entity. In an example, the transmitter 3i can broadcast beacons within a given time period (using the timer 1 2 3 4〇5 to determine the time) / or its symbol (such as in two time jobs (doubling the length of the symbol period) to ensure that, for example, the power-on mobile device 3G4 can receive and decode the beacon symbol even if the beacon symbol is time- or frequency-biased _ + example 6, the swaying device 304 can include a timer that facilitates communication in a synchronized environment or by measuring the transmission time and duration ^ calibrated to the base station in an asynchronous environment 3 〇 2. Mobile devices can also 2 a beacon decoder 314 that decodes according to known properties of the beacon: 'and/or the symbol of the beacon; and - a receiver 316 that receives the letter (including the beacon symbol) from the base station 3〇2 In an example, the mobile device 3〇4 can receive a plurality of beacon symbols, for example, from the base station 3() 2; the beacon can be part of the entire beacon. The device 304 can use the beacon to solve the horse 314 to decode the received symbol (^^) A, and determine the issue

U

The information of the base station 3〇2 (and/or the sector or transmitter of the base station 3〇2). Additionally, in an example, the ancient + BQ , , . , a Π 312 can be evaluated to provide additional information about k 及 and/or be calibrated based on the beacon. According to an example, the base station 3〇2 can use the “軚 encoder 308 to encode the signal display w to include the base station 3〇2 should be crying, for example, the beacon codec 308 is based on The information to be transmitted is selected, and the base station 302 can use the -19-1 - leaf point and upload the 2 output symbol in the transmitter 3U for a duration. The time can be 3 lei for the standard period. , 7", "double" to ensure that just 4 = open mobile device 304 can receive beacon 5 126234.doc 6 in the complete window and L' power-on mobile device 304 can initially have a bias Shift timer 200838234 η 3 12. After receiving the necessary number of beacon symbols (as previously discussed) for a given beacon signal via receiver 316, mobile device 304 can determine the entire beacon signal (eg, determine the beacon signal or the remaining symbols of the message) and The signal is decoded to be a 3 14 decoded signal. For example, after discovering the information stored in the beacon symbol, the mobile device 304 can calibrate its timer 3 12 based on the beacon. In addition, the power-on mobile device may initially have a radio or oscillating crystal with a frequency offset. For example, this can also be calibrated after receiving and decoding the necessary number of beacon symbols for the beacon codeword. Since the action 304 can be aware of the beacon mode, in this regard, the mobile device 304 can, for example, easily detect the offset beacon sequence after receiving a few symbols and validate its frequency portion or timer 3 12 . In one example, the beacon can be transmitted every 90 milliseconds on a plurality of available carrier tone I in the -bandwidth. The beacon encoder 3〇8 can encode the desired information by selecting one or more beacon symbols for transmission and to transmit to the carrier tone in the frequency domain. For example, the base station 3〇2 can convert the carrier frequency modulation to the upper two-two; by using the inverse fast Fourier transform) and transmitting the material on the transmitter 3丨〇. For example, according to the knowledge known in the text of this document, 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 户 。 。 。 。 。 。 。 。 。 。 。 And (for example) the letter such as 'by using fast Fourier&lt; to the frequency domain (code beacons. Again - times, #understand, then self-script decoding 11314 solution - or multiple symbols, factory, self-co Representing the entire beacon - part of the 唬 个 唬 decoding beacon; however, the knives allow the beacon to be decoded from a few symbols. After decoding:: no: encoding mechanism, to be transmitted by the base station 3〇2 126234.doc -20- 200838234 The symbol of the received symbol 304 can be determined. Using the nature of the beacon symbol, the mobile device 3〇4 can use the low complexity coding and decoding mechanism to confidently mark one part of the fast detection. Measure the sector; decode the beacon without time information (since it knows the valid beacon sequence); when two or more beacon symbols are received simultaneously, decode in the presence of a collision; and although action The frequency of device 3〇4 can be offset 'But still decoding. Referring now to Figure 4, there is shown a representation of the bandwidth over a time period of 4 给 for a given transmitter (such as a base station or its sector/carrier). Used for a given symbol period 4〇 2. The plurality of subcarriers of 406 and 410 represent the bandwidth, and the time period can be divided into one or more hyperframes 414, which can, for example, have a predetermined duration. The symbol period is shown, and the time is 41. Each of them can broadcast a beacon symbol, 408, and the beacon symbol 4〇4, 412 and 412 utilize power (since the other symbols are unpowered, the power can be substantially all available power) Represented as substantially unique mismatch symbols in the symbol period, respectively. As shown, 'beacon symbols 404, 408 and/or may be transmitted on different subcarriers and/or at different time periods (parent-superframe 414). Or 412; the selected subcarrier may represent desired information (such as a beacon message), which may be a forward beacon pilot channel (F_BpicH) in an example. It should be understood that each superframe can transmit multiple messages (4) No.; again, the super frame can be skipped and does not transmit a jin In one example, the beacon can be periodic on a frame, so that the waiter can transmit at intervals in the inter-cycle. As mentioned, for example, in the The choice is for the transmission frequency. For example, the sub-carriers (for example, sub-carriers 404, 408 and / 412) may refer to the time interval transmission of the beacon or the transmission of the Μ 126 126 234.doc 200838234 : a number of beacon symbols. In this respect, providing a code 4 that can have the above-described properties allows the mobile device to be based on a minimum number when there may be conflicts and when the mobile device may need calibration for time and/or frequency = the symbol is effectively in the middle of the beacon transmission (4) on the beacon transmitter

The subcarriers of the parental payment period 402, 406, and 410 in the example can be enumerated as prime number n channels (for example, as shown, and the beacon subcarrier can be the number of enumeration numbers (enumeratiGn). Subcarriers. It should be understood that the subcarriers may be substantially all available subcarriers for transmitting beacon symbols on the carrier. The other subcarriers may be divided into n groups; the available subcarriers may be subcarriers in the group. Or the group. The marshalling mechanism can be used to select a group of subcarriers. In this respect, the algebraic condition can be satisfied on the domain to allow partial obtaining of the desired properties by measuring the offset. Therefore, the sequence of the furnace symbols can be passed through Thus, the number of consecutive or purely necessary: can substantially satisfy the equation on the domain from * causing the remaining symbols in the beacon to be determined. This also allows the necessary number of symbols to not accurately satisfy the equation, but (for example In the case of an offset that can be used to adjust the receiver frequency, the offset frequency is detected and adjusted. According to an example, the algorithm can be determined because a certain number of consecutive positions are satisfied in a domain. Linear constraints exist on it, The domain element can be identified by the subcarrier at the domain. Therefore, after receiving the necessary number of symbols in succession, the symbol f can satisfy the linear constraint (❹, the wire can be aggregated to zero), and the beacon can be determined (or Remaining symbols in the field. For example, in a 1.25 MHz F-OFDM configuration, there are 113 carrier frequency or subcarriers available for transmission in 126234.doc -22-200838234 in one symbol period. The modulation can be divided into three sub-sets of 3 7 (primary) carrier frequencies or subcarriers (eg, as shown for subcarrier 4 〇 2, = 37). The given beacon symbol can be obtained by modulo 37. Position such that there are 3 ambiguous positions of the symbol. For example, this information can be used to modulate additional resources, creating redundancy by using all three carrier frequencies with the same modulo 37 value, and/or Power is saved by using only 1/3 of the carrier frequency and allows for more efficient operation. In this example, the period of 18 symbols of the beacon can be selected to result in 363/18 = 2592 beacon sequences. For example, the original element of the multiplicative group Z/37 can be selected as a symbol such that l〇g:[l.·36] —[0&qu Ot; 35] and its inverse index are defined. Next, I and 3 can be distinct elements of Z/37 (and either of them can be elements that define the above logarithms and indices). Therefore, α, 6 and . can be defined by b-A2)Q-P22)(x-ρ32) = Ρ-like α. The following variables can also be defined.

'0 1 0' Μ= 0 〇 1 , Λ =

Log px 0 0&quot; log p2 1 0 · log p3 0 1 Therefore, in the case of three consecutive radical symbols z, 2, and a in a given 18-character h-codeword, it can be judged by + 4 of a symbol. Instructions? = (~, z, + 1, ~ 2 wide can produce ? +1 = 尬,. Therefore, Shi, 126234.doc -23- 200838234 1 8 periodicity. Thus essentially causing all sequences to have a period based mechanism The position of the coded beacon code is as follows: Column, the first three beacons can be arbitrarily selected to represent 2 * Μ sequences. Then, "can indicate Κ «2, "exp[h] can be given the first 3 of the beacon sequences The element, where square brackets _ should be applied by the component (, called wise), is exponentially lined by modulo 36 = different. For example, the following equation should be solvable:

Mk (B exp[F a]) = B exp[F(a + k(2,03 Of)] where the operation in the square brackets is 36 and the operation outside the square brackets is 37. Therefore, 'by W is essentially Equivalent to adding k(2,〇,〇)^a modulo%. The decoding method can be given as follows. , , ^r Observed less, where exp[Fa], (a + k(2,0,0) T) =: V-1 log [B~ly] where, in addition to 5 modulo 37), the operation mode 36 is operated. In particular, observations in the ugly base can be expressed as (mod 37). Then, the logarithm of the plant base can be expressed as MflogM (mod 36), where 々 = (for, yes, wide. ~ use ', C' symbol mark.

α\ = β\%^ α2 = A

A3 = A k = β}/2 mod 18 126234.doc -24- 200838234 Therefore, the three consecutive beacon symbols received can uniquely determine the sequence time shift k modulo 18. Additionally, in this example, the frequency offset can be discerned by decoding 4 beacon symbols. (For example) If, according to a mobile device, the carrier frequency shifts by s ’ in frequency, then 4 彳§5 can be observed as a + s. In this respect, 怂βΚ+πχΐ-α-卜Φ, from which the s can be determined and the other receivers of the mobile device or beacon symbol can be adjusted accordingly. In addition, after receiving several signals, the ambiguity of the conflicting symbols can be eliminated. After receiving 4 symbols (and more explicitly after receiving 5 symbols), the ambiguity of the two conflicting beacon symbols can be eliminated with high probability, and the ambiguity of the three conflicting beacons can be eliminated after 1 unit of symbols. For example, the conditional parent (less 2+73) 可 can be satisfied for any valid beacon sequence on the κB that can be used in this aspect to resolve the singularity. In the case of (A, still, μ gas 3, 14, 35), in this example substantially any of the three consecutive beacon symbols from the eight consecutive beacon symbols can be determined. Many 3 consecutive L) beacon symbols from 18 consecutive beacon symbols can also be used to determine the beacon code; for example, the interpolation function is a linear function on Ζ/3 7 and can be easily Basic linear constraints are obtained at 4 consecutive beacon positions. According to another example, an I | Maximum Distance Segmentation (MDS) code transmits a beacon symbol. For example, the MDS code can produce the maximum error correction capability of the code gate with the smallest possible difference. In addition, in an example, the redundancy required by the evaluation of the message from the length (in bits) and the difficult message: in the sub-cut of the transmission letter The number of waves, the beacon, the length of the sequence of a non-carry symbol, and/or at least 126234.doc -25.200838234 additional similar factors are used to compile the MDs code. According to an example of what will be referred to hereinafter as "beacon code A&quot;, 211 subcarriers can be used to transmit a symbol (e.g., at 4"2 = 211), where the beacon symbol can be a 12-bit message ( Including the information as previously described; therefore, the MDS code may be required to support non-binary symbols (eg, #, which is the sector of the fan & transmitted). At least 2 8 12 = 4096 different sequences. According to this example, a beacon symbol can be transmitted on a subcarrier having an index Ζ &lt; (α, the index can be expressed as: f: , where and can be a domain (which can include 211 elements representing subcarriers) The original elements, ~ and h, may be exponential factors determined at least in part based on the beacon message (as described below), and ten indicates a modulo addition operation. In this example, the morphing can still represent a domain that can be substantially generated. Element of all 211 non-zero elements of Zm. In the more trivial instance, 5 can be used to generate all 6 non-zero elements (5° mod 7=1, 51 mod 7 = 5,52 mod 7=4,53 mod 7 = 6,54 mod 7=2 and 55 mod 7=3), so z7 can make 5 the original element U. The operation in the above equation can be the operation on the domain ;"; therefore, A and B The summation can be given as (A+B) m〇d 211, and the B power of A can be given as AB mod 211, etc., but the integer addition in the exponent can be an integer summed with 21〇• The exponent factor ~ and cc2 can be defined as: 0&lt;αχ&lt;21Α 0&lt;α2 &lt;210 0 Therefore 'can be defined by the equation ~ and Μ total 21 * 210=4410 dissimilar groups 12 6234.doc -26- 200838234; for example, this can support ΐ2 bit signals with 4096 available sequences. In addition, each combination of '~ and α2' can correspond to a different message U, thus corresponding to Different sequences of non-binary symbols of the letter #2 In an example, the message can be mapped to be usable in any way: 唬'4, etc., including random mode, via network planning or configuration, based on The way of history, and the like. For example, according to the example - for a given combination of ... and ..., the message Μ can be mapped to ]V[=21〇«7 +«2 because for ζ· = 1, 2 Γ θ1() = 1, so the code of the above equation can be periodic (period 210/21 = 10 symbols); therefore, in an example, for a given value t, z(a ???, α2)=ζί+10(α1, α2). For example, the beacon symbol can be shifted according to the subcarrier to transmit information to the receiver.

According to an example, even in the absence of time information, the mobile device can recover the message sent in the beacon by the two beacon symbols of the message in the presence of the sector. This can be accomplished, for example, by receiving non-binary symbols ~ and heart at times ^ and ί+1. The symbols can be expressed as: Ge = Αα, +21' 十 ρ2α2+αι+21, and X2 = A 1 (0 十 AW21 (4) = outer 21 广丨+21'十 ρ221 * 夕广+ai+2U or in matrix form : KX2j Ια21 λ21 +21/ +21/ , na2+«,+21/ , Ρΐ Ρι α2+«1+21/ :Α where Α: and Ρ 21 and ρ221 are equal to two specific elements of the field Ζ211. Use this and so on , mobile equipment or terminal can be solved Α «丨 - and Huguang Cap 丨 +21 / such as 126234.doc -27- 200838234 under: yj

= Α-! 'p^+2u &quot; / KX2j ηα2+α,+21/ J After this, the terminal or mobile device can obtain the index of Huguangxian and ^ 匕1 2 as follows: 5 = logO!) /l 〇g(A ) = (% + 2 li) mod 210, and z2 =1〇g〇2)/l〇g〇2) = (a2 +% +16i) mod21〇.

A logarithmic operation can be defined with respect to virtually any primitive element of the domain Z2&quot;, and the given value γ can be mapped to a particular value of 2. For example, correspondingly, the lookup table can be applied to the device or terminal. The exponent factor... and ~ and the time delay 51ί can be obtained as follows: A = Ζ 2 - 6, A = 61110 (121, and t = z1 divll The factor h can be obtained by combing the above two logarithmic equations. Because ~&lt; 21 (described above), so... can be an integer remainder of &amp;/21, and the time index (which can be the quotient of Ζι/21. In this regard, the terminal can also be separated by the presence of a sector) ^ Two non-contiguous beacon symbols of a symbol to recover the heartbeat sent in the beacon. In an example, the terminal can receive two beacon symbols at time ί and ί + Δ and obtain two non-binary symbols. ~ and heart, where Δ is not an integer multiple of 10. The received symbol can be expressed as: 126234.doc -28- 200838234 ten p2c αι+21(/+Δ) , and

:〆丨*huguang*10 households 221* households+«i+2U, ρλ-------~18 W21(w) or in matrix form·· 21Δ _21Δ

Pi ρΓ Kp^a^lli +21/

A ’ P, +2U, n〇2^a]+2li Array 4 can be viewed by the terminal Α = ί i 1 1 g'. So, for example, η 仃 仃 仃 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 It will be appreciated that the terminal can also be hunted by different matrices 4 to decode the received non-binary symbols in the manner described above. 2 'As mentioned in the first w' terminal can also decode the conflict beacon symbol so that the beacon is related to its transmitter, thus § δ for the transmitter and beacon, and for the sector Α (Μι, such as 2 For example, for sectors outside and outside, three non-binary symbols can be received. The four possible combinations can be solved using four combinations (such as 丨, ο, (outside), (called, outside) and (10), based on the front-fix terminal' or the receiving device. For: one: For each of the interest, the terminal knows the third sign of expectation. For example, it can be separately used in the call and external verification messages. Cut into I2, called). x, as shown, the 'beacon code' can be placed in the index by two primitives: the number and: and the time index, also in the W day. The factor ~ and "2 can also be in the index or its coefficients. - "in the column" this beacon code can be used for two subsymbols after receiving, for example, 2's and can be used for the subcarriers available for transmission of the signal per symbol period. It should be understood that The beacon code A can be used by 126234.doc -29-200838234 for virtually any number of subcarriers; another example can use 257 subcarriers with period 16 to establish 16 * 256 = 4 〇 96 combinations Used for 12-bit suffocation. In addition, different message sizes can be used; 12-bit is only one of an unlimited number of instances. According to what will be referred to as ''beacon code A,') Another example of a Reed-Sol〇mon code, 211 subcarriers can be used to transmit beacon symbols (eg, liver 211 at 402), where the beacon symbol can be a 12-bit message (including as previously Said data); therefore, the Lie Solomon code can be required to support at least 2 8 12 = 4096 different sequences of non-binary symbols (eg, which are transmitted by the sector). According to this example, the beacon symbol can be transmitted on a subcarrier having an index (four) called, which can be expressed as: where A can be the original element of the domain (which can contain 211 elements representing the subcarrier) and; =w,α; and α 2 may be an index factor (as described below) based at least in part on the beacon message 'and ten indicates a modulo addition operation. In this example, ;^=2〇7 and ;^卜16. In other instances, other primitive elements can be used for Α. Since the small value of the simplification can imply Α, (4) close together, the larger original element can provide greater frequency diversity. The choice of Qiao = Dan 2 can result in a Lie Solomon code, which can be characterized by a weighted sum of the increased indices. The exponential factors ~ and α2 can be defined as: 丨 &lt;21, and 〇^α2 &lt;210 0 Therefore 'the total of the illusion and α2 can be defined by the equation 21 * into the UU-4410 dissimilar group 126234.doc _Λ 200838234; For example, this can support i2 bit messages with 4096 available sequences. Additionally, in this regard, each unique combination of ~ and ~ may correspond to a different message (and thus correspond to a different sequence of non-binary symbols of the beacon). In an example, the message can be mapped to the available symbols in substantially any manner. The manner includes a random manner, a static assignment via network planning or configuration, a history based approach, and the like. According to the example, for a given combination of ... 2, the message m can be mapped to (example tank = 2 Η) * « / + α 2 . Because for /=1, 2, # = 1, the above-mentioned equal-code can be periodic (the period is 21〇/2); therefore, in the example, for a given value, ♦ heart. (αι, α2). For example: In this way, the beacon can be shifted according to the subcarrier to transmit information. ^ Port ° According to an example, even in the absence of time, the mobile device can also use two messages in the presence of sector h. This can be done, for example, by sending ηψΎ „ in the ^ mark and receiving the non-binary at time?

Pay "and χ 2 to achieve. The symbol can be expressed as: W = η αι + 21ί a2 lit

Pl ® Pi p2, anti-P: 2P: =η αι+21(ί+1) ^ «2 ^ 2l(r+i) or in matrix form: V J1 η / 丨+21/, J2pI\ u&gt; U .21 ρΙί κΡι2Ρ22\ where A = f 1 1 21 21 U21 p221 j 'And A and annihilation equals the domain 2 夕不士一-士,. The two specific elements of the use of this Rong i 4 寺寺式,行动设备Or finally let her down: ,, machine can solve ρΓ and ρΓ2ρ221ί as 126234.doc 200838234 = A-! V '〆丨+2U, ΚΧ2^, heart 2' After this, the terminal or mobile device is available; ^+ 21, the index h · A = logOO / logh) = (αι +21ί) mod 210 对 can define the logarithm of any original element on the domain Ζ 2 &quot;, and the given value ^ can be mapped to a specific value ζ . For example, accordingly, the lookup table is applied to the standby or the terminal. The index factor αι and the time index can be obtained by: & A mod 21, and i = zWv21 〇 by "for example, the derived M is entered into 怂 = 妒 to obtain 妒 and then solved based on corpse 12 A factor of cc2 is obtained by α2. In this respect, as described above, the terminal can also recover the message transmitted in the beacon by two non-contiguous beacon symbols that do not separate 1G symbols in the presence of a sector. And recovering the sequence of conflicting or overlapping beacon symbols from the two sectors by three consecutive beacon symbols. In the case of the case, the Lie Solomon code A can encode the number M to the set {0, 1, 2,. ·., 仏1} in the non-binary digits - sequence, where (four) ^. can be especially 1 (exhaustive = «1 + 21 / + / ^ 2 + 42 ') 111 〇 (12 identified Ku Shi 丨 | by seven In the example, the position ί in the sequence is 207, a "LM / (2 ~ l)", and α2 = Μιη0 (1 (ρ - 1); is the original element of GF (9), therefore ( pW m()d 0=;1. Another example of using the Mds code, which will be referred to as the ^B code B&quot;, can use 4 7 subcarriers for transmission, and 1σ is not paid (for example, In the symbol week 4〇2的副126234.doc -32- 200838234 In the carrier, 47). As in the previous example, φ ^ ± 4 4疋4 Lu code (for example) may require 4096 different sequences. To facilitate this Love X (a fy rv \ 7 has a beacon symbol transmitted on the subcarrier with the cable jf 2, 3) ^ This index can be expressed as ·· Α (αΐ,5 a3 ) = J^+2/ 十 ^2 +0^+2/ 十 Γ 2... and P3 can be domain Z47 (which can contain 47 elements of the subcarriers of the subcarriers ^αι, "2 and ~ can be judged based at least in part on the beacon message) The index factor (as described below), and ten indicates the modulo addition operation. In this example, the index factors α1, λ, and . can be defined as: 0&lt;(^ι&lt;2, 0&lt;α2&lt;46 ^ and 〇Sg3&lt;46 〇 Therefore, the total of 2 * 46 * 46 == 42n disparate combinations of ~, heart and ~ can be defined by the equation, thus supporting the required 4096 combinations of beacon symbols. The beacon message can be mapped. To - combination, in the instance, the combination is Μ = 2116 * αι + 46 * « 2+ 7. The extra and / or alternative mapping and the mapping described by Li Wen can be used. For example, because for the household 1, 2, 3, &lt; =1, so the code can be periodic (the period is 46/2 = 23 symbols); therefore, for a given ?, 孓 (%, 0:25«3) = meaning / +2 plus „ 3) For example, a terminal or mobile device can recover this message or beacon code by means of three beacons of the message. In one example, the device can receive three non-binary symbols 心, heart, and heart at times ί, ί+1, and ί+2, respectively. The binary symbol can be expressed as: 126234.doc •33- 200838234 Χ2 = ρ αι+2(/+1)10 ρ α2+«ι+2(ί+1)10 ρ α3+αι+2(ί+1) = =Ρ〗 2 * Λ—10 Κ * &lt;2+(4)10 Α2 * αι+2(/+2) ^ ^ α2+α!+2(ί+2) ^ ^ α3+αι+2(/+2) A 1, ... ten; 7 / two a4 * Α - ten A4 * Αα2+αι+2ί Ten ΡΧ 2+αι+2ί or in matrix form: where Β ρ1' p\ Pi ρ\ Ρ\ and the elements in the field are Ζ47 Elements. Use this equation action to prepare for the action ^2, and ρΓαι+2ί as follows: ί叫Ά+2,, y2 =§-1 x2 = ρα2+α}+2ί u&gt;&gt; al-¥ Ax-¥lt V^3 J After this, 'the terminal or mobile device is available, the index of +' is as follows: and ρ 广丨 丨 +2ί ϋ 'V , 1 1 η 〃 Α (four), 7+2. X2 Ρι Ρ22 ρ] ρ^+2ί =Β a2+ax+2t Ρ2 ΚΧ3 &gt; κΡι Ρ42 p\j ^{yx)/\〇g{px)^ax+2t, :l〇g〇2) / l 〇g〇2) = α2 + A + 2ί, and 3=1〇§(less 3)/1〇£〇93) = 6^+%+2/. A logarithmic operation can be defined with respect to virtually any primitive element of the domain, and the given value ^ can be mapped to a specific value. For example, the lookup table can be implemented within the device or terminal, accordingly. The index factors αι, 〜 and force and time indices can be obtained as follows: 126234.doc -34- 200838234 a2 a3 - 2:p 丨 丨 = 3 mod 2, and t = zl div 2 〇• _likely 'as before In the example, the 'terminal can be in the presence of a sector' # Resume the message sent in the beacon by three consecutive symbols. As shown above, the 〇7 terminal unit 11 recovers the signals transmitted in the two sectors by five consecutive signals. In the κ example, the symbol period 4〇2, 406 or 41 is available for transmitting the beacon symbol. Where the number of subcarriers is less than 412, this example code can be used. Another example of what will be referred to hereinafter as "beacon code Β" is a Lie Solomon code designed to transmit beacons using 47 sub-cuts (for example, In the subcarrier of symbol period 402, "= 47." As in the previous example, a 12-bit beacon code (for example) may require support for 4096 different sequences to facilitate this situation, with an index 牟Op A,% The beacon symbol is transmitted on the subcarrier, and the index can be expressed as: Ά, α2, α3) =: household "' 十夕丨," / 十〆三尸γ, • where Pl can be a domain (which can include 47 The primitives representing the elements of the subcarriers, h and ~ may be index factors (as described herein) determined at least in part based on the signal. In this example, the operation has been performed on the domain 47, and in an example, the household 1 5, p2 = pf = 4 3 _ ' and 3 Pl 39 ' other original elements are also available for the household 1. For example, 126234.doc -35- 200838234 Λ = household 1 and household 3 = A choice for Chu Chu in the above special formula leads to Li De Solo, α!, illusion and ~ can be defined as:, door stone horse. 0&lt;^&lt;2,0&lt;heart&lt;46, and 0&lt;heart&lt;46 〇 can be defined by the equation α

", and more than 4096 different combinations of hearts. In terms of, because for Bu 1, 9 q „ 46 Ζ, “3, is =1, the code can be periodic (cycle is 46/2=23 Dance, · W pay), therefore, for given, Α(αΐ,α2,α3) = Α+23(αΐ,^2,α3)0 For example, 'terminal or mobile device can be used by message The three beacons are used to recover this message or beacon code. In an example, the device can respectively: time ', m, and η · shoot three non-binary symbols χ... mountain" binary symbols can be expressed as: 1 X1 = Ρ广1+2ί 十 «十 ' =Ρ:1 +2 (four) ten is, 22 (four) ten eve, 3^2 (four) = aV1+2, a2a» heart and f+2) ten Α, 22 (ί+2) Θ heart" = AV/W ten; 724Ρια&gt;22ί ten hearts or in matrix form :

, , , ι 1 η ’ ρΓ+2/ ) f pr2t Ί Pi2 Pi Pi pl kPi p\ pI&gt; Pi2P22 U, 32. =B Pi2Pi, Ia&gt;32/J 126234.doc -36- 200838234 $, and the element of Ε is the element of the domain. Using this equation, the mobile device or terminal can solve the wide + '« and Qiao 〇 ^ as follows

(rja\+2i \ y\ Less 2 = B^ χι = &lt;X3J, Heart 2/J After this, the terminal or mobile device is available; 7; ^ has the following index Z1 = iogO^/logO!) = % +2r.

Where @= Λ2 Λ2 ΚΡ\ Ρ2 may define a logarithmic operation on virtually any original element of domain Z47, and a given value may be mapped to a specific value of 2. For example, correspondingly, the lookup table can be ^

Apply to equipment or terminals. The index factor β1 and the time index 丨 can be obtained as follows: X % = 5 mod 2, and t = z} div 2 0 can be obtained by substituting the enthalpy obtained as above; 2=妒# to obtain 妒 and then The factor "2" is determined based on 妒 solving α2. Similarly, the factor can be determined by substituting the enthalpy obtained as above to obtain 妒 and then based on #solving 另外. As shown in the previous example, the terminal can be represented by three consecutive symbols in the presence of a sector. Resume the message sent in the beacon. As shown above, the message transmitted in the two sectors can also be recovered by five consecutive signals. For example, this example code can be used where the number of subcarriers available for transmission of the symbol period 402 406 or 410 of the beacon symbol is less than 412. 126234.doc 37- 200838234 In an example, the 'Lie Solomon code β| can compile a sequence of numbers M to a set of non-one-bit numbers in the set {0, 1, 2, ..., 0-1}, where. By not giving the position in the sequence. Here ' Λ = 45, a】=L#/(2 -1)2", A = - l)"m〇d(2 - , and listen to m〇d ((9); P^GF((2)) The original element, therefore, (AMmod0 = 1. As shown in the outer table, the beacon code such as the equation raft, +2ί ηα2+αι+2/ can have three terms ^, μ 1 formed by three original elements, and

K one, # polynomial function. In a general example, the polynomial code can be designed such that the terminal can decode the beacon based on the R beacon symbols, where R-1. For a beacon symbol with a time index r transmitted on a subcarrier with an index "...", the index can be expressed as: No (%, ···, %)=〆州十于邱邱·· Ten pyR Qiu, where ^ can be the original element of the domain Zs, to the number that can be determined based at least in part on the beacon message (four) (as described in the text), § is used to defeat the "Yada ij carrier The number (or the total number of sub-L waves that can be used to transmit the beacon symbol) is divided into the number of springs determined based on the length of the multiplexed 苜彳石民民命 η 〇1 q , ten indicates the modulo addition operation. Also &gt; * , Λ Φ/^2ΐα2+αι+^®..·®ρ^^ι+·+%+^ where Equation 7 can be 0 or 1. ' Domain Zs can include S yuan lucky short q jing 0 to ^!, where sm. Therefore, as described above, the above-described operations of this example can be performed on the domain Zs by the operation of the macro μ, , , , , ^ ^ , such that both 俜 u S are modulo. At least (s-1) R-based I-knife is based on a y-SM, and R&amp;s, 苴 (for example) V is selected as the number of messages supported by the polynomial, and L is a polynomial code 126234 .doc -38- 200838234 The code used in this format can have T, l±f: code can have [

Parameter 9 can be described as g = ^zl L =:: parsing up to "sectors, and L can be the number of cyclic shifts of the code decoded to the same-message. And the exponent factor can be defined as ··&lt;仏And °-a2^-, aR &lt;(S^l) 〇 can be obtained by the above-mentioned linger. The bundle is served by αι to call the total ^ (S-lf-1 different &amp; A to aR each A unique-group corresponds to the non-binary of the beacon... 'should be in a different sequence of messages and therefore... the message can be mapped to the corresponding combination of (X丨 to aR): ^射W = (S- 1) R, m1)X_1+aR. It should be understood that other mappings between the message and the shot, and the combination of the call and the call can be used. (4) The code can be designed to make the terminal ## mark and decode the letter. The ticket, the subcarrier uploading wheel of the ^^(«,,...,called) has a time-corresponding code symbol with index search, which can be expressed as: 幻字Solomon can be a domain The original element of ZS, and for (4) 1 : one can be determined based at least in part on the beacon message;: Guang Bing is the number of subcarriers used to transmit the beacon, and the g factor, S can be 4 as previously described 12 6234.doc -39- 200838234 The parameter β determined by the length of the beacon code and s As shown, the beacon code may have an MDS property with, for example, a minimum number of received beacon symbol decoding messages. Capability. If s subcarriers can be used to transmit beacons, two different symbols can be transmitted using two symbol periods. In this respect, the beacon subcarriers can be interpreted as non-binary letters ZS={〇, 1, The element of ..., s-Ι}. The beacon sequence can also be interpreted as a block code in the heart, where 々 = 2 and the beacon code can be designed to have a cyclic shift. Invariant properties such that cyclic shifts of, for example, codewords can be decoded into the same message. This property may be required for non-synchronized sectors that may transmit beacon symbols simultaneously. In this example, the above is used. One or more of the encoding mechanisms can support Μ, a message if the L cyclic shifts of the codeword are decoded into the same message. For example, for a given value L, the minimum value of s can be selected. Make the number of messages required to be supported, and the number of base (four) carriers can be s L is selected with the choice of diversity. In the case of a given M, more sub-loads can cause longer L 'and smaller B can lead to lower diversity, which can correspond to = in the case of conflicts The ability to distinguish ambiguity from different light beacon sequences. The code can also be designed to facilitate detection of simultaneous transmission of different sectors of the beacon, which can be referred to as disambiguation. |^ , ^ I am exemplified by S, The terminal can receive the beacon codeword from the sector at the same time, i Ω 十八 宁 Q &gt; 1. For example, the sequence from the sector ^ can be expressed as, "(1), ..., from The sequence of sector 2 can be ^(〇), χ2(ΐ), ..., etc., and the sequence in which central white J is X from sector Q can be represented as Q 'XQ '''. For example, the 'beacon code can make the terminal not obtain the sequence of decoding in the form of 126234.doc 200838234 {~(0), ~(1), XS3(2), ...} where S1, S2 and S3 are different sectors. . In the example, the beacon sequence from the Q different sectors using the beacons A' defined above can be disambiguated by calling a symbol, where is called. Therefore, at the beacon code length L = H), up to 9 feather zones can be ambiguous. Using the beacon code B, the beacons from the q sectors can be disambiguated by 2Q+1 beacons, where (2Q+i)n. In this respect, where L = 23, at most n sectors can be disambiguated.

C c should understand that other MDS mechanisms can also be utilized, such as clearing (Γ二伽(10) code, which is designed such that a terminal or device can decode a beacon based on only one 付' payout. It should be understood that For example, this article refers to:: many factors such as network planning, information about other sectors or 'learning', and the performance of the beacon based on the length of the beacon message, the available carrier (eg ' The beacon code is selected according to the signal-to-noise ratio. The township is shown in Figure 5. The bandwidth is not expressed in the time period. The bandwidth can have a number of symbol clusters 5, 2, 5 and 4 of the synchronization signal measurement. 506. Clusters 502, 504, another t^^, 〇4 and 506 may represent periods in the bandwidth of the transmitted beacon symbol. As shown, the clusters are transmitted together with a period of time between days and days during the working time. For the case of - or (4) 'cluster transmission, the time period between 5 and 8 can be ice. In addition, -: Tang is the part of the repeated synchronization #. For example, the cluster shown can be bi-ring , where 502 is the _ cluster to be transmitted, 504 is the second plex / at 506 Each cluster 502 (and 504 and 506, although not referenced) in the "cluster" of the beta cluster loop may contain four beacons 5ΐ〇, 512, 126234 in cluster 502. Doc -41 - 200838234 5 14 and 5 16 and 3 low PSD symbols (such as pseudo-random miscellaneous sequences) 518, 520 and 522 between the beacon symbols used to separate high power spectrum poorly generated (PSD) beacons. In this example, the synchronization loop may comprise (iv) a cluster such that, for example, 502 is a cluster 丨, 5 〇 4 is a cluster 2, and 506 represents a cluster 16. In an example, the spectrum may be 2 〇 MHz, such that The transmit beacon can be adjusted by using 4 η ο a certain spacing (10) of a predetermined carrier frequency with 2048 carrier frequency modulation or subcarriers. Synchronization = can: Send a 22-bit synchronization metric, which can be divided into three bytes No, 々, and 4 bits can be used with the (64,3) code in the domain (gf) of 257 elements to encode three bytes, which can increase information transmission. Reliability, resistance to various types of ambiguity and the nature of the above described as described above. According to the above configuration - examples, Li The Solomon code can be used to encode a beacon in the GF(257) field, because the codeword length (4) is divided into 256. To map the beacon message to the codeword, the original number of the caller can be selected and set. This is because the ice can be checked to determine if w has an order of 64 by solving in GF(257). For example, the component of the GFT domain in the Fourier transform (GFT) domain can be {仏=.,," Refers to 7Γ and can put the synchronization of poor 〆, household, 2, Cl in Cl, [2 and q and other bytes can be zero. Subsequently, the GFT domain component can be transformed by Gahos Fourier transform Convert to codeword (4),, w ·· 63 64 7=0 For example, PiC can use any mapping program on f quality to generate the generated code 126234.doc -42- 200838234 = to the trimming tone, so that the receiving The device can demap the carrier frequency from the code. For example, the possible mechanism is a linear mapping, so that in (10), the rim is uploaded. '’’’ the spacing between them. Knowing that the carrier frequency is used for legal carrier frequency modulation, the code can be used to obtain the decoding, analysis frequency and/or time offset of the desired beacon defined in this paper, and the conflict resolution is exemplified by Lu, (Ling Solo Solomon code (for example) , gf continuous zero Li Solomon code) can have an MDS, of which the most signed ^, effective, non-zero code words have no more than W zero. Connect / two (four) code words as a total or W consecutive code Fu 2 and = 2 (due to the linearity of Li De (4) code, which can also be a code word) &quot; greater than 匕1 zero-sum quality contradiction. Therefore, as long as it is still = solid_solid = continuous coding symbol, If the symbol is correctly made, then the correct codeword is served. In the case of synchronization measurement, if a cluster that satisfies the valid decodability has been received, the receiver can decode the message β in this respect. Analyze multi-directional access point (or base station) ambiguity. For example, if (for example, (Μ) receives (6)) M+1 consecutive codes (4), then _ different sequences can be distinguished. Because the sequence may be Contains "solid and above symbols from - base stations or other transmitters, Therefore, the MDS quality can be used to eliminate the ambiguity. In the configuration of the foregoing example, therefore, if 16 consecutive clusters are received, the encoding "1^77 31 base stations with different synchronization metrics, access can be used. Point or other 1 shot, and, in other instances, other values of 11 and k can be used. Also 'in the anger of one or more clusters and the position within the entire codeword is 126234.doc -43 - 200838234 ^ Time ': $ decoupling offset ambiguity. Root (4) in the finite field of the 2nd shift can wait for 9 to shift the g-scale cluster. Then 'Ul 1 = moddl6) and ί = _ 2 16 f All z=0,...,63) (time shifting property). In the example of using the previous argument 疋 synchronization code 'because not only has 4 bits, but also varies from 0 to !5 'So not all codewords are used to indicate. For example, 'the offsetted message can be received ('Μ); according to the time shift property, ~, or equivalent place name...6, where, can be. Since the correct time offset can be determined, it can be judged that (four) the remaining two bytes &amp; and the entire codeword is divided into four parts in this respect, and In the quotient space (_plus space), the message is transmitted. In addition, in the example, the frequency shift ambiguity can be corrected by the spacing between the legal carrier frequency adjustments. If the frequency shift is sufficiently large, it can be changed. Mazi c63) to (¥△々+△,.., C63+A)' where △, the rate shifts by △. The GFT of the sequence (△, △, ..., △) is equal to L which is not the code word Ϊ1^7一,〇,···,1, because it is in the selected Lee Solomon code (: 〇 is equal to zero. Since the sequence (△, △, ..., △) is not a codeword, this may imply (¥△, ¥△, ..., ~+△) is also not a codeword; therefore, Δ can be detected to recover the original codeword to resolve the frequency offset ambiguity. However, in the example, the detection of Δ can be time consuming, and therefore, an efficient algorithm can be utilized to find Δ. The inverse GFT equation used to establish the Lie Solomon codeword as mentioned may be c(=J_|^_,c

7 ' has T {d=〇,...," can be a component in the SGFT domain and can be a pixel with an order of 126234.doc -44- 200838234. In the matrix form, the equation can be given, and the equation can be The transformation matrix '巧=2^. In the (4) domain, if the last _ component is not always zero (for example, it contains data or other information), then the matrix form equation can be given by h, given, where 々 is from the matrix The last constructed π X-free matrix, and S is the moxibustion vector containing the last moxibustion element in G. Example • For example, when the frequency offset exists in the received symbol (which can indicate the need. The sequence can be given by: where Ϊ is a - row vector, and its elements are all !. It should be understood that the subspace Ω traversed by the codeword has a size (1) that does not fall within (4). Therefore, it can be determined that it is orthogonal to ω. Vector ν- not orthogonal to Ϊ. It should be additionally understood that, for example, this vector can be calculated offline... or stored in memory. By multiplying the sides of the above matrix equation by 〆 on both sides, The estimation of △ can be estimated as · 〇 (4) This formula can effectively generate frequency offset 'this system Since the numerator and denominator will be obtained offline, only the inner product is needed. Now turn to Figure 6 to show the multi-cell layout in the wireless communication network. The network can include - or multiple transmission carriers or multiple base stations. 602; for example 'as shown' each base station may have 3 sectors, each of which may be assigned - a particular carrier. In this figure, for example, the carrier uses a different carrier The sectors are adjacent to mitigate interference on the carrier. For example, this can be referred to as frequency use with a factor of 3. 126234.doc -45- 200838234 The frequency can be reused or the frequency of t is no longer configured In the case of January, the network is transmitted. For example, the base station 6 pays the number, or more than one carrier can transmit this symbol. In addition, the capital is used to: establish the beacon and data by using the configuration. Some possible combinations of carrier usage. The name ^ . r , material and / section can transmit both the capital and the U pay number on the H wave. This can reduce the extra cost for beacon symbols because the preferred carrier can be used for both beacons and data. In another example, the beacon symbol can be transmitted on a single carrier and transmitted on a single carrier. The secondary transmission allows the device to detect beacons on different carriers without interfering with the beacon carrier. Current communication. In addition, since the data transmission is not interrupted to allow beacon transmission, in one example, the beacon symbol can be given a high power to the bus (e.g., facilitating pilot detection of out-of-band devices). It will be appreciated that: configuration is also possible, such as the conversion of the above configuration and the use of more than one of the available sectors for transmission.

C As previously described, a beacon codeword can be transmitted to a plurality of mobile devices with information about the beacon or its transmitter (or substantially any information). In an example, the beacon codeword can be a 12-bit code comprising 9 bits for the sector identifier or pilot PN, 2 bits for the preferred carrier index in the range G_3, and - Reserved bits. It should be understood that there may be an infinite likelihood of the size and content of the beacon message; this is only one example of facilitating further discussion. In an example, base station 602 can transmit a similar or unique beacon message to allow the mobile device to identify the beacon message. The base station 6〇2 can utilize the aforementioned encoding mechanism to achieve the desired properties of effective decoding, analytical ambiguity, and the like. Also, the mobile device (not shown) that receives the symbol can have the functionality of the interpreted symbol accordingly. 126234.doc -46- 200838234 Referring to Figures 7 to 8, #日日明 t &quot; about the method of broadcasting and decomposing ##标符 according to the beacon coding mechanism. Road &amp;&amp;&amp;&&amp;&, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , The order differs from the order shown and described herein and/or occurs in the same way as the other, so the method is not limited by the order of actions. For example, + a , ° ^ learners of this technology should understand and understand that the law can be expressed in a series of related states or events (such as in Figure 1). In addition, methods in accordance with one or more embodiments may not be required. Actions ^ Ο ^ ^ Figure 7 is illustrated to facilitate the encoding and transmission of beacons based on machines having their own raw shells (eg, 'effective local beacon decoding, ambiguity, shift resolution, etc.) as described herein: method·. At the withdrawal, the beacon 'initial' is exemplified, and the beacon message may contain information about the beacon, its transmitter: substantially any information to be transmitted by the beacon. The message may have a fixed, y and size. For example, according to a possible example described herein, the beacon can be a 12-bit or 22-bit synchronization metric. At 7.4, the beacon message can be encoded into a plurality of symbols using encoding mechanisms such as those described herein. The encoding includes beacon code A, beacon code A, (4) code B, beacon Code Lee Solomon's beacon code, synchronization metric, and/or it has variations in any variable value as described in the general example. Number 2 may be an OFDM symbol of some period within one or more of the frames of the supersonic; during the symbol period, a beacon = number may be uploaded on a subcarrier corresponding to the established symbol. In this regard, the selected subcarrier can indicate the beacon of the beacon. In an example, the beacon symbol can be a unique symbol in the -carrier uploading round during the specified symbol period 126234.doc • 47-200838234. At a plurality of bandwidths, such as transform domain &lt;, the symbols are mapped 708, for example, at - or a plurality of different time/symbol = target transmissions. The carrier tone is transmitted in the sequence of the sequence. In an example, the :: mid-range can be used in the full power of the mode carrier. 〃 (4) The transmission (for example) can be done in a distant place, and the second and second 收 are collected and exhausted by a plurality of beacon symbols: (10) The payment may be part of the message as part of the encoding mechanism as previously described. The encoding mechanism includes beacon code A, letter = code A, (4) code B, beacon code B, and Li De Solomon. The beacon code, synchronization metric, and/or it has substantially any change in the variable value as described in the general example. In this regard, the beacon may have the desired properties specified above, including local beacon decoding, ambiguous beacon resolution, time and/or frequency offset analysis, and the like. At 802, a minimum number of U no symbols for decoding the beacon can be received. As noted, in some cases, this may be a number of signals that are significantly less than the number in the entire beacon codeword. In addition, symbols can be received in certain time periods, continuously, randomly, and the like. At 804, using the nature of the beacon code as explained above, zero or more additional symbols in the message can be predicted to complete the beacon message. This prediction can utilize the minimum number of symbols as described above to satisfy linear constraints on the domain of the symbol. After the constraints are satisfied, the remaining symbols are determined to form a complete beacon message. At 806, for example, the beacon message can be decoded and interpreted to obtain information about the beacon and/or its transmitter. It should be appreciated that the method can also be used to correct the frequency or time of the offset and/or to resolve the ambiguous beacon 126234.doc -48-200838234 symbol being transmitted. =================================================================================== As used herein, the term &quot;inference&quot; generally refers to the process of reasoning or inferring the state of a system, ring, or user based on a set of observations obtained from events and/or materials. For example, inference can be used to identify a particular situation or action, or can generate a probability distribution over several states. - Probabilistic, that is, based on the consideration of data and events, the probability distribution in the state of interest. Inference can also refer to techniques used to compose higher-level events based on -= events and/or data. Regardless of whether the event is closely related in %, and regardless of whether the event and the data are from a source or a source of information and a source of information, the inference is based on a set of observed events and/or stored events. The construction of a new event or action. The example 'presented above' or a plurality of methods may include making an inference regarding the selection of one or more symbol subcarriers for transmission of beacon symbols. Inferences about the collected information about other entities transmitting beacon symbols (which are obtained by inferred entities or other entities moving around the transmission area) may be made by way of further steps. It is to be understood that the foregoing examples are illustrative in nature and are not intended to limit the number of inferred embodiments or the manner in which the various embodiments and/or methods described herein. 9 is an illustration of a mobile device 900 that facilitates receiving beacon symbols that may indicate information (such as beacon messages) on a plurality of subcarriers (e.g., for a hyperframe in an ugly communication network). Action Injury 9 includes a receiver 9〇2 from 126234.doc -49- 200838234 (for example) receiving an antenna (not shown) to receive a signal, and performs typical actions on the received signal (eg, chopping, Amplify, downconvert, etc.) and digitize the conditioned signal to obtain a sample. The receiving H 902 may be, for example, an MMSE receiving benefit, and may include a demodulation transformer 9〇4 that demodulates the received symbol and provides it to the processing (4) 6 for channel estimation. The processor 〇6 may be a processor dedicated to analyzing information received by the receiver 902 and/or generating information transmitted by the transmitter 916; a processor controlling the mobile device 9 or a plurality of components; And/or a processor that analyzes the poorness received by the receiver, generates information transmitted by the transmitter 916, and controls both the mobile device or components. The mobile device 900 can additionally include a memory gauge that operates (4) to 7 906' and can store data to be transmitted, received data, information about the channel, associated with the analyzed signal, and/or interference strength. "By", "associated channel, power, rate, or the like", and (iv) other suitable information for estimating the channel and (iv) (iv) communicating. The memory deletion may additionally store agreements and/or algorithms associated with estimating and/or channeling (e.g., based on aging, based on accommodating, etc.). In addition, including the decoding of the beacon and its symbols as described herein and the "minimum or mandatory instruction of the total number of symbols in the 4 private. The number of symbols to determine the beacon should be understood" as described in the data storage described herein. (For example, the memory 9 may be a volatile memory or a non-volatile memory, or may include both a kneaded body and a volatile memory. By means of non-limiting, non-volatile, non-volatile (ROM) ), can be programmed 126234.doc -50 · 200838234 ROM (PROM), electrically programmable ROM (EPROM), electrically erasable PROM (EEPROM) or flash memory. Volatile memory can include acting as external cache Memory Random Access Memory (RAM). By way of illustration and not limitation, there are many forms of RAM, such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM ( DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM) and Direct

Rambus RAM (DRRAM). The memory of the system and method of the present invention is intended to include, without limitation, such and any other suitable type of memory. Receiver 902 is further operatively coupled to beacon symbol decoder 91, which can decode and/or evaluate beacon symbols received over the bandwidth to determine that elements can be associated with a domain Subcarrier index, which is the subcarrier with respect to the bandwidth. For example, a subcarrier index can be transmitted to the beacon parser 912 where the least number of other subcarrier indices (eg, symbols in the beacon code subset) are received with respect to the beacon. ) After that. The t-pay parser 9丨2 can determine the overall beacon symbol sequence of the beacon message, and transcode the beacon message to obtain information about the beacon and/or the ejector. The minimum number of symbols that need to be received can be defined by the encoding mechanism presented above. Additionally, as described with reference to previous figures and examples, beacon resolution 912 may resolve ambiguities in the beacon after receiving a number of symbols. The solution 912 can process (4) :: time and/or frequency offset using the algorithm shown above. The mobile device _ further-step includes a modulator 914 and a transmitter 91 into a certain place A, physics. The 916 can be directed to (for example) soil. In addition, the device transmits a communication signal, etc. In an example, 126234.doc -51- 200838234 can send the decoded beacon symbol back to the temple ^ ^ ^ heart should. Although depicted as being separate from process 906, it should be understood that the letter zen 旎 旎 decoder 91 〇, beacon parser 912, and/or modulator 914 may be part of processing smashing &lt; Or several processors (not shown). Figure 10 is an illustration of a system 1000 for facilitating the transmission of - or a plurality of beacon symbols in a furnace message of a table (four) flag message on a subcarrier. For example, η ο system deletion can operate in an OFDM communication network in which the beacon symbol is transmitted with one or substantially one subcarrier. The system chest includes a base station (example &gt; access point) having a receiver 1G10 (and - can receive signals) via a plurality of receiving antennas or a plurality of mobile devices A demodulation transformer (8) 2) that demodulates the signals and a transmitter that transmits to one or more mobile devices via a transmission antenna for transmission. For example, the transmitter chest can transmit one or more beacon symbols for the base station. The beacon symbol identifies information about the base station _ and / or one or more of its sectors. For example, a beacon symbol can be used to identify a land 1002 and/or a sector 'in addition'. In one example, the beacon symbol I is a portion of a beacon message that traverses a plurality of beacon symbols. For example, the beacon symbol can be modulated by the modulator 1 22 into the frequency domain and transmitted by the transmitter 1 〇 24 using one or more transmitter antennas 1 〇〇 8. The bullish and w base station may utilize the beacon encoder 1 〇 18 to apply an encoding mechanism to the beacon message (such as beacon code A, beacon code a, letter, as described herein in a particular or general implementation). Code B, beacon code B, Li Solomon horse synchronization and/or substantially any code). As described, the substantial, flat-horse mechanism can be used. The coding mechanism satisfies the local symbol interpretation, meaning, by establishing a linear approximation on the carrier of the carrier 126234.doc -52-200838234 carrier. To resolve the desired nature of time and/or frequency cues, early shifts, and their analogs, the linear constraint must be satisfied by the beacon message and the carrier position.庐 = coder 1 〇 18 may generate a plurality of subcarrier indices of various symbols to facilitate the second message, and the beacon symbol assigner lion may correctly assign beacon symbols to the subcarrier and/or 疋 temple periods. The transmitter 1 〇 24 may delete the broadcast beacon symbol to one or more mobile devices after using the modulator i like the modem number. As described, the mobile device (10) 4 can apply the decoding algorithm presented herein to the subset of the total number of beacons in the code to effectively interpret the beacon information. In addition, the beacon code of the base station 1002 can be transmitted periodically as a repeat sequence and/or can be an infinite or single sequence. In an example, the symbol sequence of the beacon codeword can also be dynamic. Additionally or alternatively, some or all of beacon encoder 1018 and beacon symbol assigner 1020 may reside in or be implemented by processor 1〇14. Additionally, memory 1 〇 16 may contain instructions to facilitate the aforementioned functionality. In addition, memory 1 〇 16 may also contain information about symbol periods and/or subcarriers used in transmitting beacon symbols. Figure 11 shows an example wireless communication system 11 。. For the sake of simplicity, the wireless communication system 11 depicts a base station 111 and a mobile device i i 5〇. However, it should be appreciated that system 1100 can include more than one base station and/or more than one mobile device, wherein the additional base station and/or mobile device can be substantially similar or different than the example base station 1 1 1 0 and Mobile device 1150. In addition, it should be understood that the base station 1110 and/or the mobile device U5 can use the system described herein (Figs. 1 to 3 and Figs. 9 to 10), technology/configuration 126234.doc -53 - 200838234 (Fig. 4 to 6) and/or methods (Figs. 7-8) to facilitate wireless communication between the base station 1 and the mobile device 1150. At the base station 1110, traffic data for a number of data streams is provided from the data source 1112 to the transport (τχ) data processor 1114. According to an example, each data stream can be transmitted on a respective antenna. The data processor 1114 formats, encodes, and interleaves the data stream based on a particular encoding mechanism for the traffic stream selection to provide encoded data. The coded data of each data stream can be multiplexed with the pilot data using orthogonal frequency division multiplexing (OFDM). Additionally or alternatively, the pilot symbols may be frequency division multiplexed (FDM), time division multiplexed (TDM), or code division multiplexed (CDM). The pilot beaker is typically a known data pattern that is processed in a known manner and that can be used at the mobile device 115〇 to estimate channel response. The multiplexed pilot and coded data for each data stream may be based on a particular modulation mechanism selected for that data stream (eg, 'primary phase shift keying (BPSK), quadrature phase shift keying (qpsk), Μ phase Shift keying (M_PSK), 振幅 four amplitude modulation (M_QAM), etc., and modulation (eg 'symbol mapping') to provide modulation symbols. The data rate, encoding, and modulation of each data stream can be determined by instructions executed or provided by processor 1130. The modulation symbol of the lean stream can be provided to the processor 1120, which can further process the modulation symbols (e.g., for 〇FDm). χ χ 理 理 理 理 理 理 理 120 120 120 120 120 120 120 120 120 1 1 1 1 1 1 1 1 120 1 1 1 120 1 。 。 。 。 。 In various embodiments, the processor 1120 applies beamforming weighting to the symbol of the data μ and to the antenna from which the symbol is being transmitted. 126234.doc -54- 200838234 Each transmitter 1122 receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (eg, amplifies, filters, and upconverts) analog signals to provide for use in The modulated signal transmitted on the channel. In addition, horse modulated signals from transmitters 1122a through 1122t are transmitted from % antennas 1124a through 1124t, respectively. The transmitted modulated signals are received by the horse antennas 11 52a through 11 52r at action 1150 and the received signals are provided from each antenna 1152 to respective receivers (RCVR) 1154a through 1154r. Each receiver 1154 conditions (eg, filters, amplifies, and downconverts) the respective signals, digitizes the conditioned signals to provide samples, and further processes the samples to provide a corresponding, received "symbol stream." RX Data Processor 11 60 may receive and process the received symbol streams from the W receivers 1154 based on a particular receiver processing technique to provide AVi's 'detected,' symbol stream. The Rx data processor 116 may resolve Modulating, deinterlacing and decoding each detected symbol stream to recover the data stream of the data stream. The processing of the RX data processor 116 is performed by the processing unit 1120 and the TX data processor ι 114 at the base station The processing is complementary. As described above, the processor 周期性7〇 can periodically determine which precoding matrix to use. In addition, the processor 1170 can formulate a reverse link message including a matrix index portion and a rank value portion. The reverse link message may contain various types of information about the communication link and/or received data. The reverse link message may be received by the TX data processor 1138 (which also receives a number of resources from the source 1136). The traffic information of the stream is processed by the week 1 meal for the uso modulation, adjusted by the transmitter 1154 &amp; to 115 and transmitted back to the base station 111 by the 126234.doc -55-200838234. At the base station 1110, The modulated signal from mobile device 1150 is received by antenna 1124, regulated by receiver U22, demodulated by demodulation transformer 1140 and processed by RX data processor 1142 to retrieve the reverse chain transmitted by mobile device 1150. In addition, the processor 1130 can process the retrieved message to determine which precoding matrix is used to determine the beamforming weight.

The processors 1130 and 1170 can direct (e.g., control, coordinate, manage, etc.) operations at the base station 1110 and the mobile device 115, respectively. Individual processors 1130 and 1170 can be associated with memory 1132 and 1172 that store code and data. The processors 1130&amp; U7 may also perform computations to derive the frequency and impulse response estimates for the uplink and downlink, respectively. It should be understood that the embodiments described herein can be implemented in hardware, software, toughs, intermediates, microcode, or any combination thereof. For hardware implementations, processing can be implemented in one or more special application integrated circuits (asic), digital signal processors (DSPs), digital signal processing devices (DspD), and programmable logic devices (PLDs). Field Programmable Gate Array (FpGA), processor, controller, micro, micro-processing H, other electronic units designed to perform the functions described herein, or a combination thereof. == It can be stored in any combination of machine readable media such as health care components, child, private, program, constant ^ ^, cheek or instruction, data structure or secret haiku. Can be expected, bowed I4, courier and/or receive information, capital; &gt; number or memory content and couple Cheng Liumin, % code segment to another 126234.doc -56- 200838234 code segment or hardware circuit Transfer, transfer or transfer information, arguments, parameters, data, etc., using any suitable means including memory sharing, messaging, delivery, network 僖 yr / A. For software implementations, the techniques described herein can be implemented by modules that perform the functions described herein (eg, programs, functions, etc.). The software code can be stored in the memory unit and executed by the imaginary and processing states. The memory unit can be implemented inside the processor or imaginaryly externally, and in the case where the memory unit is implemented outside the processor, the body 70 can be passed through various components known in the art. The communication ground is coupled to the processor. Referring to Figure 12', illustrated as a system 12, broadcasts an encoded index symbol that satisfies linear constraints on the domain of several available subcarriers for the transmission of the standard. For example, system (4) may reside at least partially in a base station. It should be appreciated that system 1200 is represented as including functional blocks, which may be represented by a processor, software, or a combination thereof (eg, a Least). The functional block of the culprits. System i includes a logical group 12G2 that can cooperate with the electrical components. For example, the logical group Cong can include an electrical component 12〇4 for initializing the U code. For example, a beacon codeword can contain information about the communication entity and/or communication with the transmission entity. As previously stated, the example = &amp; § § code word can be 12-bit code and / or 22 bits in two instances: synchronous latitude. It should be understood that the beacon code may also be substantially any data set 1 Additionally, the logical group 1202 may include an electrical component 12G6 for encoding the beacon code into a plurality of beacon symbols according to an encoding mechanism, according to less than or The symbolic part of the total number of equalizers solves the coding mechanism. In an example, the subcarrier position of the transmission payout may indicate a linear constraint that can be satisfied with respect to the domain of the total number of subcarriers 126234.doc 200838234 (e.g., it may be a prime number). Using this poor message, the beacon code can be determined by solving linear constraints after receiving a few symbols. Additionally, logical group 12〇2 can include an electrical component for transmitting beacon symbols on respective subcarriers in a periodic time slot. The receiving device can utilize the subcarrier position to determine the remaining symbols that are still not received by the ## symbol codeword to facilitate efficient decoding of the beacon codeword. Additionally, system 1200 can include a memory 121 that holds instructions for executing functions associated with electrical components 1204, 1206, and 1208. Although shown external to memory 1210, it should be understood that one or more of electrical components 1204, 1206, and 1208 may be present within memory 121A. Turning to Fig. 13, illustrated is a system 接收3〇〇 that receives a plurality of encoded signal symbols and determines a beacon codeword based on the portion of the received symbol. For example, the system 1300 can reside within the mobile device. As depicted, system η (10) includes functional blocks that may represent functions implemented by a processor, software, or a combination thereof (e.g., firmware). System 13A includes a logical grouping 1302 of electrical components that facilitate receiving and decoding beacon symbols. Logical group 13〇2 may include an electrical component 1304 for receiving a plurality of beacons of a single beacon message that is less than the total number of beacon symbols in the message. As will be described, an incomplete set of beacon symbols can be used to determine the remaining symbols in the message; the number of symbols required can vary, in part, based on the number of exponential terms in the polynomial equation for the beacon message. Further &apos;logical group 13〇2 may include an electrical component 1306 for satisfying linear constraints on one of the total number of available subcarriers for the beacon message based on the received carrier position of the beacon symbol. As described, the beacon message can be encoded to produce the available subcarriers in accordance with the flat code mechanism presented herein 126234.doc -58 - 200838234

A linearly constrained beacon symbol on the domain. The beacon symbol receiver can use this information in this regard to solve for linear constraints such that the remainder of the beacon message is deterministic. Thus, logical grouping 1302 can include an electrical component 丨3〇8 for determining remaining symbols in the beacon message based on linear constraints. Determining the beacon message allows the message to be decoded to identify the information contained therein. Additionally, system 1300 can include a memory 131 that holds instructions for performing functions associated with electrical components 1304, 1306, and 1308. Although shown external to memory 1310, it should be understood that electrical components 13〇4, 13〇6, and 1308 may be present within memory 1310. The above description includes examples of one or more embodiments. Of course, it is not possible to describe every possible component or method for the purpose of describing the foregoing embodiments, and one skilled in the art will recognize that many further combinations and permutations of various embodiments are possible. of. Accordingly, the described embodiments are intended to embrace all such changes, modifications and changes in the spirit and scope of the invention. Further, the term "comprising" is used in the context of the [embodiment] or the scope of the patent application, and the term is intended to be similar to the term, including, in the manner in which the term "transition" is used in the application of the π patent|&amp; For inclusion. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is an illustration of an example communication device for use in a wireless communication system in accordance with various aspects described herein. Example of Encoded Beacon Symbols Wireless Figure 2 is an illustration of a communication system implemented by an encoding mechanism in a wireless communication environment. 126234.doc -59- 200838234 Figure 4 is an illustration of the example hyperframe and symbol period used in the wireless communication system. The figure is an illustration of an example cluster k-symbol period utilized in a wireless communication system with respect to synchronization metrics. 6 is an illustration of an example wireless communication network. An example of a beacon message Figure 7 is an illustration of a coding method that facilitates the transmission using an encoding mechanism. Ο Figure 8 is an illustration of an example method of facilitating reception of encoded beacon symbols to decode beacon messages. The figure is an illustration of an example operating device that facilitates receiving beacon symbols across different beacon subcarriers. Figure 10 is an illustration of a beaconing scheme that facilitates the encoding of a broadcast using an encoding mechanism. Bay J Spear, =: Description of the use of the (4) system and method described in this article ..., line,,, and road environment. Figure 12 is a diagram of an example system for transmitting beacon symbols of encoded beacons. 2: Retrieving an incomplete set of encoded beacon symbols for use in the description of the example system of the message. 100 Wireless communication system first 102 Base station 104 Antenna 106 Antenna 126234.doc -60- 200838234 108 Antenna 110 Antenna 112 Antenna 114 Antenna 116 Mobile device 118 Forward link 120 Reverse link 122 Mobile device 124 Forward link 126 Reverse link 200 communication device 204 beacon encoder 206 transmitter 300 wireless communication system 302 base station 304 mobile device 306 timer 308 beacon encoder 310 transmitter 312 timer 314 beacon decoder 316 receiver 400 time Period 402 symbol period 126234.doc -61 - 200838234 Γ

404 Beacon Symbol/Subcarrier 406 Symbol Period 408 Beacon Symbol/Subcarrier 410 Symbol Period 412 Beacon Symbol/Subcarrier 414 Hyperframe 500 Time Period 502 Symbol Cluster/First Cluster 504 Symbol Cluster/Second Cluster 506 Symbol Cluster/nth cluster 508 intermediate/intermediate cluster transmission 510 beacon symbol 512 beacon symbol 514 beacon symbol 516 beacon symbol 518 low PSD OFDM symbol 520 low PSD OFDM symbol 522 low PSD OFDM symbol 600 multi-cell layout 602 base station 700 Method 800 Method 900 Mobile Device 902 Receiver 126234.doc -62 - 200838234 904 Demodulation Transformer 906 Processor 908 Memory 910 Beacon Symbol Decoder 912 Beacon Parser / Beacon Symbol Parser. 914 Modulator 916 Transmitter 1000 System f 1002 Base Station 1004 Mobile Device 1006 Receive Antenna 1008 Transmitter Antenna 1010 Receiver 1012 Demodulation Transformer 1014 Processor 1016 ί Memory 1018 Beacon Encoder 1020 Beacon Symbol Assigner 1022 Modulator 1024 Transmit 1100 wireless communication system 1110 base station 1112 data source 1114 transmission ( Χ) Data Processor 126234.doc •63- 200838234 1120 TX ΜΙΜΟProcessor 1122a~1122t Transmitter (TMTR)/Receiver 1124a~1124t Antenna 1130 Processor 1132 Memory 1136 Data Source 1138 TX Data Processor 1140 Demodulation 1142 RX Data Processor 1150 Mobile Devices 1152a~1152r Antennas 1154a~1154r Transmitter 1160 RX Data Processor 1170 Processor 1172 Memory 1180 Modulator 1200 System 1202 Logical Group 1204 Electrical Component 1206 Electrical Component 1208 Electrical Component 1210 Memory Body 1300 System 1302 Logical Group 126234.doc -64- 200838234 1304 Electrical Component 1306 Electrical Component 1308 Electrical Component 1310 Memory Γ: 126234.doc -65-

Claims (1)

200838234 X. Patent application scope: A method for facilitating transmission-beacon message as a plurality of beacon symbols, comprising: ==Ma# The standard message is a plurality of beacon symbols, such that the beacon is less than the beacon 旒~, The number of symbols can be utilized to determine the remaining symbols of the beacon message; and the period of the symbol, μ*, is transmitted over the respective subcarriers for the plurality of beacon payouts. 2. In the case of the method of claim 1, the i俨俨 俨俨 lL y ^ Τ β仏铋 message contains information about at least one of the transmission bases 3. the base station of the transmission base station. The method of 8^ ΓΜί! 1 wherein the beacon message is encoded using a maximum distance division (MDS) code. 4. In the method of requesting the item, the p_ 八干 is further encoded by the sputum, so that the number of symbols smaller than the number of the oil ν 唬 唬 of the beacon message can be used to eliminate the letter. The ambiguity between the message and the conflict. 5. If the method of claim 1 is used, the 彳 彳 彳 彳 俨 丨 丨 丨 丨 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 进一步 进一步 进一步 进一步A number of symbols can be utilized and/or processed for a time or frequency offset. 6. If the method of claim 1 is straightforward, the code is coughed...:: “The use of the polynomial code contains at least the exponential term. 7. If the method of claim 6 is used, The code is given by: 尤(%···,%)=〆州十于_十··十沪+切― where R is the number of exponential terms, R, the value 钤18 is corresponding to the available The S elements of the S subcarriers transmitted by the rod are used for " &lt; original element, where 126234.doc 200838234, ... to ~ is the index factor determined based on the beacon message, the length of the polynomial code in 5H and s A parameter of the judgment is indicated by 孓(~..·,%),? One of the beacon symbols is transmitted in one subcarrier, and the ten fingers are added. The method of claim 6, wherein the polynomial code comprises two exponential terms and the beacon message is decodable based on two of the plurality of beacon symbols. T 9. The method of claim 8, wherein the two exponential terms are formed by two primitives of a domain z, the domain An having 211 elements corresponding to available subcarriers. 10. The method of claim 9, wherein the polynomial code is given by: = /^, +21' ten is +«, +21, wherein the normal and h are the original elements of the domain Z2, 4 And 〇 2 is an index factor based on the beacon message decision, a shirt, a "2) indication - a subcarrier for transmitting one of the beacon symbols in the symbol period, and an indication of the addition of the modulo 211: 11 · If requested The method of item 6, wherein the polynomial code is a second Lie Solomon code given by: = 9 ten Of ten... ten p strict which one of the original elements of the domain zs, the domain Zs having S corresponding to the beacon transmission The S elements of the subcarrier, for w=2, R, , ~ to the index factor determined based at least in part on the beacon message, Ah, . . . , %) indicating that one is used to transmit in the symbol period, The subcarrier index of the beacon symbol, 7 is based on the length of the beacon code and the S decision Z 126234.doc 200838234 one parameter, and ten indicates the modulo addition operation, and where = ΡΓ 'causes the Lee Solomon code. 2,. ..,r ' 12. As requested, where S=2U, P2 = P, 2=16〇, P21 Α=207 and 13. The method of claim 6, wherein the plurality of and the beacon message are capable of decoding three beacons C of I 4#_ based on the complex two: index term 'symbols 14. The method of item 13, wherein the three acknowledgments are formed by two original elements of the domain ζ 47, and the field Ζ 47 has 47 elements corresponding to the subcarriers available for the port. The method of claim 14 wherein the polynomial code is given by: A (%, &lt;22, (23) = 丨10 pf 丨 +2' 〆3+α丨+2/, the center of the Ρ3 is the original element of the domain Ζ47, 〇1, and the index factor determined by the beacon message,;...Turkish, Tian# ^Day is used to send one of the beacon symbols in the payment period ί Load method. 1 ^Do not add 16·If the method of claim 6 is #, where the polynomial code is the following formula: Ζ/α”%,%) = ρΓ+2/ 十 ΡΓ2Ρ22/ 十〆 3Ρ32/, where Α is one of the original elements of the domain 47' This field 47 has 47 elements corresponding to 47 subcarriers available for beacon transmission, and the heart is based on The index factor of the message determination, a Λαι,α2,%) indicates a subcarrier used to transmit one of the beacon symbols in the symbol period ί, and ten 126234.doc 200838234 does not add the addition operation, eight = A2 and The choice of household 3 = A3 results in the Lee Solomon code. For example, the method of claim 16, wherein the household 1 = 45, clever: household 4, and Λ = Α 3 = 39. 1 8. The method of μ, wherein the beacon message is a synchronization metric sent in one or more clusters of beacons. The method of claim 18, further comprising: continuously placing a cluster of encoded beacon symbols on the number of total beacon symbols corresponding to the one or more clusters of the beacon code a bit of a Galois Fourier Transform (GFT) domain; and placing zeros in the remaining bytes. 20. The method of μ, wherein the method further comprises using an inverse gft in the GFT domain The component is transformed into a codeword. 21. A wireless communication device, comprising: at least one processor configured to encode a beacon message into a plurality of beacon symbols such that a symbol less than the beacon message is parsed After the number of symbols of the total number of destinations, the beacon message becomes deterministic; and 1/a memory coupled to the at least one processor. 22. The wireless communication device of claim 21, wherein the at least one processor Further steps are configured to transmit the beacon symbols during a defined symbol period and on a correlated subcarrier. 23. The wireless communication device of claim 21 wherein the at least one processor is further configured To use a maximum distance 24. The wireless communication device of claim 21, wherein the at least one processor proceeds to 126234.doc -4- 200838234 and eliminates the plurality of steps configured to be based thereon One of the conflicting beacons of the beacon symbol is ambiguous. The 'at least one processor is detected and/or processed by one of the symbols. 2 · The wireless communication step of claim 21 is configured to be based on The beacons are time or frequency offset. - the processor enters a message, the plurality of 26. The wireless communication device of claim 21, wherein the at least step is configured to encode the beacon code using a polynomial code Contains at least one index term. Wherein the polynomial code is given by the following formula to the wireless communication device of claim 26: 牟(a"···,%) = ten in +(four), ten...tencheng+.., + for r where is the index The number of terms is an original element having a domain Zs corresponding to s elements of s subcarriers available for beacon transmission, where S &gt; 1 '; to ~ is an index factor determined based on the beacon message, For the purpose of the length of the polynomial code and the S-determination parameter, the shirt is used to transmit one of the beacon symbols in the period ,, and: 28: the wireless communication device of claim 26, wherein The multi-code contains two items and the beacon message can be decoded based on the ## symbol in the plurality of beacon symbols. ', 29. The wireless communication device of claim 28, wherein The two elements of the two fingers, Ζζη, are formed, and the field 2 ι has 2 11 elements corresponding to 211 subcarriers that can be used for the target transmission. , &quot; 3〇· The wireless communication device of claim 29, Among them, the multiple, eight horses are given by 126234.doc 200838234: and (αΐ, 22)=烀+21/十; 72W21/, where A and A are the original elements of the domain Z2U, ... and ... are the index factors judged based on the beacon message, pull, seven) indicating one for the symbol period 岬2, the subcarrier of one of the beacon symbols, and the ten indicates the addition of the modulo 211. 31. The wireless communication device of claim 26, wherein the polynomial code is given by one of the following formulas: Li De Solomon code: Add a 2) = slice + 21 » 221 /, the original element of the domain (1), the field Z2 &quot; has 211 elements H2 corresponding to 211 subcarriers available for beacon transmission, based on the beacon The exponent factor of the message decision, 4 (~hook indicates - the subcarrier used to transmit one of the beacon symbols in the symbol period/, and the ten indicates the modulo addition, the choice results in the Lee Solomon. 32. If the request is 31. The wireless communication device of claim 31, wherein the wireless communication device of claim 26, wherein the polynomial code comprises three exponential terms and the beacon message is based on the plurality of beacon symbols Decoded by two beacon symbols. - 34. A line communication device, wherein the three exponential terms are formed by three original elements of the domain Ay having 47 elements corresponding to 47 subcarriers available for transmission. 35. Wireless as claimed in claim 34 a communication device, wherein the polynomial code is given by · 126234.doc 200838234 孓 (αι, α2, α3χ+2/ 十十巧^2, where A, P2, and A are the original elements of the domain A?, αι , ... and ~ are index factors based on the determination of the beacon message, in particular (4), indicating that a subcarrier for transmitting one of the beacon symbols in the symbol period ί is indicated by 3), and ten indicates a modular addition operation. 36. The wireless communication device of claim 26, wherein the polynomial code is one of the Lie Solomon codes given by: 孓(%,%,%) = #+2/十〆y#, wherein the household 1 is One of the original elements of the field Z47, which has 47 elements corresponding to 47 subcarriers available for beacon transmission, eight = Α2, Λ = κ, q and the heart is an index factor determined based on the beacon message,牟Μ, %%) indicates a subcarrier for transmitting one of the beacon symbols in the symbol period/, and ten indicates a modulo addition operation, and the selection of Α = Α 2 and Α results in the Lee Solomon code. 37. The wireless communication device of claim 36, wherein the user is ι=45, 死4, and ρ3=Α3=39 0 38. The wireless communication device of claim 21, wherein the beacon message is in the beacon A synchronization metric sent in one or more clusters. 39. The wireless communication device of claim 38, wherein the at least one processor is further configured to: continuously place a cluster of encoded beacon symbols in the one or more clusters corresponding to the beacon code The number of total beacon symbols in a Galois Fourier Transform (GFT) domain is in a byte; and zeros are placed in the remaining bytes. The wireless communication device of claim 39, wherein the at least one processor advance is configured to use the inverse GFT to the GFT domain The component is transformed into a codeword. A wireless communication device for encoding and transmitting a beacon symbol of a beacon message, comprising: , , , . And means for initializing a beacon message; means for encoding the beacon message into a plurality of beacon symbols according to an encoding mechanism, wherein the encoding mechanism can be solved from a portion of the symbols smaller than a total number of symbols ; and 构件 The means for transmitting the beacon symbols on the corresponding subcarriers in the periodic time slot. A wireless communication device, as claimed, which further includes means for identifying a steerable carrier of the _ field such that the subcarrier position of the coded token must satisfy a linear constraint on the field. The wireless communication device of claim 41, wherein the encoding mechanism is an encoding mechanism, a beacon code, an encoding mechanism, and a beacon-like encoder (4) 4s code Β1 encoding mechanism. The wireless communication device of claim 41, wherein the beacon message includes information regarding at least one of the beacon message, the transmission base station, or the sector of the transmission base station. The maximum distance division (MDS) code is programmed by the wireless communication device of the item 41, wherein the beacon message is further encoded 'so that the total number of the payment is less than the beacon from ', α α Several beacons 126234.doc 200838234 symbols can be utilized to eliminate this beacon. The wireless communication device of claim 41, wherein the signal is encoded such that the symbol is less than (4) the message. The one-step symbol can be utilized for extracting and/or processing - time or frequency. Beacon 48. The wireless communication device of claim 41, wherein the target message is encoded by a polynomial code, the polynomial code comprising a number of items. 49. The wireless communication device of claim 48, wherein: the y-type code is given by where R is the number of exponential terms, and the outer eight-vox has s subcarriers corresponding to available for beacon transmission. The original element of the domain Zs of the S elements, where S &gt; 1, the magic factor is determined based on the index factor determined by the beacon message, "for its length of the polynomial code and a parameter of the S decision, the shirt, aR" means: Used for the subcarrier of the beacon symbol transmitted in the week (four), and the ten fingers 曰 = modulo addition. 50. The wireless communication device of claim 48, wherein the polynomial code comprises two variables and the beacon message is decoded based on two of the plurality of beacon symbols. 51. The wireless communication device of claim 50, wherein the two exponential terms are formed by two original elements of the domain, the domain having 211 elements corresponding to 211 subcarriers available for beacon transmission. 52. The wireless communication device of claim 51, wherein the polynomial code is given by 126234.doc 200838234: ^(«ι,α2) = Ααι+21ί®Ρ2^21ί, wherein households 1 and A are domains Ζηι The original elements, ~ and ~ are index factors based on the beacon temperament, Ζ, (αρα2) indicates a subcarrier for one of the beacon symbols developed in the symbol period γ, and the ten indicates the modulo 211 Addition calculation. 53. The wireless communication device of claim 48, wherein the polynomial code is represented by the following equation f, given one of the Lee Solomon codes: 义私"··, %) = ten ... ten 〆%, wherein one of the domains zs The original element, the field Zs has S elements corresponding to the S subcarriers that can be used for the # standard transmission, and for w=2, ... R, , α〗 to ... is less than part of the beacon message The exponent factor 'thin, ..., Ο indicates - the subcarrier index used for the beacon symbol transmitted during the symbol period ,, 9 is the parameter based on the beacon code, and the ten indicates the modulo addition, a 2, ..., R, =: to the Lie Solomon code. 54. The wireless communication device of claim 53, wherein s = 2 ^ = 207 ^ ^ = ^ = 16. 2, &quot; Bu 55. t request item 48 A wireless communication device, wherein the polynomial contains three or more items and the beacon message is decoded based on the plurality of beacon symbols. A) of the wireless communication device of claim 55 The three original elements are formed, and the - 啕 corresponds to 47 of the 47 subcarriers that can be used for #126234.doc 200838234 transmission 5 7 · A wireless communication device such as π, wherein the polynomial code is given by: χ, χ, (Α, α2, α3) = ten 〆 3 + "1 + 2,, / , 中中1 p2 and P3 are the original elements of the domain Z47, ~, (3⁄42 and ... are the index factors determined based on the beacon message, {(%, %々) indicates that one is used in the symbol period' to send - The subcarrier of the beacon symbol, and ten indicates a modulo addition operation. 58. The wireless communication device of claim 48, wherein the polynomial code is one of the Lie Solomon codes given by: X, (a"a2, a3 = Aai+2i®Aa2P22i®AaW, , and household 1 is the original element of domain 47, which has 47 elements corresponding to 47 subcarriers available for private transmission, = <λ=α3, ~ Indicates the modulo addition gate code. And α2 is an index factor determined based on the beacon message, the shirt (4)) indicates - the subcarrier used to transmit one beacon symbol in the symbol period, and the selection of the outer ~ Λ and 巧 = ρ 导致 leads to the li The wireless communication device Ps = Ρ \ = 39 请求 where ρ 1 = 4 5, P2 = Pi2 = 4, and 60· as in claim 41, the wireless subscriber wins ^ ^ ^ 尺An overnight device, wherein the beacon message is a synchronization metric sent in one or more clusters of beacons. And a coding beacon symbol of the cluster of the wireless communication device of claim 60, further comprising for continuously placing the one of the 126234.doc • 11 - 200838234 or more corresponding to the beacon code The number of the total beacon symbols in the cluster is one G-changed (four) domain byte order; and zero is placed in the remaining two components. 62. The wireless communication device of claim 61, wherein the step further comprises means for converting the component in the GFT domain into a codeword using an inverse GFT. 63. A computer program product, comprising: a computer readable medium, comprising: a code for causing at least a computer to initialize a beacon message having a transmitter for one of the beacon messages Information; a code for causing the at least one computer to encode the beacon message as a plurality of beacon symbols transmitted on a subcarrier that exhibits information, and selecting the beacon symbol according to an encoding mechanism, wherein Decoding the beacon message by one of the beacon payouts; and a code for causing at least one computer to transmit the beacon symbols on the subcarriers in a determined symbol period. 64. The computer program product of claim 63, wherein the encoding mechanism is related to a number of available subcarriers of a domain such that the portion of the subcarriers for the beacon symbols satisfies a linear constraint on the domain to determine the remaining a beacon symbol 0 65. A device in a wireless communication system, the device comprising: a processor configured to: encode a beacon message into a plurality of letter symbol positions based on a plurality of available locations; Associating the available locations with a domain such that by satisfying a linear constraint on the 126234.doc -12-200838234, receiving a portion of the beacon symbol locations may cause the remainder of the beacon message to be determined And transmitting the beacon symbols; and a memory coupled to the processor. 66. A method for receiving a portion of a beacon symbol used to decode a beacon message, comprising: Receiving a partial subset of the beacon symbols encoded by a beacon, the subcarrier frequencies of the encoded ticket symbols satisfying a linear constraint on a domain of one of the total number of J carrier positions available for the beacon symbol And the 邛 邛 knife determines information about the encoded beacon symbols based on the subcarrier position of the encoded beacon symbols and the solution to the linear constraint. A method of monthly request 66, wherein the information of the determination includes a frequency offset of the beacon. 68. The method of claim 67, wherein the offset is based on the local set of encoded beacon symbols compared to the reputation: the difference between the two parent t-symbols and the effective set is the offset. 6 9 · The method of claim 6 7 , the frequency offset is given by: , is a Fourier transform in a Gal〇ls (one of the gf beacon symbols c 1 1 f ^ ^Fly in the table is not the same as the square %g of a matrix representing the matrix you finally constructed by Mann's "x々 matrix, (5 is a round of people - the direction of the k elements of the mountain) The most in the a C and the 1 horse in a set orientation, the stand 7 0 · If the request item 6 9 is too earth ^, , the white is 1. I26234.doc method, where the frequency offset is solved by solving the following formula Estimate •13. 200838234 吕十·· ?Τ· ^V is a direction orthogonal to the subspace of the subspace traversed by the beacons. 71. For the method of claim 7, where ρ is predetermined The method of claim 66, wherein the information of the determination includes a transmitter that identifies the beacon in conflict with one or more other beacons. Γ 73. The method of claim 66, wherein the determination The remaining beacon symbol of the information packet 74. According to the method of claim 73, the less packet 3 is decoded immediately after the 4 remaining beacons are awarded. 75. The method of claim 74, wherein the beacon includes sector identification information. 76. The method of claim 73 wherein the received-single_beacon is substantially equal to the polynomial of the linear constraint The beacon may be determined after a number of beacon symbols of the number of exponential terms in the function. R. The method of claim 73 wherein the beacon symbols are encoded using a maximum distance division (MDS) code. 1) The method of claim 77, wherein the negotiation code is a Lie Solomon code. The method of claim 78, wherein the Lie Solomon code is calculated over a domain greater than one available beacon subcarrier. The remaining symbols can be determined by representing the two received symbols as '=A&quot;1+2U®Aa2A21i, and solving and exponentially. 126234.doc -14- 200838234 80. In the method, the symbols received by the 412 available beacon subcarriers are represented as where the Lie Solomon code is calculated on a smaller field, and can be obtained by connecting 3 '''''''''''''''''' 2ί 十 A2«十 Α2 ΟΛ and a = ρΓ2(4)) «(四)十«ί+2) = a 4a_ 十 ρ24〇2ί 十 and solve for the remaining symbols by solving A and its exponent. 8 1 · A wireless communication device containing at least one processor, its group a subset of 4-ported private symbols encoding a beacon message, wherein one of the encoded beacon symbols satisfies a field on a total number of subcarrier positions available for the beacon symbol a linear constraint; and a delta, which is consuming to the at least one processor. 82. The wireless communication device of claim 81, wherein the at least one processor is further configured to: resolve the beacon message by determining the beacon message based on the encoded beacon symbols satisfying the linear constraint Ambiguity. 8. The wireless communication device of claim 8, wherein the at least one processor further determines γ, 、, 、, and L by determining the beacon symbol based on the encoding that satisfies the linear constraint. Beacon message; and - resolve frequency and/or time offset with respect to the offset of the beacon message. 84. The wireless communication device of claim 81, wherein the at least one processor proceeds to a 126234.doc -15-200838234 bundle and determines that the beacon message is configured to: resolve the linear approximate residual beacon symbol. 85. The wireless communication step of claim 84 is configured to determine the identity message. Apparatus, wherein the at least one processor decodes the letter after entering a remaining beacon symbol 86. The wireless communication device of claim 81, wherein the beacon symbols are encoded using a maximum distance division (MDS) code. 87. The wireless communication device of claim 86, wherein the coffee code is a Lie Solomon code. 88. If the wireless communication attack of claim 87 occurs, a greater than 411 available beacon subcarriers represent the two received symbols as where the Lie Solomon code system is calculated, and twenty one «1+21/ 十 a2V&gt;22U The household 1 and its index are solved and the remaining symbols are determined. 89. The wireless communication device of claim 88, wherein the Lie Solomon code is calculated over a domain of less than 412 available beacon subcarriers, represented by 3 received symbols as X2 = ΡΓ1 ·1) θ 十厂广厂32(,+1) x3 = Ααι+2(ί+2) 十 〇22(ί+2)十“,+2)=AV冲十 ρ24« 十 ρ34« 126234.doc • 16-200838234 and solve for Ρ! and its index to determine the remaining symbols. 90. A wireless communication device for determining a beacon message based on a subset of received beacon symbols, comprising: for receiving a single beacon message less than a total number of symbols in the beacon message a component of several beacon symbols; Not used for a total number of constrained subcarriers based on the received beacon symbol and a component of the constraint; λ target-domain-linear Γ Ο A linear constraint determines the component of the beacon message. 915彳付付 91. The wireless communication device of claim 90, wherein the step comprises a frequency offset for the communication device of the tiger and the beacon symbol by the 1: A wireless communication device of claim 92, wherein the frequency offset is given by: I is a symbol in the Gal°iS! An equation $ C ^ ^, a matrix representation of G, along a heart constructed by the last moxibustion of the matrix t early, C is a moxibustion vector containing the last k elements of C, 〇Q, , ^^ ε and 1 is the 仃 vector, and its elements are all five. 9 · As for the wireless communication dream #, 绖n 乜 clothes, wherein the frequency offset is estimated by solving the following formula ea △ - '' ΨΊ 0 where f is orthogonal to堃, μ, etc. "Private symbols across the subspace of the 126234.doc -17. 200838234 the amount. 94. The wireless communication device of claim 93, wherein ν_ is predetermined. 95. The wireless communication device of claim 90, wherein the progress of the complex includes means for parsing the beacon message in the presence of a message by satisfying the linear constraint. 96. The wireless communication device of claim 90, wherein the 4 beacon symbol is encoded by a Lee Solomon code. 97. The wireless communication device of claim 90, wherein the step further comprises means for decommissioning the beacon message immediately after determining the remaining beacon symbols. 98. The wireless communication device of claim 97, wherein the beacon message includes sector identification information. 99. The wireless communication device of claim 90, wherein after receiving a single-beacon substantially equal to a number of beacon symbols for a number of exponential terms in one of the linear constraints, The text message may be a determined 0 ϋ 100. The wireless communication device of claim 90, a maximum distance division (MDS) code, and 101. The wireless communication of claim 1 is a Solomon code. Where the beacon symbols are codes. 'The MDS code is a Lie 102. The wireless communication device of claim 1 〇1, where a greater than 411 available beacon subcarriers are represented by the two received symbols as the domain of the Lie Solomon It is calculated that the code system can determine the remaining symbols by 21 = Pi Pl «ι+21ί 126234.doc -18- 200838234 and solve for the index and its index. A wireless communication device as claimed in claim 1, wherein the Lie Solomon code is calculated over a domain of less than 412 available beacon subcarriers, and can be represented as AY by means of three received symbols; , 'X2 = Pi*'1) Ten «ί+1) Ten (4) = Xin Guang '10 AV father ten hearts and € Χ 3 = ; ^ + 2 (/ + 2) ten « (four) ten outside 0 ^ 2 (four) = a V, +2i Ten and solve for A and its index to determine the remaining symbols. 104. A computer program product, comprising: a computer readable medium, comprising: code for causing at least one computer to receive an incomplete set of beacon symbol broadcasts for a beacon message, the beacons The symbol satisfies a linear constraint on a domain of subcarriers that can be used to transmit the beacon symbol broadcasts; and is used to resolve the incomplete set of at least one computer with respect to beacon symbol broadcasts Constrained to determine the code of the remaining beacon symbols in the beacon message. 105. The computer program product of claim 1, wherein the computer readable medium further comprises a frequency for determining, by the at least one computer, an effective sequence of broadcasts based on the beacon symbols and the disparate information message Offset code. 126234.doc -19-200838234 106. A device in a wireless communication system, the device comprising: a processor configured to: receive an incomplete set of beacon symbols for a beacon message; Determining a remaining beacon symbol of the beacon message based on using the received beacon symbol to satisfy a linear constraint on a domain; and decoding the beacon message to identify a transmission fan region of the beacon message Information; and a memory coupled to the processor. 126234.doc -20-