US20130142221A1 - High performance window searcher for cell measurement - Google Patents
High performance window searcher for cell measurement Download PDFInfo
- Publication number
- US20130142221A1 US20130142221A1 US13/415,487 US201213415487A US2013142221A1 US 20130142221 A1 US20130142221 A1 US 20130142221A1 US 201213415487 A US201213415487 A US 201213415487A US 2013142221 A1 US2013142221 A1 US 2013142221A1
- Authority
- US
- United States
- Prior art keywords
- window
- coherent
- receive
- window search
- antenna
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 238000005259 measurement Methods 0.000 title claims abstract description 9
- 230000001427 coherent effect Effects 0.000 claims abstract description 92
- 238000009825 accumulation Methods 0.000 claims abstract description 44
- 238000000034 method Methods 0.000 claims description 17
- 238000004891 communication Methods 0.000 claims description 15
- 238000013459 approach Methods 0.000 claims description 13
- 230000004044 response Effects 0.000 claims description 2
- 230000035508 accumulation Effects 0.000 description 24
- 238000010295 mobile communication Methods 0.000 description 16
- 230000006870 function Effects 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 7
- 230000007480 spreading Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 230000006978 adaptation Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000001228 spectrum Methods 0.000 description 3
- 230000003321 amplification Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003199 nucleic acid amplification method Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 108010003272 Hyaluronate lyase Proteins 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 238000013024 troubleshooting Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/001—Synchronization between nodes
- H04W56/002—Mutual synchronization
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3723—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using means or methods for the initialisation of the decoder
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3905—Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3972—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using sliding window techniques or parallel windows
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/16—Performing reselection for specific purposes
- H04W36/18—Performing reselection for specific purposes for allowing seamless reselection, e.g. soft reselection
Abstract
Description
- This application claims priority to, and the benefit of, U.S. Provisional Patent Application entitled “CELLULAR BASEBAND PROCESSING,” having Ser. No. 61/565,864, filed on Dec. 1, 2011, and U.S. Provisional Patent Application entitled “CELLULAR BASEBAND PROCESSING,” having Ser. No. 61/568,868, filed on Dec. 9, 2011, both of which are incorporated by reference in their entirety.
- Wideband code division multiple access (WCDMA) is a third generation (3G) cellular technology that enables the concurrent transmission of a plurality of distinct digital signals via a common RF channel. WCDMA supports a range of communications services that include voice, high speed data and video communications. One such high speed data communications service, which is based on WCDMA technology, is the high speed downlink packet access (HSDPA) service.
- WCDMA is a spread spectrum technology in which each digital signal is coded or “spread” across the RF channel bandwidth using a spreading code. Each of the bits in the coded digital signal is referred to as a “chip.” A given base transceiver station (BTS), which concurrently transmits a plurality of distinct digital signals, may encode each of a plurality of distinct digital signals by utilizing a different spreading code for each distinct digital signal. At a typical BTS, each of these spreading codes is referred to as a Walsh code. The Walsh coded digital signal may in turn be scrambled by utilizing a pseudo-noise (PN) bit sequence to generate chips. An example of a PN bit sequence is a Gold code. Each of a plurality of BTS within an RF coverage area may utilize a distinct PN bit sequence. Consequently, Walsh codes may be utilized to distinguish distinct digital signals concurrently transmitted from a given BTS via a common RF channel while PN bit sequences may be utilized to distinguish digital signals transmitted by distinct BTSs. The utilization of Walsh codes and PN sequences may increase RF frequency spectrum utilization by allowing a larger number of wireless communications to occur concurrently within a given RF frequency spectrum. Accordingly, a greater number of users may utilize mobile communication devices, such as mobile telephones, Smart phones and/or wireless computing devices, to communicate concurrently via wireless communication networks.
- Many aspects of the present disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the disclosure. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views.
-
FIG. 1 is a drawing of an exemplary wireless communication system, in accordance with an embodiment of the present disclosure. -
FIG. 2 is a drawing of an exemplary transceiver system, in accordance with an embodiment of the present disclosure. -
FIG. 3 is a drawing of an exemplary window search module employed in the transceiver system ofFIG. 2 , in accordance with an embodiment of the present disclosure. -
FIG. 4 is a block diagram illustrating one example of Ec estimation logic used in the window search module ofFIG. 3 , in accordance with an embodiment of the present disclosure. -
FIGS. 5 and 6 are flowcharts illustrating examples of functionality implemented as portions of the window search module ofFIG. 2 according to various embodiments of the present disclosure. - The present disclosure relates to an enhanced window searcher for cell measurement. In WCDMA and/or other wireless technologies subject to mobility, a wireless communications device, such as a cell phone, periodically performs a window search to measure the received energy from the multipath delay profile of the active cells and/or other cells. The sum of the measured energy of all detected paths is reported by the user equipment (UE) to the network so that each cell strength may be monitored and continuously updated. This enables dynamic cell reselection and soft handover.
- A signal from a base station may be reflected by various objects, thereby resulting in multiple paths being received at different delays by the receiver. A window search is employed to identify these multiple delayed paths over a time “window” surrounding an identified peak energy path. The window span, or the length of the window, may be 15 chips, 30 chips, 60 chips, 90 chips, or some other length. The resolution for path energy measurement may be chip or sub-chip resolution (e.g., ½ chip, ¾ chip, etc.). The path energy is obtained by first descrambling and despreading the received signal, and then squaring the magnitude of the despreaded symbol. The scrambling code phase is offset by one chip at a time (or some other predetermined number of chips) to cover the length of the time window.
- Various embodiments of the present disclosure provide configurable and scalable window search logic that exploits parallelism and reduces power consumption through resource sharing. To this end, sufficient hardware resources may be provided to enable parallel searching for multiple scrambling codes, multiple window spans, and/or multiple antennas. That is, the window search logic is equipped with a total number of coherent accumulators N, and the number N can be dynamically allocated to search across various dimensions as needed, where the dimensions are scrambling code, antennas, and window span.
- Additionally, for power consumption savings, not all N resources need to be active all the time. If a search requires fewer than N resources, then the power consumption scales down accordingly. For example, the number of active coherent accumulators, which are a major source of power consumption in window search logic, may be reduced given that the longest window span (e.g., 90 chips or some other span) may be needed only for a small number of the scrambling codes, and given that parallel searching for the maximum number of scrambling codes (e.g., 8 scrambling codes or some other number) may not be needed most of the time. Furthermore, the number of coherent accumulators may be reduced by way of using interpolation logic to achieve a desired higher subchip resolution (e.g., chip by 4 (cx4) resolution or another higher subchip resolution).
-
FIG. 1 is an illustration of an exemplary wireless communication system, in accordance with an embodiment. Referring toFIG. 1 , there is shown acell 100 and abase station C 106. Thecell 100 comprisesbase station A 102, mobile communication device MU—1 112 and mobile communication device MU—2 114. Thebase station 106 may be located outside of thecell 100. - The mobile communication devices MU—1 112 and MU—2 114 may be engaged in a communication via the
base station A 102. The mobile communication device MU—1 112 may transmit signals to the base station A 102 via anuplink RF channel 122. In response, thebase station A 102 may transmit signals to the mobile communication device MU—2 114 via adownlink RF channel 124. Signals transmitted by thebase station A 102 may communicate chips that are generated utilizing a scrambling code PN_A. The signals transmitted viaRF channel 124 may be spread utilizing a spreading code WC—12. The spreading code WC—12 may comprise an orthogonal variable spreading factor (OVSF) code, for example, a Walsh code, which enables the mobile communication device MU—2 114 to distinguish signals transmitted by the base station A 102 via thedownlink RF channel 124 from signals transmitted concurrently by the base station A 102 via other downlink RF channels, for example downlinkRF channel 126. The base station A 102 may utilize one or more OVSF codes, WC_other, when spreading data transmitted viadownlink RF channel 126. The one or more OVSF codes, WC_other, may be distinct from the OVSF code WC—12. The base station A 102 may also transmit broadcast signals which may be received by all mobile communication devices. The broadcast signals, spread by OVSF code, WC_broadcast, may be sent simultaneously ondownlink RF channels - The mobile communication device MU—2 114 may receive multiple access interference (MAI) signals from
RF channel 126 and/orRF channel 130. As stated above, the signals received viaRF channel 126 may be transmitted by the base station A 102. The signals received viaRF channel 130 may be transmitted by thebase station C 106. The signals transmitted by thebase station C 106 may be scrambled based on a scrambling code PN_C. - The mobile communication device MU—2 114 may be operable to perform a soft handoff from the current serving
base station A 102 to a base station, which is outside of thecell 100, for example, thebase station C 106. Accordingly, the mobile communication device MU—2 114 may be operable to process received signals based on scrambling code PN_C. In this regard, MU—2 114 may listen for signals frombase station C 106. - Although
FIG. 1 depicts communication between two mobile devices via a single BTS, the present disclosure is not so limited. For example, aspects of the present disclosure may be equally applicable regardless of the origin of data communicated wirelessly to themobile communication device 114. -
FIG. 2 is a diagram of an exemplary communication device in accordance with various embodiments. Referring toFIG. 2 , there is shown atransceiver system 200, a receivingantenna 222 and a transmittingantenna 232. Thetransceiver system 200 may comprise at least areceiver 202, atransmitter 204, aprocessor 206, a memory 208, awindow search module 210, a receivediversity adaptation module 211, and/or other components. Although aseparate receiver 202 andtransmitter 204 are illustrated byFIG. 2 , the present disclosure is not limited. In this regard, the transmit function and receive function may be integrated into a single transceiver block. Thetransceiver system 200 may also comprise a plurality of transmitting antennas and/or a plurality of receiving antennas, for example to support diversity transmission and/or diversity reception. Various embodiments may comprise a single antenna, which is coupled to thetransmitter 204 andreceiver 202 via a transmit and receive (T/R) switch. The T/R switch may selectively couple the single antenna to thereceiver 202 or to thetransmitter 204 under the control of theprocessor 206, for example. - The
receiver 202 may comprise suitable logic, circuitry, interfaces and/or code that may be operable to perform receive functions that may comprise PHY layer function for the reception or signals. These PHY layer functions may comprise, but are not limited to, the amplification of received RF signals, generation of frequency carrier signals corresponding to selected RF channels, for example uplink or downlink channels, the down-conversion of the amplified RF signals by the generated frequency carrier signals, demodulation of data contained in data symbols based on application of a selected demodulation type, and detection of data contained in the demodulated signals. The RF signals may be received via the receivingantenna 222. Thereceiver 202 may be operable to process the received RF signals to generate baseband signals. A chip-level baseband signal may comprise a plurality of chips. The chip-level baseband signal may be descrambled based on a PN sequence and despread based on an OVSF code, for example a Walsh code, to generate a symbol-level baseband signal. The symbol-level baseband signal may comprise a plurality of data symbols. Thereceiver 202 may comprise a rake receiver, which in turn comprises a plurality of rake fingers to process a corresponding plurality of received multipath signals. - The
transmitter 204 may comprise suitable logic, circuitry, interfaces and/or code that may be operable to perform transmit functions that may comprise PHY layer function for the transmission or signals. These PHY layer functions may comprise, but are not limited to, modulation of received data to generate data symbols based on application of a selected modulation type, generation of frequency carrier signals corresponding to selected RF channels, for example uplink or downlink channels, the up-conversion of the data symbols by the generated frequency carrier signals, and the generation and amplification of RF signals. The RF signals may be transmitted via the transmittingantenna 232. - The memory 208 may comprise suitable logic, circuitry, interfaces and/or code that may enable storage and/or retrieval of data and/or code. The memory 208 is defined herein as potentially including both volatile and nonvolatile memory and data storage components. Volatile components are those that do not retain data values upon loss of power. Nonvolatile components are those that retain data upon a loss of power. Thus, the memory 208 may comprise, for example, random access memory (RAM), read-only memory (ROM), hard disk drives, solid-state drives, USB flash drives, memory cards accessed via a memory card reader, floppy disks accessed via an associated floppy disk drive, optical discs accessed via an optical disc drive, magnetic tapes accessed via an appropriate tape drive, and/or other memory components, or a combination of any two or more of these memory components. In addition, the RAM may comprise, for example, static random access memory (SRAM), dynamic random access memory (DRAM), or magnetic random access memory (MRAM) and other such devices. The ROM may comprise, for example, a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or other like memory device.
- The
window search module 210 may comprise suitable logic, circuitry and/or code that are operable to perform a window search on a received signal. Some features of thewindow search module 210 may include parallel searching for multiple scrambling codes (e.g., 8 scrambling codes, or some other number), receive combining diversity support, resource sharing, configurable window span, dual carrier support, scalable power consumption due to a scalable number of active coherent accumulators, and/or other features. - In operation, the
receiver 202 may receive signals via the receivingantenna 222. In an exemplary embodiment, thereceiver 202 may comprise a rake receiver. Thereceiver 202 may communicate signals to theprocessor 206 and/or to thewindow search module 210. - The
window search module 210 may generate timing information that corresponds to each of the fingers in the rake receiver portion of thereceiver 202. Each of the fingers in the rake receiver may process a distinct one of a plurality of multipath signals that are received within a delay spread time duration. Based on the received RF signals, thereceiver 202 may generate chip-level baseband signals. The rake receiver withinreceiver 202 may generate one or more symbol-level baseband signals based on a selected one or more OVSF codes and a selected one or more PN sequences. The symbol-level baseband signals may be communicated to theprocessor 206. The OVSF codes may be selected based on a specified desired user signal. For example, referring toFIG. 1 , the rake receiver withinreceiver 202 associated with mobile communication device MU—2 may select an OVSF code, WC—12, or a broadcast OVSF code, WC_broadcast, and a PN sequence, PN_A, which may be utilized to generate the symbol-level baseband signal from the chip-level baseband signal. - The
processor 206 may determine which BTSs are associated with acurrent cell 100 and which BTSs are not associated with thecurrent cell 100. For example, theprocessor 206 may determine that thebase station A 102 is associated with thecurrent cell 100, while thebase station C 106 is not associated with thecurrent cell 100. In an exemplary embodiment, theprocessor 206 may store PN sequences for at least a portion of the BTSs that are associated with thecurrent cell 100. For example, referring toFIG. 1 , theprocessor 206 may generate and/or store corresponding PN sequences, for example PN_A in the memory 208. The PN sequences may be generated on the fly based on the code structure utilized by the BTS and/or based on timing information associated with the BTS. The PN sequence PN_A may be associated with thecurrent cell 100. Theprocessor 206 may correspond to an ARM processor or other processor. - In other exemplary embodiments, the
processor 206 may generate and/or store PN sequences for at least a portion of the BTSs that are associated with thecurrent cell 100 and at least a portion of the BTSs that are not associated with thecurrent cell 100. For example, referring toFIG. 1 , theprocessor 206 may generate and/or store corresponding PN sequences, for example PN_A and PN_C in the memory 208. In general, theprocessor 206 may store the PN sequences for the BTSs from which a mobile communication device, for example the mobile communication device MC—2 114, may expect to receive signals and theprocessor 206 may store PN sequences from which the mobile communicating device may not expect to receive signals. The mobile communication device may expect to receive signals, for example common pilot channel (CPICH) signals, from a plurality of BTSs in anticipation of a soft handoff from a current service BTS to a subsequent serving BTS. - In instances in which the
transceiver system 200 utilizes a plurality of receiving antennas, for example the receiving antennas 222_1 and 222_2, thetransceiver system 200 may utilize receive diversity. In a receive diversity system, thereceiver 202 may receive a first set of signals via the receiving antenna 222_1 and a second set of signals via the receiving antenna 222_2. In various embodiments, which may utilize receive diversity, thereceiver 202 and/or thewindow search module 210 may also process signals that are transmitted by BTSs, which utilize signal transmission diversity. Hence, some embodiments support any combination of transmit and receive diversity (i.e., no diversity, receive diversity only, transmit diversity only, or both receive and transmit diversity). In embodiments employing multiple receiveantennas 222, the receivediversity adaptation module 211 is configured to selectively enable or disable receive diversity based, for example, on whether a path from one of the receiveantennas 222 is comparatively weaker and may be disabled. - Turning now to
FIG. 3 , shown is an example of awindow search module 210 according to various embodiments. Thewindow search module 210 may includeIo estimation logic 303,Ec estimation logic 306,control logic 309,sort logic 312,report generation logic 315, and/or other components. Thecontrol logic 309 is configured to control the operation of theEc estimation logic 306, thereport generation logic 315, and/or other components. To this end, thecontrol logic 309 is operable to enable various configurations for thewindow search module 210. Allocation of hardware resources may be performed by thecontrol logic 309. For example, thecontrol logic 309 may distribute the total search resources between active set window search and neighbor window search. Each scrambling code may be controlled independently with its own configuration, including coherent accumulation length, non-coherent accumulation length, transmit diversity, receive diversity, window span, carrier selection, sample start position, slot start position, and/or other parameters. - The
Io estimation logic 303 is configured to estimate total energy for each of the received signals 318 a and/or 318 b. Each of the received signals 318 a and 318 b corresponds to a received signal from a respective receive antenna 222 (FIG. 2 ). The outputs,Io 321 a andIo 321 b, each correspond to a measure of total energy as the “Io” component of an Ec/Io metric. TheIo report generation logic 315. In one embodiment, each received signal 318 is composed of M-bit I/Q (i.e., M-bit I and M-bit Q) complex samples at a CxP sampling rate (e.g., P*3.84 MHz). Inside theIo estimation logic 303, the real values (I components) are squared, the imaginary values (Q components) are squared, and the squared I and Q are accumulated at a chip by P (cxP) rate. For power consumption savings, the Io accumulation may be shared across multiple scrambling codes, with the time-based subcomponents being combined to provide values for the distinct scrambling codes. - The total energy Io for a given receive
antenna 222 is computed over the same period as that used for the corresponding Ec estimation which will be explained below. That is, for a given scrambling code, the Io and Ec are computed over the same time period, defined in chips as the product between the coherent and non-coherent accumulation lengths. As a non-limiting example, if the coherent accumulation length is set to 1024 chips and the non-coherent accumulation length is set to 2, the time period is 2048 chips. - The
Ec estimation logic 306 is configured to estimate energy per chip (Ec) for each of the received signals 318 a and 318 b. In one embodiment, theEc estimation logic 306 may support searching multiple scrambling codes on multiple carriers in parallel. Multiple carrier support may be enabled with an extra buffer at the front end, with one buffer per carrier and a multiplex block to select the I/Q stream from the selected carrier to be used as input to theEc estimation logic 306 andIo estimation logic 303. - Transmit diversity may be enabled in the
Ec estimation logic 206 using the property of the CPICH channel that it is orthogonal over a certain period of chips (e.g., 512 chips). Signals from multiple transmit antennas may be independently measured because they become orthogonal. To this end, the signal from a second transmit antenna may be recovered by rotating the descrambled signal by the polarity of the second transmit antenna. This rotation causes the signal from the first transmit antenna to be canceled out. - In one embodiment, the
Ec estimation logic 306 supports cx4 resolution for at least a subset of the window span. In one embodiment, theEc estimation logic 306 provides cx4 resolution over the first 15 chips for channels having closely spaced multiple paths. In other embodiments, the cx4 resolution is supported for the entire window span. Resolution beyond cx2 (cx4 and above) may be obtained via interpolation. The outputs from theEc estimation logic 306 are provided to thesort logic 312, which sorts the results to provide a set of top Ec measurements to thereport generation logic 315 for each of the receiveantennas 222. Thereport generation logic 315 is configured to generate Ec/Io reports, perform finger management functions, and/or cell energy reporting to the network. - The
sort logic 312 obtains a number of raw energy samples for each receiveantenna 222, e.g., 60, 120, 180, 240, 360, or some other number of samples. As a result of the coherent and non-coherent accumulations over a window span L(i), the overall number of non-coherent accumulator outcomes for a scrambling code i is 4*L(i) for cx4 resolution. Thesort logic 312 outputs a number T of top energy samples to thereport generation logic 315, e.g., T=32, along with their corresponding position offsets (e.g., 0, 1 . . . 4*L(i)−1 in cx4 resolution). If receive diversity is disabled, the outputs may simply be the top T sorted results out of the raw energy list for the active receiveantenna 222. - By contrast, if receive diversity is enabled, the sorting may be done according to at least three different configurations. In a first configuration, per-antenna-based sorting may be used, where the sorting and reporting are done individually for each receive
antenna 222. That is to say, the outputs for each receiveantenna 222 are the top T energy values for the respective receiveantenna 222. In a second configuration, per-antenna-pair-based sorting may be used with reporting on a per-antenna basis (i.e., combined sorting and separate reporting), where the sorting is based on the sum of energy values across receiveantennas 222. The outputs are the sorted top T results out of a raw energy sum list across the receiveantennas 222. The offsets may correspond to the relative offsets in the raw energy sum list. - In a third configuration, sorting is done on a per-antenna-pair basis, while the report is on a per-antenna-pair basis as well. In such a case, the results are sorted as in the second configuration. Each energy value from a first receive
antenna 222 may be scaled by a first antenna combining gain factor, and each energy value from a second receiveantenna 222 may be scaled by a second antenna combining gain factor before the results are summed. In contrast to the second configuration, the combined scaled results are reported. The results may be divided by the number of receiveantennas 222 to prevent overflow. Which configuration is used may be configurable by thecontrol logic 309. - In one embodiment, the
sort logic 312 assigns energy values to bins based on threshold determinations. For example, where 16-bit values are employed, the most-significant-bits of the energy values may be used to assign the values to one of 16 bins. To sort, in one embodiment, thesort logic 312 may find a threshold 2k, with k as large as possible while more than 32 samples are beyond this threshold. Thesort logic 312 may then brute-force sort the samples above the threshold. Each incoming sample is compared with all 32 incumbents. Other sorting techniques may be employed in other embodiments. - The
control logic 309 may configure a back-to-back search by thewindow search module 210. A back-to-back search enables a batch of searches of a single cell back to back, with only one configuration in the beginning. Once a back-to-back search is activated, every search within the same batch employs the same searching parameters. - Moving now to
FIG. 4 , shown is a block diagram showing portions of theEc estimation logic 306 according to one embodiment. TheEc estimation logic 306 includesdescrambler logic 403, scramblingcode generation logic 406,coherent accumulation logic 409,interpolator 412,non-coherent accumulation logic 415, and/or other components. - The received
signal 418 is obtained from a chip matched filter and is composed of M-bit I/Q (i.e., M-bit I and M-bit Q) complex samples. The receivedsignal 418 and may be decimated to a chip by 2 (cx2) (e.g., 7.68 MHz) resolution. Chip rate samples may be provided on each of an early bus and a late bus to thedescrambler logic 403, where the early and late branches are fed with samples offset by one half-chip sample. The scramblingcode generation logic 406 provides one or more scrambling codes to thedescrambler logic 403 for use in descrambling the receivedsignal 418. In one embodiment, thedescrambler logic 403 may support descrambling of up to K (e.g., K=8) scrambling codes in parallel. By supporting the search of multiple scrambling codes in parallel, the window search is performed faster and with reduced power consumption relative to a one-at-a-time search. With increased window search bandwidth, more cells can be measured over a longer span, and awake time within the discontinuous reception (DRX) mode can be reduced, thus saving power. - For a given scrambling code i, the scrambling
code generation logic 406 also provides a shifted version of the same scrambling code, offset by X chips, where X=1, . . . L(i), and L(i) is the configured window span for the search on that scrambling code. For example, if the window span L(i) is configured as 90 chips, the scramblingcode generation logic 406 will provide 90 different phases of the same scrambling code, each phase shifted by 1 chip, to cover the entire window span of 90 chips. The same I/Q complex sample is multiplied by L(i) different phases of the scrambling code in parallel. The descrambled I/Q for a given scrambling code phase is referred to as a slice. Thus, there is a bank of L(i) slices per early and late branch, per scrambling code, per receiveantenna 222, and per transmit antenna, fed into thecoherent accumulation logic 409. - The chip rate descrambled received signals from each of the early and late branch and from each of the L(i) slices are then provided to the
coherent accumulation logic 409, which performs coherent accumulation on each of the slices. In one embodiment, thewindow search module 210 includes M=960 coherent accumulators, hence supporting a total of M=960 slices in parallel. The coherent accumulation results are interpolated to a higher resolution (e.g., cx4 resolution) by theinterpolator 412. - The coherent accumulation results (original set of cx2) as well as the interpolated result are provided to the
non-coherent accumulation logic 415 to perform a non-coherent accumulation at the higher resolution. In this way, the higher resolution (e.g., cx4 resolution) may be achieved for a window search by doubling only the number of non-coherent accumulators relative to cx2 resolution and keeping the number of coherent accumulators the same as for cx2 resolution. Since the coherent accumulation stage is more computationally intensive than the non-coherent accumulation stage, significant power consumption may be saved. In one embodiment, the window search module includes 1920 (M*N=960*2) non-coherent accumulators. The non-coherent accumulators square the I and Q components at the output of the coherent accumulators and accumulate the squared I and Q over the non-coherent accumulation length. - The
interpolator 412 performs an interpolation to a higher subchip resolution. For example, theinterpolator 412 may interpolate samples at a chip by 2 (cx2) resolution to a chip by 4 (cx4) resolution. In one embodiment, the even cx4 samples pass unchanged directly from the coherent accumulators to the non-coherent accumulators, while the odd cx4 samples are reconstructed from even cx4 samples nearby by theinterpolator 412. The interpolation may be performed, for example, according to the following equation: -
- The coefficients employed above ([−1 5 5 −1]/8) may be chosen for ease of hardware implementation or for other reasons.
- In the case of receive diversity, the components shown in
FIG. 4 may be duplicated for the additional receive paths. Receive combining diversity may be supported by weighting and combining the non-coherent accumulation results per receive antenna 222 (FIG. 2 ). In the case that one of the receiveantennas 222 is receiving a signal that is significantly stronger than that received by another one of the receive antennas 222 (e.g., where one received signal meets a signal strength threshold relative to the other received signal), receive selection may be possible by shutting down the weaker receive path components, thereby further saving power consumption in the window search module 210 (FIG. 2 ). The decision to disable or enable receive diversity based on path strengths may be made by the receive diversity adaptation module 211 (FIG. 2 ). In the exemplary case of two receiveantennas 222, thewindow search module 210 may be configured to receive with either the first receiveantenna 222 only, the second receiveantenna 222 only, or with both receiveantennas 222. - Next, several non-limiting examples of configurations for the
window search module 210 will be discussed. For these examples, assume that a total number of 960 coherent accumulators are available (M=960), and that two base station transmit antennas and/or two receiveantennas 222 may be employed. In a first configuration, five scrambling codes are searched in parallel. The first scrambling code is searched with a window span of 15 and with transmit and receive diversity enabled. The search for the first scrambling code uses 15*2*2*2=120 coherent accumulators (15 window span length*2 branches [early/late]*2 receive paths*2 transmit paths). - The second scrambling code is searched with a window span of 30 with receive diversity enabled and transmit diversity disabled. The search for the second scrambling code uses 30*2*2*1=120 coherent accumulators (30 window span length*2 branches [early/late]*2 receive paths*1 transmit path). The third scrambling code is searched with a window span of 60 with receive diversity disabled and transmit diversity enabled. The search for the third scrambling code uses 60*2*1*2=240 coherent accumulators (60 window span length*2 branches [early/late]*1 receive path*2 transmit paths). The fourth scrambling code is searched with a window span of 60 with receive diversity enabled and transmit diversity disabled. The search for the fourth scrambling code uses 60*2*1*2=240 coherent accumulators (60 window span length*2 branches [early/late]*2 receive paths*1 transmit path).
- The fifth scrambling code is searched with a window span of 90 with receive and transmit diversity disabled. The search for the fifth scrambling code uses 90*2*1*1=180 coherent accumulators (90 window span length*2 branches [early/late]*1 receive path*1 transmit path). According to the first configuration, 900 coherent accumulators out of 960 total are active, yielding a resource consumption of 93.75%. It is noted that according to the first configuration, each of the five scrambling codes has an independent and different configuration.
- In a second configuration, the
window search module 210 searches seven scrambling codes in parallel. Three of the scrambling codes employ a window span length of 60 chips, while the remaining four of the scrambling codes employ a window span length of 15 chips. Receive diversity is enabled and transmit diversity is disabled for all seven of the scrambling codes. Each one of the three scrambling codes uses 60*2*2*1=240 coherent accumulators (60 window span length*2 branches [early/late]*2 receive paths*1 transmit path), and each one of the four scrambling codes uses 15*2*2*1=60 coherent accumulators (15 window span length*2 branches [early/late]*2 receive paths*1 transmit path). This results in a total active usage of 960 coherent accumulators, corresponding to 100% utilization. In this configuration, some of the scrambling codes use the same configuration, but it is not a requirement. - In a third configuration, the
window search module 210 searches six scrambling codes in parallel. Under the third configuration, receive diversity is disabled as a second receiveantenna 222 has been disabled, e.g., because its signal has been determined to be too weak. The first scrambling code is searched with a window span of 60 with transmit diversity enabled. The search for the first scrambling code uses 60*2*1*2=240 coherent accumulators (60 window span length*2 branches [early/late]*1 receive path*2 transmit paths). The second scrambling code is searched with a window span of 90 with transmit diversity disabled. The search for the second scrambling code uses 90*2*1*1=180 coherent accumulators (90 window span length*2 branches [early/late]*1 receive path*1 transmit path). - The third scrambling code is searched with a window span of 60 with transmit diversity disabled. The search for the third scrambling code uses 60*2*1*1==120 coherent accumulators (60 window span length*2 branches [early/late]*1 receive path*1 transmit path). The fourth scrambling code is searched with a window span of 30 with transmit diversity disabled. The search for the fourth scrambling code uses 30*2*1*1=60 coherent accumulators (30 window span length*2 branches [early/late]*1 receive path*1 transmit path). The fifth scrambling code is searched with a window span of 15 with transmit diversity enabled. The search for the fifth scrambling code uses 15*2*1*2=60 coherent accumulators (15 window span length*2 branches [early/late]*1 receive path*2 transmit paths).
- The sixth scrambling code is searched with a window span of 15 with transmit diversity disabled. The search for the sixth scrambling code uses 15*2*1*1=30 coherent accumulators (15 window span length*2 branches [early/late]*1 receive path*1 transmit path). Under the third configuration, no receive diversity is configured for any of the six scrambling codes. Consequently, only a subset of the total resource is active, resulting in power consumption savings. In this example, 690 coherent accumulators are in active use out of 960, resulting in 71.88% utilization. It is noted that even if receive diversity is active, the
window search module 210 may still be configured to despread signals from both receiveantennas 222 or either one of the two. - With reference to
FIG. 5 , shown is a flowchart that provides one example of the operation of a portion of the window search module 210 (FIG. 2 ) according to various embodiments. It is understood that the flowchart ofFIG. 5 provides merely an example of the many different types of functional arrangements that may be employed to implement the operation of the portion of thewindow search module 210 as described herein. As an alternative, the flowchart ofFIG. 5 may be viewed as depicting an example of steps of a method implemented in the transceiver system 200 (FIG. 2 ) according to one or more embodiments. - Beginning with
box 503, thewindow search module 210 configures window search logic including M coherent accumulators to perform a window search on a received signal for a set of scrambling codes i. Each one of the set of scrambling codes is to be searched for a respective window span L(i). Inbox 506, thewindow search module 210 performs the window search for each of the set of scrambling codes i in parallel in the window search logic. - The window searches utilize a scalable number M1 of the coherent accumulators. M1 may be determined based at least in part on the number of scrambling codes i, the respective window spans L(i) to be searched, whether receive diversity is enabled, whether transmit diversity is enabled, and/or on other factors. Receive diversity and/or transmit diversity may be enabled on a per-scrambling-code basis. In one example, M1 may equal M. Alternatively, if M1 is less than M, one or more of the M coherent accumulators may be inactive and in a reduced power consumption state during the window search due to the scalability of the window search logic.
- In
box 509, thewindow search module 210 sorts the respective set of energy results for each scrambling code i based at least in part on a selected sorting approach. If receive diversity is not enabled, the selected sorting approach may default to per-antenna-based sorting for the active receive antenna 222 (FIG. 2 ). If receive diversity is enabled, the selected sorting approach may be chosen from per-antenna-based sorting or per-antenna-pair-based sorting. - In
box 512, thewindow search module 210 reports the respective sorted set of energy results for each scrambling code i based at least in part on a selected reporting approach. When per-antenna-based sorting is used, the selected reporting approach may be per-antenna-based reporting. When per-antenna-pair-based sorting is used, the selected reporting approach may be per-antenna-based reporting or per-antenna-pair-based reporting. Subsequently, thewindow search module 210 may be reconfigured for a different number of scrambling codes, different window spans, and different receive and transmit diversity settings. Thereafter, the portion of thewindow search module 210 ends. - With reference to
FIG. 6 , shown is a flowchart that provides one example of the operation of another portion of the window search module 210 (FIG. 2 ) according to various embodiments. In particular, the portion of thewindow search module 210 depicted inFIG. 6 may correspond to a portion of the Ec estimation logic 306 (FIG. 3 ). It is understood that the flowchart ofFIG. 6 provides merely an example of the many different types of functional arrangements that may be employed to implement the operation of the portion of thewindow search module 210 as described herein. As an alternative, the flowchart ofFIG. 6 may be viewed as depicting an example of steps of a method implemented in the transceiver system 200 (FIG. 2 ) according to one or more embodiments. - Beginning with
box 601, thewindow search module 210 is configured to perform a series of operations in parallel across multiple scrambling codes and, potentially, multiple transmit antennas and multiple receive antennas 222 (FIG. 2 ). Inbox 602, for a given scrambling code i, the scramblingcode generation logic 406 provides L(i) shifted versions of the same scrambling code i, each offset by 1 chip (or some other predetermined number of chips), where L(i) is the configured window span in chips for that search. Inbox 603, thewindow search module 210 descrambles the received signal for Tx/Rx antenna pair (t, r) for each of the L(i) chip positions, at a first subchip resolution, e.g., cx2 resolution or some other resolution. - In
box 606, thewindow search module 210 performs a coherent accumulation over a length of CI chips on the descrambled received signal for Tx/Rx antenna pair (t, r) for each of the L(i) chip positions, at the first subchip resolution. Inbox 609, thewindow search module 210 interpolates the coherent accumulation result for Tx/Rx antenna pair (t, r) for each of the L(i) chip positions to a second subchip resolution, e.g., cx4 resolution or some other resolution. Inbox 612, thewindow search module 210 performs a non-coherent accumulation over a length of NCI samples at the second chip resolution using the interpolated coherent accumulation result. In various embodiments, thewindow search module 210 includes a set of M coherent accumulators and a set of N*M non-coherent accumulators, where N is greater than 1. The value of N may correspond to an interpolation factor employed in the interpolation ofbox 609. - If embodied in dedicated hardware, the systems described herein can be implemented as a circuit or state machine that employs any one of or a combination of a number of technologies. These technologies may include, but are not limited to, discrete logic circuits having logic gates for implementing various logic functions upon an application of one or more data signals, application specific integrated circuits having appropriate logic gates, or other components, etc. Such technologies are generally well known by those skilled in the art and, consequently, are not described in detail herein. Although the various systems described herein may be embodied in dedicated hardware as discussed above, as an alternative the same may also be embodied in software or code executed by general purpose hardware or a combination of software/general purpose hardware and dedicated hardware.
- The flowcharts of
FIGS. 5 and 6 show the functionality and operation of an implementation of portions of thewindow search module 210. If embodied in software, each block may represent a module, segment, or portion of code that comprises program instructions to implement the specified logical function(s). The program instructions may be embodied in the form of source code that comprises human-readable statements written in a programming language or machine code that comprises numerical instructions recognizable by a suitable execution system such as a processor 206 (FIG. 2 ) in a computer system or other system. The machine code may be converted from the source code, etc. If embodied in hardware, each block may represent a circuit or a number of interconnected circuits to implement the specified logical function(s). - Although the flowcharts of
FIGS. 5 and 6 show a specific order of execution, it is understood that the order of execution may differ from that which is depicted. For example, the order of execution of two or more blocks may be scrambled relative to the order shown. Also, two or more blocks shown in succession inFIGS. 5 and 6 may be executed concurrently or with partial concurrence. Further, in some embodiments, one or more of the blocks shown inFIGS. 5 and 6 may be skipped or omitted. In addition, any number of counters, state variables, warning semaphores, or messages might be added to the logical flow described herein, for purposes of enhanced utility, accounting, performance measurement, or providing troubleshooting aids, etc. It is understood that all such variations are within the scope of the present disclosure. - Also, any logic or application described herein that comprises software or code can be embodied in any non-transitory computer-readable medium for use by or in connection with an instruction execution system such as, for example, a
processor 206 in a computer system or other system. In this sense, the logic may comprise, for example, statements including instructions and declarations that can be fetched from the computer-readable medium and executed by the instruction execution system. In the context of the present disclosure, a “computer-readable medium” can be any medium that can contain, store, or maintain the logic or application described herein for use by or in connection with the instruction execution system. - The computer-readable medium can comprise any one of many physical media such as, for example, magnetic, optical, or semiconductor media. More specific examples of a suitable computer-readable medium would include, but are not limited to, magnetic tapes, magnetic floppy diskettes, magnetic hard drives, memory cards, solid-state drives, USB flash drives, or optical discs. Also, the computer-readable medium may be a random access memory (RAM) including, for example, static random access memory (SRAM) and dynamic random access memory (DRAM), or magnetic random access memory (MRAM). In addition, the computer-readable medium may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or other type of memory device.
- It should be emphasized that the above-described embodiments of the present disclosure are merely possible examples of implementations set forth for a clear understanding of the principles of the disclosure. Many variations and modifications may be made to the above-described embodiment(s) without departing substantially from the spirit and principles of the disclosure. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/415,487 US20130142221A1 (en) | 2011-12-01 | 2012-03-08 | High performance window searcher for cell measurement |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201161565864P | 2011-12-01 | 2011-12-01 | |
US201161568868P | 2011-12-09 | 2011-12-09 | |
US13/415,487 US20130142221A1 (en) | 2011-12-01 | 2012-03-08 | High performance window searcher for cell measurement |
Publications (1)
Publication Number | Publication Date |
---|---|
US20130142221A1 true US20130142221A1 (en) | 2013-06-06 |
Family
ID=48523580
Family Applications (9)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/405,377 Abandoned US20130142057A1 (en) | 2011-12-01 | 2012-02-27 | Control Channel Acquisition |
US13/415,487 Abandoned US20130142221A1 (en) | 2011-12-01 | 2012-03-08 | High performance window searcher for cell measurement |
US13/428,022 Expired - Fee Related US8842658B2 (en) | 2011-12-01 | 2012-03-23 | Synchronization channel interference cancellation |
US13/432,320 Active 2033-11-17 US9198149B2 (en) | 2011-12-01 | 2012-03-28 | Two-step searcher for cell discovery |
US13/433,683 Active US8670509B2 (en) | 2011-12-01 | 2012-03-29 | Adaptive path selection for interference cancellation |
US13/436,845 Expired - Fee Related US8861652B2 (en) | 2011-12-01 | 2012-03-31 | Detecting format of a transport channel |
US13/624,228 Abandoned US20130141257A1 (en) | 2011-12-01 | 2012-09-21 | Turbo decoder metrics initialization |
US13/646,138 Abandoned US20130142238A1 (en) | 2011-12-01 | 2012-10-05 | High resolution symbol timing tracking |
US13/680,495 Abandoned US20130143577A1 (en) | 2011-12-01 | 2012-11-19 | Frequency offset correction |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/405,377 Abandoned US20130142057A1 (en) | 2011-12-01 | 2012-02-27 | Control Channel Acquisition |
Family Applications After (7)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/428,022 Expired - Fee Related US8842658B2 (en) | 2011-12-01 | 2012-03-23 | Synchronization channel interference cancellation |
US13/432,320 Active 2033-11-17 US9198149B2 (en) | 2011-12-01 | 2012-03-28 | Two-step searcher for cell discovery |
US13/433,683 Active US8670509B2 (en) | 2011-12-01 | 2012-03-29 | Adaptive path selection for interference cancellation |
US13/436,845 Expired - Fee Related US8861652B2 (en) | 2011-12-01 | 2012-03-31 | Detecting format of a transport channel |
US13/624,228 Abandoned US20130141257A1 (en) | 2011-12-01 | 2012-09-21 | Turbo decoder metrics initialization |
US13/646,138 Abandoned US20130142238A1 (en) | 2011-12-01 | 2012-10-05 | High resolution symbol timing tracking |
US13/680,495 Abandoned US20130143577A1 (en) | 2011-12-01 | 2012-11-19 | Frequency offset correction |
Country Status (1)
Country | Link |
---|---|
US (9) | US20130142057A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150131593A1 (en) * | 2012-10-05 | 2015-05-14 | Cisco Technology, Inc | High Density Deployment Using Transmit or Transmit-Receive Interference Suppression with Selective Channel Dimension Reduction/Attenuation and Other Parameters |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7639736B2 (en) | 2004-05-21 | 2009-12-29 | Rambus Inc. | Adaptive receive-side equalization |
JP5747123B2 (en) * | 2011-06-30 | 2015-07-08 | パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカPanasonic Intellectual Property Corporation of America | Method for reporting phase offset, user equipment using the method, and transmission point device |
US9048990B2 (en) | 2011-12-01 | 2015-06-02 | Broadcom Corporation | Power efficient paging channel decoding |
US20130142057A1 (en) | 2011-12-01 | 2013-06-06 | Broadcom Corporation | Control Channel Acquisition |
US8873420B2 (en) | 2011-12-01 | 2014-10-28 | Broadcom Corporation | Detecting extended acquisition indicators |
US8743930B2 (en) * | 2012-03-30 | 2014-06-03 | Broadcom Corporation | Suppressing intra-cell interference |
US8774066B2 (en) * | 2012-05-31 | 2014-07-08 | Intel Mobile Communications GmbH | Macro-femto inter-cell interference mitigation |
US10440644B2 (en) * | 2012-06-29 | 2019-10-08 | Qualcomm Incorporated | Methods and apparatus for turbo decoder throttling |
US9167458B2 (en) * | 2012-09-12 | 2015-10-20 | Qualcomm Incorporated | Using downlink TFCI to generate a larger idle interval |
US9432918B2 (en) * | 2012-11-13 | 2016-08-30 | Qualcomm Incorporated | Apparatus and methods of receive diversity (RXD) full cell search |
US9526099B2 (en) | 2013-07-03 | 2016-12-20 | Qualcomm Incorporated | Apparatus and methods for early transport format determination |
US10560244B2 (en) * | 2013-07-24 | 2020-02-11 | At&T Intellectual Property I, L.P. | System and method for reducing inter-cellsite interference in full-duplex communications |
US8718178B1 (en) | 2013-11-08 | 2014-05-06 | Qualcomm Incorporated | Selection of non-linear interference cancelation (NLIC) input |
WO2015082009A1 (en) * | 2013-12-05 | 2015-06-11 | Telefonaktiebolaget L M Ericsson (Publ) | Oscillator arrangement, method, computer program and communication device |
US9548776B2 (en) | 2014-01-16 | 2017-01-17 | Qualcomm Incorporated | Interference cancelation using cooperative sensing |
EP3163945B1 (en) * | 2014-08-07 | 2019-06-19 | Huawei Technologies Co. Ltd. | Interference cancellation methods and devices |
US9723535B1 (en) * | 2014-11-10 | 2017-08-01 | Sprint Spectrum L.P. | Wireless network neighbor list optimization based on group delay metrics |
CN111970063B (en) * | 2020-08-26 | 2022-04-29 | 北京字节跳动网络技术有限公司 | Communication method, device, equipment and storage medium |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030220755A1 (en) * | 2002-05-16 | 2003-11-27 | Nicolas Darbel | Code group acquisition procedure for a UMTS-FDD receiver |
US20050088987A1 (en) * | 2003-09-16 | 2005-04-28 | Dong-Ryeol Ryu | Apparatus and method for searching for cell and multi-path in mobile communication system |
US7356070B2 (en) * | 2002-12-17 | 2008-04-08 | Lg Electronics Inc. | Apparatus for recognizing mobile signals in mobile communication system, and method therefor |
US20090131009A1 (en) * | 2003-03-05 | 2009-05-21 | Interdigital Technology Corporation | Received communication signal processing methods and components for wireless communication equipment |
US20100027592A1 (en) * | 2008-07-29 | 2010-02-04 | Agere Systems Inc. | Technique for searching for a preamble signal in a spread spectrum signal using a fast hadamard transform |
Family Cites Families (76)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5627592A (en) * | 1993-02-10 | 1997-05-06 | U.S. Philips Corporation | Start code for signalling bits |
US5933462A (en) * | 1996-11-06 | 1999-08-03 | Qualcomm Incorporated | Soft decision output decoder for decoding convolutionally encoded codewords |
US5852630A (en) * | 1997-07-17 | 1998-12-22 | Globespan Semiconductor, Inc. | Method and apparatus for a RADSL transceiver warm start activation procedure with precoding |
WO2000052833A1 (en) * | 1999-03-01 | 2000-09-08 | Fujitsu Limited | Method and apparatus for decoding maximum posterior probability |
US6580767B1 (en) * | 1999-10-22 | 2003-06-17 | Motorola, Inc. | Cache and caching method for conventional decoders |
US6643318B1 (en) | 1999-10-26 | 2003-11-04 | Golden Bridge Technology Incorporated | Hybrid DSMA/CDMA (digital sense multiple access/code division multiple access) method with collision resolution for packet communications |
US6700937B1 (en) * | 2000-01-05 | 2004-03-02 | At&T Corp. | Iterative decoding |
JP3438778B2 (en) | 2000-05-09 | 2003-08-18 | 日本電気株式会社 | W-CDMA transmission rate estimation method and apparatus |
US6813743B1 (en) * | 2000-07-31 | 2004-11-02 | Conexant Systems, Inc. | Sliding window technique for map decoders |
US6452979B1 (en) * | 2000-09-06 | 2002-09-17 | Motorola, Inc. | Soft output decoder for convolutional codes |
US6865711B2 (en) * | 2000-12-15 | 2005-03-08 | Conexant Systems, Inc. | System of and method for decoding trellis codes |
US7010073B2 (en) * | 2001-01-19 | 2006-03-07 | Qualcomm, Incorporated | Delay lock loops for wireless communication systems |
JP4269520B2 (en) * | 2001-01-23 | 2009-05-27 | 株式会社デンソー | Approximation calculation device and MAP decoding device |
US20020131390A1 (en) * | 2001-03-09 | 2002-09-19 | Wen-Yi Kuo | Cancellation of non-orthogonal signal in CDMA wireless communications systems |
US7200799B2 (en) * | 2001-04-30 | 2007-04-03 | Regents Of The University Of Minnesota | Area efficient parallel turbo decoding |
US7013146B2 (en) | 2001-06-27 | 2006-03-14 | Nokia Corporation | Method for adaptively setting transmission parameters for a random access channel transmission uplink procedure in a wireless communication system |
US20030023919A1 (en) * | 2001-07-12 | 2003-01-30 | Yuan Warm Shaw | Stop iteration criterion for turbo decoding |
US6868518B2 (en) * | 2001-07-12 | 2005-03-15 | Sony Corporation | Look-up table addressing scheme |
US20030091129A1 (en) * | 2001-07-12 | 2003-05-15 | Mingming Zhang | Look-up table index value generation in a turbo decoder |
US6744747B2 (en) * | 2001-08-22 | 2004-06-01 | Qualcomm, Incorporated | Method & apparatus for W-CDMA handoff searching |
US6768768B2 (en) * | 2001-09-19 | 2004-07-27 | Qualcomm Incorporated | Method and apparatus for step two W-CDMA searching |
US7277679B1 (en) * | 2001-09-28 | 2007-10-02 | Arraycomm, Llc | Method and apparatus to provide multiple-mode spatial processing to a terminal unit |
KR100479169B1 (en) * | 2001-10-26 | 2005-03-25 | 삼성전자주식회사 | Apparatus for cell search and method thereof in mobile communication system |
SG125061A1 (en) * | 2001-12-07 | 2006-09-29 | Oki Techno Ct Singapore Pte | A turbo decoder, and a map decoder component of the turbo decoder |
US20030149928A1 (en) * | 2002-02-07 | 2003-08-07 | Yeun-Renn Ting | Turbo-code decoder |
DE10206727A1 (en) * | 2002-02-18 | 2003-08-28 | Infineon Technologies Ag | Combined encryption and decryption circuit and turbo-decoder with such circuit |
ITFI20020034A1 (en) * | 2002-02-27 | 2003-08-27 | Actis Active Sensors S R L | METHOD AND DEVICE FOR THE SPECTRAL ANALYSIS OF AN ECOGRAPHIC SIGNAL |
KR100871219B1 (en) * | 2002-04-24 | 2008-12-01 | 삼성전자주식회사 | Cell search apparatus for multi search in mobile communication system and method thereof |
JP3898574B2 (en) * | 2002-06-05 | 2007-03-28 | 富士通株式会社 | Turbo decoding method and turbo decoding apparatus |
US7042930B2 (en) * | 2002-06-06 | 2006-05-09 | The Aerospace Corporation | Spread spectrum bit boundary correlation search acquisition system |
JP4185314B2 (en) * | 2002-06-07 | 2008-11-26 | 富士通株式会社 | Information recording / reproducing apparatus, optical disc apparatus, and data reproducing method |
US8179946B2 (en) | 2003-09-23 | 2012-05-15 | Rambus Inc. | Systems and methods for control of advanced receivers |
US20040062298A1 (en) * | 2002-10-01 | 2004-04-01 | Mcdonough John G. | System and method for detecting direct sequence spread spectrum signals using pipelined vector processing |
US7474688B2 (en) * | 2002-10-01 | 2009-01-06 | Texas Instruments Incorporated | System and method for detecting multiple direct sequence spread spectrum signals using a multi-mode searcher |
EP1561286B1 (en) * | 2002-11-15 | 2013-04-10 | Telecom Italia S.p.A. | Method and device for fine synchronization of a digital telecommunication receiver |
US7233774B2 (en) * | 2003-01-30 | 2007-06-19 | Broadcom Corporation | RF transceiver with compact stacked mixer design for multiple frequency conversion |
DE10310812B4 (en) | 2003-03-12 | 2007-11-22 | Infineon Technologies Ag | Decoding device, trellis processor and method |
JP4227481B2 (en) * | 2003-07-11 | 2009-02-18 | パナソニック株式会社 | Decoding device and decoding method |
DE10334064B3 (en) * | 2003-07-25 | 2005-04-14 | Infineon Technologies Ag | Method and circuit arrangement for calibrating a sampling control signal of a sampling phase selection element which influences the sampling instant of a received signal |
JP2005109771A (en) * | 2003-09-30 | 2005-04-21 | Fujitsu Ltd | Method and apparatus for decoding maximum posteriori probability |
US7257760B2 (en) | 2003-11-25 | 2007-08-14 | Roland Reinhard Rick | Early decoding of a control channel in a wireless communication system |
JP2005167513A (en) * | 2003-12-01 | 2005-06-23 | Matsushita Electric Ind Co Ltd | Decoding device and decoding method |
JP4778441B2 (en) * | 2003-12-22 | 2011-09-21 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | SISO decoder with sub-block processing and sub-block based stop criteria |
US7266757B1 (en) * | 2004-01-29 | 2007-09-04 | Xilinx, Inc. | Pipelined architecture implementing recursion processes for forward error correction |
GB2418109B (en) * | 2004-09-10 | 2007-03-07 | Samsung Electronics Co Ltd | MAP decoding |
JP2006324754A (en) * | 2005-05-17 | 2006-11-30 | Fujitsu Ltd | Maximum a posteriori probability decoding method and decoder thereof |
US7747922B2 (en) * | 2005-06-01 | 2010-06-29 | Telecommunications Research Laboratories | Adaptive hybrid ARQ systems with BCJR decoding |
US20070064665A1 (en) | 2005-08-23 | 2007-03-22 | Interdigital Technology Corporation | Method and apparatus for accessing an uplink random access channel in a single carrier frequency division multiple access system |
RU2426261C2 (en) | 2005-09-08 | 2011-08-10 | Эл Джи Электроникс Инк. | Method and protocol for processing attempts at accessing communication system |
CN101346906B (en) | 2005-12-23 | 2013-10-16 | Lg电子株式会社 | Random access procedure processing method |
US8000305B2 (en) | 2006-01-17 | 2011-08-16 | Motorola Mobility, Inc. | Preamble sequencing for random access channel in a communication system |
KR100918734B1 (en) * | 2006-07-27 | 2009-09-24 | 삼성전자주식회사 | Method and Apparatus for Error Correction in Multiple-input Multiple-output Communication System |
JP4708301B2 (en) * | 2006-10-13 | 2011-06-22 | 富士通株式会社 | Turbo decoder |
US7957758B2 (en) | 2007-06-13 | 2011-06-07 | Mediatek Inc. | Method of and apparatus for reducing power consumption in a mobile telephony system |
US8291302B2 (en) * | 2007-10-17 | 2012-10-16 | Marvell International Ltd. | State metrics memory reduction in a turbo decoder implementation |
US8214715B1 (en) * | 2007-10-17 | 2012-07-03 | Marvell International Ltd. | Hardware implementation of QPP interleaver |
US8036319B2 (en) * | 2007-11-01 | 2011-10-11 | Intel Corporation | Direct conversion receiver and method for correcting phase imbalance therein |
EP2218288B1 (en) | 2007-11-01 | 2011-05-18 | Koninklijke Philips Electronics N.V. | Improved power ramping for rach |
US8149702B2 (en) | 2007-12-21 | 2012-04-03 | Mediatek Inc. | Multi-mode bit rate processor |
TWI339956B (en) * | 2007-12-31 | 2011-04-01 | Ind Tech Res Inst | Method and apparatus for convolutional turbo decoding |
US8264975B2 (en) * | 2008-02-20 | 2012-09-11 | Qualcomm Incorporated | FFT-based estimation of thermal noise and rise over thermal in a wireless communication system |
US8077820B2 (en) * | 2008-03-05 | 2011-12-13 | Agere Systems Inc. | Detection of frequency correction bursts and the like |
US8321744B2 (en) * | 2008-09-16 | 2012-11-27 | Analog Devices, Inc. | Channel adaptive iterative turbo decoder system and method |
US8767769B2 (en) | 2009-02-23 | 2014-07-01 | Freescale Semiconductor | Processing data flows |
US8369384B2 (en) | 2009-09-15 | 2013-02-05 | Broadcom Corporation | Method and system for processing signals utilizing a programmable interference suppression module |
US8131221B2 (en) * | 2009-10-23 | 2012-03-06 | Broadcom Corporation | Method and system for processing multipath signals to suppress interface utilizing a programmable interface suppression module |
CN102484484B (en) * | 2009-08-25 | 2014-08-20 | 富士通株式会社 | Transmitter, encoding device, receiver, and decoding device |
GB0915135D0 (en) * | 2009-08-28 | 2009-10-07 | Icera Inc | Decoding signals received over a noisy channel |
JP5583942B2 (en) * | 2009-09-30 | 2014-09-03 | 富士通株式会社 | Wireless receiver |
EP2494698A4 (en) * | 2009-10-28 | 2015-03-25 | Lenovo Innovations Ltd Hong Kong | Method of synchronisation channel (sch) interference cancellation in a mobile communication system |
CN103299697A (en) | 2010-10-29 | 2013-09-11 | 瑞典爱立信有限公司 | Method and arrangement in a communications network |
US8910029B2 (en) * | 2011-02-08 | 2014-12-09 | Intel Mobile Communications GmbH | Iterative decoder |
US8873420B2 (en) | 2011-12-01 | 2014-10-28 | Broadcom Corporation | Detecting extended acquisition indicators |
US9048990B2 (en) | 2011-12-01 | 2015-06-02 | Broadcom Corporation | Power efficient paging channel decoding |
US20130142057A1 (en) | 2011-12-01 | 2013-06-06 | Broadcom Corporation | Control Channel Acquisition |
US20130262952A1 (en) * | 2012-03-30 | 2013-10-03 | Broadcom Corporation | Memory architecture for turbo decoder |
-
2012
- 2012-02-27 US US13/405,377 patent/US20130142057A1/en not_active Abandoned
- 2012-03-08 US US13/415,487 patent/US20130142221A1/en not_active Abandoned
- 2012-03-23 US US13/428,022 patent/US8842658B2/en not_active Expired - Fee Related
- 2012-03-28 US US13/432,320 patent/US9198149B2/en active Active
- 2012-03-29 US US13/433,683 patent/US8670509B2/en active Active
- 2012-03-31 US US13/436,845 patent/US8861652B2/en not_active Expired - Fee Related
- 2012-09-21 US US13/624,228 patent/US20130141257A1/en not_active Abandoned
- 2012-10-05 US US13/646,138 patent/US20130142238A1/en not_active Abandoned
- 2012-11-19 US US13/680,495 patent/US20130143577A1/en not_active Abandoned
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030220755A1 (en) * | 2002-05-16 | 2003-11-27 | Nicolas Darbel | Code group acquisition procedure for a UMTS-FDD receiver |
US7356070B2 (en) * | 2002-12-17 | 2008-04-08 | Lg Electronics Inc. | Apparatus for recognizing mobile signals in mobile communication system, and method therefor |
US20090131009A1 (en) * | 2003-03-05 | 2009-05-21 | Interdigital Technology Corporation | Received communication signal processing methods and components for wireless communication equipment |
US20050088987A1 (en) * | 2003-09-16 | 2005-04-28 | Dong-Ryeol Ryu | Apparatus and method for searching for cell and multi-path in mobile communication system |
US20100027592A1 (en) * | 2008-07-29 | 2010-02-04 | Agere Systems Inc. | Technique for searching for a preamble signal in a spread spectrum signal using a fast hadamard transform |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150131593A1 (en) * | 2012-10-05 | 2015-05-14 | Cisco Technology, Inc | High Density Deployment Using Transmit or Transmit-Receive Interference Suppression with Selective Channel Dimension Reduction/Attenuation and Other Parameters |
US9332557B2 (en) * | 2012-10-05 | 2016-05-03 | Cisco Technology, Inc. | High density deployment using transmit or transmit-receive interference suppression with selective channel dimension reduction/attenuation and other parameters |
Also Published As
Publication number | Publication date |
---|---|
US8842658B2 (en) | 2014-09-23 |
US20130143554A1 (en) | 2013-06-06 |
US20130142238A1 (en) | 2013-06-06 |
US20130143577A1 (en) | 2013-06-06 |
US8670509B2 (en) | 2014-03-11 |
US20130142273A1 (en) | 2013-06-06 |
US20130142190A1 (en) | 2013-06-06 |
US20130141257A1 (en) | 2013-06-06 |
US9198149B2 (en) | 2015-11-24 |
US8861652B2 (en) | 2014-10-14 |
US20130142223A1 (en) | 2013-06-06 |
US20130142057A1 (en) | 2013-06-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20130142221A1 (en) | High performance window searcher for cell measurement | |
EP1719258B1 (en) | Method and apparatus for finger placement in a rake receiver | |
US8284819B2 (en) | Method and system for interference suppression in WCDMA systems | |
US8311484B2 (en) | Method and system for interference suppression using information from non-listened base stations | |
US8098715B2 (en) | Method and apparatus for estimating impairment covariance matrices using unoccupied spreading codes | |
CA2345699C (en) | A cdma receiver that shares a tracking device among multiple rake branches | |
US8208856B2 (en) | Method and system for a programmable interference suppression module | |
US8472410B2 (en) | Rake receiver architecture within a WCDMA terminal | |
US8369384B2 (en) | Method and system for processing signals utilizing a programmable interference suppression module | |
US8503588B2 (en) | Method and system for compensation of interference cancellation delay | |
US8131221B2 (en) | Method and system for processing multipath signals to suppress interface utilizing a programmable interface suppression module | |
US20030231705A1 (en) | Digital correlators | |
US6934553B2 (en) | Receiving unit, receiving method and semiconductor device | |
US20020191566A1 (en) | Method of cellular communication | |
US7724808B2 (en) | Efficient delay profile computation with receive diversity | |
US7068708B2 (en) | Method and receiving unit for demodulating a multi-path signal | |
FI113921B (en) | Receiver, Receiving Method, Computer Program, and Computer Memory | |
EP2326027B1 (en) | Multi-path searching apparatus and method supporting transmission diversity mode detection | |
US20110096813A1 (en) | Method and system for interference suppression between multipath signals utilizing a programmable interface suppression module | |
GB2386506A (en) | Dual mode signal processing | |
EP2158686B1 (en) | Method and apparatus for estimating impairment covariance matrices using unoccupied spreading codes | |
US7580679B2 (en) | Communication apparatus changing measuring methods of communication quality | |
US7995640B2 (en) | Dynamic interpolation location | |
JP2000244378A (en) | Correlator circuit for spread spectrum communication, demodulating circuit and receiver | |
Vejlgaard et al. | Grouped rake finger management principle for wideband CDMA |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: BROADCOM CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:XIA, PENGFEI;HAHM, MARK;KWAK, JAEYOUNG;AND OTHERS;SIGNING DATES FROM 20120307 TO 20120308;REEL/FRAME:027829/0354 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH CAROLINA Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001 Effective date: 20160201 Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001 Effective date: 20160201 |
|
AS | Assignment |
Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD., SINGAPORE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:041706/0001 Effective date: 20170120 Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:041706/0001 Effective date: 20170120 |
|
AS | Assignment |
Owner name: BROADCOM CORPORATION, CALIFORNIA Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041712/0001 Effective date: 20170119 |