RU2426260C2 - Encoding beacon radio signals in wireless communication systems - Google Patents

Abstract

FIELD: information technology.

SUBSTANCE: disclosed methods and systems simplify transmission of beacon radio signal symbols of a beacon radio signal message so that the sequence of symbols can satisfy linear restriction on the field, where the field elements can be identified using carriers. In this respect, the encoding scheme can be applied a beacon radio signal message; the encoding scheme can form a plurality of beacon radio signal symbols in order to transmit at given subcarriers. The beacon radio signal symbol receiver can decode the beacon radio signal message by receiving a number less than the total number of symbols in the beacon radio signal message, and determining the remaining subcarriers of the symbol based on linear restriction. That way, more efficient decoding of beacon radio signals is simplified, as well as disambiguation of the beacon radio signal by clarifying which symbols satisfy linear restriction for symbols, and allowing time and frequency shift by detecting shift which must be possessed by the result of satisfying linear restriction.

EFFECT: high accuracy of encoding beacon radio signals.

106 cl, 13 dwg

Description

Cross reference to related applications

This application claims priority to provisional patent application (US) serial number 60/862185, entitled "BEACON CODING SCHEME", filed October 19, 2006, provisional patent application (US) serial number 60/863123, entitled "CODE FOR BEACONS IN A WIRELESS COMMUNICATION SYSTEM ", filed October 26, 2006, provisional patent application (USA) serial number 60/868658, entitled" BEACONS IN A WIRELESS COMMUNICATION SYSTEM ", which was filed December 5, 2006, and provisional patent application ( USA) serial number 60/883541 entitled "BEACONS IN A WIRELESS COMMUNICATION SYSTEM", which I filed January 1, 2007. The above applications are fully contained in this document by reference.

State of the art

FIELD OF THE INVENTION

The following description generally relates to wireless communications, and more particularly to encoding beacon symbols for more efficient decoding and resolution in a wireless communications system.

State of the art

Wireless communication systems are widely deployed to provide various types of communication content, such as, for example, voice, data, and the like. Typical wireless communication systems may be multiple access systems capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access systems include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access ( OFDMA) etc.

In general, multiple access wireless communication systems can support simultaneous communication for multiple mobile devices. Each mobile device can exchange data from one or more base stations through transmission on the forward and reverse links. The forward communication line (or downlink) refers to the communication line from base stations to mobile devices, and the reverse communication line (or uplink) refers to the communication line from mobile devices to base stations. Additionally, communication between mobile devices and base stations can be carried out through systems with one input and one output (SISO), systems with many inputs and one output (MISO), systems with many inputs and many outputs (MIMO), etc.

MIMO systems typically use multiple (N _T ) transmit antennas and multiple (N _R ) receive antennas for data transmission. Antennas can relate to base stations (eg, access points) and mobile devices (eg, access terminals) in one example, where the base station can provide communication channels to mobile devices. Base stations may transmit beacon signals for interpretation by mobile devices in an attempt to identify the base station and / or transmission carrier or its sector. The beacon symbols are sent at a predetermined time in a superframe, thereby causing collisions of the beacon signals to occur as the number of sectors within range exceeds the number of available subcarriers. Additionally, as additional information needs to be transmitted in a beacon radio signal and as the number of transmitting devices grows in a given area, mobile devices can be overloaded with messages of beacon radio signals that need to be decoded, and can often discard messages that they cannot process.

SUMMARY OF THE INVENTION

The following is a simplified summary of one or more embodiments in order to provide a basic understanding of these embodiments. This entity is not a comprehensive overview of all considered embodiments, and it does not intend either to identify key or critical elements of all embodiments, or to describe the scope of any or all embodiments. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as an introduction to the more detailed description that is presented later.

In accordance with one or more embodiments and their intended disclosure, various aspects are described in connection with simplifying the encoding of beacon messages sent by base stations or their sectors. In particular, beacon messages can be encoded as a plurality of beacon symbols that meet certain conditions or field restrictions to enable efficient character decoding, taking into account an incomplete character set, as well as efficient and accurate resolution of conflicting characters and time / frequency offset.

According to related aspects, a method that facilitates transmitting a beacon signal as a plurality of beacon symbols is described herein. The method may comprise encoding a beacon message as a plurality of beacon symbols so that a number of characters less than the total number for the beacon message can be used to determine the remaining characters of the beacon message. The method may also comprise transmitting a plurality of beacon symbols on the respective subcarriers at designated symbol periods.

Another aspect relates to a wireless communication device. The wireless communication device may include at least one processor configured to encode the beacon message as a plurality of beacon symbols so that after resolving the number of characters less than the total number for the beacon message, the beacon message becomes deterministic . A wireless communication device may also include a storage device coupled to at least one processor.

Another aspect relates to a wireless communication device that encodes and transmits beacon symbols of a beacon signal. The wireless communications apparatus may include means for initiating a beacon signal message and means for encoding a beacon signal message to a plurality of beacon symbols according to a coding scheme, wherein the coding scheme may be solved from a portion of symbols smaller than the total number of symbols. Additionally, the wireless communication device may include means for transmitting beacon symbols on the respective subcarriers in periodic time slices.

Another other aspect relates to a computer program product, which may have a computer-readable medium including code for instructing at least one computer to initialize a beacon signal with information regarding a beacon message transmitter. The code may also instruct at least one computer to encode the beacon signal into a plurality of beacon symbols that should be sent on subcarriers indicating information, wherein the beacon symbols are selected according to a coding scheme where the beacon signal can be decoded by receiving a part beacon symbols. In addition, the code may instruct at least one computer to transmit beacon symbols on subcarriers at certain symbol periods.

In accordance with another aspect, an apparatus in a wireless communication system may include a processor configured to encode a beacon signal to a plurality of beacon symbol positions according to a plurality of available positions, associate available positions with a field, so that receiving a portion of the beacon symbol positions may make the rest of the beacon message is deterministic by satisfying the linear field constraint, and transmit the beacon symbols about the radio signal. In addition, the device may include a storage device connected to the processor.

According to a further aspect, a method for receiving a portion of the beacon symbols that are used to decode the beacon message is also described. The method may comprise receiving a partial subset of coded beacon symbols, wherein the subcarrier position of the encoded beacon symbol satisfies a linear field limitation associated with the total number of subcarrier positions suitable for use with beacon symbols. Additionally, the method may include determining information regarding the encoded symbols of the beacon signal, at least in part, based on the position of the subcarrier of the encoded symbols of the beacon signal and the resulting solution for linear restriction.

Another aspect relates to a wireless communication device. The wireless communication device may include at least one processor configured to receive a subset of coded beacon symbols of the beacon signal, wherein the position of the coded symbol beacon subcarrier satisfies a linear field constraint associated with the total number of subcarrier positions suitable for use with beacon symbols. A wireless communication device may also include a storage device coupled to at least one processor.

Another aspect relates to a wireless communication device for determining a beacon signal based on a subset of the received beacon symbols. The device may include means for receiving the number of beacon symbols of a single beacon message less than the total number of beacon symbols in the beacon message. The device may also include means for satisfying a linear field constraint associated with the total number of available subcarriers for reporting the beacon signal, based on the positions of the subcarrier of the received beacon symbols. The device may further include means for determining the remaining beacon symbols in the beacon message based on a linear constraint.

Another other aspect relates to a computing software product, which may have a computer-readable medium including code for instructing at least one computer to receive an incomplete set of broadcast transmissions of beacon symbols associated with a beacon signal, while the beacon symbols satisfy linear field limitation associated with suitable subcarriers for broadcasting beacon symbols. The code may also instruct the at least one computer to solve a linear constraint on an incomplete set of broadcast beacon symbol broadcasts to determine the remaining beacon symbols in the beacon message.

In accordance with another aspect, a device may be provided in a wireless communication system, including a processor configured to receive an incomplete set of beacon symbols associated with a beacon message. The processor may also be configured to determine the remaining beacon symbols of the beacon signal based on the use of the received beacon characters to satisfy linear field constraints, and decode the beacon signal to distinguish information about their transmitting sector. Additionally, the device may include a storage device connected to the processor.

To the accomplishment of the foregoing and related ends, one or more embodiments comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects of one or more embodiments. However, these aspects point to only some of the many ways in which the principles of various embodiments can be used, and the described embodiments are intended to include all such aspects and their equivalents.

Brief Description of the Drawings

FIG. 1 is an illustration of a wireless communication system in accordance with various aspects presented herein.

FIG. 2 is an illustration of an example communication device for use within a wireless communication environment.

FIG. 3 is an illustration of an example wireless communication system that implements transmit beacon symbols encoded by an encoding scheme.

FIG. 4 is an illustration of exemplary superframes and symbol periods used in wireless communication systems.

FIG. 5 is an illustration of the clustered beacon symbol periods of the example used with respect to clock indicators in wireless communication systems.

FIG. 6 is an illustration of an example wireless communication network.

FIG. 7 is an illustration of an example methodology that facilitates transmitting a beacon radio message encoded using a coding scheme.

FIG. 8 is an illustration of an example methodology that facilitates receiving encoded beacon symbols to decode a beacon signal.

FIG. 9 is an illustration of an example mobile device that facilitates receiving beacon symbols through various beacon subcarriers.

FIG. 10 is an illustration of an example system that implements transmit beacon symbols encoded by a coding scheme.

FIG. 11 is an illustration of an example wireless network environment that can be used in conjunction with various systems and methods described herein.

FIG. 12 is an illustration of an example system that transmits a beacon signal from encoded beacon symbols.

FIG. 13 is an illustration of an example system that receives an incomplete set of coded beacon symbols for decoding a beacon message.

DETAILED DESCRIPTION OF THE INVENTION

Various embodiments will now be described with reference to the drawings, in which like reference numbers are used to refer to like elements. In the following description, for purposes of explanation, many specific details are set forth in order to provide a thorough understanding of one or more embodiments. However, it may be obvious that these embodiments can be practiced without these specific details. In other cases, the block diagram model shows common structures and apparatuses in order to simplify the description of one or more embodiments.

When used in this application, the terms "component", "module", "system", etc. have the intention of referring to a computer-related object, whether it is hardware, firmware, a combination of hardware and software, software or software during execution. For example, a component may be, but not limited to, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and / or a computer. By way of illustration, both an application running on a computing device and a computing device may be a component. One or more components may reside within a process and / or thread of execution, and the component may be localized on a computer and / or distributed between two or more computers. In addition, these components can be executed from various computer-readable media having various data structures stored. Components can exchange data through local and / or remote processes, for example, in accordance with a signal having one or more data packets (for example, data from one component interacting with another component in a local system, distributed system and / or network, for example over the Internet, with other systems through a signal).

In addition, various embodiments are described herein in connection with a mobile device. A mobile device can also be called a system, subscriber device, subscriber station, mobile station, mobile device, remote station, remote terminal, access terminal, user terminal, terminal, wireless device, user agent, user device, or user equipment (UE). A mobile device can be a cell phone, a cordless telephone, a Session Initiation Protocol (SIP) telephone, a wireless subscriber access station (WLL), a personal digital assistant (PDA), a handheld device with wireless connections, a computing device, or another processing device connected to wireless modem. In addition, various embodiments are described herein in connection with a base station. The base station may be used to exchange data with the mobile device (s) and may also be referred to as an access point, node B, or some other terminology.

Moreover, various aspects or features described herein may be implemented as a method, device, or product using standard programming and / or development techniques. The term "product" when used in this document is intended to contain a computing program accessible from any computer-readable device, medium or medium. For example, computer-readable media can include, but not limited to, magnetic storage devices (e.g., hard disk, floppy disk, magnetic tape, etc.), optical disks (e.g., compact disc (CD), universal digital disk (DVD), etc.), smart cards and flash memory devices (for example, EPROM, card, card, flash disk, etc.). Additionally, the various storage media described herein may represent one or more apparatuses and / or other computer-readable media for storing information. The term “computer-readable medium” may include, without limitation, wireless channels and various other media capable of storing, hosting and / or transferring commands (s) and / or data.

Referring now to FIG. 1, a wireless communication system 100 is illustrated in accordance with various embodiments presented herein. System 100 comprises a base station 102, which may include several groups of antennas. For example, one antenna group may include antennas 104 and 106, another group may comprise antennas 108 and 110, and an additional group may include antennas 112 and 114. Two antennas are illustrated for each antenna group; however, more or fewer antennas can be used for each group. The base station 102 may additionally include a chain of transmitting devices and a chain of receiving devices, each of which, in turn, may contain many components associated with the transmission and reception of signals (for example, processors, modulators, multiplexers, demodulators, demultiplexers, antennas, etc.) that should be recognized by specialists in this field of technology.

Base station 102 may communicate with one or more mobile devices, such as mobile device 116 and mobile device 122; however, it should be appreciated that base station 102 can exchange data with virtually any number of mobile devices, such as mobile devices 116 and 122. Mobile devices 116 and 122 can be, for example, cell phones, smartphones, laptop computers, handheld devices communications, handheld computers, satellite radios, global positioning systems, PDAs and / or any other suitable apparatus for exchanging data via wireless communication system 100. As illustrated, the mobile device 116 communicates with the antennas 112 and 114, while the antennas 112 and 114 transmit information to the mobile device 116 on the forward link 118 and receive information from the mobile device 116 on the reverse link 120. In addition, the mobile device 122 communicates with the antennas 104 and 106, while the antennas 104 and 106 transmit information to the mobile device 122 on the forward link 124 and receive information from the mobile device 122 on the reverse link 126. In a frequency division duplex (FDD) system, for example, forward link 118 may use a different frequency band from that used by reverse link 120, and forward link 124 may use a different frequency band than used by reverse link 126. Additionally, in a time division duplex (TDD) system, forward link 118 and reverse link 120 may use a common frequency band and forward link 124 and reverse link 126 may use a common frequency band.

Each group of antennas and / or the area in which they are intended to exchange data may be referred to as a sector of the base station 102. For example, groups of antennas can be configured to communicate with mobile devices in the sector of the areas covered by the base station 102. When communicating directly to the communication lines 118 and 124, the transmitting antennas of the base station 102 may use beamforming in order to improve the signal-to-noise ratio of the direct communication lines 118 and 124 for mobile devices 116 and 122. In addition, although the base station 102 uses beamforming to transmit to mobile devices 116 and 122 randomly distributed over their associated coverage, mobile devices in neighboring cells may be less affected than transmitting a base station through one antenna to all of their mobile devices.

In one example, the base station 102 may send a beacon signal or codeword from each antenna 104, 106, 108, 110, 112 and 114 and / or antenna grouping containing information regarding the antenna and / or the corresponding base station 102, such as identification information and / or other indicators, or general information associated with the antennas and / or base station 102. A beacon radio signal message, or code word, or, generally, a beacon radio signal — a signal sent using almost all available power to reach devices having both low and high signal to noise ratio (SNR); a beacon signal or codeword may contain identification information to enable various devices to identify the sector to which the beacon signal relates. A beacon message or codeword may be represented by a certain number of beacon symbols (which may be OFDM symbols in one example) transmitted in a combination or sequence of beacon signals. A combination of beacon signals is represented by a plurality of beacon symbols sent to transmit information in a beacon signal, and may be a repeating or infinite configuration in various examples.

According to an example, mobile devices 116 and 122 may receive one or more beacon symbols and decode them to distinguish information associated with antennas, an associated sector, base station 102, and / or a main system or network; in one example, a beacon symbol may be one of the first signals that mobile devices 116 and 122 can interpret regarding a base station 102 or antenna (for example, when turning on the power or moving within the broadcast range, for example). To this end, the beacon symbol may be sent so that it is easily recognizable by mobile devices 116 and 122. In one example, the beacon symbols may represent the entire beacon code word, which may be a plurality of beacon symbols indicating information, or a configuration, part of which may be required before correct decoding. According to an example, base station 102 may send a beacon symbol from a given antenna 104, 106, 108, 110, 112 and / or 114 by transmitting virtually all available power on a single subcarrier channel (or a small number of channels). Mobile devices 116 and / or 122 can receive a signal and perform fast Fourier transform (FFT) or another decoding algorithm for the signal to determine that one channel has a very high frequency compared to others. Mobile devices 116 and / or 122 may conclude that this is a beacon symbol associated with a given antenna, sector, base station 102 and / or core network or system, and interpret the symbol accordingly. Additionally, mobile devices 116 and 122 may conclude that the symbol of the beacon signal is one of the collection of characters used in the code word of the beacon radio signals, for example.

To simplify usability with multiple antennas (as shown in the drawing) and / or multiple base stations (not shown), the base station 102 can uniquely identify itself by having an associative associated beacon code that is broadcast to the mobile device 116 and 122 which is within range. A beacon code represents a method by which a beacon message is encoded; this information may enable the receiver of the beacon signal or its symbol to predict the details of the beacon signal as described herein. The beacon code may be one character sent each super-frame, with the character being broadcast in a unique subcarrier. Additionally, the beacon code may be a plurality of such symbols broadcast in different subcarriers each period to represent the beacon code word or a configuration from which the beacon code word transmitter information may be extracted by mobile devices 116 and 122. Symbols for broadcast transmissions, subcarriers for broadcast transmissions and their order can be specified when encoding a beacon radio signal and it can be based, at least in part, on the desired beacon signal and time index for the symbol, in one example.

The beacon code in accordance with aspects described herein may be structured to allow the mobile unit 116 and 122 to quickly identify the base station 102 by broadcast beacon, without having to receive all characters of the beacon code word. Additionally, the coding schemes of the beacon radio signals described below may enable the mobile device 116 and 122 to resolve the ambiguity of the beacon radio signals if a plurality of symbols are received regarding one or more transmitters. In addition, the beacon codes of the radio signals disclosed below may enable the mobile device 116 and 122 to detect a frequency shift in the apparatus and appropriately adjust the shift to interpret the beacon codes of the signals as being transmitted, as well as providing the ability to read and decode a plurality of symbols by mobile devices 116 and 122. In this regard, mobile devices 116 and 122 can expand the selection of base stations 102 to which you want to connect, by increasing the volume beacon radio signals that they can interpret.

Turning to FIG. 2, a communication device 200 for use within a wireless communication environment is illustrated. The communication device 200 may be a base station or part thereof, a mobile device or part thereof, or virtually any communication device that transmits one or more beacon symbols. The communication device 200 may include a beacon radio encoder 204 that encodes a beacon signal as one or more beacon symbols (such as a OFDM beacon symbol), and a transmitter 206 that broadcasts a symbol or multiple beacon symbols. In one example, the communication device 200 may formulate a beacon signal and encode the message using the beacon encoder 204, for example, into one or more characters that relate to information regarding the communication device 200. A beacon signal may be sent in a synchronous or asynchronous configuration and may have various properties for its identification depending on the configuration, in one example. Communication device 200 may transmit beacon symbols through a transmitter 206 at specified time intervals (and for specified time periods, in one example). In this regard, the devices can receive a beacon signal as one or more of the transmitted symbols and distinguish information about the communication device 200 according to an example.

In one example, a beacon symbol may be transmitted through a transmitter 206 for a given period of time, such as between two symbol periods, to ensure that the devices can receive the entire symbol, even if the device is not correctly time synchronized or has an asynchronous configuration. After receiving the number of beacon symbols that contain the beacon (for example, a beacon message or codeword), the apparatus may be able to independently adjust or adjust its timing to exchange data in a wireless system, of which the communication device 200 is a part. Beacon signals may have some properties in this regard that are known to the apparatus. For example, beacon symbols may be transmitted at a predetermined (periodic) interval and / or in each superframe (for one or more symbol periods) in an OFDM configuration.

According to an example, beacon symbols can be selected for the desired beacon, which transmits information about the beacon or its transmitter. Symbols may be selected, defined or otherwise provided so as to satisfy a number of properties. Properties may be known to mobile devices or other devices in a network or system in order to efficiently interpret various broadcast beacon signals. For example, by interpreting and decoding the required number of symbols of the beacon signal in the beacon signal, while the required number may be less than the total number of characters in the signal, the apparatus can identify the communication device 200 sending the signal. For example, a beacon radio signal for a communication device having a period of 18 can be fully decoded and become deterministic for the apparatus after decoding 3 out of 8 consecutive symbols, for example. This is described in more detail below. It will be appreciated that the number of characters in a beacon signal may be determined and periodically transmitted or undefined in one example. Another property of a beacon radio signal sent by a communication device and known by the apparatus makes it possible for the apparatus to resolve the ambiguity of two or more beacon radio signals transmitted simultaneously. Using the coding schemes described below, communication devices 200 can send beacon signals so that an apparatus listening to a plurality of beacon signals can receive the desired number of characters from each beacon radio signal and determine time periods for one or more of the beacon radio signals. The required number may also be less than the total number of characters in the signal, enabling the apparatus to efficiently achieve the above functionality.

According to yet another example, a property of a beacon radio coding scheme used by a beacon radio encoder 204 to encode a beacon signal of a communication device 200, as shown herein, may enable one or more devices to correct an offset frequency component or a synchronization component. Since the properties of the coding scheme of the beacon radio signals may be known to the mobile device, beacon radio signals sent by one or more communication devices 200 that are shifted in frequency and / or time, for example, can be easily detected after receiving a certain number of characters in the beacon radio signal. It should be borne in mind that the above properties may enable mobile devices to listen to a certain number of beacon radio signals from communication devices 200 and to facilitate efficient discrimination of information about transmitters (communication devices 200), so the maximum number of beacon radio signals can be listened to and decoded, and can be effective decisions have been made regarding which communication devices 200 need to be exchanged.

Now referring to FIG. 3, a wireless communication system 300 is illustrated that encodes beacon radio signals for one or more base stations. System 300 includes a base station 302 that communicates with a mobile device 304 (and / or any number of different mobile devices (not shown)). Base station 302 may transmit information to mobile device 304 over a forward link channel; in addition, the base station 302 may receive information from the mobile device 304 via a reverse link channel. In addition, system 300 may be a MIMO system. Additionally, system 300 may operate in a wireless OFDMA network, in one example.

Base station 302 may include a timer 306 that can facilitate the exchange of data in a synchronized environment or the sending of symbols for data time periods in asynchronous systems, for example. Base station 302 may also include a beacon radio encoder 308 that encodes a beacon radio message as a plurality of symbols that can be transmitted by transmitter 310. As described previously, the beacon radio code may refer to and be selected, for example, based on the beacon message the radio signal to be sent, as well as the time index. It should be appreciated that the beacon message may contain an identifier for the base station 302 or one or more of its sectors, preferred carrier and / or other information about the transmission object and / or the beacon radio signal. In one example, transmitter 310 may broadcast a beacon and / or its symbols for a given period of time (using timer 306 to determine the time), for example, in two time periods (double the length of the symbol period) to provide that power-on mobile devices 304 can receive and decode a beacon symbol, even if they are shifted, for example, in time or frequency.

Mobile device 304 may include a timer 312 that facilitates exchanging data in a synchronized environment or tuning to base stations 302 in asynchronous environments by measuring, for example, the time and duration of sending. The mobile device 304 may also comprise a beacon radio decoder 314 that decodes the beacon radio signals and / or their symbols according to properties known to the beacon radio signals and a receiver 316 that receives data exchange from the base station 302 (including beacon symbols). In one example, the receiver 316 of the mobile device 304 may receive a plurality of beacon symbols from the base station 302, for example, beacon symbols may be part of the entire beacon signal. Mobile device 304 may decode one or more received symbols with a beacon radio decoder 314 and determine information about a base station 302 that sent a beacon radio signal (and / or its sector or transmitter). Additionally, the timer 312 may be taken into account in order to provide additional information about the beacon radio signal and / or to adjust it based on the beacon radio signal in one example.

According to an example, the base station 302 may encode the beacon message with the beacon encoder 308 to contain information regarding the base station 302; a beacon radio encoder 308 selects symbols, for example, based on information to be transmitted. Base station 302 can transmit beacon symbols on transmitter 310 at a point in time and during the use of timer 306. The time can be two times the normal period to ensure that mobile devices 304 that have just turned on can receive the beacon radio signal throughout the window. For example, the turning on mobile device 304 may initially have an offset timer 312. After receiving the required number of beacon symbols of a given beacon signal (as explained previously) through the receiver 316, the mobile device 304 can determine the entire beacon signal (for example, determine the remaining beacon symbols or messages) and decode the signal using the beacon decoder 314. After detecting the information stored in the beacon symbols, the mobile device 304 may adjust its timer 312, for example, according to the beacon radio signal. Additionally included mobile device may initially also have a bias frequency of the radio or crystal. This can also be adjusted, for example, after receiving and decoding the required number of beacon symbols of the beacon codeword. Since the mobile device 304 can know the configuration of the beacon radio signals, it can easily detect a sequence of beacon radio signals of bias in this regard after receiving, for example, a few characters and effectively adjust its frequency block or timer 312.

In one example, beacon signals may be transmitted every 90 milliseconds on one of the many available tones in the passband. The beacon radio encoder 308 may encode the desired information by selecting one or more beacon symbols for transmission and converting the symbols to tones in the frequency domain. Base station 302 can convert tones to the time domain (for example, by using the inverse fast Fourier transform), for example, and transmit data through a transmitter 310. Symbols for a beacon signal can be selected according to the properties described herein and, for example, a known mobile device 304. Mobile device 304 may receive beacon radio data through a receiver 316 and convert them into a frequency domain (eg, using a fast Fourier transform), example, and decode the beacon signal using the beacon decoder 314. In addition, it should be appreciated that the beacon signal may be decoded from one or more symbols, which may represent part or all of the beacon signal; however, the coding schemes disclosed herein provide the ability to decode a beacon radio signal from a small number of characters. After decoding a sufficient portion of the beacon signal, the remaining symbols to be transmitted by the base station 302 and received by the mobile device 304 can be deterministic. Using the properties of the symbols of the beacon signal, the mobile device 304 can quickly detect a sector from part of the beacon signal using low complexity encoding and decoding mechanisms, decode the beacon signal in the absence of time information (since it can know the valid sequences of the beacon radio signals), decode in the presence of collisions, when two or more symbols of the beacon signal are received simultaneously, and decode despite the frequency of the mobile device 3 04 may be biased.

Now referring to FIG. 4, a representation of the bandwidth over a period of time 400 for a given transmitter (such as a base station or its sector / carrier, for example) is displayed. The bandwidth is represented by a plurality of subcarriers during these symbol periods 402, 406 and 410, and time periods can be divided into one or more superframes 414, which may, for example, have predetermined durations. Each of the symbol periods 402, 406, and 410 shown may broadcast the beacon symbols 404, 408, and 412, respectively, represented in fact as a single OFDM symbol in a symbol period using power (which may be virtually all of the power that is available, as other characters are not powered). As shown, the beacon symbol 404, 408 and / or 412 may be transmitted on different subcarriers and / or in different time periods each superframe 414; the selected subcarrier (s) may represent the required information, such as a beacon signal, which may be a direct beacon control channel (F-BPICH) in one example.

It should be appreciated that several beacon symbols may be transmitted per superframe; in addition, one or more superframes may be skipped and not transmit a beacon symbol. In one example, a beacon signal may be periodic in a time frame so that it can transmit in an interval for a given time period. As mentioned, a beacon signal may be a plurality of beacon symbols transmitted at intervals where frequencies selected for transmission (e.g., subcarriers 404, 408 and / or 412) may indicate information, for example, about a beacon radio signal or transmission object. In this regard, a coding scheme is presented, which may have the properties described above, which enable mobile devices to efficiently detect information about the beacon radio signal transmitter in the middle of the transmission of the beacon signals based on the minimum number of beacon symbols despite collisions and when the mobile device can fine tuning with respect to time and / or frequency is required.

In one example, the subcarriers of each symbol period 402, 406, and 410 can be listed as a prime number of channels n (for example, 0 ... n-1, as shown), and the beacon radio subcarrier can be interpreted by the receiver as an enumeration modulo prime subcarrier numbers. It will be appreciated that subcarriers may be virtually all available subcarriers for transmitting beacon symbols for a carrier. Additionally, however, subcarriers can be divided into n groups; available subcarriers may be either subcarriers in a given group or a group. A coding scheme may be used to select a group of subcarriers. In this regard, algebraic conditions can be satisfied over the field, making it possible to achieve the desired properties in part by measuring displacements. Thus, the symbol sequence of the beacon signal can be selected so that the selection or reception of the required number of characters in the string can practically satisfy the field equation, making the rest of the characters in the beacon signal deterministic. This also makes it possible to detect and control the offset frequencies, since the required number of characters will not exactly satisfy the equation, but can form an offset that can be used to, for example, adjust the frequency of the receiver.

According to one example, the algorithm may be determinate in that a certain number of n positions of the beacon radio signal in a string satisfies the linear constraint that exists across the field, and field elements can be identified using subcarriers. Thus, after receiving the required number of characters in a string, the characters can satisfy linear constraints (for example, the coefficients can be reduced to zero), and the remaining characters in the beacon radio signal (or field) can be determined. For example, in a 1.25 MHz F-OFDM configuration, there are 113 tones or subcarriers that can be used for transmission during a symbol period. Tones can be divided into 3 subsets of 37 (prime) tones or subcarriers (n = 37, as shown relative to subcarrier 402, for example). This position of the symbol of the beacon signal can be taken modulo 37 so that there can be 3 possible positions for the symbol. This information can be used to modulate additional information, create redundancy by using all 3 of the tones that have the same value modulo 37, and / or save power and provide more efficient operation by using, for example, only 1/3 of the tones. In this example, the period of 18 symbols for the beacon signal may be selected, providing 36 ^3/18 = 2592 sequence beacon.

и его обратная экспонента. Затем, p ₁, p ₂ и p ₃ могут быть различными примитивными элементами Z/37 (и любой из них может быть элементом, используемым для того, чтобы задавать логарифм и экспоненту выше). Соответственно, a, b и c могут быть заданы посредством

Следующие переменные также могут быть заданы:According to this example, a primitive element of the multiplicative group Z / 37 can be selected as a symbol, so that

and its inverse exponent. Then, p ₁ , p ₂ and p ₃ can be various primitive Z / 37 elements (and any of them can be an element used to specify the logarithm and exponent above). Accordingly, a, b and c can be defined by

The following variables can also be set:

Таким образом,

, поэтому

и

делая практически все последовательности периодическими с периодом в 18.Thus, given the three consecutive symbols of the beacon signal, z ₁ , z ₂ and z ₃ , in the 18-character code word of the beacon signal, the next symbol z ₄ can be determined by z ₄ = az ₁ + bz ₂ + cz ₃ . The designation z ^t = ( z _t , z _{t + 1} , z _{t + 2} ) ^T can give

In this way,

, so

and

making almost all sequences periodic with a period of 18.

In order to encode the code sequence of the beacon radio signal according to the scheme, the first three positions of the symbols of the beacon radio signal can be arbitrarily selected as follows:

representing 2 * 36 ² sequences. Further, α may denote ( α ₁ , α ₂ , α ₃ ) ^T. The first 3 elements in the sequence of the beacon signal can be specified by B exp [ Vα ], where the square brackets can indicate that the exponent should be applied componentwise, and Vα is calculated modulo 36. Now the following equation should be solvable:

while arithmetic operations in square brackets are performed modulo 36, and outside modulo 37, for example. Thus, the multiplication of M ^{k is} almost equivalent to adding k (2,0,0) ^T to α modulo 36. The decoding algorithm can be defined as follows.

Observation y = M ^k z , where z = B exp [ Vα ],

(mod 36), где

Далее, используя запись "C":in this case, arithmetic operations are performed modulo 36 with the exception of B ^-1 y, which is performed modulo 37. In particular, the observation on the base B can be expressed as w = B ^-1 y (mod 37). Then the base V logarithm can be expressed as

(mod 36) where

Next, using the entry "C":

Thus, three consecutive received beacon symbols can uniquely determine the sequence and time shift k modulo 18.

из чего s может быть определено, и мобильный аппарат или другой приемник символов маякового радиосигнала может регулироваться надлежащим образом. Кроме того, может быть разрешена неоднозначность конфликтующих символов маякового радиосигнала после приема некоторого числа сигналов. Неоднозначность двух конфликтов может быть разрешена с высокой вероятностью после приема 4 символов (и более определенно, 5), а трех конфликтующих маяковых радиосигналов - после 10 символов. Например, условие

может быть удовлетворено практически для любой допустимой последовательности маяковых радиосигналов, что может быть использовано в этом отношении для того, чтобы разрешать конфликтующие символы. При (p ₁, p ₂, p ₃)=(3, 14, 35), практически любые 3 из 8 последовательных символов маякового радиосигнала в этом примере могут определять последовательность. 3 символа из 18 могут использоваться также для того, чтобы определять код маякового радиосигнала; интерполирующая функция является линейной по Z/37 и может быть легко получена из фундаментального линейного ограничения по 4 последовательным позициям маяковых радиосигналов, например.Additionally, frequency shifts can be distinguished by decoding 4 beacon symbols in this example. If the tones are shifted in frequency by s according to the mobile device, for example, then 4 symbols of the beacon radio signal can be observed as z _i + s . In this regard, further

from which s can be determined, and a mobile device or other beacon symbol receiver can be adjusted appropriately. In addition, the ambiguity of conflicting beacon symbols after receiving a certain number of signals can be resolved. The ambiguity of two conflicts can be resolved with high probability after receiving 4 characters (and more specifically, 5), and three conflicting beacon radio signals after 10 characters. For example, the condition

can be satisfied for almost any valid beacon sequence, which can be used in this regard to resolve conflicting characters. With ( p ₁ , p ₂ , p ₃ ) = (3, 14, 35), almost any 3 out of 8 consecutive beacon symbols in this example can determine the sequence. 3 characters out of 18 can also be used to define a beacon code; the interpolation function is linear in Z / 37 and can be easily obtained from the fundamental linear constraint on 4 consecutive positions of beacon radio signals, for example.

According to another example, a maximum diversity (MDS) code is used to transmit beacon symbols forming a beacon radio signal. MDS codes can generate codewords having the largest possible minimum difference between codewords, and thus can provide the greatest opportunity for error correction for a given amount of redundancy, for example. The MDS code can be formulated, in one example, by estimating at least one of the message length of the beacon radio signal (for example, in bits), the number of subcarriers available to transmit the beacon radio signal, the amount of redundancy required for the message beacon signal, sequence length of non-binary characters and / or additional similar factors.

, что может быть выражено следующим образом:According to an example, hereinafter referred to as “beacon code A code”, 211 subcarriers may be available for transmitting beacon symbols (e.g., n = 211 by 402), while the beacon symbol may be a 12-bit message (including self data described previously); thus, an MDS code may be required to support at least 2 ¹² = 4096 different sequences of non-binary characters (which are what the sector transmits, for example). According to this example, beacon symbols may be transmitted on an index subcarrier

that can be expressed as follows:

,

,

обозначает сложение по модулю. В этом примере p ₁ и p ₂ могут представлять элементы Z₂₁₁, что может формировать практически все 211 ненулевых элементов поля. В более тривиальном примере Z₇ может иметь 5 в качестве примитивного элемента, поскольку 5 может быть использовано для того, чтобы формировать все 6 ненулевых элементов (5° mod 7=1, 5¹ mod 7=5, 5² mod 7=4, 5³ mod 7=6, 5⁴ mod 7=2 и 5⁵ mod 7=3).where p ₁ and p ₂ may be primitive elements of the field Z ₂₁₁ (which may contain 211 elements representing subcarriers), α ₁ and α ₂ may be exponent coefficients determined, at least in part, based on a beacon signal (as described below), and

denotes modulo addition. In this example, p ₁ and p ₂ can represent elements of Z ₂₁₁ , which can form almost all 211 non-zero field elements. In a more trivial example, Z ₇ can have 5 as a primitive element, since 5 can be used to form all 6 non-zero elements (5 ° mod 7 = 1, 5 ¹ mod 7 = 5, 5 ² mod 7 = 4, 5 ³ mod 7 = 6, 5 ⁴ mod 7 = 2 and 5 ⁵ mod 7 = 3).

Arithmetic operations in the above equation can be performed on the field Z ₂₁₁ ; thus, addition of A and B can be defined as (A + B) mod 211, A raised to the power of B, can be defined as A ^B mod 211, etc., but addition of integers within exponents can be addition integers modulo 210. The coefficients of the exponent α ₁ and α ₂ can be specified as follows:

для i = 1, 2, код вышеупомянутого уравнения может быть периодическим с периодом в 210/21=10 символов; таким образом, X(α ₁, α ₂)=X _t+10(α ₁, α ₂) для данного значения t, в одном примере. Символы маякового радиосигнала могут быть сдвинуты согласно поднесущей таким образом, например, чтобы передавать информацию приемнику.Thus, the total number 21 * 210 = 4410 different combinations of α ₁ and α ₂ can be set by means of the equation; this makes it possible to support, for example, a 12-bit message having 4096 available sequences. Additionally, each unique combination of α ₁ and α ₂ may correspond to a different message (and thus a different sequence of non-binary symbols for the beacon signal) in this regard. In the example, the message can be converted into accessible characters in almost any way, including randomly, by static assignment through network planning or configuration, based on statistics, etc. According to one example, for a given combination of α ₁ and α ₂ , the message, M, can be converted, for example, to M = 210 * α ₁ + α ₂ . Insofar as

for i = 1, 2, the code of the above equation may be periodic with a period of 210/21 = 10 characters; thus, X ( α ₁ , α ₂ ) = X _{t + 10} ( α ₁ , α ₂ ) for a given value of t , in one example. The beacon symbols may be shifted according to the subcarrier in such a way as to transmit information to the receiver, for example.

According to an example, a mobile device can recover a message sent in a beacon radio signal using two beacon symbols of a message in the presence of a sector, even without time information. This can be done, for example, by receiving non-binary characters x ₁ and x ₂ at times t and t +1. Symbols may be expressed as follows:

or in matrix form:

и

равны двум конкретным элементам поля Z ₂₁₁. Используя эти уравнения, мобильный аппарат или терминал может разрешать

следующим образом:Where

and

equal to two specific elements of the field Z ₂₁₁ . Using these equations, a mobile device or terminal can resolve

in the following way:

следующим образом:After that, the terminal or mobile device can receive degree indicators

in the following way:

The logarithm can be set relative to almost any primitive element of the field Z ₂₁₁ , and this value of y can be converted to a specific value of z . Accordingly, a lookup table may be implemented, for example, within an apparatus or terminal. The coefficients of the exponent α ₁ and α ₂ and the time index t can be obtained as follows:

The coefficient α ₂ can be obtained by combining these two above logarithmic equations. Because α ₁ <21 (as shown above), α ₁ may be the remainder of an integer division z _1/21 and a time index t may be the quotient z _1/21.

In this regard, the terminal can also recover a message sent in a beacon signal using two inconsistent beacon symbols that are not spaced 10 characters apart when there is one sector. In one example, a terminal may receive two beacon symbols and receive two non-binary symbols x ₁ and x ₂ at times t and t + Δ, where Δ is not an integer multiple of 10. Received symbols may be expressed as follows:

or in matrix form:

Таким образом, матрица A может быть зависимой от символов маякового радиосигнала, принимаемых, например, посредством терминала или мобильного аппарата. Следует принимать во внимание, что терминал может декодировать принимаемые недвоичные символы способом, описанным выше, также с другой различной матрицей A .Where

Thus, matrix A may be dependent on beacon symbols received, for example, by a terminal or a mobile device. It should be appreciated that the terminal can decode the received non-binary symbols in the manner described above, also with another different matrix A.

, формируемых с помощью двух примитивных элементов, и временной индекс t также помещается в эти показатели степени. Коэффициенты α ₁ и α ₂ также могут быть в показателях степени или их коэффициентах. Такой код маякового радиосигнала может быть декодирован после приема 2 символов, например, и может использоваться более чем для 412 поднесущих на период символа, подходящий для использования при передаче символов маякового радиосигнала, в одном примере. Следует принимать во внимание, что код A маяковых радиосигналов, как описано, может быть реализован практически для любого числа поднесущих; другой пример может использовать 257 поднесущих с периодом 16, чтобы создавать 16*256=4096 комбинаций для 12-битового сообщения. Дополнительно могут быть использованы другие размеры сообщения также; 12-битовый размер - это только один из безграничного числа примеров.Additionally, as mentioned earlier, the terminal can also decode conflicting beacon symbols to associate the beacon signals with a transmitter to determine transmitter and beacon information. For example, three non-binary characters can be accepted for sector A ( xa ₁ , xa ₂ , xa ₃ ) and for sector B ( xb ₁ , xb ₂ , xb ₃ ). Based on the first two characters, the terminal or receiver can resolve using the four combinations ( xa ₁ , xa ₂ ), ( xb ₁ , xb ₂ ), ( xa ₁ , xb ₂ ) and ( xb ₂ , xa ₁ ) for four possible messages . For each of the four possible messages, the terminal knows what to expect from the third character. For example, two of the messages ( xa ₁ , xa ₂ ) and ( xb ₁ , xb ₂ ) can be checked by xa ₃ and xb _3, respectively. The other two, ( xa ₁ , xb ₂ ) and ( xb ₂ , xa ₁ ), cannot be verified in this example. In addition, as shown, the beacon code may be the sum of two exponential terms

formed using two primitive elements, and the time index t is also placed in these exponents. Coefficients α ₁ and α ₂ can also be in exponents or their coefficients. Such a beacon code may be decoded after receiving 2 symbols, for example, and may be used for more than 412 subcarriers per symbol period suitable for use in transmitting beacon symbols, in one example. It should be appreciated that beacon code A, as described, can be implemented for virtually any number of subcarriers; another example may use 257 subcarriers with a period of 16 to create 16 * 256 = 4096 combinations for a 12-bit message. Additionally, other message sizes may also be used; 12-bit size is just one of a limitless number of examples.

, что может быть выражено следующим образом:According to another example, using the Reed-Solomon code, which is hereinafter referred to as the “A code of the beacon radio signals”, 211 subcarriers may be available for transmitting beacon symbols (for example, n = 211 by 402), while the beacon symbol may be a 12-bit message (including the data described previously); thus, a Reed-Solomon code may be required to support at least 2 ¹² = 4096 different sequences of non-binary characters (which are what the sector transmits, for example). According to this example, beacon symbols may be transmitted on an index subcarrier

that can be expressed as follows:

,

,

, α₁ и α₂ могут быть коэффициентами показателя степени, определенными, по меньшей мере, частично на основе сообщения маякового радиосигнала (как описано ниже), и

обозначает сложение по модулю. В этом примере p ₁ = 207 и

Другие примитивные элементы могут быть использованы для p ₁ в других примерах. Больший примитивный элемент может предоставлять большее частотное разнесение, поскольку небольшое значение p ₁ может подразумевать, что

ближе друг другу. Выбор

может иметь результатом код Рида-Соломона, который может характеризоваться посредством взвешенной суммы возрастающих экспоненциалов.where p ₁ may be a primitive element of the field Z ₂₁₁ (which may contain 211 elements representing subcarriers), and

, α ₁ and α ₂ may be exponent coefficients determined, at least in part, based on a beacon signal (as described below), and

denotes modulo addition. In this example, p ₁ = 207 and

Other primitive elements may be used for p ₁ in other examples. A larger primitive element may provide greater frequency diversity, since a small p ₁ value may imply that

closer to each other. The choice

can result in a Reed-Solomon code, which can be characterized by a weighted sum of increasing exponentials.

The coefficients of the exponent α ₁ and α ₂ can be set as follows:

для i = 1, 2, код вышеупомянутого уравнения может быть периодическим с периодом в 210/21=10 символов; таким образом, X(α ₁, α ₂)=X _t+10(α ₁, α ₂) для данного значения t, в одном примере. Символы маякового радиосигнала могут быть сдвинуты согласно поднесущей таким образом, например, чтобы передавать информацию приемнику.Thus, the total number 21 * 210 = 4410 different combinations of α ₁ and α ₂ can be set by means of the equation; this makes it possible to support, for example, a 12-bit message having 4096 available sequences. Additionally, each unique combination of α ₁ and α ₂ may correspond to a different message (and thus a different sequence of non-binary symbols for the beacon signal) in this regard. In the example, the message can be converted into accessible characters in almost any way, including randomly, by static assignment through network planning or configuration, based on statistics, etc. According to one example, for a given combination of α ₁ and α ₂ , the message, M, can be converted, for example, to M = 210 * α ₁ + α ₂ . Insofar as

for i = 1, 2, the code of the above equation may be periodic with a period of 210/21 = 10 characters; thus, X ( α ₁ , α ₂ ) = X _{t + 10} ( α ₁ , α ₂ ) for a given value of t , in one example. The beacon symbols may be shifted according to the subcarrier in such a way as to transmit information to the receiver, for example.

According to an example, a mobile device can reconstruct a message sent in a beacon radio signal using two beacon symbols in the presence of a sector even without time information. This can be done, for example, by receiving non-binary characters x ₁ and x ₂ at times t and t +1. Symbols may be expressed as follows:

or in matrix form:

и

равны двум конкретным элементам поля Z ₂₁₁. Используя эти уравнения, мобильный аппарат или терминал может разрешать

следующим образом:Where

and

equal to two specific elements of the field Z ₂₁₁ . Using these equations, a mobile device or terminal can resolve

in the following way:

следующим образом:After that, the terminal or mobile device can receive an exponent

in the following way:

The logarithm can be set relative to almost any primitive element of the field Z ₂₁₁ , and this value of y can be converted to a specific value of z . Accordingly, a lookup table may be implemented, for example, within an apparatus or terminal. The coefficient α _{1 of the} exponent and the time index t can be obtained as follows:

, чтобы получить

, например, и последующего разрешения α ₂ на основе

.The coefficient α ₂ can be obtained by replacing the extracted t by

, To obtain

, for example, and subsequent resolution of α ₂ based

.

In this regard, the terminal can also recover a message sent in a beacon signal using two non-consecutive beacon symbols that are not 10 characters apart in the presence of one sector, as well as conflicting or overlapping sequences of beacon symbols from two sectors using three consecutive characters beacon as shown above.

В этом примере,

p₁ - это примитивный элемент GF(Q), следовательно,

.In one example, the Reed-Solomon code of the beacon radio signals may encode the value M into a sequence of non-binary numbers in the set (0, 1, 2, ..., Q-1), where Q = 211. The position t in the sequence can be set by

In this example,

p ₁ is a primitive element of GF (Q), therefore,

.

, что может быть выражено следующим образом:Another example of the use of the MDS code, which is hereinafter referred to as “Beacon Radio Code B”, may use 47 subcarriers to transmit beacon symbols (for example, n = 47 in the subcarriers for a period of 402 symbols). As in the previous example, a 12-bit beacon code, for example, may require support for 4096 different sequences. To simplify this, a beacon symbol may be transmitted on an index subcarrier

that can be expressed as follows:

,

,

могут быть примитивными элементами поля Z₄₇ (которое может содержать 47 элементов, представляющих поднесущие), α ₁, α ₂ и α ₃ могут быть коэффициентами показателя степени, определенными, по меньшей мере, частично на основе сообщения маякового радиосигнала (как описано ниже), а

обозначает сложение по модулю. В этом примере коэффициенты показателя степени α ₁, α ₂ и α ₃ могут быть заданы следующим образом:Where

may be primitive elements of field Z ₄₇ (which may contain 47 elements representing subcarriers), α ₁ , α ₂ and α ₃ may be exponent coefficients determined at least in part based on a beacon signal (as described below), but

denotes modulo addition. In this example, the coefficients of the exponent α ₁ , α ₂ and α ₃ can be set as follows:

для i=1, 2, 3, код может быть периодическим, например, с периодом в 46/2=23 символа; таким образом,

для данного t.Thus, the total number 2 * 46 * 46 = 4232 different combinations of α ₁ , α ₂ and α ₃ can be set by means of the equation, thereby supporting the required 4096 combinations for the symbol of the beacon signal. A beacon message can be converted to a combination in one example as M = 2116 * α ₁ + 46 * α ₂ + α ₃ . Additional and / or alternative conversions may also be used as described above. Insofar as

for i = 1, 2, 3, the code can be periodic, for example, with a period of 46/2 = 23 characters; in this way,

for a given t.

The terminal or mobile device can recover this message or the code of the beacon signal, for example, using three characters of the beacon signal of the message. In the example, the device can receive three non-binary characters x ₁ , x ₂ and x ₃ at time t, t + 1 and t + 2, respectively. Binary characters can be expressed as follows:

or in matrix form:

и элементы B являются элементами поля Z ₄₇. Используя эти уравнения, мобильный аппарат или терминал может разрешать

следующим образом:Where

and elements B are elements of field Z ₄₇ . Using these equations, a mobile device or terminal can resolve

in the following way:

следующим образом:After that, the terminal or mobile device can receive degree indicators

in the following way:

The logarithm can be set with respect to almost any primitive element of the field Z ₄₇ , and a given value of y can be converted to a specific value of z . Accordingly, a lookup table may be implemented, for example, within an apparatus or terminal. The coefficients of the exponent α ₁ , α ₂ and α ₃ and the time index t can be obtained as follows:

Similarly, as shown in the previous example, the terminal can recover messages sent in the beacon radio signal using three consecutive characters in the presence of the sector. The terminal can also recover messages sent in two sectors using five consecutive signals, as shown above. This example code can be used if the number of subcarriers of a period of 402, 406, or 410 characters suitable for use in transmitting beacon symbols is less than 412, in one example.

, что может быть выражено следующим образом:Another example of the use of the MDS code, hereinafter referred to as the “Beacon Radio Code B 'code", may be a Reed-Solomon code constructed with 47 subcarriers to transmit beacon symbols (e.g., n = 47 in the subcarriers during the period 402 characters). As in the previous example, a 12-bit beacon code, for example, may require support for 4096 different sequences. To simplify this, a beacon symbol may be transmitted on an index subcarrier

that can be expressed as follows:

,

,

а α ₁, α ₂ и α ₃ могут быть коэффициентами показателя степени, определенными, по меньшей мере, частично на основе сообщения маякового радиосигнала (как описано в данном документе). В этом примере арифметические операции могут выполняться по полю Z₄₇, и в одном примере p ₁ = 45,

и

; другие примитивные элементы также могут быть использованы для p ₁. Выбор

имеет результатом, например, код Рида-Соломона в вышеприведенном уравнении. Дополнительно, α ₁, α ₂ и α ₃ могут быть заданы следующим образом:where p ₁ may be a primitive element of the field Z ₄₇ (which may contain 47 elements representing subcarriers),

and α ₁ , α _2, and α ₃ may be exponent coefficients determined at least in part based on a beacon signal (as described herein). In this example, arithmetic operations can be performed on the field Z ₄₇ , and in one example p ₁ = 45,

and

; other primitive elements can also be used for p ₁ . The choice

results, for example, in the Reed-Solomon code in the above equation. Additionally, α ₁ , α ₂ and α ₃ can be defined as follows:

для i=1, 2, 3, код может быть периодическим, например с периодом в 46/2=23 символа; таким образом,

для данного t.More than 4096 different combinations of α ₁ , α ₂ and α ₃ can be specified by equation. Insofar as

for i = 1, 2, 3, the code can be periodic, for example with a period of 46/2 = 23 characters; in this way,

for a given t.

The terminal or mobile device can recover this message or the code of the beacon signal, for example, using three characters of the beacon signal of the message. In the example, the device can receive three non-binary characters x ₁ , x ₂ and x ₃ at time instants t, t + 1 and t + 2, respectively. Binary characters can be expressed as follows:

or in matrix form:

и элементы B являются элементами поля Z ₄₇. Используя эти уравнения, мобильный аппарат или терминал может разрешать

следующим образом:Where

and elements B are elements of field Z ₄₇ . Using these equations, a mobile device or terminal can resolve

in the following way:

следующим образом:After that, the terminal or mobile device can receive an exponent

in the following way:

The logarithm can be set with respect to almost any primitive element of the field Z ₄₇ , and a given value of y can be converted to a specific value of z . Accordingly, a lookup table may be implemented, for example, within an apparatus or terminal. The coefficient of the exponent α ₁ and the time index t can be obtained as follows:

, чтобы получить

, и последующего разрешения α ₂ на основе

. Аналогично, коэффициент α ₃ может быть определен посредством замены t, полученного выше, на

, чтобы получить

, и последующего разрешения α ₃ на основе

. Более того, как показано в предыдущем примере, терминал может восстанавливать сообщения, отправляемые в маяковом радиосигнале, с помощью трех последовательных символов при наличии сектора. Терминал также может восстанавливать сообщения, отправляемые в двух секторах, с помощью пяти последовательных сигналов, как показано выше. Этот примерный код может использоваться, если число поднесущих периода 402, 406 или 410 символа, подходящего для использования при передаче символов маякового радиосигнала, меньше чем 412, например.The coefficient α ₂ can be determined by replacing t obtained above by

, To obtain

, and subsequent resolution of α ₂ based

. Similarly, the coefficient α ₃ can be determined by replacing t obtained above with

, To obtain

, and subsequent resolution of α ₃ based

. Moreover, as shown in the previous example, the terminal can recover messages sent in the beacon radio signal using three consecutive characters in the presence of the sector. The terminal can also recover messages sent in two sectors using five consecutive signals, as shown above. This example code can be used if the number of subcarriers of a period of 402, 406, or 410 symbols suitable for use in transmitting beacon symbols is less than 412, for example.

. Здесь

p₁ - это примитивный элемент GF(Q), следовательно,

.In one example, the Reed-Solomon code of a beacon radio signal may encode the value M into a sequence of non-binary numbers in the set (0, 1, 2, ..., Q-1), where Q = 47. The position t in the sequence can be set by

. Here

p ₁ is a primitive element of GF (Q), therefore,

.

, код маякового радиосигнала может быть полиномиальной функцией, имеющей три члена

и

сформированные с помощью трех примитивных элементов. В общем примере полиномиальный код может быть разработан так, чтобы терминал мог декодировать маяковый радиосигнал на основе R символов маякового радиосигнала, где

Для символа маякового радиосигнала с временным индексом t, передаваемого по несущей с индексом

, который может быть выражен следующим образом:As shown in the formula

, the beacon code may be a polynomial function having three members

and

formed using three primitive elements. In a general example, a polynomial code may be designed so that a terminal can decode a beacon radio signal based on R beacon symbols, where

For a beacon symbol with a time index t transmitted on a carrier with an index

which can be expressed as follows:

обозначает сложение по модулю. Кроме того,where p ₁ - p _R can be primitive elements of the field Z _S , α ₁ -α _R can be exponent coefficients determined, at least in part, based on the message of the beacon signal (as described herein), S is the number of subcarriers used to transmit the beacon radio signal (or the total number available to transmit the symbols of the beacon radio signal), q is a parameter determined based on the length of the polynomial code and S, and

denotes modulo addition. Besides,

where β _ij may be 0 or 1.

Таким образом, операции в вышеприведенных уравнениях этого примера могут выполняться по полю Z_S, как описано выше, так что они все осуществляются по модулю S. R и S могут быть выбраны, по меньшей мере, частично на основе

где M - это число сообщений, поддерживаемых посредством полиномиального кода, к примеру, а L - это длина полиномиального кода. Коды, использующие этот формат, могут иметь следующие свойства: коды могут иметь период в L символов, так что

до L-1 секторов могут быть разрешены детерминированно, если удовлетворяется

и L может быть числом циклических сдвигов кодового слова, которое декодируется к тому же сообщению.Field Z _S may include S elements from 0 to S-1, where

Thus, the operations in the above equations of this example can be performed on the field Z _S , as described above, so that they are all carried out modulo S. R and S can be selected at least partially based on

where M is the number of messages supported by the polynomial code, for example, and L is the length of the polynomial code. Codes using this format can have the following properties: codes can have a period of L characters, so

up to L-1 sectors can be resolved deterministically if satisfied

and L may be the number of cyclic shifts of the codeword that is decoded to the same message.

и коэффициенты показателя степени могут быть заданы следующим образом:The parameter q can be described as

and exponent coefficients can be set as follows:

различных комбинаций для α ₁-α _R может быть получено с помощью ограничений, показанных выше. Каждая уникальная комбинация α ₁-α _R может соответствовать различному сообщению и, следовательно, различной последовательности недвоичных символов для маякового радиосигнала. Сообщение может быть преобразовано в соответствующую комбинацию α ₁-α _R следующим образом:Total

different combinations for α ₁ - α _R can be obtained using the restrictions shown above. Each unique combination of α ₁ - α _R can correspond to a different message and, therefore, to a different sequence of non-binary symbols for the beacon radio signal. A message can be converted to the corresponding combination of α ₁ - α _R as follows:

It should be appreciated that other transformations between the message and the combination α ₁ - α _R can also be used.

Для символа маякового радиосигнала с кодом Рида-Соломона с временным индексом t, передаваемого по несущей с индексом

, который может быть выражен следующим образом:In general, the Reed-Solomon code can be designed so that the terminal can decode the beacon radio signal based on R symbols of the beacon radio signal, where

For a beacon symbol with a Reed-Solomon code with a time index t transmitted on a carrier with an index

which can be expressed as follows:

для m = 2,...,R, α ₁-α _R могут быть коэффициентами показателя степени, определенными, по меньшей мере, частично на основе сообщения маякового радиосигнала, S может быть числом поднесущих, используемых для того, чтобы передавать маяковый радиосигнал, и q может быть параметром, определенным на основе длины кода маяковых радиосигналов и S, как описано ранее.where p ₁ may be a primitive element of the field Z _S , and

for m = 2, ..., R, α ₁ - α _R may be exponent coefficients determined, at least in part, from the message of the beacon signal, S may be the number of subcarriers used to transmit the beacon signal, and q may be a parameter determined based on the code length of the beacon signals and S, as described previously.

As shown, the beacon code may have the MDS property, which allows decoding the message, for example, based on the minimum number of received beacon symbols. If S subcarriers are available for transmitting beacon signals, then S ² different messages can be sent using two symbol periods. In this regard, the beacon subcarrier can be interpreted as an element of the non-binary alphabet Z _S = {0, 1, ..., S-1}. The beacon sequence can also be interpreted as a block code (n, k) in Z _S , where k = 2 and n = L.

The beacon code may be designed to also have the cyclic shift invariant property, so that the cyclic shifts of the codeword can be decoded to the same message, for example. This property may be required for asynchronous sectors that can transmit beacon symbols at the same time. In this example, using one or more of the coding schemes presented above, M = S ² / L messages can be supported if L cyclic shifts of the codeword are decoded to a single message. For a given value of L, the smallest value for S can be selected so that the required number of messages M is supported, and L can be selected, for example, in part based on a compromise between the number of subcarriers S and diversity. A larger L may result from a larger number of subcarriers in a given M, and a smaller L may result in lower diversity, which may correspond to less ability to resolve the ambiguity of beacon sequences from different sectors in the presence of collisions.

, в одном примере. Таким образом, неоднозначность до 9 секторов может быть разрешена, если длина кода L=10. Используя код B маяковых радиосигналов, неоднозначность маяковых радиосигналов из Q секторов может быть разрешена с помощью 2Q+1 символов маякового радиосигнала, где

. В этом отношении неоднозначность до 11 секторов может быть разрешена, где L=23.Beacon codes can also be designed to facilitate the detection of various sectors transmitting beacon signals at the same time, which may be referred to as ambiguity resolution. The terminal can receive codewords of a beacon signal from Q sectors simultaneously, where Q> 1, for example. Sequences from sector 1, for example, can be denoted as x ₁ (0), x ₁ (1), ..., a sequence from sector 2 can be x ₂ (0), x ₂ (1), ..., and etc., while the sequence from sector Q can be designated x _Q (0), x _Q (1), .... The code of the beacon signal may be such that the terminal does not receive a decoded sequence in the form { x _S1 (0 ), x _S2 (1), x _S3 (2), ...}, where S1, S2 and S3 are, for example, different sectors. Using the A code of the beacon radio signals set above, the ambiguity of the sequences of the beacon radio signals from Q different sectors can be resolved using Q + 1 characters of the beacon radio signal, where

, in one example. Thus, ambiguity of up to 9 sectors can be resolved if the code length is L = 10. Using code B of the beacon signals, the ambiguity of the beacon signals from Q sectors can be resolved using 2Q + 1 characters of the beacon signal, where

. In this regard, ambiguity of up to 11 sectors can be resolved, where L = 23.

It will be appreciated that other MDS schemes may also be used, such as, for example, a cleared MDS code designed so that a terminal or apparatus can decode a beacon radio signal based only on one beacon symbol. It should be appreciated that beacon codes can be selected according to many factors, such as those mentioned in this document, including network planning, extracted information regarding other sectors or beacons, as well as based on the length of the beacon message, the number of available carriers, required performance (for example, signal-to-noise ratios), etc.

Referring to FIG. 5, a representation of a bandwidth over a period of time 500 is shown. The bandwidth may have a certain number of symbol clusters 502, 504, and 506, which simplify the transmission of overhead beacon radio signals with a clock metric. Clusters 502, 504, and 506 can represent time periods in a passband where beacon symbols are transmitted. As shown, clusters are transmitted along with time periods between 508. The time period may be consistent or different over time. For this example, the time period between cluster transmission 508 may be 1 second. Additionally, the cluster may be part of a repeating synchronization cycle. For example, the clusters shown may represent one cycle, where 502 is the first cluster to transmit, 504 is the second, and 506 may be the nth cluster in the n cluster cycle.

In one example, each cluster 502 (as well as 504 and 506, although not represented by reference numbers) may contain four beacon symbols 510, 512, 514, and 516 of the beacon radio signals in the OFDM cluster 502 and 3 of 518, 520, and 522 low spectral density power (PSD) (such as pseudo-random noise (PN) sequences) between beacon symbols to separate beacon radio signals with high PSD. In this example, the synchronization cycle may contain 16 clusters, so 502 is cluster 1, 504 is cluster 2, and 506 represents cluster 16, for example. In one example, the frequency spectrum may be 20 MHz, so 4 carriers may be used having 2048 tones or subcarriers; in addition, a beacon radio signal can be sent on 257 indicated tones with a certain diversity. The synchronization loop can be used to send a 22-bit synchronization metric, which can be divided into three bytes, X ₁ , X ₂ , X ₃ . 4 bits in X ₁ can be used with a code (64, 3) in a Galois field (GF) of 257 elements to encode three bytes, which allows to increase the reliability of information transfer, resist various types of ambiguities and, in essence, implement properties as described above.

, поскольку w может проверяться для того, чтобы определять, имеет ли оно порядок 64, посредством разрешения

в GF(257). В области преобразования Галуа-Фурье (GFT) его компоненты могут быть обозначены как {C _i}_i=0,...,63, и информация синхронизирующего показателя

,

,

может быть помещена в C ₁, C ₂ и C ₃, и все остальные байты, например, могут равняться нулю. Впоследствии компоненты области GFT могут быть преобразованы в кодовое слово {c_i}_i=0,...,63 через преобразование Галуа-Фурье:According to an example of the above configuration, Reed-Solomon codes can be used to encode beacon radio signals in the GF field (257), since the codeword length of 64 divides 257-1 = 256. To convert a beacon message into a codeword, the prime p in GF (257) can be selected and specified

, since w can be checked in order to determine if it is of order 64, by means of permission

in GF (257). In the field of the Galois Fourier transform (GFT), its components can be denoted as { C _i } _{i = 0, ..., 63} , and information of the synchronizing indicator

,

,

can be placed in C ₁ , C ₂ and C ₃ , and all other bytes, for example, can be zero. Subsequently, the components of the GFT domain can be transformed into the codeword {c _i } _{i = 0, ..., 63} through the Galois-Fourier transform:

где t _i - это тон, по которому передается i-й маяковый радиосигнал, а T-1 - это разнесение между допустимыми тонами, например.The generated codeword can then be converted to tones using almost any conversion procedure, so that the receiver can perform the inverse transform of tones, for example, to generate a codeword. One possible scheme is linear transformation, so

where t _i is the tone along which the i- th beacon radio signal is transmitted, and T -1 is the spacing between valid tones, for example.

или эквивалентно, ненулевые кодовые слова имеют не более k-1 нулей. Затем, если k или более последовательных кодированных символов совместно используются, по меньшей мере, посредством двух кодовых слов,

, то

, который также может быть кодовым словом вследствие нелинейности кодов Рида-Соломона, может иметь больше k-1 нулей и противоречит свойству MDS. Таким образом, каждый раз, когда k или более последовательных кодированных символов наблюдается, корректное кодовое слово может быть получено, если символы корректно обнаружены. В случае синхронизирующего показателя приемник, в этом отношении, может декодировать сообщение, если принят один кластер, удовлетворяющий эффективному декодируемому свойству.The use of such codes can achieve the required beacon code properties defined in this document: efficient decoding, resolution of frequency and / or time offset, resolution of conflicting characters, etc. For example, a Reed-Solomon code (n, k) (for example, a Reed-Solomon code that has nk consecutive zeros in the GFT domain) may have MDS in which the minimum distance is

or equivalently, non-zero codewords have at most k-1 zeros. Then, if k or more consecutive coded symbols are shared by at least two codewords,

then

, which can also be a codeword due to the nonlinearity of Reed-Solomon codes, can have more than k -1 zeros and contradicts the MDS property. Thus, every time k or more consecutive coded characters are observed, a correct codeword can be obtained if the characters are correctly detected. In the case of a synchronization metric, the receiver, in this regard, can decode the message if one cluster is received that satisfies the effective decoded property.

In addition, the ambiguity of a multiple access point (or base station) can also be resolved. For example, if (k-1) M + 1 consecutive coded characters are received (for example, using (n, k) nodes), then M different sequences can be distinguished. Since possible sequences may contain k or more characters from one base station or another transmitter, the MDS property can be used to resolve character ambiguity. In the configuration of the above examples, n = 64 and k = 3; thus, if 16 consecutive clusters are received, 31 base stations, access points, or other transmitters having different clocks can be distinguished using this coding scheme; also other values for n and k can be used in other examples.

, для всех i=0,..., 63 (свойство сдвига во времени). В примере, использующем 22-битовый синхронизирующий код, поясненном ранее, поскольку X ₁ имеет только 4 бита и, следовательно, варьируется от 0 до 15, не все кодовые слова используются для того, чтобы представлять сообщения. Например, сообщение

может быть принято, т.е. смещение; согласно свойству сдвига во времени

или эквивалентно

где t может быть сдвигом в кластерах. Затем

. Поскольку корректное смещение во времени t может быть определено, оставшиеся два байта X ₂ и X ₃ могут быть определены. Полное кодовое слово, в этом отношении, делится на 4 части, и сообщение может быть передано в фактор-пространстве.Additionally, the time shift ambiguity can also be resolved if one or more clusters are detected and the position within the whole codeword is unknown. According to the GFT theory for a finite field, a shift of t symbols in the time domain can be equivalent to scaling C _i by

, for all i = 0, ..., 63 (time shift property). In the example using the 22-bit synchronization code explained earlier, since X ₁ has only 4 bits and therefore varies from 0 to 15, not all code words are used to represent messages. For example, a message

can be taken i.e. bias; according to the time shift property

or equivalent

where t can be a shift in clusters. Then

. Since the correct time offset t can be determined, the remaining two bytes X ₂ and X ₃ can be determined. The complete codeword, in this regard, is divided into 4 parts, and the message can be transmitted in factor space.

, что не является кодовым словом, поскольку C ₀ равно 0 в выбранном коде Рида-Соломона. Поскольку последовательность (Δ, Δ..., Δ) не является кодовым словом, это может подразумевать то, что (c ₁ + Δ,c ₂ + Δ,..., c ₆₃ + Δ) также не является кодовым словом; таким образом, Δ может быть обнаружен, чтобы восстанавливать первоначальное кодовое слово, разрешая неоднозначность сдвига частоты.In addition, the frequency shift ambiguity can be corrected by spacing between valid tones, in one example. If the frequency shift is large enough, then it can change the codeword ( c ₁ , c ₂ , ..., c ₆₃ ) to ( c ₁ + Δ, c ₂ + Δ, ..., c ₆₃ + Δ), where Δ = frequency shift divided by T. GFT sequence (Δ, Δ, ..., Δ) is

, which is not a codeword, since C ₀ is 0 in the selected Reed-Solomon code. Since the sequence (Δ, Δ ..., Δ) is not a codeword, this may imply that ( c ₁ + Δ, c ₂ + Δ, ..., c ₆₃ + Δ) is also not a codeword; thus, Δ can be detected to restore the original codeword, resolving the frequency shift ambiguity.

где M может быть матрицей преобразования с

Если в области GFT последние k компонентов не являются постоянно нулями (к примеру, они содержат данные или другую информацию), то формула в матричной форме может быть задана посредством

где

- это матрица n×k, состоящая из последних k столбцов матрицы M, а

- это k-вектор, содержащий последние k элементов в

. Когда сдвиг частоты существует в принимаемых символах, что может указывать потребность в подстройке приемника, например, последовательность может быть задана следующим образом:In one example, however, detecting Δ can be time-consuming and thus an efficient algorithm can be used to find Δ. The inverse GFT formula used to generate the Reed-Solomon code, as mentioned, can be , where {C _i } _{i = 0, ..., n-1} can be components in the GFT domain, and w can be an element with order (q-1) / n. In matrix form, a formula can be defined by

where M can be a transformation matrix with

If in the GFT domain the last k components are not constantly zeros (for example, they contain data or other information), then the formula in matrix form can be defined by

Where

is an n × k matrix consisting of the last k columns of the matrix M, and

is a k-vector containing the last k elements in

. When a frequency shift exists in the received symbols, which may indicate a need for tuning the receiver, for example, the sequence can be specified as follows:

- это вектор-столбец, все элементы которого равны единице. Следует принимать во внимание, что подпространство Ω, охватываемое посредством кодовых слов, имеет размерность k, и

не попадает в Ω. Таким образом, вектор

, который является ортогональным по отношению к Ω, но не к

, может быть определен. Дополнительно следует принимать во внимание, что этот вектор

может быть вычислен автономно и/или сохранен, например, в запоминающем устройстве. Посредством умножения обеих сторон вышеупомянутого матричного уравнения

по обеим сторонам, оценка Δ может быть оценена следующим образом:Where

is a column vector whose all elements are equal to one. It should be borne in mind that the subspace Ω covered by codewords has dimension k, and

does not fall into Ω. So the vector

which is orthogonal with respect to Ω, but not to

may be determined. Additionally, it should be borne in mind that this vector

can be calculated autonomously and / or stored, for example, in a storage device. By multiplying both sides of the above matrix equation

on both sides, the estimate of Δ can be estimated as follows:

Using this formula, it is possible to efficiently generate a frequency bias, since only the internal product can be required for the numerator and denominator, which should be obtained independently.

Turning now to FIG. 6, a diagram 600 of several cells in a wireless communication network is shown. A network may comprise a plurality of base stations 602 having one or more transmission carriers or sectors; for example, as shown, each base station may have 3 sectors, each of which may be assigned a specific carrier. In this drawing, the carriers are adjacent from sectors using different carriers, in order, for example, to reduce interference on the carrier. This may be referred to, for example, as frequency use having a coefficient of 3.

Radio beacon symbols in such a network configuration may be transmitted with or without frequency reuse; for example, a single carrier to base station 602 may transmit a beacon symbol, or multiple carriers may transmit it. Additionally, data transmission can also use configurations such as creating some possible combinations of a beacon signal and using carrier data. In one example, beacon data and symbols may be transmitted on a single carrier. This makes it possible to reduce the amount of overhead information for beacon symbols, since the preferred carrier can be used for both beacon signals and data. In another example, beacon symbols may be transmitted on multiple carriers, and data on a single carrier. This configuration may enable mobile devices to detect beacon radio signals on different carriers without interrupting the current data exchange on the data carrier. Additionally, more power can be provided to the beacon symbol (for example, simplifying the detection of control signals by out-of-band devices), in one example, since data transmissions are not interrupted in order to transmit the beacon signal. It will be appreciated that other configurations are also possible, such as the inverse of the above configuration, as well as the use of data and beacon radio signals from several of the available sectors for transmission.

As previously described, beacon radio codewords can be sent with information regarding the beacon radio signal or its transmitter (or virtually any information) to a plurality of mobile devices. In one example, the beacon codeword may be a 12-bit code that includes 9 bits for a sector identifier or control PN, 2 bits for a preferred carrier index within the range of 0-3 and 1 reserved bit. It should be borne in mind that unlimited possibilities in terms of size and content of messages of beacon radio signals are allowed; this is just one example to simplify the further explanation. In the example, base stations 602 may send similar or unique beacon messages to enable mobile devices to identify them. Base stations 602 may use the coding schemes described above to achieve the desired properties of efficient decoding, ambiguity resolution, etc. In addition, mobile devices (not shown) receiving characters may have functionality in order to interpret the characters appropriately.

Referring to FIG. 7-8, methodologies are illustrated regarding broadcast transmission and interpretation of beacon symbols according to a beacon radio coding scheme. Although, in order to simplify the explanation, the methodologies are shown and described as a sequence of actions, it is necessary to understand and take into account that the methodologies are not limited by the order of actions, since some actions may, in accordance with one or more embodiments, be performed in a different order and / or in parallel with the actions, different from the actions shown and described in this document. For example, those skilled in the art should understand and take into account that a methodology can alternatively be represented as a sequence of interrelated states or events, for example, in a state diagram. Moreover, not all illustrated acts may be used to implement a methodology in accordance with one or more embodiments.

Turning to FIG. 7, illustrated is a methodology 700 that facilitates encoding and transmitting a beacon radio signal according to a circuit having properties such as those illustrated herein (e.g., efficient partial decoding of beacon radio signals, resolution of ambiguities and shifts, etc.). At 702, a beacon signal is initialized; the beacon signal may contain information, for example, regarding the beacon signal, its transmitter, or virtually any information that must be transmitted by the beacon signal. The message may have a fixed or varying size; according to possible examples described herein, a beacon signal may have, for example, a 12-bit or 22-bit clock size. At step 704, the beacon message can be encoded into multiple characters using a coding scheme such as those described herein, including the beacon code A, the beacon code A ', the beacon code B, the beacon code B', and Reed codes Solomon's beacon radio signals, synchronizing indicators and / or their variations with almost any variable values, as described in the general examples.

Symbols may be OFDM symbols of certain periods within one or more superframes; during the symbol period, the beacon symbol may be transmitted on a subcarrier that corresponds to the created symbol. In this regard, the selected subcarrier may indicate information in the beacon message. In one example, a beacon symbol may be the only symbol transmitted on a carrier during a specified symbol period. At 706, the symbols are mapped to a plurality of bandwidth tones, which must be mapped to a time domain for transmitting a beacon signal. Tones can be sent in a patterned sequence, for example, at one or more different time periods / symbol in step 708. This can be done in the form of a broadcast using almost all of the carrier power, in one example, in order to, for example, reach mobile devices that can to be far away.

Now referring to FIG. 8, a methodology 800 is illustrated that facilitates receiving and decoding a plurality of beacon symbols. The beacon symbols may be part of a beacon message encoded as part of the coding scheme described previously, including beacon code A, beacon radio code A, beacon radio code B, beacon radio code B, Reed-Solomon beacon codes , synchronizing indicators (sizes) and / or their variations with almost any variable values, as described in the general examples. In this regard, beacon signals may have the desired properties described above, including partial decoding of the beacon signal, resolution of the ambiguities of the beacon signals, resolution of time and frequency offsets, etc. At 802, a minimum number of beacon symbols may be received for decoding the beacon. As described, in some cases, this may be a significantly smaller number of signals than the number in the entire codeword of the beacon signal. Additionally, characters may be received at certain time periods, sequentially, arbitrarily, etc.

At step 804, using the code properties of the beacon signal, as explained above, zero or more additional characters in the message can be predicted to supplement the message beacon signal. This prediction may use a minimum number of characters, as described above, to satisfy the linear constraint on the character field. After satisfying the constraint, the remaining symbols are determined to form a complete beacon message. At 806, a beacon signal can be decoded and interpreted to, for example, obtain information about the beacon signal and / or its transmitter. It should be appreciated that the methodology can be used to correct the frequency or time offset and / or also to allow ambiguous sent beacon symbols.

It will be appreciated that, in accordance with one or more aspects described herein, inferences can be made regarding the selection or determination of symbol subcarriers to which one or more beacon symbols should be sent, as described. As used herein, the term “inferring” or “inference” usually means the process of reasoning or designating system states, environments and / or users from a set of observation data obtained through events and / or data. Inference can be used to identify a specific context or action, or it can form a probability distribution, for example, by state. The logical conclusion can be probabilistic, i.e. calculating a probability distribution over states of interest based on an analysis of data and events. Inference can also refer to techniques used to compose high-level events from a set of events and / or data. Such a logical conclusion leads to the compilation of new events or actions from a set of observable events and / or stored event data, regardless of whether events are related in close time proximity and whether events and data come from one or more sources of events and data.

According to an example, one or more of the methods presented above may include making inferences regarding the selection of one or more symbol subcarriers for transmitting beacon symbols. As an additional illustration, a logical conclusion can be made regarding the information collected on other objects transmitting the symbols of the beacon signal (if obtained by the logical output of the object or other objects moving in the transmission zone). It should be appreciated that the above examples are illustrative in nature and are not intended to limit the number of logical conclusions that can be drawn, or the way these logical conclusions are made in connection with various embodiments and / or methods described in this document.

FIG. 9 is an illustration of a mobile device 900 that facilitates receiving beacon symbols on a plurality of subcarriers (eg, for a superframe in an OFDM communication network) that may indicate information, such as a beacon message. Mobile device 900 includes a receiver 902, which receives a signal, for example, from a receiving antenna (not shown) and performs typical actions (for example, filters, amplifies, converts with decreasing frequency, etc.) with the received signal and digitizes the signal to the required signal parameters to get samples. Receiver 902 may be, for example, an MMSE receiver and may comprise a demodulator 904 that can demodulate received symbols and provide them to a processor 906 for channel estimation. The processor 906 may be a processor for analyzing information received by the receiver 902, and / or generating information for transmission by the transmitter 916, a processor that controls one or more components of the mobile device 900, and / or a processor that analyzes information received by the receiver 902, generates information for transmission by the transmitter 916 and controls one or more components of the mobile device 900.

Mobile device 900 may further comprise a storage device 908 that is operatively connected to a processor 906 and which can store data to be transmitted, received data, information associated with available channels, data associated with the analyzed signal intensity and / or interference, information related to the assigned channel, power, speed, etc., and any other suitable information for channel estimation and data exchange through the channel. Storage device 908 may further store protocols and / or algorithms associated with channel estimation and / or use (e.g., performance-based, bandwidth-based, etc.). In addition, the storage device 908 may include instructions for decoding the beacon radio signals and their symbols and determining the beacon radio signals from the minimum or required number of characters less than the total number of characters in the beacon radio signal, as described herein.

It will be appreciated that the data store (e.g., storage device 908) described herein may be a volatile storage device or non-volatile storage device, or may include both volatile and non-volatile storage device. By way of illustration, but not limitation, non-volatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable PROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM), which acts as an external cache. By way of illustration, but not limitation, RAM is available in many forms, 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 storage device 908 of the present systems and methods is intended to contain (but not only) these and any other suitable types of storage devices.

The receiver 902 is further operatively connected to a beacon symbol decoder 910, which can decode and / or evaluate the beacon symbols received over the passband to determine a subcarrier index that may refer to an element in the field associated with the passband subcarriers. The subcarrier index may be transmitted to the beacon signal resolution module 912, where after receiving the minimum number of other subcarrier indices associated with the beacon radio signal (for example, symbols in the beacon signal codeword), the beacon signal symbol resolver 912 may determine the entire sequence of beacon symbols for reporting the beacon signal and decode the message beacon signal, for example, to receive information about the beacon signal and / or its transmitter . The minimum number of characters required for reception may be specified by the coding schemes presented above. Additionally, the lighthouse radio signal resolving module 912 may resolve the ambiguity in the lighthouse radio signals after receiving a certain number of symbols, as described with reference to the previous drawings and examples. In addition, the module 912 resolution beacon radio signals can correct the shift in time or frequency in the mobile device 900 using the algorithms shown above. The mobile device 900 further further comprises a modulator 914 and a transmitter 916, which can transmit a communication signal, for example, to a base station, another mobile device, etc. In one example, a response to a decoded beacon symbol may be sent. Although illustrated as being separate from the processor 906, it should be appreciated that the beacon symbol decoder 910, the beacon resolution module 912 and / or modulator 914 may be part of a processor 906 or a series of processors (not shown).

FIG. 10 is an illustration of a system 1000 that facilitates transmitting one or more beacon symbols in a beacon message on subcarriers that represent the contents of a beacon message. For example, system 1000 may operate in an OFDM communication network in which beacon symbols may be sent using one or substantially one subcarrier. System 1000 comprises a base station 1002 (e.g., an access point, etc.) with a receiver 1010 that receives signal (s) from one or more mobile devices 1004 (and a demodulator 1012 that can demodulate these signals) through multiple receive antennas 1006, and a transmitter 1024 that transmits to one or more mobile devices 1004 via a transmit antenna 1008. The transmitter 1024 may transmit one or more beacon symbols, for example, associated with a base station 1002. A beacon symbol may identify information on a base station 1002 and / or one or more of its sectors. For example, a beacon symbol may serve to identify a base station 1002 and / or sector; in addition, the beacon symbol may be part of a beacon message that encompasses a plurality of beacon symbols, in one example. A beacon symbol may be modulated to the frequency domain by a modulator 1022 and transmitted by one or more transmitter antennas 1008 using a transmitter 1024, for example.

For example, a base station may use a beacon radio encoder 1018 to apply a coding scheme to a beacon signal (such as A, A ', B, B' code of a beacon, Reed-Solomon codes, clock indicators, and / or virtually any code described in this document in a specific or general implementation). As described, practically any coding scheme can be used that satisfies the required properties of partial interpretation of characters, ambiguity resolution, resolution of time and / or frequency shifts, etc., by creating a linear field constraint on the plurality of carrier subcarriers to be satisfied by means of the subcarrier positions of the beacon messages. A beacon radio encoder 1018 may generate a plurality of subcarrier indices for various symbols to facilitate transmission of a desired message, and a beacon radio symbol assignment module 1020 may appropriately assign beacon symbols to subcarriers and / or predetermined time periods. After modulating the symbols with a modulator 1022, transmitter 1024 may broadcast the beacon symbols to one or more mobile devices 1004. As described, mobile devices 1004 may apply the decoding algorithms presented herein to a subset of the total number of beacon symbols in the code to efficiently interpret the beacon message. Additionally, the beacon code for the base station 1002 may be transmitted periodically as a repeating sequence and / or may be an infinite or one time sequence. In one example, the symbol sequence for the beacon codeword may also be dynamic. Additionally or alternatively, some or all of the beacon radio encoder 1018 and the beacon symbol symbol assignment module 1020 may be permanently located in or be implemented by the processor 1014. In addition, the memory 1016 may contain instructions to simplify the above functionality. In addition, the storage device 1016 may also contain information regarding symbol periods and / or subcarriers to use in transmitting beacon symbols.

FIG. 11 illustrates an example wireless communication system 1100. The wireless communication system 1100 shows one base station 1110 and one mobile device 1150 for short. However, it should be appreciated that the system 1100 may include more than one base station and / or more than one mobile device, while additional base stations and / or mobile devices may be much similar or different from the approximate base station 1110 and mobile device 1150, described below. In addition, it should be borne in mind that the base station 1110 and / or mobile device 1150 can use systems (Figs. 1-3 and 9-10), techniques / configurations (Figs. 4-6) and / or methods (Fig. 7 -8) described in this document to facilitate wireless communication between each other.

At base station 1110, traffic data for a number of data streams is provided from a data source 1112 to a transmit (TX) data processor 1114. According to an example, each data stream may be transmitted over a respective antenna. TX data processor 1114 formats, codes, and interleaves the traffic data stream based on the particular coding scheme selected for that data stream to provide encoded data.

The encoded data for each data stream can be multiplexed with pilot data using orthogonal frequency division multiplexing (OFDM) techniques. Additionally or alternatively, the pilot symbols may be frequency division multiplexed (FDM), time division multiplexed (TDM) or code division multiplexed (CDM). The pilot data is typically a known data template that is processed in a known manner and can be used in mobile device 1150 in order to evaluate the channel response. Multiplexed control signals and encoded data for each data stream can be modulated (e.g. symbolically converted) based on a specific modulation scheme (e.g., binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), M-phase shift keying (M-PSK ), M-quadrature amplitude modulation (M-QAM), etc.) selected for this data stream to provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions executed or provided by processor 1130.

Modulation symbols for all data streams may be provided to the TX MIMO processor 1120, which may further process modulation symbols (eg, for OFDM). The TX MIMO processor 1120 further provides N _T modulation symbol streams to N _T transmitters (TMTR) 1122a-1122t. In various embodiments, TX MIMO processor 1120 applies beamforming weights to the symbols of the data streams and to the antenna from which the symbol is to be transmitted.

Each transmitter 1122 receives and processes a respective symbol stream to provide one or more analog signals, and further leads to the desired parameters (e.g., amplifies, filters, and upconverts) the analog signals to provide a modulated signal suitable for MIMO transmission channel. Additionally, N _T modulated signals from transmitters 1122a through 1122t are then transmitted from N _T antennas 1124a through 1124t, respectively.

In the mobile device 1150, the transmitted modulated signals are received by N _R antennas 1152a-1152r and the received signal from each antenna 1152 is provided to a respective receiver (RCVR) 1154a-1154r. Each receiver 1154 leads to the required parameters (for example, filters, amplifies, and downconverts) the corresponding signal, digitizes the signal reduced to the required parameters to provide samples, and further processes the samples to provide a corresponding “received” symbol stream.

An RX data processor 1160 may receive and process N _R received symbol streams from N _R receivers 1154 based on a specific receiver processing technique to provide N _T “detected” symbol streams. An RX data processor 1160 may demodulate, interleave, and decode each detected symbol stream to recover traffic data for the data stream. The processing by the RX data processor 1160 is complementary to the processing performed by the TX MIMO processor 1120 and TX data processor 1114 at the base station 1110.

The processor 1170 may periodically determine which precoding matrix to use, as explained above. Additionally, processor 1170 may formulate a reverse link message comprising a matrix index portion and a rank value portion.

The reverse link message may comprise various types of information related to the communication link and / or the received data stream. The reverse link message can be processed by TX data processor 1138, which also receives traffic data for a number of data streams from data source 1136, is modulated by modulator 1180, adjusted to desired parameters by transmitters 1154a-1154r, and transmitted back to base station 1110.

At base station 1110, the modulated signals from mobile device 1150 are received via antennas 1124, adjusted to desired parameters by receivers 1122, demodulated by demodulator 1140, and processed by RX data processor 1142 to extract a reverse link message transmitted from mobile device 1150. Additionally processor 1130 may process the extracted message to determine which precoding matrix to use to determine the charting weights s orientation.

Processors 1130 and 1170 can direct (for example, monitor, coordinate, manage, etc.) work in the base station 1110 and mobile device 1150, respectively. The respective processors 1130 and 1170 may be associated with a storage device 1132 and 1172 that stores program codes and data. Processors 1130 and 1170 can also perform calculations to obtain frequency and impulse response estimates for the uplink and downlink, respectively.

It should be understood that the embodiments described herein may be implemented by hardware, software, firmware, middleware, microcode, or any combination of the above. When implemented in hardware, processing units can be implemented in one or more specialized integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), user programmable matrix LSIs (FPGAs) , processors, controllers, microcontrollers, microprocessors, other electronic units designed to perform the functions described in this document, or combinations thereof.

When embodiments are implemented in software, firmware, middleware, or microcode, the program code or code segments can be stored on a computer-readable medium, such as a storage component. A code segment can represent a procedure, function, subprogram, program, standard procedure, nested procedure, module, software package, class, or any combination of instructions, data structures, or program statements. A code segment may be associated with another code segment or a hardware circuit by transmitting and / or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. can be transmitted, forwarded or forwarded by any appropriate means, including memory sharing, messaging, hand-off, data transmission over the network, etc.

When implemented in software, the techniques described in this document can be implemented using modules (for example, procedures, functions, etc.) that perform the functions described in this document. Program codes can be stored in a storage device and executed by the processor. The storage device can be implemented in the processor or externally with respect to the processor, and in the second case, it can be functionally connected to the processor using various means known in the art.

With reference to FIG. 12, a system 1200 is illustrated that broadcasts encoded beacon symbols that can satisfy a linear field constraint associated with the number of subcarriers used to transmit beacon signals. For example, system 1200 may reside at least partially within a base station. It should be appreciated that the system 1200 is presented as including functional blocks, which may be functional blocks that represent functions implemented by a processor, software, or a combination of the above (e.g., firmware). System 1200 includes a logical grouping of 1202 electrical components that can act in conjunction. For example, logical grouping 1202 may include an electrical component for initializing a code for beacon radio signals 1204. For example, the code word for a beacon radio signal may contain information regarding a transmitting entity and / or its communication. As previously described, for example, the beacon codeword may be a 12-bit code and / or a 22-bit clock indicator in two examples. It should be appreciated that the beacon code can also accept almost any data configuration. Additionally, the logical grouping 1202 may comprise an electrical component for encoding the beacon code into a plurality of beacon symbols according to a coding scheme, wherein the coding scheme may be allowed from a portion of characters less than or equal to the total number of characters 1206. In one example, subcarrier positions used to transmit symbols, may indicate a linear constraint that may be satisfied for the field regarding the total number of subcarriers (which may be th number, for example). Using this information, the beacon code may become determinate after a small number of symbols are received by solving a linear constraint. In addition, logical grouping 1202 may include an electrical component for transmitting beacon symbols on respective subcarriers in periodic time slices. As described, the receiver can use the subcarrier position to determine the remaining symbols of the beacon codeword that have not yet been received to facilitate efficient decoding of the beacon codeword. Additionally, system 1200 may include a memory 1210 that stores instructions for performing functions associated with electrical components 1204, 1206, and 1208. Although shown as being external to memory 1210, it should be understood that one or more electrical components 1204, 1206 and 1208 may exist within storage 1210.

Turning to FIG. 13, a system 1300 is illustrated that receives a plurality of coded beacon symbols and determines a beacon radio codeword based on the reception of a portion of the symbols. System 1300 may reside, for example, within a mobile device. As illustrated, system 1300 includes function blocks that may represent functions implemented by a processor, software, or a combination thereof (eg, firmware). System 1300 includes a logical grouping 1302 of electrical components that simplify the reception and decoding of beacon symbols. Logical grouping 1302 may include an electrical component for receiving the number of beacon symbols of a single beacon message less than the total number of beacon symbols in message 1304. As will be described, an incomplete set of beacon symbols can be used to determine the remaining characters in the message; the required number of characters may vary in part based on the number of exponential terms in the polynomial equation associated with the beacon signal. In addition, logical grouping 1302 may include an electrical component to satisfy a linear field constraint associated with the total number of available subcarriers for the beacon signal, based on the positions of the subcarrier of the received beacon symbols 1306. As described, the beacon signal may be encoded according to the coding scheme presented herein to generate beacon symbols that satisfy a linear field constraint to foot subcarriers. The beacon symbol receiver may use this information to allow for linear restriction, making the remainder of the beacon message deterministic. Therefore, the logical grouping 1302 may include an electrical component for determining the remaining characters in the beacon message based on the linear constraint 1308. The definition of the beacon message may enable decoding of the message to distinguish the information contained therein. Additionally, system 1300 can include a memory 1310 that stores instructions for performing functions associated with electrical components 1304, 1306 and 1308. Although shown as being external to memory 1310, it should be understood that electrical components 1304, 1306 and 1308 may exist within memory 1310.

What is described above includes examples of one or more embodiments. Of course, it is impossible to describe every possible combination of components or methodologies in order to describe the above embodiments, but those skilled in the art may recognize that many additional combinations and permutations of various embodiments are permissible. Therefore, the described embodiments are intended to cover all such transformations, modifications, and variations that fall within the spirit and scope of the appended claims. Moreover, to the extent that the term “includes” is used in the detailed description or in the claims, this term should be inclusive in a manner similar to the term “contains”, as “contains” is interpreted when used as a transition word in the claims inventions.

Claims (106)

1. A method for facilitating the transmission of a beacon signal as a plurality of beacon symbols, comprising the steps of:
encode the beacon message as a plurality of beacon symbols so that a number of characters less than the total number for the beacon message can be used to determine the remaining characters of the beacon message; and
transmit a plurality of beacon symbols on the respective subcarriers in the assigned symbol periods. 2. The method according to claim 1, in which the message beacon signal contains information about at least one of the transmitting base station or its sector. 3. The method according to claim 1, in which the message beacon signal is encoded using the maximum diversity (MDS) code. 4. The method according to claim 1, wherein the beacon message is further encoded so that a number of characters less than the total number for the beacon message can be used to resolve the ambiguity of the beacon message from the conflicting beacon message. 5. The method according to claim 1, wherein the beacon message is further encoded so that the number of characters less than the total number for the beacon message can be used to detect and / or correct a shift in time or frequency. 6. The method according to claim 1, wherein the beacon signal is encoded using a polynomial code that contains at least one exponential term. 7. The method according to claim 6, in which the polynomial code is specified by the following expression:

where R is the number of exponential terms, p ₁ -p _R are the primitive elements of the field Z _s having S elements corresponding to S subcarriers suitable for use in transmitting beacon radio signals, where S> 1, α ₁ -α _R are the coefficients an exponent determined on the basis of the beacon signal, q is a parameter determined on the basis of the length of the polynomial code and S, X _t (α ₁ , ..., α _R ) denotes the subcarrier to be used for the symbol of the beacon signal sent in period t , and ⊕ stands for modulo addition. 8. The method according to claim 6, in which the polynomial code contains two exponential members, and the message of the beacon signal is decoded based on two characters of the beacon radio signal into a plurality of characters of the beacon radio signal. 9. The method of claim 8, in which two exponential members are formed using two primitive elements of the field Z ₂₁₁ , having 211 elements corresponding to 211 subcarriers used for transmitting beacon radio signals. 10. The method according to claim 9, in which the polynomial code is specified by the following expression:

,
where p ₁ and p ₂ are primitive elements of the field Z ₂₁₁ , α ₁ and α ₂ are the exponent coefficients determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ ) denotes the subcarrier that should be used for the beacon symbol the radio signal sent in the period t of the symbol, and ⊕ denotes addition modulo 211. 11. The method according to claim 6, in which the polynomial code is a Reed-Solomon code specified by the following expression:

where p ₁ is a primitive element of the field Z _S having S elements corresponding to S subcarriers suitable for use in transmitting beacon radio signals,

for m = 2, ..., R, α ₁ -α _R are the exponent coefficients, determined at least in part on the basis of the beacon signal, X _t (α ₁ , ..., α _R ) denotes the subcarrier index use for the symbol of the beacon signal sent in the period t of the symbol, q is a parameter determined based on the code length of the beacon signal and S, and ⊕ denotes modulo addition, and

for m = 2, ..., R results in a Reed-Solomon code. 12. The method according to claim 11, in which S = 211, R = 2, q = 21, p ₁ = 207 and

. 13. The method according to claim 6, in which the polynomial code contains three exponential members, and the message of the beacon signal is decoded based on three characters of the beacon radio signal to a plurality of characters of the beacon radio signal. 14. The method according to item 13, in which three exponential members are formed using three primitive elements of the field Z ₄₇ having 47 elements corresponding to 47 subcarriers used for transmitting beacon radio signals. 15. The method according to 14, in which the polynomial code is specified by the following expression:

where p ₁ , p ₂ and p ₃ are the primitive elements of the field Z ₄₇ , α ₁ , α ₂ and α ₃ are the coefficients of the exponent, determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ , α ₃ ) denotes the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition. 16. The method according to claim 6, in which the polynomial code is a Reed-Solomon code specified by the following expression:

,
where p ₁ is a primitive element of the field Z ₄₇ having 47 elements corresponding to 47 subcarriers suitable for use in the transmission of beacon radio signals,

,

, α ₁ and α ₂ are power factor coefficients determined based on the beacon signal, X _t (α ₁ , α ₂ , α ₃ ) is the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition, selection

and

yields the Reed-Solomon code. 17. The method according to clause 16, in which p ₁ = 45,

and

. 18. The method of claim 1, wherein the beacon signal is a clock metric sent in one or more clusters of beacon signals. 19. The method according to p. 18, further comprising the step of sequentially placing the encoded beacon symbols of the cluster in bytes of the Galois Fourier transform (GFT) area corresponding to the number of full characters of the beacon radio signal in one or more clusters of beacon codes, and zeros in remaining bytes. 20. The method of claim 19, further comprising converting the components of the GFT domain to a codeword using the inverse GFT. 21. A wireless communication device for encoding a beacon signal, comprising:
at least one processor configured to encode the beacon signal as a plurality of beacon symbols so that after resolving the number of characters less than the total number for the beacon signal, the beacon message becomes deterministic; and
a storage device connected to at least one processor. 22. The wireless communications apparatus of claim 21, wherein the at least one processor is further configured to transmit beacon symbols for a predetermined symbol period and on a related subcarrier. 23. The wireless communications apparatus of claim 21, wherein the at least one processor is further configured to encode a beacon signal using a maximum diversity (MDS) code. 24. The wireless communications apparatus of claim 21, wherein the at least one processor is further configured to resolve the ambiguity of a plurality of conflicting beacon signals based on a portion of their beacon symbols. 25. The wireless communications apparatus of claim 21, wherein the at least one processor is further configured to detect and / or correct an offset in time or frequency based on a portion of the symbols of the beacon signal. 26. The wireless communications apparatus of claim 21, wherein the at least one processor is further configured to encode a beacon signal using a polynomial code that comprises at least one exponential member. 27. The wireless communications apparatus of claim 26, wherein the polynomial code is specified by the following expression:

where R is the number of exponential terms, p ₁ -p _R are the primitive elements of the field Z _S having S elements corresponding to S subcarriers suitable for use in the transmission of beacon radio signals, where S> 1, α ₁ -α _R are the coefficients an exponent determined on the basis of the beacon signal, q is a parameter determined on the basis of the length of the polynomial code and S, X _t (α ₁ , ..., α _R ) denotes the subcarrier to be used for the symbol of the beacon signal sent in period t , and ⊕ stands for modulo addition. 28. The wireless communications apparatus of claim 26, wherein the polynomial code comprises two exponential members and the beacon signal is decoded based on two beacon characters into a plurality of beacon characters. 29. The wireless communications apparatus of claim 28, wherein the two exponential members are generated using two primitive elements of the Z ₂₁₁ field, having 211 elements corresponding to 211 subcarriers used for transmitting beacon radio signals. 30. The wireless communications apparatus of claim 29, wherein the polynomial code is specified by the following expression:

where p ₁ and p ₂ are the primitive elements of the field Z ₂₁₁ , α ₁ and α ₂ are the exponent coefficients determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ ) denotes the subcarrier that should be used for the beacon symbol the radio signal sent in the period t of the symbol, and ⊕ denotes addition modulo 211. 31. The wireless communications apparatus of claim 26, wherein the polynomial code is a Reed-Solomon code defined by the following expression:

,
where p ₁ is a primitive element of the field Z ₂₁₁ , having 211 elements corresponding to 211 subcarriers suitable for use in the transmission of beacon radio signals,

α ₁ and α ₂ are exponent coefficients determined based on the beacon signal, X _t (α ₁ , α ₂ ) is the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ is modulo choice

yields the Reed-Solomon code. 32. The wireless communications apparatus of claim 31, wherein p ₁ = 207 and

. 33. The wireless communications apparatus of claim 26, wherein the polynomial code comprises three exponential members, and the beacon signal is decoded based on three beacon characters into a plurality of beacon characters. 34. The wireless communications apparatus of claim 33, wherein the three exponential members are formed using three primitive elements of field Z ₄₇ having 47 elements corresponding to 47 subcarriers used for transmitting beacon radio signals. 35. The wireless communications apparatus of claim 34, wherein the polynomial code is specified by the following expression:

,
where p ₁ , p ₂ and p ₃ are the primitive elements of the field Z ₄₇ , α ₁ , α ₂ and α ₃ are the exponent coefficients determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ , α ₃ ) denotes the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition. 36. The wireless communications apparatus of claim 16, wherein the polynomial code is a Reed-Solomon code defined by the following expression:

where p ₁ is a primitive element of the field Z ₄₇ having 47 elements corresponding to 47 subcarriers suitable for use in the transmission of beacon radio signals,

,

, α ₁ and α ₂ are power factor coefficients determined based on the beacon signal, X _t (α ₁ , α ₂ , α ₃ ) is the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition, selection

and

yields the Reed-Solomon code. 37. The wireless communications apparatus of claim 36, wherein p ₁ = 45,

and

. 38. The wireless communications apparatus of claim 21, wherein the beacon signal is a clock metric sent in one or more clusters of beacon signals. 39. The wireless communications apparatus of claim 38, wherein the at least one processor is further configured to sequentially put coded cluster beacon symbols in bytes of a Galois Fourier transform (GFT) region corresponding to the number of full beacon symbols in one or more clusters of beacon codes, and zeros in the remaining bytes. 40. The wireless communications apparatus of claim 39, wherein the at least one processor is further configured to convert components of a GFT domain into a codeword using an inverse GFT. 41. A wireless communications device for encoding and transmitting beacon symbols of a beacon signal, comprising:
beacon message initialization means;
means for encoding a beacon signal message into a plurality of beacon symbols according to a coding scheme, wherein the coding scheme may be resolved from a portion of the characters less than the total number of characters; and
means for transmitting beacon symbols on respective subcarriers in periodic time slices. 42. The wireless communications apparatus of claim 41, further comprising means for identifying available subcarriers using the field such that subcarrier positions for the beacon symbols used for encoding must satisfy a linear field constraint. 43. The wireless communications apparatus of claim 41, wherein the coding scheme is a coding scheme for beacon radio signals code A, beacon radio signals code A ', beacon radio signals code B, or beacon radio signals code B'. 44. The wireless communications apparatus of claim 41, wherein the beacon signal comprises information of at least one of the beacon signal transmitting to a base station or a sector thereof. 45. The wireless communications apparatus of claim 41, wherein the beacon signal is encoded using a maximum diversity code (MDS) code. 46. The wireless communications apparatus of claim 41, wherein the beacon signal is further encoded so that the number of beacon symbols is less than the total number for the beacon message, can be used to resolve the ambiguity of the beacon signal from a conflicting beacon message radio signal. 47. The wireless communications apparatus of claim 41, wherein the beacon signal is further encoded such that the number of beacon symbols is less than the total number for the beacon signal, can be used to detect and / or correct a time offset or frequency. 48. The wireless communications apparatus of claim 41, wherein the beacon signal is encoded using a polynomial code that comprises at least one exponential term. 49. The wireless communications apparatus of claim 48, wherein the polynomial code is specified by the following expression:

where R is the number of exponential terms, p ₁ -p _R are the primitive elements of the field Z _S having S elements corresponding to S subcarriers suitable for use in the transmission of beacon radio signals, where S> 1, α ₁ -α _R are the coefficients an exponent determined on the basis of the beacon signal, q is a parameter determined on the basis of the length of the polynomial code and S, X _t (α ₁ , ..., α _R ) denotes the subcarrier to be used for the symbol of the beacon signal sent in period t , and ⊕ stands for modulo addition. 50. The wireless communications apparatus of claim 48, wherein the polynomial code comprises two exponential members, and the beacon signal is decoded based on two beacon symbols into a plurality of beacon symbols. 51. The wireless communications apparatus of claim 50, wherein the two exponential members are formed using two primitive elements of the Z ₂₁₁ field, having 211 elements corresponding to 211 subcarriers used for transmitting beacon radio signals. 52. The wireless communications apparatus of claim 51, wherein the polynomial code is specified by the following expression:

,
where p ₁ and p ₂ are primitive elements of the field Z ₂₁₁ , α ₁ and α ₂ are the exponent coefficients determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ ) denotes the subcarrier that should be used for the beacon symbol the radio signal sent in the period t of the symbol, and ⊕ denotes addition modulo 211. 53. The wireless communications apparatus of claim 48, wherein the polynomial code is a Reed-Solomon code defined by the following expression:

where p ₁ is a primitive element of the field Z _S having S elements corresponding to S subcarriers suitable for use in transmitting beacon radio signals,

for m = 2, ..., R, α ₁ -α _R are the exponent coefficients, determined at least partially based on the message of the beacon radio signal, X _t (α ₁ , ..., α _R ) denotes the subcarrier index that follows use for the symbol of the beacon signal sent in the period t of the symbol, q is a parameter determined based on the code length of the beacon signal and S, and ⊕ denotes modulo addition, and

for m = 2, ..., R results in a Reed-Solomon code. 54. The wireless communications apparatus of claim 53, wherein S = 211, R = 2, q = 21, p ₁ = 207, and

. 55. The wireless communications apparatus of claim 48, wherein the polynomial code comprises three exponential members, and the beacon signal is decoded based on three beacon symbols into a plurality of beacon symbols. 56. The wireless communications apparatus of claim 55, wherein the three exponential members are formed using three primitive elements of field Z ₄₇ having 47 elements corresponding to 47 subcarriers used for transmitting beacon radio signals. 57. The wireless communications apparatus of claim 56, wherein the polynomial code is specified by the following expression:

,
where p ₁ , p ₂ and p ₃ are the primitive elements of the field Z ₄₇ , α ₁ , α ₂ and α ₃ are the coefficients of the exponent, determined on the basis of the message of the beacon radio signal, X _t (α ₁ , α ₂ , α ₃ ) denotes the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition. 58. The wireless communications apparatus of claim 48, wherein the polynomial code is a Reed-Solomon code defined by the following expression:

,
where p ₁ is a primitive element of the field Z ₄₇ having 47 elements corresponding to 47 subcarriers suitable for use in the transmission of beacon radio signals,

,

, α ₁ and α ₂ are power factor coefficients determined based on the beacon signal, X _t (α ₁ , α ₂ , α ₃ ) is the subcarrier to be used for the beacon symbol sent in the symbol period t, and ⊕ denotes modulo addition, selection

and

yields the Reed-Solomon code. 59. The wireless communications apparatus of claim 58, wherein p ₁ = 45,

and

. 60. The wireless communications apparatus of claim 41, wherein the beacon signal is a clock metric sent in one or more clusters of beacon signals. 61. The wireless communications apparatus of claim 60, further comprising means for sequentially storing the encoded beacon symbols of the cluster in bytes of the Galois Fourier transform (GFT) region, corresponding to the number of complete beacon symbols in one or more clusters of beacon codes, and zeros in the remaining bytes 62. The wireless communications apparatus of claim 61, further comprising means for converting the components of the GFT domain into a codeword using the inverse GFT. 63. Machine-readable medium containing codes stored in it, which, when executed on a computer, prompts at least one computer:
initialize the beacon message with information regarding the transmitter of the beacon message;
encode the beacon signal to a plurality of beacon symbols to be sent on subcarriers indicating information, wherein the beacon symbols are selected according to a coding scheme where the beacon signal can be decoded by receiving a portion of the beacon symbols; and
transmit beacon symbols on subcarriers at specific symbol periods. 64. The computer-readable medium of claim 63, wherein the coding scheme associates the number of available subcarriers with the field such that a portion of the subcarriers for the beacon symbols satisfies a linear field constraint to determine the remaining beacon symbols. 65. A device for transmitting beacon symbols in a wireless communication system, a device comprising:
a processor configured to:
encode the beacon signal to a plurality of beacon symbol positions according to the plurality of available subcarrier positions in at least one symbol period;
associate the available subcarrier positions with a number field, so that receiving a portion of the positions of the beacon symbols can make the rest of the message of the beacon radio signal deterministic by satisfying a linear field constraint; and
transmit beacon symbols used to encode the beacon signal; and
a storage device connected to the processor. 66. A method for receiving a portion of beacon symbols that are used to decode a beacon signal, comprising the steps of:
receiving a partial subset of coded beacon symbols from the beacon, wherein the subcarrier positions of the coded beacon symbols satisfy a linear field constraint associated with the total number of subcarrier positions suitable for use with the beacon symbols; and
- determining information regarding the encoded symbols of the beacon signal, at least in part, on the basis of the position of the subcarrier of the encoded symbols of the beacon signal and the resulting decision for linear limitation. 67. The method of claim 66, wherein the specific information comprises a frequency shift of the beacon signal. 68. The method of claim 67, wherein the offset is determined based on a partial set of coded beacon symbols in comparison with a valid set of beacon symbols, the difference in each symbol of the beacon and allowable set is an offset. 69. The method according to p, in which the frequency shift is specified by the following expression:

,
Where

is a matrix representation of a formula representing beacon symbols in the Galois Fourier transform (GFT) region

,

is an n × k matrix consisting of the last k columns of the matrix M,

is a k-vector containing the last k elements in

, but

is a column vector, all elements of which are units. 70. The method according to p, in which the frequency shift is estimated by solving the following expression:

Where

is a vector orthogonal to the subspace covered by the symbols of the beacon signal. 71. The method according to item 70, in which

is predefined. 72. The method according to p, in which the determination of information comprises the step of identifying one transmitter of the beacon radio signal, where there are conflicts with one or more other beacon radio signals. 73. The method according to p, in which certain information contains the remaining symbols of the beacon signal in the beacon signal. 74. The method of claim 73, further comprising decoding the beacon signal after determining the remaining symbols of the beacon signal. 75. The method of claim 74, wherein the beacon signal comprises sector identification information. 76. The method according to p, in which the beacon signal can be determined after receiving the number of characters of the beacon signal of one beacon signal, almost equal to the number of exponential terms in the polynomial function associated with linear restriction. 77. The method according to p, in which the symbols of the beacon signal are encoded using the maximum diversity (MDS) code. 78. The method according to p, in which the MDS code is a Reed-Solomon code. 79. The method of claim 78, wherein the Reed-Solomon code is computed over a field greater than 411 suitable for use sub-carriers of the beacon radio signals, the remaining symbols can be determined by representing 2 received symbols as follows:

, and

and solutions p ₁ and its exponents. 80. The method of claim 78, wherein the Reed-Solomon code is computed over a field smaller than 412 suitable for use sub-carriers of the beacon radio signals, the remaining symbols can be determined by representing 3 received symbols as follows:

,

, and

and solutions p ₁ and its exponents. 81. A wireless communication device for receiving a subset of beacon symbols, comprising:
at least one processor configured to receive a subset of encoded beacon symbols of the beacon signal, wherein the position of the subcarrier of the encoded beacon symbol satisfies a linear field constraint associated with the total number of subcarrier positions suitable for use with beacon symbols; and
a storage device connected to at least one processor. 82. The wireless communications apparatus of claim 81, wherein the at least one processor is further configured to resolve the ambiguity of the beacon signal by determining the beacon signal based on the encoded beacon symbol that satisfies the linear constraint. 83. The wireless communications apparatus of claim 81, wherein the at least one processor is further configured to permit a frequency and / or time offset by determining a beacon signal and an offset associated therewith based on the encoded beacon symbols, satisfying the linear constraint. 84. The wireless communications apparatus of claim 81, wherein the at least one processor is further configured to determine the remaining beacon symbols of the beacon signal, resolving a linear constraint. 85. The wireless communications apparatus of claim 84, wherein the at least one processor is further configured to decode the beacon signal after determining the remaining characters of the beacon signal. 86. The wireless communications apparatus of claim 81, wherein the beacon symbols are encoded using a maximum diversity code (MDS). 87. The wireless communications apparatus of claim 86, wherein the MDS code is a Reed-Solomon code. 88. The wireless communications apparatus of claim 87, wherein the Reed-Solomon code is computed over a field greater than 411 suitable for use beacon radio subcarriers, the remaining symbols can be determined by representing 2 received symbols as follows:

, and

and solutions p ₁ and its exponents. 89. The wireless communications apparatus of claim 88, wherein the Reed-Solomon code is computed over a field smaller than 412 suitable for use beacon radio subcarriers, the remaining symbols can be determined by representing 3 received symbols as follows:

,

, and

and solutions p ₁ and its exponents. 90. A wireless communication device for determining a beacon signal based on a subset of received beacon symbols, comprising:
means for receiving the number of beacon symbols of a single beacon signal less than the total number of beacon symbols in the beacon message;
means for satisfying a linear field constraint associated with the total number of available subcarriers for reporting the beacon signal, based on the positions of the subcarrier of the received beacon symbols; and
means for determining the remaining beacon symbols in the beacon message based on a linear constraint. 91. The wireless communications apparatus of claim 90, further comprising means for resolving a frequency shift of the wireless communications apparatus by comparing beacon symbols with a valid sequence of beacon symbols. 92. The wireless communications apparatus of claim 91, wherein the frequency shift is defined by the following expression:

,
Where

is a matrix representation of a formula representing beacon symbols in the Galois Fourier transform (GFT) domain

,

is an n × k matrix consisting of the last k columns of the matrix M,

is a k-vector containing the last k elements in

, but

is a column vector, all elements of which are units. 93. The wireless communications apparatus of claim 92, wherein the frequency shift is specified by solving the following expression:

Where

is a vector orthogonal to the subspace covered by the symbols of the beacon signal. 94. The device according to item 93, in which

is predefined. 95. The wireless communications apparatus of claim 90, further comprising means for resolving the beacon signal in the presence of a conflicting beacon signal by satisfying a linear constraint. 96. The wireless communications apparatus of claim 90, wherein the beacon symbols are encoded using a Reed-Solomon code. 97. The wireless communications apparatus of claim 90, further comprising means for decoding the beacon signal after determining the remaining characters of the beacon signal. 98. The wireless communications apparatus of claim 97, wherein the beacon signal comprises sector identification information. 99. The wireless communications apparatus of claim 90, wherein the beacon signal may be deterministic after receiving the number of beacon symbols of one beacon signal substantially equal to the number of exponential terms in the polynomial function associated with the linear constraint. 100. The wireless communications apparatus of claim 90, wherein the beacon symbols are encoded using a maximum diversity code (MDS) code. 101. The wireless communications apparatus of claim 100, wherein the MDS code is a Reed-Solomon code. 102. The wireless communications apparatus of claim 101, wherein the Reed-Solomon code is computed over a field greater than 411 suitable for use beacon radio subcarriers, the remaining symbols can be determined by representing 2 received symbols as follows:

, and

and solutions p ₁ and its exponents. 103. The wireless communications apparatus of claim 101, wherein the Reed-Solomon code is computed over a field of less than 412 suitable beacon radio subcarriers, the remaining symbols can be determined by representing 3 received symbols as follows:

,

, and

and solutions p ₁ and its exponents. 104. Machine-readable medium containing codes stored in it, which, when executed on a computer, prompts at least one computer:
receive an incomplete set of broadcast beacon symbol broadcasts associated with the beacon signal, the beacon symbols satisfy a linear field constraint associated with suitable subcarriers for transmitting broadcast beacon symbols; and
solve a linear constraint on an incomplete set of broadcast beacon symbol broadcasts to determine the remaining beacon symbols in the beacon message. 105. The computer-readable medium of claim 104, further comprising a code for instructing at least one computer to determine a frequency shift based on broadcast transmissions of beacon symbols and an acceptable sequence of broadcast transmissions for various beacon signals. 106. A device for distinguishing information about a message transmitting a beacon signal sector in a wireless communication system, a device comprising:
a processor configured to:
receive an incomplete set of beacon symbols associated with the beacon message;
determine the remaining beacon symbols of the beacon signal based on the use of the received beacon symbols to satisfy the linear field constraint; and
decode the beacon message to distinguish information about the transmitting sector; and
a storage device connected to the processor.

Images