TWI517603B - Method,apparatus,processor and computer一readablemedium for generating a secondary synchronizationcode(ssc) for wireless communication - Google Patents

Description

Method, apparatus, processor and computer readable medium for generating a secondary synchronization code for wireless communication

The following is generally related to wireless communications, and more specifically to determining a secondary synchronization codebook for selecting secondary synchronization codes for a radio network site.

This non-provisional patent application claims the "SECONDARY SYNCHRONIZATION CODEBOOK FOR E-UTRAN" filed on August 13, 2007. The priority of U.S. Provisional Patent Application Serial No. 60/955,623, the disclosure of which is hereby incorporated by reference in its entirety in its entirety in its entirety in its entirety in its entirety in

Wireless communication systems are widely deployed to provide various types of communication content, such as voice content, material content, and the like. A typical wireless communication system can be a multiple access system capable of supporting communication with multiple users by sharing available system resources (eg, bandwidth, transmission power). Examples of such multiple access systems may include a code division multiple access (CDMA) system, a time division multiple access (TDMA) system, a frequency division multiple access (FDMA) system, and orthogonal frequency division multiple access (OFDMA). System and similar.

Generally, a wireless multiple access communication system can simultaneously support communication of multiple mobile devices. Each mobile device can communicate with one or more base stations via transmissions on the forward and reverse links. The forward link (or downlink) refers to the communication link from the base station to the mobile device, and the reverse link (or uplink) refers to the communication link from the mobile device to the base station. In addition, via single input A single output (SISO) system, a multiple input single output (MISO) system, a multiple input multiple output (MIMO) system, etc., to establish communication between the mobile device and the base station.

MIMO systems typically multiple (N _T th) transmit antennas and multiple (N _R) receive antennas for data transmission. The MIMO channel formed by the N _T transmit antennas and N _R receive antennas may be decomposed into N _S independent channels, such separate channels may be referred to as spatial channels, where N _S { N _T , N _R }. Each of the N _S independent channels corresponds to a dimension. In addition, MIMO systems can provide improved performance (e.g., increased spectral efficiency, higher throughput, and/or greater reliability) if the additional dimensions generated by multiple transmit and receive antennas are utilized.

Additional system complexity can also be introduced by improved performance, throughput and reliability provided by multiple transmission wireless access stations. For example, where multiple base stations are transmitting in a common area and the transmissions are received by a single device, a mechanism for distinguishing between the transmissions may be required. In addition, components for distinguishing and/or identifying one base station from another base station may be required. A mechanism for identifying base stations and distinguishing the received transmissions is by utilizing channel synchronization. In some examples, the synchronization may include a primary synchronization code (PSC) including the frequency and timing information of the transmission and a secondary synchronization code (SSC) providing the base station identification code. In such examples, a device can distinguish and decode one or more transmissions in a multi-transmitter environment by PSC and/or SSC.

A simplified summary of one or more aspects is presented below to provide a basic understanding of the aspects. This summary is not a comprehensive overview of all intended aspects and is intended to neither identify any important or critical elements nor The scope of all aspects. Its sole purpose is to present some concepts of one or more aspects

In at least some aspects, the present disclosure utilizes a primary synchronization channel (P-SCH) correlation scrambling code to scramble a secondary synchronization code (SSC) for a plurality of base stations. In addition, various mechanisms are provided to achieve the disturbance. In at least one additional aspect, the PSC-based scrambling code is generated from a plurality of M-sequences generated from polynomials different from the polynomial used to generate the SSC. In addition, an SSC codebook is disclosed that selects a sequence pair to generate an SSC for a multi-transmitter mobile site based on the power and/or correlation characteristics of the resulting scrambled SSC. As a result, interference between multiple transmitter SSC transmissions received at a device can be reduced, providing improved throughput, reliability, and consistency for planned, semi-planned, and unplanned mobile base station deployments.

According to some aspects, a method for generating a secondary synchronization code (SSC) for wireless communication is disclosed. The method can include: generating a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; and scrambling using a common binary scrambling code based on one of a primary synchronization code (PSC) associated with the wireless communication At least one M sequence of the sequence matrix. Moreover, the method can include: generating an SSC from the at least one scrambled M sequence; and mapping the SSC to a subcarrier channel of an orthogonal frequency division multiplexing (OFDM) transmission.

According to other aspects, an apparatus for generating an SSC for wireless communication is provided. The apparatus can include: a logic processor that generates a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; And a data transformation module that uses at least one sequence of the matrix based on a common binary scrambling code associated with one of the PSCs associated with the wireless communication. Additionally, the apparatus can include: a multiplex module that generates an SSC from the at least one disturbed sequence; and a transmission processor that maps the SSC to a subcarrier channel of an OFDM transmission.

According to still other aspects, yet another apparatus for generating an SSC for wireless communication is disclosed. The apparatus can include: means for generating a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; and for using a binary scrambling code based on one of the PSCs associated with the wireless communication A component that disturbs at least a sequence of the matrix. Additionally, the apparatus can include: means for generating an SSC from the at least one disturbed sequence; and means for mapping the SSC to a subcarrier channel of an OFDM transmission.

In an additional aspect of the present disclosure, a processor configured to generate an SSC for wireless communication is provided. The processor can include: a first module that generates a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; and a second module that is used based on the wireless communication A common binary scrambling code of one of the PSCs disturbs at least one sequence of the matrix. The processor can further include: a third module that generates an SSC from the at least one disturbed sequence; and a fourth module that maps the SSC to a subcarrier channel of an OFDM transmission.

According to at least one other aspect, a computer readable medium is provided comprising computer readable instructions configured to generate an SSC for wireless communication. The instructions may be executed by at least one computer from a base M sequence and the base M The cyclic shifting variant of the sequence produces a sequence of matrices and scrambles at least a sequence of the matrix using a common binary scrambling code based on one of the PSCs associated with the wireless communication. Moreover, the instructions are executable by at least one computer to generate an SSC from the at least one disturbed sequence and map the SSC to a subcarrier channel of an OFDM transmission.

According to some aspects, a method for selecting a distinct SSC for a radio network site is disclosed. The method can include: forming a sequence matrix from a base M sequence and n cyclic shift sequences of the base M sequence; and assigning one of the (n+1)^2 indices to the sequence matrix Sequence pair. The method can also include selecting the sequence pair based at least in part on a peak-to-average power ratio (PAPR) or signal correlation that results in one of the SSCs.

Additionally, in accordance with other aspects, an apparatus for selecting a different SSC for a radio network site is provided. The apparatus can include: a logic processor that forms a sequence matrix from a base M sequence and n cyclic shift sequences of the base M sequence; and an indexing module that will substantially (n+1)^2 One of the indices is assigned to a distinct sequence pair of the sequence matrix. According to some aspects, the apparatus can also include: a pruning module that selects the sequence pair based, at least in part, on a PAPR or signal correlation that caused one of the SSCs from a sequence.

In one or more additional aspects, a device for selecting a distinct SSC for a radio network site is disclosed. The apparatus can include: means for forming a sequence matrix from a base M sequence and n cyclic shift sequences of the base M sequence; and for assigning one of substantially (n+1)^2 indices to A component of a sequence of distinct sequences of the sequence matrix. Moreover, the apparatus can include means for selecting the sequence pair based at least in part on a sequence of PAPRs or signal correlations that cause one of the SSCs.

According to at least one other aspect, a processor configured to select a distinct SSC for a radio network site is disclosed. The processor can include: a first module that forms a sequence matrix from a base M sequence and n cyclic shift sequences of the base M sequence; and a second module that will substantially (n+1)^ One of the two indices is assigned to a distinct sequence pair of the sequence matrix. Additionally, the processor can include a third module that selects the sequence pair based at least in part on a PAPR or signal correlation that caused one of the SSCs from a sequence.

In addition to the foregoing, a computer readable medium is provided that includes computer readable instructions configured to select a distinct SSC for a radio network site. The instructions are executable by at least one computer to form a sequence matrix from a base M sequence and n cyclic shift sequences of the base M sequence and assign one of substantially (n+1)^2 indices to the sequence matrix Different sequence pairs. Moreover, the instructions are executable by at least one computer to select the sequence pair based, at least in part, on a PAPR or signal correlation that caused one of the SSCs from a sequence.

According to additional aspects, a method of wireless communication is disclosed. The method can include: receiving a wireless transmission from a mobile network transmitter; and extracting an SSC from the wireless transmission, the SSC including at least two sequences that are scrambled using a common PSC-based binary scrambling code. The method can further include: decrypting the SSC using a common PSC-based binary descrambling code; and The decrypted SSC determines an identification code of the mobile network transmitter.

According to other aspects, an apparatus for wireless communication is provided. The apparatus can include: an antenna that receives wireless transmissions from a mobile network transmitter; and a demodulation device that extracts an SSC from the wireless transmission, the SSC including using a common PSC-based binary scrambling code Disturbing at least two sequences. Additionally, the apparatus can include: a signal processor that utilizes a common PSC-based binary descrambling code to decrypt the SSC; and a logic processor that determines the mobile network transmitter from the decrypted SSC An identification code.

According to still other aspects, an apparatus for wireless communication is disclosed. The apparatus can include: means for receiving a wireless transmission from a mobile network transmitter; and means for extracting an SSC from the wireless transmission, the SSC comprising using at least a common PSC-based binary scrambling code to scramble at least Two sequences. Moreover, the apparatus can include: means for decrypting the SSC using a common PSC-based binary descrambling code; and means for determining an identification code of the mobile network transmitter from the decrypted SSC.

In an additional aspect, a processor configured to communicate wirelessly is disclosed. The processor can include: a first module that receives wireless transmissions from a mobile network transmitter; and a second module that extracts an SSC from the wireless transmission, the SSC including using a common PSC based The binary scrambles the code to disturb at least two sequences. The processor may further include: a third module that decrypts the SSC using a common PSC-based binary descrambling code; and a fourth module that determines the mobile network transmission from the decrypted SSC One of the identifiers.

In accordance with one or more other aspects, a computer readable medium is provided that includes computer readable instructions configured to communicate wirelessly. The instructions are executable by at least one processor to receive a wireless transmission from a mobile network transmitter and extract an SSC from the wireless transmission, the SSC comprising at least two sequences that are scrambled using a common PSC-based binary scrambling code. The instructions are further executable by the at least one processor to decrypt the SSC using a common PSC-based binary descrambling code and determine an identification code of the mobile network transmitter from the decrypted SSC.

To the accomplishment of the foregoing and <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; The specific description in the one or more aspects are described in detail in the following description. However, these are merely a few of the various ways in which the principles of the various aspects can be utilized, and the described aspects are intended to include all such aspects and their equivalents.

Various aspects are now described with reference to the drawings in which like reference numerals are In the following description, numerous specific details are set forth However, it will be apparent that this aspect can be practiced without such specific details. In other instances, well-known structures and devices are shown in block diagram in order to facilitate describing one or more aspects.

Additionally, various aspects of the disclosure are described below. It should be apparent that the teachings herein may be embodied in a variety of forms and that any specific structure and/or function disclosed herein is merely representative. Familiar with this technology Based on the teachings herein, the aspects disclosed herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, a device can be implemented and/or practiced using any number of the aspects set forth herein. In addition, a device and/or a method can be implemented using other structures and/or functionality in addition to or different from one or more of the aspects set forth herein. As an example, many of the methods, devices, systems, and apparatuses described herein are in the context of determining the characteristics of one or more wireless channels and providing a handover determination based in part on the magnitude of the determined characteristic. description. Those skilled in the art should understand that similar techniques can be applied to other communication environments.

In one or more aspects, the present disclosure provides reduced interference for multiple secondary synchronization code (SSC) transmissions in a multi-transmitter environment. The environment can be associated with a planned, semi-planned, and/or unplanned mobile communications environment. Typically, a Radio Access Network (RAN) base station (BS) utilizes synchronization codes to facilitate mobility with mobile devices (eg, cellular phones, cellular enabled laptops, multi-mode phones, personal digital assistants [PDA] and/or Or the like (OTA) communication. The mobile device monitors the synchronization code (and other portions of the OTA transmission in some examples) to determine when the relevant information is provided by the BS. In the case where many BSs exist within relatively small communication sites (e.g., such that the mobile device receives wireless transmissions from many BSs), the synchronization codes can interfere with each other, making it difficult to distinguish at the mobile device. Therefore, the mechanism for reducing or avoiding synchronization code interference can improve the reliability of mobile communication.

According to some aspects, a specific mechanism is provided to generate SSC and use P-SCH phase Turn off the garbled code to disturb. When transmitted in a common action environment (eg, a single action deployment site or multiple closely located action sites), the scrambled SSCs may be less likely to interfere with each other. In at least one aspect, the SSC can be generated from a first set of sequences provided by the first mathematical expression, and the scrambling code to scramble the SSC can be generated from different mathematical expressions. Further, the sequence index of the scrambling code can be selected based on a primary synchronization channel (P-SCH). Various mechanisms can be utilized to generate a scrambled SSC and reduce interference from multiple SSCs transmitted by multiple sources (e.g., BS).

The SSC can be generated from a plurality of sequences selected from a sequence of matrices comprising a base sequence and a variant of the base sequence (eg, a cyclic shift sequence). The scrambling code can be used to disturb the underlying sequence, the selected sequence, and/or the SSC to reduce interference from the OTA SSC. As an example, a pair of selected sequences may first be scrambled by a scrambling code, which may then be combined to form a full length scrambled SSC sequence (eg, by interlaced sequence pairs), which may be disturbed by the full length of the SSC The sequence is mapped to an OTA message. In another example, the pair of sequences can be first interleaved to form an undisturbed full length sequence and then the full length sequence is scrambled by the scrambling code, which is then mapped to the transmission. In other examples, the base sequence can be scrambled such that the sequence matrix contains the scrambled base sequence and its disturbed variations. In this example, a pair of scrambled sequences can be selected from the matrix, interleaved to form a full-length SSC sequence, and mapped to an OTA message. The disturbed SSC sequence can produce reduced interference of the transmitted SSC and improve transmission reliability for planned, semi-planned or unplanned mobile base station deployments.

Provided to generate PSC-based disturbances according to one or more other aspects A code mechanism that randomizes interference between encoded signals. Multiple sequences (eg, three sequences) are utilized to generate a scrambling code for one or more SSCs. A plurality of sequences may comprise a collection of full length sequences (or, for example, a modified full length sequence, such as truncated by one bit) or a set of semi-long sequences (which are appended to other semi-long sequences of the set). In at least one aspect, a set of full length and/or half length sequences is generated from a common M sequence polynomial. In another aspect, a set of full length and/or half length sequences can be generated from a plurality of M sequence polynomials. In at least one additional aspect, a PSC-based scrambling code is generated from three half-length M sequences generated from a polynomial different from the polynomial used to generate the SSC.

In accordance with one or more other aspects, an SSC codebook for generating an SSC for a multi-transmitter mobile site is provided. The SSCs can be generated from various sequences of a sequence of matrices. The sequences can be selected based on the PAPR and/or related decisions of the SSCs resulting from a pair of sequences. Thus, the resulting SSC can exhibit improved transmission and reduced interference due to the aspects of the present disclosure.

As used in this disclosure, the terms "component", "system" and the like are intended to mean a computer-related entity that is a hardware, a software, an executing software, a firmware, an intermediate software, a microcode, and/or Any combination of them. For example, a component can be, but is not limited to being, a process executed on a processor, a processor, an object, an executable, a thread, a program, and/or a computer. One or more components can reside in a process and/or execution thread, and a component can be localized on a computer and/or distributed between two or more computers. In addition, such components can be executed from a variety of computer readable media having various data structures stored thereon. A component can, for example, have one or more data packets (eg, For example, signals from other components in the local system, the decentralized system, and/or components that interact with other systems via signals such as the Internet, by local and/or far End process and communicate. In addition, as will be appreciated by those skilled in the art, the components of the systems described herein may be reconfigured and/or supplemented by additional components to facilitate the achievement of various aspects, objectives, advantages, etc. described herein and are not limited thereto. The precise configuration stated in the given diagram.

Moreover, various aspects are described herein in connection with a mobile communication device (or, for example, a mobile device). Mobile communication devices may also be referred to as systems, subscriber units, subscriber stations, mobile stations, mobile devices, remote stations, remote terminals, access terminals, user terminals, user agents, user devices, or users. device. The subscriber station can be a cellular telephone, a wireless telephone, a Session Initiation Protocol (SIP) telephone, a wireless area loop (WLL) station, a personal digital assistant (PDA), a wireless connection capable handheld device, or a wireless data modem. Or other processing device that facilitates a similar mechanism to wireless communication of the processing device.

In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, intermediate software, microcode, or any suitable combination thereof. If implemented in software, the functions may be stored as one or more instructions or code on a computer readable medium or transmitted through a computer readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of the computer program from one location to another. The storage medium can be any available media that can be accessed by a computer. By way of example and not limitation, such computer-readable media can include RAM, ROM, EEPROM, A CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or any other medium that can be used to carry or store the desired code in the form of an instruction or data structure and accessible by a computer. Additionally, any connection is properly termed a computer-readable medium. For example, if you use a coaxial cable, fiber optic cable, twisted pair cable, digital subscriber line (DSL), or wireless technology such as infrared, radio, and microwave to transmit software from a website, server, or other remote source, the coaxial cable , fiber optic cables, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of the media. Disks and optical discs as used herein include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy discs and Blu-ray discs, where the discs are typically magnetically regenerated and used by discs. The laser optically regenerates the data. Combinations of the above should also be included in the context of computer readable media.

For hardware implementations, processing units, various illustrative logic, logic blocks, modules, and circuits described in connection with the aspects disclosed herein can be implemented or implemented in one or more of the following: Circuit (ASIC), digital signal processor (DSP), digital signal processing device (DSPD), programmable logic device (PLD), field programmable gate array (FPGA), discrete gate or transistor logic, discrete hardware Components, general purpose processors, controllers, microcontrollers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, a combination One or more microprocessors of a DSP core, or any other suitable configuration. Additionally, at least one processor can comprise one or more modules operable to perform one or more of the steps and/or actions described herein.

In addition, various aspects or features described herein can be implemented as a method, apparatus, or article of manufacture by using standard stylization and/or engineering techniques. Furthermore, the steps and/or actions of a method or algorithm described in connection with the aspects disclosed herein may be embodied in a hardware, in a software module executed by a processor, or in a combination of the two. In addition, in some aspects, a method or algorithm step and/or action may reside on a machine readable medium and/or computer readable medium as at least one or any combination or combination of code and/or instructions. The machine readable medium and/or computer readable medium can be incorporated into a computer program product. The term "article of manufacture" as used herein is intended to encompass a computer program accessible from any computer readable device, carrier, or media. By way of example, computer readable media may include, but are not limited to, magnetic storage devices (eg, hard disks, floppy disks, magnetic strips...), optical disks (eg, compact discs (CDs), digital versatile discs (DVD)...) , smart cards and flash memory devices (eg cards, sticks, secure disks...). Additionally, various storage media described herein can represent one or more devices and/or other machine-readable media for storing information. The term "machine-readable medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and/or carrying instructions and/or data.

Moreover, the word "exemplary" is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other aspects or designs. The truth is, the word The use of "exemplary" is intended to present concepts in a specific manner. As used in this application, the term "or" is intended to mean an inclusive "or" rather than an exclusive "or". That is, "X utilizes A or B" is intended to mean any of the natural inclusive permutations unless otherwise indicated or clear from the context. That is, if X utilizes A; X utilizes B; or X utilizes both A and B, then "X utilizes A or B" is satisfied in the case of any of the previous examples. In addition, the word "a" as used in the present application and the appended claims should be understood to mean "one or more" unless otherwise indicated.

As used herein, the term "inferred" generally refers to a process of deriving or inferring the state of a system, environment, and/or user from a collection of observations captured via events and/or materials. Inference can be used to identify a particular situation or action, or, for example, to generate a probability distribution with respect to a state. The inference can be probabilistic, that is, based on the calculation of the probability distribution of the state involved, based on consideration of the data and events. Inference can also refer to techniques used to construct higher order events from a collection of events and/or data. Regardless of whether the events are closely related in time, and regardless of whether the events and data are from one or several events and sources of information, this inference results in the construction of new events or actions from the observed events and/or the collection of stored event data. .

Referring now to the drawings, FIG. 1 illustrates a wireless communication system 100 having a plurality of base stations 110 and a plurality of terminals 120 that can be utilized in conjunction with one or more aspects. The base station (110) is generally a fixed station that communicates with the terminal and may also be referred to as an access point, a Node B, or some other terminology. Each base station 110 provides communication coverage for a particular geographic area or coverage area, which areas are Illustrated as three geographic regions in Figure 1 labeled as 102a, 102b, and 102c. The term "cell" can refer to the base station and/or its coverage area, depending on the context in which the term is used. To improve system capacity, the base station geographic area/coverage area can be partitioned into multiple smaller areas (eg, three smaller areas, according to cell 102a in FIG. 1) 104a, 104b, and 104c. Each of the smaller regions (104a, 104b, 104c) can be servoed by a respective base station transceiver subsystem (BTS). The term "sector" may refer to the context of the term to refer to the BTS and/or its coverage area. For a sectorized cell, the BTSs of all sectors of the cell are typically co-located within the base station of the cell. The transmission techniques described herein are applicable to systems with sectorized cells and systems with unsectorized cells. For the sake of simplicity, in the following description, unless otherwise specified, the term "base station" is generally used for a fixed station of a servo sector and a fixed station of a servo cell.

Terminals 120 are typically distributed throughout the system, and each terminal can be fixed or mobile. A terminal can also be referred to as a mobile station, user equipment, user device, or some other terminology. The terminal can be a wireless device, a cellular phone, a personal digital assistant (PDA), a wireless data card, and the like. Each terminal 120 can communicate with zero, one or more base stations on the downlink and uplink at any given time. The downlink (or forward link) refers to the communication link from the base station to the terminal, and the uplink (or reverse link) refers to the communication link from the terminal to the base station.

For a centralized architecture, system controller 130 is coupled to base station 110 and provides coordination and control for base station 110. For a decentralized architecture, base stations 110 can communicate with each other as needed. Data transmission on the forward link is usually from An access point to an access terminal occurs at or near the maximum data rate supported by the forward link and/or the communication system. Additional channels of the forward link (e.g., control channels) can be transmitted from multiple access points to an access terminal. Reverse link data communication can occur from one access terminal to one or more access points.

2 is an illustration of a particular or unplanned/semi-planned wireless communication environment 200 in accordance with various aspects. System 200 can include one or more base stations 202 in one or more cells and/or sectors that receive, transmit, repeat (equal) wireless communications to each other and/or to one or more mobile devices 204 signal. As illustrated, each base station 202 can provide communication coverage for a particular geographic area (illustrated as four geographic areas labeled 206a, 206b, 206c, and 206d). As will be appreciated by those skilled in the art, each base station 202 can include a transmitter chain and a receiver chain, each of which can in turn include a plurality of components associated with signal transmission and reception (eg, a processor) , modulator, multiplexer, demodulation transformer, demultiplexer, antenna, etc.). The mobile device 204 can be, for example, a cellular telephone, a smart phone, a laptop, a palm-type communication device, a palm-sized computing device, a satellite radio, a global positioning system, a PDA, and/or for use via the wireless network 200. Any other suitable device for communication. As set forth herein with respect to subsequent figures, system 200 can be utilized in conjunction with the various aspects described herein to facilitate providing and/or utilizing synchronized OTA messaging in a wireless communication environment (200).

3 is a block diagram of an example system 300 that provides reduced interference of synchronization messages in a mobile communication environment. Synchronization messages as utilized in the context of system 300 may include SSC. As discussed in this article, it should be understood that available The primary synchronization code (PSC) or P-SCH aspect reduces the interference of the SSC. It should be further appreciated that the mobile communication environment associated with system 300 may include Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) (hereinafter collectively referred to as LTE) system, Evolved Global Mobile Telecommunications System (UMTS) terrestrial radio storage. An E-UTRAN system, or a combination thereof or the like. For example, using orthogonal frequency division multiple access (OFDMA) access techniques, frequency division multiplexing (FDM) (eg, including orthogonal FDM (OFDM), coded OFDM (COFDM)), and/or the like Other suitable mobile communication architectures are included in the mobile communication environment. It should be further appreciated that those skilled in the art can determine appropriate mechanisms for applying the techniques below to other mobile communication environments, including code division multiple access (CDMA) environments (eg, CDMA2000, 3GPP2, etc.), time-sharing multiple access ( TDMA) environment (eg, TDMA), time division duplex (TDD) environment, or a suitable combination thereof (eg, TD-CDMA, TD-SCDMA, UMTS-TDD, FDMA/TDMA/FDD, etc.).

System 300 can include an SSC generator 302 coupled to one or more base stations of RAN 306 (e.g., E-UTRAN). One or more devices 304 may be serviced by the RAN 306. The base station (306) can communicate with the mobile device 304 by exchanging OTA messages. The OTA message sent to the mobile device 304 typically includes one or more synchronization messages to facilitate this communication. For example, the PSC can be utilized to indicate where the data is wrapped in the message, the length of the message, the frequency of synchronization, or the like. The SSC can provide prior information as well as the identification number of the transmission base station 306. Thus, the SSC can be utilized by the mobile device 304 to distinguish one base station (306) from another base station (306) in the multiple transmitter site 306.

In the case of transmitting multiple OTA messages by multiple base stations, in general Parallel time can cause interference between messages. Interference with synchronization information can result in loss of information, increased power consumption at the mobile device 304, and communication inefficiencies. To reduce the occurrence of interference, SSC generator 302 may utilize one or more scrambling codes to reduce the likelihood that two SSCs will interfere with each other at the receiving device (304).

System 300 can further include a logic processor 308 that generates a sequence matrix for generating one or more SSCs for the base station for RAN 306. For example, sequences, sequence pairs, sequence triplets, and the like can be utilized to generate SSCs. In one aspect, a sequence pair of sequences of length 31 (e.g., a binary sequence of 31 binary bits) is utilized to generate a 62-bit SSC. The sequence pairs are sequenced by the optional free logic processor 308. In an example, the sequence matrix can be generated from a single base M sequence of length 31. The sequence can be derived from a suitable polynomial expression. In other aspects, logical processor 308 derives a base M sequence from a polynomial expression different from the polynomial expression used by data transformation module 310 (below) to generate a sequence for the SSC scrambling code. As a specific example, the polynomial expression used to generate the underlying M sequence may have the form x^5+x^2+1 on GF(2), where GF(2) indicates the Galois field in which the result of the constraint expression is a binary number (Galois Field).

Once a base sequence is generated by the logical processor 308, a variation of the base sequence can be formed to fill the sequence matrix. In some aspects, a variation is produced that is substantially equal to the number of digits of the base sequence. (For example, if the base sequence contains 31 digits, then 29, 30, 31 or a substantially similar number of variants is produced). The variants are combined with the base sequence to form a sequence matrix (For example, wherein the first, second, third, etc. columns of the matrix respectively comprise a base sequence, a first variant, a second variant, etc., and wherein the first, second, third, etc. rows of the matrix respectively comprise each sequence The first, second, third, etc., for example, see Figure 4 above.

Once the sequence matrix is defined, the logical processor can select from the matrix to generate multiple sequences of SSCs. As an example, a pair of sequences of length 31 can be selected to form a SSC of length 62. Each such SSC can then be assigned to one or more base stations of the RAN 306 and can carry identification information (e.g., base station ID) that distinguishes such base stations from other base stations. As discussed in more detail below at Figures 5 and 6, the selection may be based on a number of factors including, but not limited to, the PAPR of the resulting SSC, or signal correlation, or a combination thereof, or the like. As discussed below, to reduce interference between SSCs transmitted by RAN 306, the SSC can be disrupted by utilizing one or more scrambling sequences, such as a PSC based sequence.

System 300 can further include a data transformation module 310 that uses a common binary scrambling code to scramble at least one sequence of a sequence of matrices. In at least one aspect, the scrambling code can be generated by a sequence module 312 that utilizes sequences derived from a common polynomial expression. The common polynomial expression and/or the derived sequence may be based on a PSC associated with wireless communication (eg, an OTA message). As an example, an index derived from PSC may be utilized to select a sequence pair, a sequence triplet, or the like (eg, a self-scrambling code sequence matrix) to generate a scrambling code. The selection of the PSC-based scrambling code sequence can provide reduced interference for OTA transmissions of multiple SSCs.

It should be appreciated that the data transformation module 310 can utilize the scrambling sequence to disturb the longitude The components of the SSC, SSC (for example, sequences that form SSCs, sequences of triplets, etc.) or sequences of the sequence matrices themselves. In a particular example, data transformation module 310 can scramble the underlying sequence used to generate the sequence matrix. Derivative sequences (e.g., cyclic shift variants) that are used to form the scrambled base sequence of the sequence matrix are also inherently disturbed. Thus, a sequence matrix can be formed from a scrambled sequence (eg, by utilizing a scrambled base sequence or variations thereof), an undisturbed sequence (eg, by utilizing an unscrambled base sequence and variations thereof), or both . As described in more detail below, the disturbed sequence of matrices is selected by the logical processor 308, interleaved by the multiplex module 314, and mapped by the transport processor 316 to the OTA message.

In other examples, the scrambling code can be applied to one or more undisturbed sequences selected from undisturbed sequence matrices. For example, data transformation module 310 can scramble a plurality of short sequences selected from the matrix, which are then interleaved by multiplex module 314 to form a full length SSC sequence. As another example, the multiplex module 314 can first interleave a short sequence and then provide the resulting full length sequence to the data transformation module 312, which scrambles the full length sequence. The scrambled sequence is then used as the SSC for one or more base stations (306).

Various types of scrambling codes can be generated by the sequence module 312 as is known in the art or as known in the art. As mentioned above, the sequence module 312 can generate various sequences (eg, M sequences) from a common polynomial expression or a different polynomial expression. In at least one aspect, a scrambling code is generated based on three M sequences of length 63, wherein each sequence of length 63 is truncated by one bit to form a perturbation Garbled (or, for example, changing a bit to 0 and mapping to a DC transmission of a wireless transmission tone). In another example, a scrambling code based on three M sequences of length 31 is generated, and three repetitions are used to generate three scrambling codes of length 62 (eg, where B is a sequence of length 31, the repetition may have a form [ B, B]).

In at least one particular aspect, each of the plurality of scrambling code sequences can be formed from a single polynomial expression. In one aspect, the polynomial expression can have the form 1+x^2+x^3+x^4+x^5. The resulting scrambling code sequence can be represented by C(0, n). As a specific example of a suitable scrambling sequence, C(0,n) may indicate the following M sequence: C(0,n)={-1,1,1,1,-1,-1,-1,1,- 1,1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1, 1,1,1} The above sequence C(0,n) may represent a basic M sequence. A cyclic shift variant of the base M sequence (see, for example, Figure 4 below) can be defined as C(k,n)=C(0,(n+k) mod N). Therefore, a scrambling code of length 63 can be obtained according to the following equation: [C(u, 0), C(u, 0), ..., C(u, 14), C(u, 14), C(u, 15 ), 0, C(u, 15), C(u, 16), C(u, 16), ..., C(u, 30), C(u, 30)] where 0 can be mapped to frequency based transmission The DC carrier frequency is adjusted. It will be appreciated that other length codes can be generated by setting the appropriate values for k and n of C(k,n) (eg, k and n can have suitable values greater than zero). For the case of length 63, the disparate scrambling code can be generated by selecting the distinct value of 'u'. The value 'u' can be selected based on the desired number of scrambling code sequences of one of these sequences. For example, five, ten, twenty, etc. variations of the base M sequence can be selected. For 31 possible sequences, 'u' may correspond to the set {0,...,30}.

In at least one aspect, the sequence module 312 can be self-formed C(k,n)=C(0,(n+k) mod N) produces three scrambling sequences. The scrambling code may correspond to the following three 'u' values: {0, 10, 20}, thus utilizing the base M sequence, the tenth cyclic shifting variant of the base sequence, and the twentieth cyclic shifting variant of the base sequence. The resulting three scrambling code sequences are: C(0,n)={-1,1,1,1,-1,-1,-1,1,-1,1,-1,1,1,-1 ,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,1,1} C(10,n)= {-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,1 ,1,-1,1,1,1,-1,-1,-1,1,-1,1} C(20,n)={1,-1,-1,1,-1,- 1,1,1,1,1,1,-1,1,1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,- 1,-1,-1,-1,1}

The aforementioned scrambling sequence can be used to generate a scrambling code having a varying length (e.g., a scrambling code of length 62) and combined with the SSC sequence. The scrambled sequence is mapped to a wireless transmission as discussed below. A significant reduction in interference between transmitted SSCs can be achieved by utilizing a scrambling sequence of a common polynomial expression.

System 300 can further include a transport processor 316. Transport processor 316 can map the SSC to a component of the OTA message. Specifically, the SSC can be mapped to a subcarrier channel of a frequency-based message (eg, FDM, OFDM, OFDMA) and mapped to a code-based message (eg, CDMA, CDMA-2000, Wideband CDMA [WCDMA]) On the code division, the appropriate ones that are mapped to time-based or combined system messages (eg, TD-CDMA, TD-SCDMA, UMTS-TDD, FDMA/TDMA/FDD, etc.) based on time-based messages (eg, TDMA) On the weight. The OTA message can be received at the mobile device 304, and the mobile device 304 can utilize suitable techniques for decoding the message and SSC. In at least one example, the mobile device 304 can utilize a process for decoding the SSC that is substantially inverse to the process utilized by the SSC generator 302 for encoding/scrambling the SSC. Instructions for decoding SSC can be pre- Loaded into the mobile device 302, downloaded from or included in the OTA message (eg, message) from a network patch or the like (eg, a software and/or hardware patch at the service provider's web server) In the lead or the like).

As described, system 300 can provide significant benefits for wireless communication. SSC scrambling codes generated from a common polynomial expression and indexed based on a corresponding PSC may result in reduced interference of SSCs transmitted by multiple base stations (306). This result can have even greater benefits, with a larger number of base stations (306) present in a semi-planned or unplanned deployment where the interference can be high and the signal-to-noise ratio (SNR) is relative low. Thus, system 300 can provide increased efficiency and OTA reliability even for adverse wireless environments.

4 illustrates an example sequence matrix 400 that can be utilized to generate synchronization codes and/or scrambling codes for the various aspects described herein. Sequence matrix 400 contains a number of sequences represented by columns of matrix 400. The first (top) column of the matrix is a base sequence. The lower columns of the matrix are variants of the base sequence. As depicted in Figure 4, the lower columns are cyclic shift variants of the base sequence, but it should be understood that other suitable variations of the binary base sequences known in the art can be utilized to produce a sequence matrix similar to that depicted at 400. Sequence matrix. As depicted by the arrows shown in the sequence matrix 400, the cyclic shift is a unit number shift, whereby a variation of the base sequence is formed by shifting each sequence by one position, or one matrix row, as compared to the previous sequence. . Thus, bit 1 of the base sequence is -1, and the first cyclic shift variant of the base sequence (depicted at column 2 of the matrix) has the same -1 in the second bit (the second row). In addition, each bit of the base sequence is shifted to the first The next row to the right of the cyclic shift sequence. It will be appreciated that multiple cyclic shifts may alternatively be utilized such that instead of shifting a single row, each bit is shifted by two rows, three rows, etc., relative to the previous sequence.

The extra columns of the matrix present a further shift of the base sequence. Therefore, the bits of the second cyclic shift sequence (column 3) are shifted by two rows from the base sequence (column 1), and are performed throughout each column and the like. For a matrix with 'L' rows, based on the sequence length 'L', the matrix may contain at least 'L' unique sequences, including L-1 single cyclic shift variants of the base sequence and the base sequence. This sequence can be utilized to generate synchronization codes and/or scrambling codes as described herein. Where 'L' matches the desired code length, a single sequence of matrices 400 can be utilized to generate such codes. Alternatively, where 'L' is shorter than the desired code length, multiple sequences of matrix 400 may be utilized to generate the code.

As an example of the foregoing, a desired code length (e.g., SSC length) is 62 bits. In the case where 'L' is equal to 62, a single sequence of matrices 400 can be utilized to form the code. In the case where 'L' is equal to 31, the sequence of the matrix 400 can be interleaved to form the code. In the case where 'L' is equal to 21, the code can be generated by interleaving a sequence triplet in which one of the sequences is truncated by one bit. It should also be appreciated that a substantially similar sequence length can be utilized in conjunction with bit truncation and/or bit repetition (eg, a M sequence of length 63 can be truncated by one bit to form a code of length 62, or Sequence pairs of length 30 or length 32 are utilized in conjunction with a single bit repetition or truncation to form a code of length 62, etc.).

In the case of dense base station deployments where several dozen or hundreds of base stations operate at a common geographic location (see, for example, Figure 1 above), the utilization is shorter than Sequence pairs, triplets, etc. of the length of the object code length may be beneficial. This is due to the fact that more unique sequence pairs, triplets, etc. can be extracted from the sequence matrix 400 compared to a single sequence. For example, if 'L' is equal to 62 and the desired SSC length is 62 bits, then there are 62 unique single sequences to form 62 distinct SSCs. However, in the case where the matrix 400 has 'L' = 31 and for a SSC of length 62, there are 961 (31^2) sequence pairs that can form 961 different SSCs. As another example, for 'L=20' or 'L=21' (using bit repetition or truncation), there are respectively 8,000 or 9261 sequence triplet combinations that can produce different SSCs. Thus, by selecting the appropriate sequence length for the desired SSC length and utilizing pairs of sequences, triplets, etc., the number of unique codes generated by matrix (400) can be increased.

In at least one specific example of the claimed subject, matrix 400 is a square matrix of 31 M-sequences having a length 'L' equal to 31. The base sequence is a binary sequence resulting from a polynomial expression of the form x^5+x^2+1 on GF(2). Moreover, the additional sequence is a single cyclic shift variant of the base sequence (eg, as depicted by the arrow of sequence matrix 400). Pairs of sequences can be selected and interleaved to form various dissimilar SSC codes. As described elsewhere herein, SSC scrambling can be implemented in a variety of ways (see, for example, Figure 3 above). In one example, the selected pairs can be interleaved to form a sequence of length 62 and then scrambled. Alternatively, the selected sequence of length 31 can be disturbed and then interleaved to form a sequence of length 62. As a further alternative, the base M sequence can be disturbed such that each cyclic shift variant of the matrix 400 is also disturbed. The disturbed sequence pairs can then be selected and interleaved to form a SSC code of length 62. Depending on the situation, 0 bits can be added to a code of length 62 to form a code of length 63, where 0 bits Map to the DC carrier tone of the wireless transmission. Thus, various mechanisms can be utilized to reduce interference from overlapping wireless messages received at a device, thereby providing improved reception and overall communication, and potentially reducing power at the receiving device (e.g., by avoiding repeated transmissions).

5 depicts a block diagram of an example system 500 that provides reduced interference of transmitted SSCs in a multi-transmitter mobile site. More specifically, system 500 provides a selective codebook for selecting a sequence combination for generating the resulting SSC. In some aspects, the sequence combination can be based on the basic characteristics of the resulting SSC. Thus, improved wireless transmission can be achieved by properly selecting the SSC that produces the desired characteristics in the mobile communication environment.

System 500 includes an SSC index selector 502 that identifies one or a plurality of SSC sequences or sequence groups (eg, for generating a base station 504 that can be assigned to a RAN (not depicted, but see FIG. 3, 306) (eg, , sequence pair). The SSC index selector 502 can include a logical processor 506 that forms a sequence matrix from which the sequence or sequence group can be selected. A number of variations of a base sequence and a base sequence can be utilized to form a sequence matrix. In at least one aspect, the base sequence is a binary M sequence of length n+1, and the matrix comprises n cyclic shift variants of the base sequence and the base sequence (eg, as depicted at Figure 4 above). An indexing module 508 can assign an index to a sequence and/or sequence group of sequence matrices. The sequence/sequence group can be selected by reference to the assigned index. In at least one aspect of the disclosure, the indexing module assigns substantially (n+1) ^x indices, where x is the number of sequences in a group. Thus, for a single sequence, a total of n+1 indices are assigned. For sequence pairs, assign substantially (n+1)^2 indexes, and so on.

In the event that there are more distinct combinations of SSC sequences for the base station (504) that require the SSC, the trim module 510 can select the sequence/sequence group based on the characteristics of the resulting SSC. These characteristics can be based on the results of the signal simulator, for example, the signal simulator can determine the interference, power loss, cross-correlation, and similar characteristics of the SSC. The sequence/sequence group of SSCs having the desired characteristics (such as low PAPR) can be selected to generate the SSC.

As a specific example of the aspect of system 500, logical processor 506 defines a sequence matrix having 31 sequences of length 31. A sequence pair of matrices may be represented by (u, v), where both u and v have values {0,...,30}. A number of SSCs of length 62 can be generated based on the sequence pair (u, v) of the sequence matrix. The indexing module 508 assigns (n+1)^2 or 961 indices to the 961 distinct sequence pairs of the sequence matrix. These indexes can be generated using an algorithm with the form r=u*31+v. In one aspect of the example, trim module 510 selects 961 based on characteristics of SSC signals that include sequence pairs (eg, including scrambling (such as provided by a common PSC-based scrambling code) and interleaving the sequences). 170 of the different indexes. One or more of the selected SSCs (eg, a pair) can then be modulated by the transmission processor 512 (eg, using a modulator, signal encoder, etc.) into a radio frame to resolve the frame boundary of the radio frame. . As a specific aspect of this example, the following SSC index corresponding to a maximum PAPR of substantially 6.75 decibels (dB) can be utilized: r = u * 31 + v: 16 18 20 33 62 63 66 70 71 75 80 83 93 99 104 105 113 116 121 125 126 140 153 168 169 170 173 189 190 191 203 204 210 211 220 226 228 233 236 241 251 261 267 268 270 278 287 293 300 304 313 317 327 332 336 367 377 379 388 395 399 401 417 418 419 422 424 426 435 439 445 452 453 456 457 466 475 478 482 486 488 493 498 508 515 516 517 518 531 533 534 543 546 553 554 560 565 587 589 592 606 614 618 621 623 625 628 631 636 645 653 665 677 678 684 700 707 708 711 713 714 719 725 728 735 738 745 751 752 755 765 770 777 781 789 797 801 802 810 816 818 819 826 829 831 851 854 856 862 863 871 879 889 897 901 909 910 913 916 917 930 938 940 946 954

In another aspect of the example, trim module 510 also selects 340 of the 961 distinct indices based on the characteristics of the SSC signal containing the selected sequence pair. Different carrier tones derived from one or more of the 340 resulting SSCs (e.g., different carrier tones of a pair of SSCs) may be modulated by the transmission processor 512 into a radio frame to resolve the frame boundaries of the radio frame. In a specific aspect, the following SSC index corresponding to a maximum PAPR of substantially 7.18 dB is utilized r = u * 31 + v: 2 5 6 7 11 14 17 18 20 23 27 30 33 37 39 41 43 44 47 50 53 60 61 63 65 66 68 70 71 74 75 80 84 86 88 99 101 102 104 105 107 111 113 114 115 116 121 125 126 137 140 144 151 153 155 158 168 169 170 173 183 187 189 190 191 197 203 204 205 209 210 211 212 217 219 220 225 226 227 228 233 236 238 240 241 257 259 263 266 267 268 270 271 276 277 278 285 286 290 292 293 294 300 303 304 306 307 310 311 312 313 316 317 327 331 332 336 338 339 341 342 344 346 347 353 359 360 362 363 379 372 373 374 394 399 401 406 413 417 418 419 420 421 422 424 426 430 439 442 445 446 450 452 453 454 456 457 463 466 475 478 482 483 485 486 492 493 494 495 498 499 505 506 508 513 515 516 517 533 533 539 543 549 550 553 554 560 565 569 570 571 572 573 579 583 587 588 589 590 592 594 596 603 606 607 609 610 614 620 621 625 630 631 634 636 637 642 645 646 653 657 659 661 664 668 675 677 678 679 681 682 684 686 690 694 699 700 702 707 708 709 720 725 726 728 732 733 735 738 739 740 741 747 751 752 753 755 760 764 767 770 772 773 780 781 782 785 787 789 791 795 797 801 802 805 810 811 815 818 819 821 823 825 826 830 831 838 842 845 846 851 853 854 856 862 863 868 871 875 876 878 879 881 889 891 892 897 901 906 907 909 910 913 916 916917 918 919 925 930 935 936 940 942 943 944 951 954 957 959

In another example for selecting a code index, it can be used for minimization based on An index of 170, 340 or another suitable number is selected for the number of overlapping code indices in an SSC. For example, a first set of sequences 'u' of length 31 may utilize an index {0, 1, 2, ..., 19}. The second set of sequences 'v' of length 31 may utilize the indices {11, 13, 14, ..., 30} to minimize the overlap between the 'u' and 'v' sequences of the resulting SSC. In some examples, reduced index overlap may provide reduced interference between transmitted codes.

As described, system 500 can provide an SSC codebook that selects SSC based on the basic characteristics of the transmitted synchronization signal. This result can result in improved signal reception, reduced traffic (e.g., less data retransmission requests) for terminal devices in the mobile environment, and lower power consumption for such terminals. Thus, significant benefits can be provided by system 500 for a mobile communication environment.

6 illustrates a block diagram of an example system 600 that utilizes an SSC codebook as described herein for reducing interference between SSC transmissions. The selection of the SSC code may be based on a comparison of the transmitted power and/or cross-correlation properties of the simulated SSC with one or more thresholds. The resulting SSC can be tuned into a wireless transmission (e.g., a radio frame) to resolve the frame boundary of the transmission. Because the SSC selection is based on basic SSC characteristics, improved power and/or related characteristics can be provided by system 600 for mobile communications.

System 600 includes an SSC index selector 602 that indexes sequences and/or sequence groups of sequence matrices. The index selector may select one or more indices based on the power and/or cross-correlation properties of the simulated SSC code 604 caused by a particular sequence of free-index identifications. A product that can be evaluated for power and/or cross-correlation properties based on a comparison with one or more thresholds quality. For example, the pruning module 606 can adjust the selection of a particular index based on a comparison of the SSC PAPR to the PAPR threshold (eg, based on a nominal OFDM symbol), a comparison of the SSC interaction correlation with an interrelated correlation threshold, or both. Thus, the resulting SSC having predetermined quality characteristics can be produced.

System 600 can utilize a signal simulation module 608 to determine the PAPR of the simulated SSC (604) caused by the sequence of freely identified by a particular index. The signal simulation module 608 can compare the determined PAPR with the threshold PAPR and forward the result to the trim module 606. A relatively low PAPR is generally beneficial for wireless transmissions (e.g., as compared to transmission of typical frequency modulated signals), thereby causing negligible impact on downlink transmissions in many instances. Thus, the threshold may generally specify a certain maximum acceptable PAPR, an acceptable range within the desired PAPR (eg, within 3 dB of the desired PAPR), and a number of SSCs below the desired PAPR (eg, have lower than desired) 30 SSCs of the PAPR value of the PAPR) or the like, or a suitable combination thereof.

The system 600 can also utilize a signal correlation module 610 that determines the interaction correlation factor of the simulated SSC (604) caused by the sequence of a particular index identification. The signal correlation module 610 can compare the determined interaction correlation and interaction correlation threshold to assess the quality of the simulated SSC 604. Signals that are strongly correlated with other signals can often exhibit high interference, so minimal cross-correlation can be desirable. Accordingly, the pruning module 606 can adjust the selection of a particular sequence index based, at least in part, on the interaction correlation being equal to or below the threshold correlation. In some aspects, the pruning module 606 can adjust the selection of a particular sequence index based on a combination of PAPR results and interactivity related results. For example, if the simulated SSC (604) has a PAPR lower than the threshold PAPR and low The correlation associated with the simulated SSC (604) may be selected in relation to the relevant threshold. As described, system 600 provides a convenient mechanism for selecting an index of a sequence matrix to provide beneficial PAPR and/or low cross-correlation properties, resulting in improved wireless transmission and reliability in many instances.

FIG. 7 depicts a block diagram of an example system 700 in accordance with aspects of the present disclosure, the system 700 including a base station 702 and one or more mobile devices 704. In at least one aspect of the present disclosure, base station 702 can determine a suitable SSC code and/or a scrambling code to reduce interference with the transmitted synchronization information. In particular, the base station 702 can implement the sequence index for generating and scrambling the SSC, generating a scrambling code for the SSCs (eg, based on three M sequences of length 31), and based on the characteristics of the SSCs. Various mechanisms. Thus, system 700 facilitates improved mobile communication by providing improved transmission characteristics for OTA messages received at one or more mobile devices 704 in a mobile communication environment.

System 700 includes a base station 702 (e.g., an access point...), wherein receiver 710 receives signals from one or more mobile devices 704 via a plurality of receive antennas 706, and transmitter 728 transmits signals via a transmit antenna 708 To the one or more mobile devices 704. Receiver 710 can receive information from receive antenna 706 and can further include a signal receiver (not shown) that receives uplink data synchronized in accordance with the PSC and/or SSC provided by base station 702. Additionally, receiver 710 is operatively associated with demodulation transformer 712 that demodulates the information received by the transformer. The demodulated symbols are analyzed by a processor 714 that is coupled to a memory 716 that stores and generates a sequence of matrices to provide synchronization and/or scrambling codes. And selecting, scrambling, and/or multiplexing the sequences to form an SSC, according to an SSC codebook known to those skilled in the art, as known in the art, as described herein, or by the context provided herein. Select sequence related information and/or any other suitable information related to performing the various actions and functions set forth herein.

Processor 714 is further coupled to a logic processor 718 that can generate a sequence of matrices from at least one base M sequence and cyclic shift variants of the sequence (eg, n cyclic shift variants). The processor 714 can be further coupled to a data transformation module 720 that can disrupt various sequences of the sequence matrix provided by the logic processor 718. For example, as described herein, data transformation module 720 can utilize a common binary scrambling code based on a PSC associated with a wireless communication to disrupt at least one of the sequences associated with the SSC.

In addition, the processor 714 can be coupled to a multiplex module 722 that can generate an SSC based on at least one disturbed sequence provided by the data transformation module 720. For example, in the case where the data transformation module 720 disturbs the base sequence of a sequence of matrices, any suitable cyclic shift variant of the scrambled base sequence and/or the scrambled base sequence itself may be utilized by the multiplex module 722 To form the SSC. The SSC can be formed by interleaving two or more sequences, repetition of one or more sequences, addition/cutting of bits, or the like as needed.

Processor 714 can be further associated with a sequence of modules 724. The sequence module 724 can provide one or more sequences to generate a scrambling code by the free logic processor 718 (eg, based on a common expression different from the expression used to generate the SSC correlation sequence) Polynomial expression). In an example, sequence module 724 can generate three suitable M sequences of length 63 or length 31 to form a scrambling code. For example, three M sequences can be generated from a base M sequence and a cyclic shift variant of the base M sequence. Moreover, in at least some aspects, at least 20 cyclic shift variations of the base M sequence can be generated, and the three M sequences can include a base M sequence, a tenth cyclic shift variant, and a twentieth cyclic shift variant . However, it should be appreciated that other variations of the base sequence may be utilized, and other selected members of the set may be utilized for scrambling three of the code sequences (or other suitable numbers, for example).

Base station 702 can further include a modulator 726 that can map an SSC to an OTA message transmitted by transmitter 728. In one aspect, the SSC can be mapped onto some or all of the subcarrier channels of an OFDM transmission. The OTA message can be sent to the mobile device 704 via the transmit antenna 708. It should be appreciated that base station 702 can be part of a planned, semi-planned, or unplanned deployment of several base stations (not depicted) operating in a common area. The generation, scrambling, and assignment of SSC may be performed by base station 702 in a predetermined manner as specified by logical processor 718 and sequence module 724 or other instructions stored in memory 716 and executed by processor 714 associated with operation of the multi-base station. . In the alternative, base station 702 can communicate with other neighboring base stations via a backhaul network (not depicted) to coordinate the assignment of various base stations of the SSC to the cell site. In at least one other alternative, the code assignments can be specified and provided to the base station 702 at least in part by a centralized entity (not depicted, but see FIG. 3 above). Thus, system 700 can function as part of a RAN that includes multiple base stations.

FIG. 8 illustrates a block diagram of an example system 800 including a mobile device 802. Mobile device 802 can be configured to receive and decode synchronization information within OTA messages transmitted by base station 804. The decoding process at mobile device 802 can be reversed by a similar process utilized by base station 804. Instructions for receiving and decoding messages may be preloaded at the mobile device 802, at least in part, within the OTA message, obtained by a software/firmware patch (eg, via a network or a computing device) Connected), or a combination thereof or the like.

The mobile handset 802 includes at least one antenna 806 (eg, a transmission receiver including an input interface or a group of such receivers) that receives signals (eg, including synchronization information associated with facilitating remote wireless communication) and receives the received signals The receiver performs a typical action (eg, filtering, amplifying, downconverting, etc.) receiver 808. In particular, antenna 806 and transmitter 830 (collectively referred to as transceivers) can be configured to facilitate wireless data exchange with base station 804.

Antenna 806 and receiver 808 can also be coupled to a demodulation transformer 810 that can demodulate the received symbols and provide them to a processor 812 for evaluation. In particular, demodulation transformer 810 can extract at least synchronization information from the received wireless transmissions. For example, for frequency based transmission, demodulation transformer 810 can extract synchronization information from the subcarrier frequency of the wireless transmission. In one aspect, the synchronization information can include at least one SSC, the at least one SSC further comprising at least two sequences that are scrambled using a common PSC-based binary scrambling code. A signal processor 814 can utilize a common PSC based binary descrambling code to decrypt at least two sequences containing the received SSC. The descrambling code can be substantially equivalent to the scrambling code utilized by the base station 804, or can be its counterpart (e.g., the inverted scrambling code). in In at least one aspect, decoding the synchronization information involves a data processor 820 that applies a first inverse cyclic shift to the first of the two sequences associated with the SSC and the second reverse loop A shift is applied to the second of the two sequences. In this (equal) aspect, signal processor 814 can then apply the descrambled code to the shifted first sequence and the shifted second sequence to decrypt the SSC.

Once the received SSC is decoded, a logical processor 818 can extract the identification information associated with the device (804) that transmitted the received data. This information can be utilized to further decode the received data (e.g., payload information) and/or facilitate communication with the transmitting device (804).

It should be appreciated that the processor 812 can control and/or reference one or more components (806, 808, 810, 816, 822) of the mobile handset 802. Moreover, processor 812 can execute one or more modules, applications, engines, or the like (814, 818, 820) that include information or control related to performing functions of mobile device 802. For example, as described above, the functions may include receiving data from a remote source (804), decoding the received data based on a particular descrambling code, and identifying a mobile network associated with the decrypted code. Transmitter (804), or the like.

The mobile handset 802 can additionally include a memory 816 operatively coupled to the processor 812. The memory 816 can store data to be transmitted, to be received, and the like. In addition, memory 816 can store modules, applications, engines, etc. (814, 818, 820) executed by processor 812 above.

The mobile handset 802 can further include a modulator 822 and a transmitter 824 that will generate the signal (eg, by the processor 812 and The modulator 822 generates) transmissions to, for example, a base station 804, an access point, another access terminal, a remote agent, and the like. As depicted, system 800 provides a mobile device 802 that facilitates receiving encoded synchronization information provided by base station 804 and decrypting the encoded information to facilitate wireless communication between such devices (802, 804). Since the synchronization information can be encoded based on the selected SSC codebook and/or based on some scrambling code, the reduced interference and improved reliability and reduced power consumption at the mobile device 802 can potentially be achieved.

The foregoing systems have been described in terms of interactions between several components, modules, and/or communication interfaces. It should be appreciated that such systems and components/modules/interfaces can include some of the components or sub-components specified therein, the specified components or sub-components, and/or additional components. For example, a system can include SSC generator 108, trim module 510, and transport processor 512, or different combinations of these and other components. Sub-components may also be implemented as being communicatively coupled to other components rather than being included within the components of the previous generation. Additionally, it should be noted that one or more components can be combined into a single component that provides a collection of functionality. For example, the signal simulation module 608 can include a signal correlation module 610 or the signal correlation module 610 can include a signal simulation module 608 to facilitate determining the peak average power and interaction correlation of the SSC by a single component. The components can also interact with one or more other components not specifically described herein but known to those skilled in the art.

In addition, as will be appreciated, various aspects of the systems disclosed above and the methods below may include components, sub-components, processes, components, methods, or mechanisms based on artificial intelligence or knowledge or rules (eg, support vector machines, neural networks) Network, expert system, Bayesian inference network, fuzzy logic, data fusion Engine, classifier...) or consists of it. The components and components other than those already described herein can be automated to perform specific mechanisms or processes to make the portions of the systems and methods more adaptable, effective, and intelligent.

In view of the example systems described above, reference will be made to the flowcharts of FIGS. 9-11 to better understand the methods that can be implemented in accordance with the disclosed subject matter. Although the method is shown and described as a series of blocks for the sake of simplicity of explanation, it should be understood and understood that the claimed subject matter is not limited by the order of the blocks, as some blocks may differ from those described herein and The order of the order of description occurs and/or coincides with other blocks. In addition, not all illustrated blocks are required to implement the methods described below. In addition, it should be further appreciated that the methods disclosed below and throughout the specification can be stored on an article to facilitate delivery and transfer of the methods to a computer. The term "article of manufacture" as used is intended to encompass a computer program accessible from any computer readable device, device in conjunction with a carrier, or storage medium.

9 depicts a flow diagram of an example method 900 for reducing interference of multiple SSC transmissions in accordance with aspects of the present disclosure. At 902, method 900 can generate a sequence of matrices. The sequence matrix can include M sequences generated from one or more polynomial expressions. In at least one aspect of the present disclosure, the M sequence is generated from a polynomial expression having the form x^5+x^2+1 on GF(2). Additionally, the M sequence can include a base sequence and various variations of the base sequence such as provided by cyclically shifting the base sequence.

At 904, method 900 can scramble at least one M sequence using a PSC-based scrambling code associated with a wireless communication. Can be based, for example, on PSC The sequence of associated index identifications produces the scrambling code. In one aspect, the at least one M sequence that is scrambled using the scrambling code can include multiplexed to form a sequence of pairs of SSCs. The pair of M sequences can be disturbed before or after the multiplex. In another aspect, the base M-sequence of the sequence matrix above may be the at least one M-sequence scrambled at reference numeral 904 such that each variant of the scrambled base M-sequence is also disturbed. Thus, according to this aspect, the sequence matrix contains a disturbed sequence.

At 906, method 900 can generate an SSC based on the scrambled M sequence. As indicated above, one or more of the sequences may be truncated by the generation of multiple sequences (eg, sequence pairs, sequence triplets) of the SSC of the desired length (eg, length 62), truncating the sequences. The SSC is generated by repeating one or more of the sequences, or a combination thereof, or the like. At 908, method 900 can map the SSC to a subcomponent of the OTA message (eg, a subcarrier channel of the OFDM transmission).

The SSC generated by method 900 that is scrambled using PSC-based scrambling codes can provide improved interference characteristics for wireless communications. It will be appreciated that the scrambling code can be generated from the same polynomial used to generate the SSC or a polynomial different from the polynomial used to generate the SSC. In at least one aspect, the polynomial used to generate the scrambling code has the form 1+x^2+x^3+x^4+x^5. In addition, this polynomial can be utilized to generate a basic scrambling sequence. A cyclic shifting variant of the underlying scrambling sequence can be generated to provide a scrambling sequence matrix. In one embodiment of the present disclosure, twenty or more cyclic shift variations of the scrambling sequence are generated and combined with the underlying scrambling sequence to form a scrambling sequence matrix. According to these aspects, the three sequences of the self-scrambling sequence matrix can be disturbed code. As an example, a PSC-based scrambling code can be generated using a base scrambling sequence, a tenth cyclic shifting variant of the base scrambling sequence, and a twentieth cyclic shifting variant of the base scrambling sequence.

10 depicts a flow diagram of a sample method 1000 for scrambling OTA SSC transmissions in accordance with one or more aspects. At 1002, method 1000 can generate a sequence of matrices as described herein. At 1004, method 1000 can select two sequences from the matrix to generate an SSC. The sequences can be selected based on the characteristics of the SSC code caused by the selected sequence. According to a specific example, the characteristics may include a PAPR of the SSC code, an interactivity correlation factor of the SSC code, or a suitable combination thereof.

At 1006, method 1000 can determine whether to first disrupt or first multiply the sequence. The decision may be based on the derivation of the resulting SSC code in conjunction with the primary wireless transmission characteristics of the RAN (e.g., multipath scatter, signal reflection/refraction, or the like as known in the art of radio frequency propagation and/or mobile communication techniques). Interference characteristics. If the sequences are first multiplexed, the method 1000 can proceed to 1014, and if the sequences are first disturbed, the method 1000 can proceed to 1008.

As described herein (eg, see method 900, supra), at 1008, method 1000 can generate a PSC-based scrambling code from a sequence matrix generated from one or more polynomial expressions. At 1010, the PSC-based scrambling code can be utilized to scramble the two sequences selected from the sequence matrix. At 1012, the sequences can then be interleaved to form an SSC. The SSC can be mapped to an OTA message and transmitted in conjunction with one or more wireless communications.

At 1014, method 1000 can interleave the two sequences selected from the sequence matrix to form a full length sequence. At 1016, it can be produced as described herein. Give birth to a full length scrambling code. At 1018, the full length sequence can be disturbed by utilizing the scrambling code generated at reference numeral 1016. Finally, at 1020, an SSC can be generated from the scrambled interlace sequence, which can be mapped to the OTA message discussed above.

11 illustrates a flow diagram of a sample method 1100 for generating a scrambled SSC in accordance with at least one aspect. At 1102, method 1100 can generate an M sequence from a polynomial expression. In some examples, the polynomial expression can have the form x^5+x^2+1 on GF(2). At 1104, method 1100 can use the PSC-based scrambling code to scramble the M-sequence. A PSC-based scrambling code can be generated from one or more scrambling sequences of one or more scrambling polynomial expressions. According to at least one aspect, the scrambled polynomial expressions can comprise a single expression having the form 1+x^2+x^3+x^4+x^5.

At 1106, the scrambled M sequence is cyclically shifted n times to produce n distinct disturbed variations of the scrambled M sequence. The disturbed M sequence and the n distinct distorted variants can be compiled into a disturbed sequence matrix. At 1108, both of the scrambled sequences of the scrambled sequence matrix are selected to form an SSC. As described herein, the selected sequences can be multiplexed to form a full length scrambled sequence. It will be appreciated that the two selected sequences may be based on the essential characteristics of the SSC derived from the sequences. In one aspect, the basic characteristics include the PAPR of the SSC as compared to the PAPR threshold. In another aspect, the basic characteristics include cross-correlation factors as compared to the associated threshold. In yet another aspect, the basic characteristics comprise the appropriate combinations of the foregoing.

In at least one other aspect, the two selected sequences can be based on a predetermined number The goal is to SSC. As a specific example, as discussed above, where the scrambled sequence matrix comprises 31 scrambled sequences having a length that is substantially half the length of the desired SSC code, may be based on PAPR and/or cross-correlation properties To select 170 or 340 sequence pairs. Selecting the SSC sequence in this manner can provide reduced interference with the transmitted synchronization information, potentially reducing the power consumption of the receiving device and improving the overall communication quality in the mobile communication environment. Thus, as described herein, the method 1100 can provide significant benefits for various mobile communication technologies.

12 depicts a block diagram of an example system 1200 that facilitates wireless communication in accordance with some aspects disclosed herein. On the downlink, at access point 1205, transmit (TX) data processor 1210 receives, formats, encodes, interleaves, and modulates (or symbol maps) the traffic data and provides modulation symbols ("data symbols"). . Symbol modulator 1215 receives and processes the data symbols and pilot symbols and provides a stream of symbols. The symbol modulator 1220 multiplexes the data and pilot symbols and provides them to a transmitter unit (TMTR) 1220. Each transmission symbol can be a data symbol, a pilot symbol, or a signal value of zero. The pilot symbols can be transmitted continuously in each symbol period. The pilot symbols can be divided by frequency division multiplexing (FDM), orthogonal frequency division multiplexing (OFDM), time division multiplexing (TDM), code division multiplexing (CDM), or a suitable combination thereof.

The TMTR 1220 receives the symbol stream and converts it into one or more analog signals and further conditions (e.g., amplifies, filters, and upconverts) the analog signals to produce a downlink signal suitable for transmission on a wireless channel. The downlink signal is then transmitted to the terminal via antenna 1225. At terminal 1230, antenna 1235 receives the downlink signal and provides the received signal to Receiver unit (RCVR) 1240. Receiver unit 1240 conditions (eg, filters, amplifies, and downconverts) the received signal and digitizes the conditioned signal to obtain samples. The symbol demodulator 1245 demodulates the received pilot symbols and provides them to the processor 1250 for channel estimation. The symbol demodulator 1245 further receives a frequency response estimate for the downlink from the processor 1250, performs data demodulation on the received data symbols to obtain a data symbol estimate (which is an estimate of the transmitted data symbols) And the data symbol estimates are provided to RX data processor 1255, which demodulates (i.e., symbol demaps), deinterleaves, and decodes the data symbol estimates to recover the transmitted traffic data. The processing performed by symbol demodulation transformer 1245 and RX data processor 1255 is complementary to the processing performed by symbol modulator 1215 and TX data processor 1210 at access point 1205, respectively.

On the uplink, TX data processor 1260 processes the traffic data and provides data symbols. The symbol modulator 1265 receives and multiplexes the data symbols and pilot symbols, performs modulation, and provides a stream of symbols. Transmitter unit 1270 then receives and processes the symbol stream to generate an uplink signal that is transmitted by antenna 1235 to access point 1205. In particular, as described herein, the uplink signal may be in accordance with SC-FDMA requirements and may include a frequency hopping mechanism.

At access point 1205, the uplink signal from terminal 1230 is received by antenna 1225 and processed by receiver unit 1275 to obtain samples. Symbol demodulation transformer 1280 then processes the samples and provides received pilot symbols and data symbol estimates for the uplink. The RX data processor 1285 processes the data symbol estimates to recover the traffic data transmitted by the terminal 1230. processor The 1290 performs channel estimation for each of the roles in the transmission on the uplink. Multiple terminals may simultaneously transmit pilots on respective assigned sets of their pilot subbands on the uplink, where the set of pilot subbands may be interleaved.

Processors 1290 and 1250 direct (e.g., control, coordinate, manage, etc.) operations at access point 1205 and terminal 1230, respectively. The respective processors 1290 and 1250 can be associated with a memory unit (not shown) that stores the code and data. Processors 1290 and 1250 can also perform computations to derive frequency and impulse response estimates for the uplink and downlink, respectively.

For multiple access systems (eg, SC-FDMA, FDMA, OFDMA, CDMA, TDMA, etc.), multiple terminals can transmit simultaneously on the uplink. For this system, the pilot subbands can be shared between different terminals. Channel estimation techniques can be used in situations where the pilot subband of each terminal spans the entire operating band (possibly except for the band edges). This pilot subband structure is desirable for obtaining the frequency diversity of each terminal. The techniques described herein can be implemented by a variety of components. For example, such techniques can be implemented in hardware, software, or a combination thereof. For hardware implementations that can be digital, analog or digital, and analog, the processing unit for channel estimation can be implemented in one or more special application integrated circuits (ASICs), digital signal processing. (DSP), digital signal processing device (DSPD), programmable logic device (PLD), field programmable gate array (FPGA), processor, controller, microcontroller, microprocessor, designed to execute Other electronic units of the functions described herein, or a combination thereof. For software, implementation can be performed by performing the functions described herein. Modules (for example, programs, functions, etc.). The software code can be stored in the memory unit and executed by the processors 1290 and 1250.

13, 14, and 15 provide block diagrams of example systems 1300, 1400, 1500 for implementing various aspects of the present disclosure. System 1300 can include a module 1302 for generating a sequence matrix from cyclic shift variants of the base M sequence and the base M sequence. The base M sequence can be generated from a polynomial expression as described herein. The bit of each cyclic shift variant of the base sequence can be a single shift, a double shift bit, a triple shift bit, etc., or a suitable combination thereof. The base sequence and shift variants can be utilized by module 1302 to form a sequence matrix.

System 1300 can also include a module 1304 for disrupting one or more of the M sequences. Module 1304 can utilize a scrambling code (such as a PSC based scrambling code) to scramble the M sequence. As described herein, the scrambling code can be generated by generating a base scrambling sequence from a polynomial expression (eg, different from a polynomial expression used to generate the sequence matrix). A cyclic shifting variant of the underlying scrambling sequence can be generated and one or more of the underlying scrambling sequence and the shifting variant can be utilized to generate the scrambling code.

The module 1306 for generating the SSC can utilize at least one scrambled M sequence to generate the SSC. For example, depending on the length of the at least one disturbed M-sequence compared to the desired length of the SSC, the scrambled M-sequences may be interleaved, truncated, repeated, or a combination thereof, or the like, as appropriate. System 1300 can further include a module 1308 for mapping SSCs onto OTA transmissions. For example, the bit of the SSC can be mapped to the subcarrier channel of the OFDM transmission, the sub-code of the CDMA transmission, the sub-time division of the TDMA transmission, Or a suitable combination of integrated systems. As described, system 1300 can generate a scrambled SSC code that exhibits reduced interference in a mobile communication environment.

As described herein, system 1400 can include a module 1402 for generating a sequence matrix from n cyclic shift variants of the base M sequence and the base M sequence. Additionally, system 1400 can include a module 1404 for indexing sequence pairs of sequence matrices. The module can generate at least (n+1)^2 indices for each distinct sequence pair of the sequence matrix. In addition, system 1400 can include a module 1406 for determining PAPR and/or correlation of SSC codes caused by sequence pairs. Module 1406 can select a predetermined number of sequence pairs that satisfy PAPR and/or cross-correlation thresholds (eg, below the desired PAPR and/or below the desired correlation factor) (eg, substantially 170 sequence pairs, substantially 340) Sequence pairs, or based at least in part on other suitable numbers of base stations in the mobile site, etc.). Thus, the SSC caused by the selected sequence pair can have the desired transmission characteristics, resulting in improved wireless transmission.

System 1500 can include a module 1502 for receiving wireless transmissions. Module 1502 can receive one or more wireless OTA transmissions from a mobile network transmitter (eg, a base station). Module 1502 can include one or more wireless antennas (eg, a radio antenna), a receiver for pre-conditioning the received signals, or the like. System 1500 can further include a module 1504 for extracting an SSC for transmission received by the free module 1502. As is known in the art, the extraction can be based on signal demodulation, modulation, and the like. The module 1506 for descrambling the SSC can utilize a common PSC-based binary descrambling code to decrypt the SSC. In one aspect, the descrambling code can be substantially similar to the scrambling code used to disturb the SSC or a variant of the scrambling code (eg, by inverting the scrambling code) Bit)). Additionally, system 1500 can include a module 1508 for determining the identification code of the mobile network transmitter from the decrypted SSC. For example, the ID stored in the memory can be used to read and cross-reference the transmitter ID encoded into the SSC. For example, the transmitter ID can be utilized to facilitate wireless communication between the mobile device and the mobile network transmitter. In the event that the received signal exhibits reduced interference, system 1500 can provide reduced power consumption and improved communication reliability in a mobile communication environment.

100‧‧‧Wireless communication system

102a‧‧‧Geographical area

102b‧‧‧Geographical area

102c‧‧‧Geographical area

104a‧‧‧Small area

104b‧‧‧Small area

104c‧‧‧Small area

110‧‧‧Base station

120‧‧‧ Terminal

130‧‧‧System Controller

200‧‧‧Special or unplanned/semi-planned wireless communication environment/system/wireless network

202‧‧‧Base station

204‧‧‧Mobile devices

206a‧‧ Geographical area

206b‧‧‧Geographical area

206c‧‧‧ Geographical area

206d‧‧‧Geographical area

300‧‧‧ system

302‧‧‧SSC generator

304‧‧‧Mobile devices

306‧‧‧Radio Access Network (RAN)/Multi-Transmitter Site/Base Station

308‧‧‧Logical Processor

310‧‧‧Data Conversion Module

312‧‧‧Sequence Module

314‧‧‧Multiplex module

316‧‧‧Transport Processor

400‧‧‧Sequence Matrix

500‧‧‧ system

502‧‧‧SSC Index Selector

504‧‧‧Base Station

506‧‧‧Logical Processor

508‧‧‧indexing module

510‧‧‧Cutting module

512‧‧‧Transfer Processor

600‧‧‧ system

602‧‧‧SSC index selector

604‧‧‧ Simulated SSC code

606‧‧‧Cutting module

608‧‧‧Signal Simulation Module

610‧‧‧Signal related modules

700‧‧‧ system

702‧‧‧Base station

704‧‧‧Mobile devices

706‧‧‧ receiving antenna

708‧‧‧ Transmission antenna

710‧‧‧ Receiver

712‧‧‧Demodulation Transducer

714‧‧‧ processor

716‧‧‧ memory

718‧‧‧Logical Processor

720‧‧‧Data Conversion Module

722‧‧‧Multiplex module

724‧‧‧Sequence Module

726‧‧‧Transformer

728‧‧‧Transporter

800‧‧‧ system

802‧‧‧Mobile Devices/Mobile Phones

804‧‧‧Base Station/Transmission Device/Remote Source/Mobile Network Transmitter

806‧‧‧Antenna

808‧‧‧ Receiver

810‧‧‧Demodulation Transducer

812‧‧‧ processor

814‧‧‧Signal Processor

816‧‧‧ memory

818‧‧‧Logical Processor

820‧‧‧ data processor

822‧‧‧Transformer

824‧‧‧Transporter

1200‧‧‧ system

1205‧‧‧ access point

1210‧‧‧Transport (TX) data processor

1215‧‧‧ symbol modulator

1220‧‧‧Transmitter Unit (TMTR)

1225‧‧‧Antenna

1230‧‧‧ Terminal

1235‧‧‧Antenna

1240‧‧‧ Receiver Unit (RCVR)

1245‧‧‧Demodulation Transducer

1250‧‧‧ processor

1255‧‧‧RX data processor

1260‧‧‧TX Responsible Processor

1265‧‧‧ symbol modulator

1270‧‧‧Transmitter unit

1275‧‧‧ Receiver unit

1280‧‧‧ symbol demodulation

1285‧‧‧RX data processor

1290‧‧‧ Processor

1300‧‧‧ system

1302‧‧‧Modules for generating a sequence matrix from cyclic shift variants of basic M-sequences and basic M-sequences

1304‧‧‧Modules for disturbing one or more of these M sequences

1306‧‧‧Modules for generating SSC

1308‧‧‧System for mapping SSC to OTA transmission

1400‧‧‧ system

1402‧‧‧Modules for generating a sequence matrix from n cyclic shift variants of the base M sequence and the base M sequence

1404‧‧‧Modules for indexing sequence pairs of sequence matrices

1406‧‧‧A module for determining the PAPR and/or correlation of the SSC code caused by the sequence pair

1500‧‧‧ system

1502‧‧‧Module for receiving wireless transmission

1504‧‧‧A module for extracting an SSC for the transmission of the free module 1502

1506‧‧‧Modules for descrambling SSC

1508‧‧‧Modules for the identification code of the SSC-determined mobile network transmitter from the decrypted SSC

1 depicts a block diagram of an example system for providing wireless communication in accordance with the aspects set forth herein.

2 illustrates a block diagram of an example communication device for use with a wireless communication environment.

3 depicts a block diagram of an example system that provides reduced interference between SSCs of a multi-base station site in accordance with one or more aspects.

4 illustrates a diagram of an example sequence matrix that produces sequences for SSC, scrambling codes, and/or the like.

5 depicts a block diagram of an example system that provides reduced interference of transmitted SSCs in a multi-transmitter mobile site.

6 illustrates a block diagram of an example system that utilizes the SSC codebook described herein for reducing interference between SSC transmissions.

7 depicts a block diagram of an example base station in accordance with aspects of the present disclosure.

Figure 8 illustrates a block diagram of an example terminal device in accordance with still other aspects of the present disclosure.

Figure 9 depicts a reduction in multiple SSC transmissions in accordance with aspects of the present disclosure A flow chart of an example method of interference.

10 depicts a flow diagram of a method for scrambling an OTA SSC transmission in accordance with one or more aspects.

11 illustrates a flow diagram of a method for generating a sample of a scrambled SSC in accordance with at least one aspect.

12 depicts a block diagram of an example system that facilitates remote communication in accordance with some aspects disclosed herein.

13 depicts a block diagram of an example system that provides reduced interference for a mobile communication environment.

14 depicts a block diagram of a sample system that selects SSC sequences based on the PAPR and/or correlation of the resulting SSC signals.

Figure 15 illustrates a block diagram of a sample system that provides improved reception and synchronization in a multi-transmitter mobile environment.

(no component symbol description)

Claims (25)

A method for generating a secondary synchronization code (SSC) for wireless communication, comprising: generating a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; using based on the wireless communication Cooperating one of a primary synchronization code (PSC) with a common binary scrambling code to scramble at least one M sequence of the sequence matrix; generating an SSC based on the at least one scrambled M sequence; and mapping the SSC to an orthogonal frequency division On the subcarrier channel of multiplex (OFDM) transmission. The method of claim 1, further comprising generating the common binary scrambling code by using at least one of a sequence of lengths of 63 each having a length of 62; or using respective repetitions A plurality of M sequences of length 31 are formed to form a sequence of length 62. The method of claim 1, further comprising generating the scrambling code from one or more M sequences generated from a common polynomial expression. The method of claim 1, further comprising generating the scrambling code M sequence from a different polynomial expression. The method of claim 3, further comprising: generating a base scrambling sequence from the one or more sequences; defining a set of cyclic shift sequences from the base scrambling sequence; A plurality of distinct scrambling codes are selected from the base scrambling sequence to form the common binary scrambling code. The method of claim 5, wherein the defining the set of cyclic shift sequences further comprises generating at least twenty cyclic shift sequences in addition to generating the base scrambling sequence. The method of claim 5, wherein selecting the three distinct scrambling codes further comprises: selecting the basic scrambling sequence, a tenth cyclic shifting sequence, and a twentieth cyclic shifting sequence. The method of claim 1, wherein generating the SSC further comprises: selecting two M sequences from the sequence matrix; interleaving the selected M sequences to form a sequence of length 62; and applying the common binary scrambling code to the A sequence of length 62. The method of claim 1, wherein generating the SSC further comprises: selecting two M sequences from the sequence matrix; applying the common binary scrambling code to the selected M sequences to obtain two scrambled M sequences; and interleaving The two disturbed M sequences form a sequence of length 62. The method of claim 1, wherein generating the sequence matrix further comprises applying the common binary scrambling code to the base M sequence to provide the at least one scrambled M sequence. The method of claim 10, wherein generating the SSC further comprises applying two different cyclic shifts to the scrambled base M sequence to generate two scrambled M sequences; The two scrambled M sequences are interleaved to form a sequence of length 62. An apparatus for generating an SSC for wireless communication, comprising: a logic processor that generates a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; a data transformation module Resolving at least one sequence of the matrix using a common binary scrambling code based on one of the PSCs associated with the wireless communication; a multiplex module that generates an SSC based on the at least one disturbed sequence; and a transport processor It maps the SSC to the subcarrier channel of an OFDM transmission. The apparatus of claim 12, further comprising: a sequence module that generates the scrambling code from a sequence derived from a common polynomial expression. The apparatus of claim 13, the sequence module generating the scrambling code from at least one of: a plurality of M sequences of length 63 each of a sequence of length 62; or each repeating to form a length of 62 A plurality of M sequences of length 31 in sequence. As with the apparatus of claim 13, the logical processor derives the base M sequence from a polynomial expression different from the common polynomial expression. The apparatus of claim 13, the sequence module: generating a basic scrambling sequence from the derived sequences; Defining a set of cyclic shift sequences from the base scrambling sequence; and selecting a plurality of distinct scrambling codes from the base scrambling sequence to form the common binary scrambling code. The apparatus of claim 16, wherein the sequence module generates at least twenty cyclic shift sequences in addition to the base scrambling sequence to define the set of cyclic shift sequences. The apparatus of claim 16, the three distinct scrambling codes comprising the base scrambling sequence, a tenth cyclic shift sequence, and a twentieth cyclic shift sequence. The device of claim 12, wherein: the logic processor selects two M sequences from the sequence matrix; the multiplex module interleaves the selected M sequences to form an undisturbed sequence of length 62; The data transformation module applies the common binary scrambling code to the sequence of length 62. The apparatus of claim 12, wherein: the logic processor selects two M sequences from the sequence matrix; the data transformation module applies the common binary scrambling code to the selected M sequences to obtain two scrambled M And the multiplex module interleaves the two scrambled M sequences to form a sequence of length 62. The apparatus of claim 12, the data transformation module applying the common binary scrambling code to the base M sequence to provide the at least one scrambled M sequence and generating the sequence matrix. The apparatus of claim 21, the logic processor: applying two different cyclic shifts to the scrambled base M sequence to generate two scrambled M sequences; and interleaving the two scrambled M sequences to form A sequence of length 62 produces the SSC. An apparatus for generating an SSC for wireless communication, comprising: means for generating a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; for use in connection with the wireless communication a component of a common binary scrambling code associated with one of the PSCs to disturb at least one sequence of the matrix; means for generating an SSC based on the at least one disturbed sequence; and a means for mapping the SSC to an OFDM transmission The component on the carrier channel. A processor configured to generate an SSC for wireless communication, comprising: a first module that generates a sequence matrix from a base M sequence and a cyclic shift variant of the base M sequence; a module that uses at least one sequence of the matrix based on a common binary scrambling code associated with one of the PSCs associated with the wireless communication; a third module that generates an SSC based on the at least one disturbed sequence; a fourth module that maps the SSC to a subcarrier of an OFDM transmission On the wave channel. A computer readable medium, comprising: computer readable instructions configured to generate an SSC for wireless communication, the instructions being executable by at least one computer to: cyclically shift from a base M sequence and the base M sequence The bit variant generates a sequence matrix; scrambling at least one sequence of the matrix using a common binary scrambling code based on one of the PSCs associated with the wireless communication; generating an SSC based on the at least one disturbed sequence; and mapping the SSC Up to the subcarrier channel of an OFDM transmission.