Abstract:
The embodiments utilize OFDM symbols to communicate network IDs. The IDs are encoded into symbols utilizing the network IDs as seeds to scramble respective pilots that are then transmitted by utilizing the symbols. The pilots can be structured into a single OFDM symbol and/or multiple OFDM symbols. The single symbol structure for transmitting the network IDs is independent of the number of network ID bits and minimizes frequency offset and Doppler effects. The multiple symbol structure allows a much coarser timing accuracy to be employed at the expense of transmitting additional symbols. Several embodiments employ a search function to find possible network ID candidates from a transmitted symbol and a selection function to find an optimum candidate from a network ID candidate list.

Description:
BACKGROUND 
     I. Field 
     The embodiments relate generally to data communications, and more particularly to systems and methods for structuring network IDs into OFDM symbols utilized in a wireless communication system. 
     II. Background 
     The introduction of wireless technology for personal communications has almost made the traditional telephone a thing of the past. As wireless technologies improve, the sheer numbers of parties desiring to communicate wirelessly keep increasing substantially. “Cell” phones have developed into multifunctional devices that not only function to relay voice communications, but data as well. Some devices have also incorporated interfaces to the Internet to allow users to browse the World Wide Web and even download/upload files. Thus, the devices have been transformed from a simple voice device to a “multimedia” device that enables users to receive/transmit not only sound, but also images/video as well. All of these additional types of media have tremendously increased the demand for communication networks that support these media services. The freedom to be ‘connected’ wherever a person or device happens to be located is extremely attractive and will continue to drive future increases in wireless network demand. 
     Thus, the ‘airwaves’ in which wireless signals are sent become increasingly crowded. Complex signals are employed to utilize signal frequencies to their fullest extent. However, due to the sheer numbers of communicating entities, it is often not enough to prevent interference of signals. Network identification (ID) is typically transmitted with data so that a receiving entity knows the origination of the data. When interferences occur, a receiving entity may not be able to properly interpret what network the signal originated from and may lose information. This drastically reduces the efficiency of a communication network, requiring multiple sends of the information before it can be properly received. In the worst case, the data may be totally lost if it cannot be resent. If a network has hundreds or even thousands of users, the probability of not being able to identify a network ID increases substantially. The demand for wireless communications is not decreasing. Therefore, it is reasonable to assume that signal interferences will continue to increase, degrading the usefulness of existing technology. A communication system that can avoid this type of data corruption will be able to provide increased reliability and efficiency to its users. 
     SUMMARY 
     The following presents a simplified summary in order to provide a basic understanding of some aspects of the embodiments. This summary is not an extensive overview of the embodiments. It is not intended to identify key/critical elements of the embodiments or to delineate the scope of the embodiments. Its sole purpose is to present some concepts of the embodiments in a simplified form as a prelude to the more detailed description that is presented later. 
     The embodiments relate generally to data communications, and more particularly to systems and methods for structuring network IDs into OFDM symbols utilized in a wireless communication system. Multiple network IDs are encoded into symbols utilizing the network IDs as seeds to scramble respective pilots that are then transmitted utilizing the symbols. The pilots can be structured into a single OFDM symbol and/or multiple OFDM symbols. The single symbol structure for transmitting the network IDs is independent of the number of network ID bits and minimizes frequency offset and Doppler effects, providing a high spreading gain of network ID data that is highly resistant to interference from other network ID broadcasts. The multiple symbol structure, however, allows a much coarser timing accuracy to be employed at the expense of transmitting additional symbols. One embodiment is a method for facilitating data communications that utilizes at least one OFDM symbol structured with at least one pilot respective of a network ID for communicating the network ID between entities. Another embodiment is a system that facilitates data communications that includes a communication component that communicates at least one network ID between entities by utilizing at least one OFDM symbol that includes at least one pilot respective of the network ID. 
     Several embodiments employ a search function to find possible network ID candidates from a transmitted symbol and a selection function to find an optimum candidate from the network ID candidate list. When multiple network IDs are structured into received symbols, typically, a first network ID is determined and utilized to facilitate in determining a second network ID. By employing metrics, a score or value can be assigned to each possible ID and an optimum set of network IDs can be determined by maximizing the score of the set of IDs. Thus, the embodiments provide a robust, cost-effective means to substantially reduce network ID interferences and increase network ID data reception. 
     To the accomplishment of the foregoing and related ends, certain illustrative embodiments are described herein in connection with the following description and the annexed drawings. These embodiments are indicative, however, of but a few of the various ways in which its principles may be employed and is intended to include all such embodiments and their equivalents. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  is a block diagram of a data communication system in accordance with an embodiment. 
         FIG. 2  is another block diagram of a data communication system in accordance with an embodiment. 
         FIG. 3  is an illustration of scrambling pilots for a single network ID in accordance with an embodiment. 
         FIG. 4  is an illustration of scrambling pilots for multiple network IDs in accordance with an embodiment. 
         FIG. 5  is an illustration of single OFDM symbol structures in accordance with an embodiment. 
         FIG. 6  is an illustration of dual OFDM symbol structures in accordance with an embodiment. 
         FIG. 7  is a block diagram of a network ID decoding component in accordance with an embodiment. 
         FIG. 8  is a block diagram of a network ID determination component in accordance with an embodiment. 
         FIG. 9  is an illustration of a search metric calculation in accordance with an embodiment. 
         FIG. 10  is a flow diagram of a method of constructing an OFDM symbol based on scrambled pilots generated from network IDs in accordance with an embodiment. 
         FIG. 11  is a flow diagram of a method of selecting network ID candidates in accordance with an embodiment. 
         FIG. 12  is another flow diagram of a method of searching for network ID candidates in accordance with an embodiment. 
         FIG. 13  is another flow diagram of a method of selecting network ID candidates in accordance with an embodiment. 
         FIG. 14  is a flow diagram of a method of determining a search metric in accordance with an embodiment. 
         FIG. 15  illustrates an example communication system environment in which the embodiments can function. 
     
    
    
     DETAILED DESCRIPTION 
     The embodiments are now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments. It may be evident, however, that the embodiments may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the embodiments. As used in this application, the term “component” is intended to refer to an entity, either hardware, software, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a processor, a process running on a processor, and/or a multiplexer and/or other signal facilitating devices and software. 
     In accordance with the embodiments and corresponding disclosure thereof, various aspects are described in connection with a subscriber station. A subscriber station can also be called a system, a subscriber unit, mobile station, mobile, remote station, access point, base station, remote terminal, access terminal, user terminal, user agent, or user equipment. A subscriber station may be a wireless telephone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device having wireless connection capability, or other processing device connected to a wireless modem. 
     The embodiments provide systems and methods to facilitate communication of network IDs in wireless systems. Utilization of OFDM symbols provides a means to transmit and receive pilots that have been scrambled based upon a respective network ID. By decoding the scrambled pilots, the network IDs can be retrieved. In this manner, dedicated symbols can provide a robust mechanism for relaying network IDs, substantially reducing interference from other networks. Additionally, the embodiments allow for multiple network IDs to be communicated in a single symbol or in multiple symbols. A single symbol structure requires more fine timing accuracy, while the multiple symbol structure requires coarse timing accuracy, but at the cost of additional symbols. A typical embodiment of a multiple structure utilizes separate symbols for each network ID to be communicated. 
     Reception and decoding of the network IDs is generally obtained utilizing a two stage process that includes a search process (that can be implemented by a search component) for finding a list of possible network ID candidates and a selection process (that can be implemented by a selection component) for selecting an optimum candidate from the candidate network ID list. The embodiments provide multiple means for determining the network IDs dependent upon the method utilized to encode the network ID into the symbol(s). Thus, a single symbol that contains a two network ID structure of interleaved pilots utilizes a different method of decoding than a dual symbol structure that contains a separate symbol for each network. The selection process itself can be eliminated by only maintaining a top scored value that is determined by a search metric. This essentially reduces a possible network ID candidate list to only a single choice, negating the necessity of having a follow-on selection process. 
     Typically, mobile wireless units are not aware of what networks are available in a particular area. In order for these units to operate, they must acquire network IDs by intercepting them from wireless signals. Normally, there are wide area networks and local area networks in a reception area that each has its own IDs. These IDs act as keys to facilitate in decoding program material. In a high traffic area, however, it may be difficult for a mobile device to properly interpret network IDs due to interference by other networks in the area. 
     In  FIG. 1 , a block diagram of a data communication system  100  in accordance with an embodiment is shown. The data communication system  100  is comprised of an entity “1”  102  and an entity “2”  104 . Entity “1”  102  and entity “2”  104  each have a communication component  106  and  108  respectively. The embodiment is not limited to only two communicating entities and is shown as such for illustrative purposes only. Entity “1”  102  utilizes the communication component  106  to encode its network ID into an OFDM symbol and transmit it wirelessly. Entity “2”  104  acquires the transmitted signal from entity “1”  102  and utilizes its communication component  108  to decode the network ID transmitted by entity “1”  102 . Once decoded, the network ID can then be utilized to facilitate in interpreting programming from entity “1”  102 . The transmitted network ID can be a single OFDM symbol and/or multiple OFDM symbols. By utilizing the embodiment, the robustness of the acquisition of the network ID is increased substantially, especially when in a high interference area. The embodiment also provides a mechanism to transmit multiple network IDs in a single OFDM symbol and/or multiple OFDM symbols. This is accomplished by interleaving pilots representative of the network IDs in one OFDM symbol and/or utilizing one OFDM symbol per pilot. Additionally, one skilled in the art can appreciate that a communication component of the embodiments is not required to reside within a transmitting and/or receiving entity. It can provide the OFDM symbol structures and/or symbol structure interpretation for the transmitting and/or receiving component respectively from an external, remote location. 
     In some communication systems, for example, two layers of network IDs exist such as, for example, network ID type A and network ID type B. Typically, a wireless system needs to acquire network ID type A to decode type A program material and needs to acquire both network ID type A and network ID type B to decode type B programs. Thus, a system that desires, for example, to decode local programming needs to acquire both a wide area programming network ID and a local programming network ID to decode the local programming, while only the wide area programming network ID is necessary to decode the wide area programming. 
     Turning to  FIG. 2 , another block diagram of a data communication system  200  in accordance with an embodiment is illustrated. The communication system  200  is comprised of a communication component  202 . The communication component  202  is comprised of a network ID encoding component  204  and a network ID decoding component  206 . The network ID encoding component  204  receives network “A” ID  208  and network “B” ID  210  and encodes the IDs  208 ,  210  into OFDM symbol(s)  212 . The encoding utilizes pilots that are scrambled based on network IDs and inserted into OFDM symbol(s). This aspect is described in greater detail herein. Once the OFDM symbol(s) have been constructed they are typically transmitted for reception by various entities such as, for example, mobile wireless devices. The network ID decoding component  206  receives OFDM symbol(s)  214  and decodes the symbol(s) into network “A” ID  216  and network “B” ID  218 . Once the network IDs are known, a mobile device can utilize them to facilitate in utilizing programming from the respective networks. One skilled in the art will appreciate that the embodiments can utilize a communication component  202  that has only either a network ID encoding component  204  or a network ID decoding component  206 , but not both. Thus, a wireless device that is utilized to receive information may not have an encoding component  204 . Likewise, a network transmitting device may not have a decoding component  206 . 
     Looking at  FIG. 3 , an illustration  300  of scrambling pilots for a single network ID in accordance with an embodiment is shown. In one embodiment, a pseudo-noise sequencer  302  is utilized to facilitate in encoding a network ID into an OFDM symbol. The pseudo-nose sequencer  302  receives pilots  304  and employs a network “A” ID as a seed to scramble the pilots  304 . This creates network “A” ID pilots  308  that contain network ID information for network “A.” In  FIG. 4 , an illustration  400  of scrambling pilots for multiple network IDs in accordance with an embodiment is depicted. In this embodiment, a pseudo-noise sequencer  402  receives pilots  404  and employs both network “A” ID  406  and network “B” ID  408  as seeds to scramble the pilots  404 . This produces network “B” ID pilots  410  that contain network ID information for both network “A” and network “B.” Thus, network “A” ID is typically required to be known before the network “B” ID can be decoded. For this reason, a decoding process typically decodes the network “A” ID first before decoding the network “B” ID. 
     The embodiments utilize dedicated OFDM symbols for network IDs. A preferred embodiment is illustrated in  FIGS. 5-6 . In this preferred embodiment, the sub-carrier groups are structured as interlaces. That is, the sub-carriers of an OFDM symbol is sub-divided into I interlaces indexed from 0 to I−1. Each interlace consists of P sub-carriers where the sub-carriers are spaced I×Δf apart in frequency, with Δf being the sub-carrier spacing. 
     In  FIG. 5 , an illustration of single OFDM symbol structures  500  in accordance with an embodiment is shown. In  FIG. 5A , one OFDM symbol  502  is utilized to transmit both network “A” and network “B” ID information through respective network ID pilots that are interlaced in the symbol. In this embodiment, L (I/L=2, 4, . . . , I/2) evenly spaced interlaces are filled with pilots of which L/2 evenly spaced interlaces are utilized for Network “A” and another L/2 evenly spaced interlaces are utilized for Network “B,” and the unused interlaces are nulled (no energy). In this example, I=8, P=512, and the total number of sub-carriers is, therefore, 4096. In one embodiment ( FIG. 5A ), L=I=8, four even interlaces (0, 2, 4, 6) are utilized for network “A” which are filled with network “A” ID pilots (pilots scrambled by pseudo-noise sequences seeded with network “A” ID). Four odd interlaces (1, 3, 5, 7) are utilized by network “B” and are occupied by network “B” ID pilots (pilots scrambled by network “B” sequences (sequences seeded by both network “A” ID and network “B” ID)). In another embodiment ( FIG. 5B ), L=I/2, interlaces (0, 4) are utilized for network “A” and interlaces (2, 6) are utilized by network “B” in one OFDM symbol  504 . 
     Turning to  FIG. 6 , an illustration of dual OFDM symbol structures  600  in accordance with an embodiment is shown. In  FIG. 6A , network “A” ID pilots are inserted in a single OFDM symbol  602  and network “B” pilots are inserted into a single OFDM symbol  604 . For this dual symbol structure, the utilized interlaces, L (I/L=1, 2, . . . , I), are evenly spaced network “A” ID and network “B” ID pilot interlaces inserted in the network “A”  602  and network “B”  604  symbols, respectively, each of which generates I/L periods in the time domain. In  FIG. 6B , another embodiment of a dual structure is illustrated where network “A” symbol  606  and network “B” symbol  608  are constructed utilizing L=I/4. Single OFDM symbol structures as shown in  FIGS. 5A and 5B  utilize less OFDM symbols but require finer timing. While dual symbol structures as shown in  FIGS. 6A and 6B  utilize more OFDM symbols but require less accurate timing, and the required accuracy decreases as L decreases since the repeated number of periods increases. In a general sense, the pilots are scalable. This can be accomplished by increasing the alternating interval in a single symbol-based system. Thus, the interval can be every other one or every other two or every other three, etc. The number of pilots should be divisible into the total number of frequency interlaces to afford a periodic signal that can be easily intercepted at frequent time intervals. 
     Once network ID information has been encoded into an OFDM structure, it can be transmitted to a wireless device. The wireless device then decodes the symbol structure to determine the network ID(s). Turning to  FIG. 7 , a block diagram of a network ID decoding component  700  in accordance with an embodiment is depicted. The network ID decoding component  700  is comprised of a network ID determination component  702 . The component  702  receives a signal input  704  and determines a network ID  706  from the signal input  704 . The embodiments typically utilize a two step process to make the network ID determination. Additionally, the processes themselves are based upon whether the symbol structure employed is a single symbol structure or a multiple symbol structure. 
     In  FIG. 8 , a block diagram of a network ID determination component  800  in accordance with an embodiment is illustrated. The network ID determination component  800  is comprised of a search process component  802  and a selection process component  804 . The search process component  802  receives a signal input  806  that contains a network ID encoded within an OFDM symbol structure. The search process component  802  employs a hypothesis network ID  808  and a search metric  810  to facilitate in determining a network ID list of possible candidates. The hypothesis network ID  808  originates from a group of possible network IDs. The search metric  810  is described in detail herein and establishes a ‘score’ for a particular network ID candidate. The selection process component  804  receives the network ID candidate list and employs a selection metric  812  to facilitate in determining an optimum network ID  814 . In some embodiments, the selection process component  804  can be omitted. 
     The acquisition embodiment is utilized to receive the symbol structure  502 ,  504  in  FIGS. 5A and 5B  and/or  602 ,  604  and  606 ,  608  depicted in  FIGS. 6A and 6B . After timing is established, network “A” ID symbol is sampled one or multiple periods depending on the timing accuracy and transformed into the frequency domain. The “L A ” number of network “A” ID pilot interlaces are descrambled utilizing one of the hypothesis network “A” IDs and IFFT (Inverse direct Fast Fourier Transform) transformed to obtain an L*512-tap time-domain channel observation. The network “A” ID search metric is calculated and added to a candidate set, A M , of size M, if it makes it to the top M. This process continues until all of the network “A” ID hypotheses are tested. 
     The network “B” ID symbol is then sampled one or multiple periods. The L B  interlaces are descrambled utilizing one of the hypothesis network “B” IDs combined with a network “A” ID in the network “A” candidate set, A M . The network “B” search metric is then calculated and added to the network “B” candidate set, B N , of size N, if it makes it to the top N. This process continues until all the network “A” IDs in the network “A” candidate set are combined with all the network “B” ID hypotheses and tested. 
     After the network “A” ID/network “B” ID candidate search process finishes, a selection process begins. The selection process is additionally beneficial in terms of time diversity since the search data is from a fraction of one OFDM symbol. Increased time diversity facilitates to make a better selection from a candidate set. The selection metric is calculated for all the candidates from the next network ID symbols. The selection metric, a combination of search metrics from different network ID symbols, therefore, provides more time diversity than the search metric does. The network “A” ID with the best selection metric is selected as the optimum network ID candidate. The network “B” ID is selected from network “A”/network “B” ID combinations that yield the best selection metric score. The design of the selection metric is discussed herein. In one embodiment, the selection process can be avoided by setting M=N=1. 
     An optimum network “A”/network “B” ID combination is the one with the largest combined search metric: 
                       (     NETA   ,   NETB     )     *     =       max       NETA   ⊆     A   M       ,     NETB   ⊆     B   N           ⁢       {         ∑     s   =   1     S     ⁢       η   NETA     ⁡     (   s   )         +       η     NETA   ,   NETB       ⁡     (   s   )         }     .               (     Eq   .           ⁢   1     )               
where S is the number of time diversity combinations from the selection process.
 
     In  FIG. 9 , an illustration  900  of a search metric calculation in accordance with an embodiment is shown. When pilot samples are much longer than a maximum channel, e.g., L=4, the network “A”/network “B” search metric is calculated utilizing the following procedure. 512L tap network “A”/network “B” time-domain channel observations are divided, for example, into 16 bins  902 , each of which is 128 taps long. Bins 0-5  904  are utilized for channel activity detection (assuming, for example, that a channel spread is less than 768 taps). Bins 7-14  906  are utilized for noise baseline/interference power spectral density (PSD) calculations since no channel activity should exist in this zone. To allow possible channel energy leakage from the channel activity zone  904  into noise baseline detection zone  906  due to miss-time alignment, Bin 6  908  and Bin 15  910  are not utilized for the interference PSD calculation. 
     The search metric for the nth TDM pilot network “A”/network “B” symbol is defined as follows for the detected PSD energy, η  916 : 
                           η     (   i   )       ⁡     (   n   )       =       ∑     k   =   0         5   ·   128     -   1       ⁢     (     max   ⁢     {           s   k     (   i   )       ⁡     (   n   )       -     λ   ⁢           ⁢       w     (   i   )       ⁡     (   n   )           ,   0     }       )         ;     ⁢     
     ⁢     where   ⁢     :       ⁢           ⁢     
     ⁢           w     (   i   )       ⁡     (   n   )       =       1     8   ·   128       ⁢       ∑     k   =     7   ·   128           14   ·   128     -   1       ⁢     s   k     (   i   )             ;             (     Eq   .           ⁢   2     )               
is the interference PSD energy  912 , s k   (i)  is the energy  914  of the kth sample under the ith hypothesis and λ is a predetermined constant. The search metric is an unbiased estimate of the total energy of the channel under the hypothesis.
 
     The final search metric with S selection diversity is: 
                 η     (   i   )       =       ∑     s   =   1     S     ⁢       η     (   i   )       ⁡     (   s   )           ;         
which is the sum of the search metric obtained from both network “A”/network “B” ID symbols to gain time-diversity as well as reduce estimation variance. This search metric does not assume any channel profile and, therefore, is channel profile safe.
 
     In the case of a mismatch between a hypothesis ID and a correct ID, the channel energy of the correct ID broadcast will be evenly spread over the whole 16 bins, and no significant channel energy should be detected in the activity zone utilizing the search metric, i.e., η→0. However, if the hypothesis ID matches the correct ID, the broadcast channel with the correct ID will be dispread, and the channel energy will be confined within the activity zone. For channels who&#39;s ID does not match a hypothesis ID, the channel energy will be spread over the whole 16 bins. In this case, significant energy will be detected utilizing the search metric, i.e., η→0. 
     However, in the case where the pilot samples are not longer than a maximum channel, such as I=1 in  FIG. 6 , a separation between the channel under hypothesis and interference does not exist. The channel activity zone and the noise zone overlaps. Therefore, the interference PSD, w, in (Eq. 2) is a biased estimate (over-estimate) of the interference PSD. In the extreme case when L=1 and the channel is longer than  512 , the interference PSD estimate becomes: 
                     w   =       1     4   ·   128       ⁢       ∑     j   =   0         4   ·   128     -   1       ⁢     s   j           ;           (     Eq   .           ⁢   4     )               
which is always an over-estimate of the interference power spectral density. The search metric defined in (Eq. 2) then becomes:
 
                         η   ~       (   i   )       =       ∑     k   =   0         4   ·   128     -   1       ⁢     max   ⁢     {       (       s   k     (   i   )       -     λ   ⁢           ⁢   w       )     ,   0     )           ;           (     Eq   .           ⁢   5     )               
resulting in a biased estimate (under-estimate) of the energy of the channel under hypothesis. The flatter the channel time response, the greater the bias. In other words, unlike the search metric in (Eq. 2) which is profile independent, the search metric in (Eq. 5) favors the channel with a concentrated profile, although an OFDM receiver in general does not have this discrimination.
 
     In view of the exemplary systems shown and described above, methodologies that may be implemented in accordance with the embodiments will be better appreciated with reference to the flow charts of  FIGS. 10-14 . While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of blocks, it is to be understood and appreciated that the embodiments are not limited by the order of the blocks, as some blocks may, in accordance with the embodiments, occur in different orders and/or concurrently with other blocks from that shown and described herein. Moreover, not all illustrated blocks may be required to implement the methodologies in accordance with the embodiments. 
     In  FIG. 10 , a flow diagram of a method  1000  of constructing an OFDM symbol based on scrambled pilots generated from network IDs in accordance with an embodiment is shown. The method  1000  starts  1002  by obtaining a network ID for network “A”  1004  and network “B”  1006 . These networks can be a wide area network and a local area network and the like. Typically, utilization of the local area network programming requires both the local area ID and the wide area ID. A first set of pilots are then scrambled with a pseudo-noise sequencer seeded by network “A” ID  1008 . This encodes the network ID into the pilots. A second set of pilots are then also scrambled with a pseudo-noise sequencer seeded by both network “A” ID and network “B” ID  1010 . This encodes the network “B” ID into the scrambled pilots, but also requires that network “A” ID be known to facilitate in decoding the network IDs. OFDM symbol(s) are then constructed utilizing both sets of scrambled pilots  1012 , ending the flow  1014 . The pilot sets can be interleaved in a single OFDM symbol and/or one OFDM symbol can be employed for each set of pilots. Utilizing a single OFDM symbol requires higher accuracy in timing for acquisition than with multiple symbols. 
     Turning to  FIG. 11 , a flow diagram of a method  1100  of selecting network ID candidates in accordance with an embodiment s illustrated. This method  1100  of selecting an optimum network ID candidate is typically employed with transmission of network IDs utilizing a single OFDM symbol. The method  1100  starts  1102  by obtaining a network ID candidate list  1104 . The network ID candidate list is typically constructed as described herein. A selection metric value or score is then determined for each candidate  1106 . The selection metric is calculated for all candidates from the pilot symbols at the boundaries of frames of the superframe. It provides more time diversity than the search metric. An optimum candidate is then selected based on the selection metric values/scores  1108 , ending the flow  1110 . 
     Looking at  FIG. 12 , another flow diagram of a method  1200  of searching for network ID candidates in accordance with an embodiment is shown. This method  1200  is generally applicable to network IDs transmitted utilizing a multiple OFDM symbols. The method  1200  starts  1202  by acquiring an input signal  1204  and establishing the SFN timing  1206 . A network ID pilot is then sampled  1208  and transformed into the frequency domain  1210 . A hypothesis network ID is utilized to facilitate in descrambling the pilot interlaces which are then employed to obtain a time-domain channel observation  1212 . A network ID search metric is then calculated  1214  and utilized to construct a network ID candidate list  1216 , ending the flow  1218 . 
     Moving on to  FIG. 13 , another flow diagram of a method  1300  of selecting network ID candidates in accordance with an embodiment is depicted. This method  1300  selects an optimum combination of network IDs and can be applicable to either single OFDM symbol construction and/or multiple symbol construction network ID transmission acquisitions. The method  1300  starts  1302  by obtaining a network ID candidate list for network “A”  1304  and a network ID candidate list for network “B”  1306 . The candidate list can be obtained according to the flow in  FIG. 12 . An optimum combination of network ID “A” and network ID “B” is then determined based on search metric scores  1308 , ending the flow  1310 . When determining an optimum second network ID from a candidate list, the second network ID is selected from the highest scoring combination of the first and second network IDs after the first optimum network ID has been determined. 
     In  FIG. 14 , a flow diagram of a method  1400  of determining a search metric in accordance with an embodiment is shown. The search metric can be applicable to both single and multiple OFDM symbol network ID transmissions. The method  1400  starts  1402  by determining if pilot samples are longer than a maximum channel  1404 . If yes, network ID time-domain channel observations are divided into “X” bins that are “Y” taps long, where X and Y are integers from one to infinity  1406 . A first subset of the bins is utilized for detecting channel energy in the form of power spectral density (PSD) energy  1408 . A second subset of bins separated by guard zones is utilized to determine a noise baseline or interference PSD energy  1410 . Channel energy (detected PSD) is then determined by eliminating the interference PDS energy from the obtained PSD energy  1412 , ending the flow  1414 . When a mismatch occurs between a hypothesis network ID and a correct network ID, the channel energy of the correct network ID is broadcast evenly over all of the bins and, therefore, no significant amount of energy is detected in the first subset of bins. However, if a match occurs, the broadcast channel with the correct network ID is dispread, and the channel energy is confined within the first subset of bins. This form of the search metric provides an unbiased estimate of the total energy of the channel under hypothesis. Examples of this process are described herein and are illustrated in  FIG. 9 . 
     If, however, the pilot samples are not longer than the maximum channel  1404 , the channel energy is determined by eliminating an average PSD energy from the obtained PSD energy  1416 , ending the flow  1414 . The average PSD energy is utilized in this instance because no separation between the channel under hypothesis and the interference PSD exists. Utilizing the average PSD energy generally produces an over-estimate of the interference PSD resulting in a biased estimate of the channel under hypothesis. 
       FIG. 15  is a block diagram of a sample communication system environment  1500  with which the embodiments can interact. The system  1500  further illustrates two representative communication systems A  1502  and B  1504 . One possible communication between systems A  1502  and B  1504  may be in the form of a data packet adapted to be transmitted between two or more communication systems. The system  1500  includes a communication framework  1506  that can be employed to facilitate communications between the communication system A  1502  and communication system B  1504 . 
     In one embodiment, a data packet transmitted between two or more communication system components that facilitates data communications is comprised of, at least in part, information relating to a network ID that is communicated with at least one OFDM symbol structure that employs at least one pilot respective of the network ID. 
     What has been described above includes examples of the embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of the embodiments are possible. Accordingly, the embodiments are intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.