text:
|Publication number
|Publication type
|Application number
|Publication date
|Jan 29, 2008
|Filing date
|Jan 31, 2003
|Priority date
|Jan 31, 2002
|Fee status
|Publication number
|Philip Julius Vigneron, Jason Robert Duggan, Hua Xu
|Original Assignee
|Nortel Networks Limited
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (10), Non-Patent Citations (4), Referenced by (31), Classifications (7), Legal Events (5)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims the benefit of provisional application Ser. No. 60/353,728, filed Jan. 31, 2002, and provisional application Ser. No. 60/353,942, filed Jan. 31, 2002, the disclosures of which are incorporated herein by reference in their entireties. This application is related to a concurrently filed utility application entitled ENHANCED PARALLEL INTERFERENCE CANCELLATION, the disclosure of which is incorporated herein by reference in its entirety.
The present invention relates to wireless communications, and in particular to enhancing parallel interference cancellation.
In code-division multiple access (CDMA) systems, multiple access interference (MAI) is a factor that contributes to a limitation in system capacity and performance. In an attempt to reduce the effect of this factor, one can employ some form of multi-user detection (MUD) algorithm. The basis of a typical MUD algorithm is the application of information known about other users to improve detection of each individual user. Of particular interest is the class of MUD algorithms known as subtractive interference cancellation detectors. The fundamental principle behind these detectors is that an estimate is made of each individual user's contribution to the total MAI and then subtracted out from the received signal such that the MAI affecting each individual user is reduced.
If the estimation and subtraction of the MAI occurs in parallel for each user, the resulting detector is known as a parallel interference cancellation (PIC) detector. Typically, the detection process is carried out in an iterative manner, where the data decisions of the previous iteration are used as the basis for the next iteration's MAI estimates. In general, the reliability of these data decisions improves as the number of iterations increases. In a conventional PIC detector, each cancellation iteration involves an attempt to cancel out all or a portion of the MAI. For each individual user, this is accomplished by directly subtracting out the MAI estimates for all the other users.
As the number of users in a particular communication environment increases, and the data rates increase, the complexity associated with parallel interference cancellation significantly increases. As such, there is a need for a way to provide parallel interference cancellation in an effective and efficient manner, which reduces the complexities of previous parallel interference cancellation architectures.
The present invention relates to a new parallel interference cancellation (PIC) technique. For a number of incoming symbols or a signal segment including a number of incoming signals, interference contributions, which are independent of incoming data, are calculated based on the cross-correlations of signature sequences of the given user and the corresponding interfering users for each multipath signal and channel estimates corresponding thereto. Cross-correlations are calculated based on the channel delays for each of the respective multipath signals. During PIC, the interference contributions already contain the effect of the channel, and only need updating according to the rate of change of channel dynamics, and not the symbol period. Interference is computed from each interfering user to each given user using current estimates of symbol decisions and the aforementioned interference contributions. The precomputation of the interference contributions, which are valid for a sequence of symbols or signals, allows for extremely low complexity baseband processing in the receiver.
Those skilled in the art will appreciate the scope of the present invention and realize additional aspects thereof after reading the following detailed description of the preferred embodiments in association with the accompanying drawing figures.
The accompanying drawing figures incorporated in and forming a part of this specification illustrate several aspects of the invention, and together with the description serve to explain the principles of the invention.
The embodiments set forth below represent the necessary information to enable those skilled in the art to practice the invention and illustrate the best mode of practicing the invention. Upon reading the following description in light of the accompanying drawing figures, those skilled in the art will understand the concepts of the invention and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the disclosure and the accompanying claims.
The present invention may be incorporated in a base station transceiver 20 as illustrated in
The baseband processor 30 processes the digitized received signal to extract the information or data bits conveyed in the received signal. This processing typically comprises demodulation, decoding, error correction, and interference cancellation operations, the latter of which being the focus of the present invention. The baseband processor 30 is generally implemented in one or more digital signal processors (DSPs), application specific integrated circuits (ASICs), and field programmable gate arrays (FPGAs). Further detail regarding the operation of the baseband processor 30 and parallel interference cancellation is described in greater detail below. On the transmit side, the baseband processor 30 receives digitized data, which may represent voice, data, or control information from the control system 32, which it encodes for transmission. The encoded data is output to the transmitter 24, where it is used by a modulator 44 to modulate a carrier signal that is at a desired transmit frequency. Power amplifier circuitry 46 amplifies the modulated carrier signal to a level appropriate for transmission, and delivers the modulated carrier signal to antenna 26 through a matching network 48.
In a typical parallel interference cancellation (PIC) system, the input signal is composed of multiple user signals separated by orthogonal or substantially orthogonal (quasi-orthogonal) codes. For a specific time duration, or slot, the input signal is separated into M individual signals corresponding to each of the multiple users and demodulated to recover K symbols for each of the M individual signals. In a typical "regeneration" process, the respective K symbols for the M users are remodulated using the appropriate spreading and scrambling coding and are filtered using channel estimates to create M regenerated signals. For each user, the regenerated signals for the other M−1 users are subtracted from the original input signal to form M new individual signals. This last step is repeated for each user to create M individual signals, one for each of the M users. These new individual signals are each demodulated and reprocessed, theoretically with higher reliability than in the previous step, for as many iterations as desired. The output of the last iteration is used to form the final symbol decisions for each of the M user signals. A survey of interference cancellation techniques for code-division multiple access (CDMA) is given in S. Moshavi, "Multi-User Detection for DS-CDMA Communications," IEEE Communications Magazine, October 1996, pp. 124-136, which is incorporated herein by reference.
High-level architectures representative of PIC circuitry chip rate and symbol rate PIC embodiments for the present invention are illustrated in
Initially, the pilot or midamble extraction function 62 extracts training signals, such as pilot signals or midambles, from the received input signal 60 for a given slot, and channel conditions are obtained for each user from the channel estimation function 64. Since the pilot signal or midambles from the various users are known by the receiver, the channel estimation function 64 can correlate the known pilot signals or midambles with those received for each user and each multipath signal associated therewith. Accordingly, the relative timing of correlations between the received signal and the pilot signals or midambles for the various users is indicative of the relative channel delays for the multipath signals for each user. Further, the relative magnitude and phase of the correlation corresponds to the attenuation of the signal caused by the channel. For simplicity, the relative delays are referred to as channel delays, and the attenuations caused by the channel or the channel response are referred to as channel estimates. The channel delays and estimates may change at different rates and may be provided by the same or different entities depending on the desired design. The channel delays and estimates are used for the constituent rake demodulation 66, and are used directly or indirectly by the regeneration function 72 to regenerate signals to calculate interference
Upon reception, rake demodulation 66 separates the composite input signal 60 into individual signals corresponding to the respective signals for each user in light of the channel delays provided by the channel estimation 64. To determine the individual signals for each user during subsequent iterations, the PIC function 68 subtracts the regenerated interference signals corresponding to all other individual signals from the composite input signal 60 for the given time slot. The regenerated signals for each user are provided by the regeneration function 72.
As noted, rake demodulation 66 is used to demodulate each individual user's signal from the composite input signal 60. Although not required, rake demodulation on the preferred embodiment incorporates maximum ratio combining (MRC). As such, the incoming received signal 60 is a baseband signal, which is first passed through a root-raised-cosine (RRC) filter (not shown). The RRC filter is matched to the RRC filter of the transmitter, which transmitted the signal being received. The RRC filter is specified by the communication standard and is the one used in existing CDMA architectures. The composite input signal 60 after being filtered is usually a four or eight-times oversampled signal. The oversampled signal is then passed through each of the fingers of the rake receiver. Each finger delays the resulting signal by the appropriate delay and decimates the signal to the chip rate. This chip rate signal is then despread by being multiplied by the conjugate of the signature sequence, or code, of the given user. The term signature sequence is meant to be a general term for the spreading and/or scrambling code for that particular user. In some CDMA systems, the spreading/scrambling and despreading/descrambling may be done in two steps where first the signal is spread and then it is scrambled, and vice versa in the receiver. These steps may be performed in a single step, if the code is the combined spreading and scrambling code. So, for instance in a UMTS FDD uplink, the signature sequence is the combination of the scrambling code of a given user and the orthogonal varying spreading function (OVSF) code of the data channel for the user.
After the multiplication by the conjugate of the code, despreading is completed by summing over the spreading factor for that user. The resulting output is at the symbol rate. The outputs of the individual fingers are then combined together. In maximum ratio combining, the weight factors for the combining step are the conjugates of the channel estimates for the respective paths. Other combining weights may be used as will be recognized by those skilled in the art. Symbol estimates for each user are determined by applying the symbol decision function 70 to the outputs of the rake demodulator 66 in traditional fashion. The symbol decision function 70 may be implemented in software or hardware using symbol detection circuitry. The regeneration function 72 essentially recreates estimates of each of the various user's signals from the symbol estimates based on the corresponding channel delays and estimates.
Thus, the output of the regeneration function 72 provides estimates for each of the individual signals received for each user corresponding to the output of the rake demodulation function 66. The individual signals from other users are considered as interference to any given user. For each user, the PIC function 68 will iteratively subtract out the regenerated estimates of the interfering signals from all other users in an effort to recover the transmitted signal for a given user on a symbol-by-symbol basis after rake demodulation.
As illustrated in
As above, the pilot or midamble extraction function 62 extracts the pilot signal or midamble from the received input signal 60 for a given slot, and channel delays and estimates are obtained for each user from the channel estimation function 64 in traditional fashion. The channel delays are used for chip rate finger allocation in the constituent rake demodulation 66.
Upon reception, the PIC function 68 is bypassed and rake demodulation 66 separates the composite input signal 60 into M individual signals corresponding to the respective signals for each user. To determine the individual signals for each user during subsequent iterations, the PIC function 68 subtracts the regenerated chip rate signals corresponding to all other individual signals from the composite input signal 60 for the given time slot.
Again, rake demodulation 66 is used to demodulate each individual user's signal from the composite input signal 60. Demodulation may include despreading each individual signal with a unique channelization code and descrambling all individual signals using the base station's descrambling code. This operation is performed at the chip rate, producing a complex, symbol rate output. Symbol estimates for each user are determined by applying the symbol decision function 70 to the rake demodulation outputs in traditional fashion. The regeneration function 72 recreates estimates of the individual chip rate signals from the symbol decisions for each of the estimated users, and individually processes the modulated symbols based on the corresponding channel estimates. Accordingly, the regeneration function 72 will typically involve the following steps for each user:
receiving symbols for each user at a symbol rate,
spreading the symbols with each user's specific channelization code,
scrambling the spread signals with the base station's scrambling code, and
filtering the spread and scrambled signals with the user's channel estimates.
The output of the regeneration function 72 provides chip rate, or oversampled, estimates for each of the spread individual signals received for each user. For each individual user, the regenerated signals for all of the other users are essentially subtracted from the received signal 60 by the PIC function 68 prior to rake demodulation 66 at the chip rate.
With reference to
The MRCi output is sent to a corresponding symbol decision function 70 1, which generates a hard symbol decision di (n) based on the MRCi output, where n is the PIC iteration and i is the user. The hard symbols di (n) are fed to regeneration function 72 i for the other users. For example, the hard symbol d1 (0) for User 1 is sent to the regeneration functions 72 2 and 72 3 for User 2 and User 3, respectively. The hard symbol decision for User 2, d2 (0), is sent to regeneration functions 72 1 and 72 3 for User 1 and User 3, while the hard symbol decision, d3 (0), for User 3 is sent to regeneration functions 72 1 and 72 2 for User 1 and User 2. Thus, the regeneration functions 72 1-72 3 receive the hard symbol decisions di (0) for each of the other two interfering users. As will be discussed in further detail below, regeneration functions 72 1-72 3 will effectively generate estimates of the total interference to a given user based directly or indirectly on the symbol decisions from the other users and the respective channel conditions for those users.
As shown in
Since signals from different users typically have different channel delays caused from being at different distances from the receiver, interference to a given user's current symbol may come from the interfering users' current, previous, or next symbols. As such, the interference contribution from the current, previous, and next symbols of the other users is taken into consideration when determining the total interference from all the users to the given user in the present invention.
To generate the total interference to User 1 (I1), hard symbol decisions of a previous iteration from the interfering users are each processed based on interference contribution terms for the previous, current, and next interfering symbols. Thus, hard symbol decisions for the previous, current, and next symbols for each interfering user, di,prev n−1, di,curr n−1, and di,next n−1, are each respectively processed in light of a corresponding interference contribution term Ii,2,prev, Ii,2,curr, and Ii,2,next, respectively. The interference contribution term Ii,j,z represents the interference contribution of a symbol for interfering User j on a symbol for select User i, wherein the symbol for User j may be the previous, current, or next (z) symbol in relation to the current symbol being received by User i. Thus, the interference contribution terms for the previous, current, and next symbols of interfering users are respectively used to modify the hard symbol decisions for the previous, current, and next symbols of the interfering users. The modification is illustrated by multiplication functions 74 2 and 74 3 for Users 2 and 3. The modified hard symbol decisions for the previous, current, and next symbols for Users 2 and 3 are summed through summing functions 76 2 and 76 3, respectively, wherein the summed outputs are further summed by summing function 78 to generate the total interference to User 1, I1.
As will be described below, the interference contribution terms Ii,j,z are fixed from symbol to symbol, and once calculated, may remain constant over numerous symbols, which greatly reduces computational complexity. The interference contribution terms are fixed over a time period for which the channel estimates and channel delay are deemed to be constant. Although the interference contribution terms Ii,j,z are relatively fixed for a given sequence of symbols, the hard symbol decisions di (n) will change from one symbol to the next, as will the total interference to User 1, I1, which is a function of the hard symbol decisions di (n). By generating the interference contribution terms only when the channel or delay estimates change, these values are then stored and are simply loaded from memory as the PIC is performed iteration to iteration. Prior art PIC techniques require much of the computationally intensive regeneration steps to be performed each and every iteration. The pre-computing of the interference contribution terms means that the computational complexity per iteration is very low, and thus, there is little additional cost to running additional iterations.
For each user, a cross-correlation value is determined for each delay with respect to all of the other interfering users' delays. Signature sequences used by the different users are typically orthogonal or at least substantially orthogonal to each other, and as such, will not interfere with one another as long as the signature sequences are aligned. Unfortunately, signals from different users are typically received with varying delays due to channel delays and transmission distances. As such, the encoded symbols are not aligned and will interfere with one another. The amount of interference one signal will have on another is a function of the cross-correlation of the signature sequences at the relative offsets defined by the channel delays. For the present invention, the cross-correlation values for each multipath signal of User i are determined with respect to all multipath signals of each User j for the current, previous, and next symbols. The cross-correlation values are based on the relative time delays of the current, previous, and next symbols of each User j with respect to the current symbol of User i. Thus, for each delay associated with User i, a cross-correlation value is determined with each delay associated with each User j (all interfering users). Each cross-correlation value corresponds to a pair of rake fingers, wherein one rake finger of the pair is associated with User i and the other is associated with User j.
Individual cross-correlations are calculated by:
For interference to User i from User j's previous, current, and next data symbols relative to User i's current symbol, P refers to User i's pth finger, and q refers to the qth finger of User j. τp,q is the relative delay between the pth finger and the qth finger (τp−τq). si is one symbol's worth of the desired user's signature sequence, while vj is one symbol's worth of the interferer's filtered signature sequence. Note that this filtering of the interferer's signature sequence is by the concatenated transmit and receive pulse-shaping filters. The chip period is Tc, and the symbol period is Ts, which equals the spreading factor (SF) multiplied by the chip period Tc.
These cross-correlations essentially define interference based on coding delays, without the impact of channel attenuation, on each multipath signal from the multipath signals from interfering users. Notably, these cross-correlation values are not a function of the actual data symbols being transmitted, but only the cross-correlations of the various signature sequences in light of the relative channel delays τp,q. To determine the actual interference contributions on a given user's signal based on the interfering users' signals, the impact of the channel attenuations must be taken into consideration. As such, step two essentially combines the multipath signals for each individual interfering User j in light of the channel estimates hj for each User j. In step three, the interfering contributions for each multipath signal of User i can be combined using maximum ratio combining in a fashion similar to that provided in the rake demodulation function 66 to effectively combine the individual interference contributions from other users. Again, these latter two steps are provided for the current symbol being processed for User i in light of the current, previous, and next symbols of each of the interfering Users j.
The interference contributions from the previous, current, and next symbols of interfering User j onto the current symbol of the desired User i can be represented as follows:
I i,j,curr =h i R i,j,curr p,q h j
I i,j,prev =h i R i,j,prev p,q h j
I i,j,next =h i R i,j,next p,q h j,
where hi is the channel matrix for User i's multipath signals and hj is the channel matrix for the interfering User j's channel matrix. Accordingly, the interference contributions for the previous, current, and next symbols of User j onto the current symbol of User i can be expressed as a function of the cross-correlations between pairs of fingers of the interfering and desired users in light of the channel conditions for each user.
The cross-correlations for each of the interfering fingers are combined to effectively recreate the superposition of the characteristics of the transmission paths. This combination can be accomplished by the following:
R i,j,curr p =R i,j,curr h j
R i,j,prev p =R i,j,prev h j
R i,j,next p =R i,j,next h j
The interference contributions for the previous, current, and next symbols of User j onto the current symbol of User i is calculated by:
I i,j,curr =h i R i,j,curr p
I i,j,prev =h i R i,j,prev p
I i,j,next =h i R i,j,next p
The effect of this last operation emulates the maximum ratio combining over the desired user's fingers in the rake demodulation function 66. Thus, the result is a set of complex numbers that represents interference contributions from the previous, current, and next symbols of User j for the current symbol of User i. Importantly, these interference contributions are not based on, nor are they a function of, symbols fed back during the PIC process, and thus, may be applied to numerous consecutive symbols without requiring recalculation. Since the interference contribution terms are a function of the channel delays and channel estimates, they only need to be recalculated when either or both of the channel delays or channel estimates change. Typically, channel delays and channel responses change slowly and at different rates, relative to the rate at which symbols are processed.
With reference back to
Although the interference contributions are effectively multiplied by the hard symbol estimates d, the multiplication can be implemented using simple addition of rectangular coordinates instead of the more complex multiplication calculations. This greatly reduces the computational complexity, since the interference contribution terms and symbols, in general, are complex numbers. The output of the symbol decision function 70 is generally a complex number corresponding to a quadrature-based constellation point, such as that found in QPSK where the constellation points are (1, −1, j, and −j). As such, multiplication of the complex interference contribution terms is simply an accumulation and possible swapping of the real and imaginary parts of the interference contribution terms.
One subtle point with respect to the invention is the rate of update associated with respect to the three steps used to compute the interference contribution terms. The rates of update are a function of the rate at which each of the channel delays and channel estimates are updated. There are many ways in which channel delay and channel estimation can be performed. Such estimation depends to a great extent on what the particular communication standard offers to support these functions. UMTS FDD and 1xRTT offer a pilot signal, which is code multiplexed with the data and transmitted at the same time as the data but it has a different signature sequence. UMTS TDD, on the other hand, has a training sequence inserted into the transmitted signal. Specifically, it has a midamble—a known sequence of symbols inserted into the middle of every slot. During the midamble, no data is transmitted, only the known sequence.
Both the pilot sequence and the midamble (training sequences) enable channel delay and channel estimation with relatively simple methods. The key point is that the delay and channel estimation are distinct and occur at different rates. This is shown in a UMTS FDD type example in
In the computation of the interference contribution terms, step one is the correlation of one symbol's worth of code of the desired user with a raised-cosine (RC) filtered version of one symbol's worth of code of the interferer. This correlation depends on two things: (1) the codes of the two users, and (2) the relative delay between the fingers of the desired and interfering user. When short codes are in use, the codes of the two users repeats, and so the correlation terms remain valid as long as the relative finger delays of the users remain the same. Information about the short codes is provided below in further detail. Notably, the correlation terms need to be updated whenever the finger delays of either user change. From the above example, this occurs 25 times a second, or once every 40 ms.
Steps two and three in computing the interference contribution terms incorporate the effect of the channel gains of each of the interfering and desired user, respectively, wherein the channel estimates reflect the channel gains for each channel. As such, steps two and three need to be performed whenever the channel estimates change. By the above example, this is once a slot, or 1500 times a second, which is much more frequent than for step one. The resulting interference contribution terms are valid until the next update, which occurs in the next slot.
Another factor in the frequency at which interference contribution terms are updated is the type of signature code used—a short code or a long code. The 1xRTT standard only has long codes, while the UMTS TDD standard only has short codes, and UMTS FDD has both long and short code options. A short code is a signature code (i.e. the combination of the scrambling and spreading code) that is periodic, and as such, repeats itself. Most long codes actually repeat themselves, but their period is very long. In UMTS TDD and FDD systems, the signature code consists of the sequential application of an OVSF code, which is used for spreading, and a scrambling code, which is used for scrambling.
Both spreading and scrambling codes have to be short codes in order for the resulting signature code to be a short code. OVSF codes (and Walsh codes for 1xRTT systems) are by their definition short codes. The scrambling codes (or PN codes as they are referred to in 1xRTT systems) can be short or long codes, depending on their definition. In UMTS TDD, the scrambling codes are short codes of 16 chips in length. In UMTS FDD, there are two scrambling codes defined. There is a long scrambling code that repeats after a very long period and a short scrambling code that repeats every 256 chips. There is no short code in 1xRTT systems.
In the two previous scenarios, the spreading factors (SF) of the interfering and desired user were equal to the length of the short code, or 16.
The previous examples have shown that when an interfering user and desired user are not aligned, two symbols of the interferer overlap, and therefore, interfere with each desired user symbol where all users have the same spreading factor. The invention description has shown that correlations and the corresponding interference contribution terms that follow must be calculated for the current, previous, and next symbols.
The examples to this point have all had the interfering and desired users with the same spreading factor. This is referred to as the uniform spreading factor case. In a real system, of course, different users may have different spreading factors. This is referred to as a mixed spreading factor case.
A person skilled in the art will appreciate that the invention still applies to the mixed spreading factor case. All of the steps of the invention still apply: (a) computing cross-correlations between the interfering and desired user codes (over the length of the short code), (b) incorporating the channel estimates of the interferer, (c) applying the combining weights of the rake combining to derive the interference contribution terms, (d) performing symbol decisions at the output of each iteration and then combining these symbol decisions with the interference contribution terms to regenerate the total interference, and finally (e) performing the subtraction of the interference.
There are two possible approaches to accommodate the mixed spreading factor. The first is to do all of the information management necessary to keep track of exactly which set of symbols of the interfering user affect each desired symbol and calculating the appropriate cross-correlations and interference contribution terms. Such management must account for the fact that there may be many combinations of different users with different spreading factors. A second approach, which is more straightforward, is to determine the minimum spreading factor of all of the users and then consider all of the other users' symbols as broken-down symbols, or partial symbols, with the same spreading factor as this minimum spreading factor.
Much of the previous discussion has assumed that the delay spread of the channel is less than one symbol; however, a delay spread greater than one symbol is accommodated by the invention.
Practically, an embodiment of the invention will assume some maximum delay spread and determine the interference contribution terms from the respective number of symbols, which also depends on the spreading factor. Usually the strength of very late multipaths are much weaker than the early paths, and often very late paths, which imply a large delay spread, may be ignored with little effect on performance. Effectively, these ignored paths become un-modeled interference.
Since the PIC process becomes more accurate with the number of iterations and the early iterations often provide hard symbol decisions that are inaccurate, the performance of the present PIC system can be enhanced by taking into consideration the hard decisions from previous iterations of a given PIC process for a given symbol. This process is generally referred to as interstage combining, and a symbol rate PIC architecture implementing interstage combining according to the present invention is illustrated in
During the nth PIC iteration, the softened symbol estimates for the previous, current, and next symbols bi,prev (n), bi,curr (n), bi,next (n) obtained from the previous iteration of the algorithm are used in recreation of the total interference Ii (n) to User i. The assumption here is that the delay spread generates interference limited to one symbol period on either side of the desired symbol—a simplifying assumption, but not one limiting applicability of the results. Filtering of each hard symbol estimate dj may be performed according to the exemplary input-output equations of Table 1.
TABLE 1 Input-output equations for interstage filter. Example Input/Output Equations for Interstage Filtering First Iteration: bj (0) = γ1 (1) dj (0) Second Iteration: bj (1) = γ2 (2) dj (1) + γ1 (2) dj (0) Third Iteration: bj (2) = γ3 (3) dj (2) + γ2 (3) dj (1) + γ1 (3) dj (0) Fourth Iteration: bj (3) = γ4 (4) dj (3) + γ3 (4) dj (2) + γ2 (4) dj (1) + γ1 (4) dj (0) Fifth Iteration: bj (4) = γ5 (5) dj (4) + γ4 (5) dj (3) + γ3 (5) dj (2) + γ2 (5) dj (1) + γ1 (5) dj (0) Sixth Iteration: bj (5) = γ6 (6) dj (5) + γ5 (6) dj (4) + γ4 (6) dj (3) + γ3 (6) dj (2) + γ2 (6) dj (1)
Each soft symbol estimate bj is expressed as a function of a PIC iteration index, where each set of coefficients are potentially different during each iteration. Note that for each successive iteration the number of non-zero terms increases, as symbol estimates are accumulated for filtering. At some point, the length of the filter is reached, and the oldest symbol estimates drop out. This occurs in the sixth iteration for the given example, where dj,curr (0), is not used, but dj,curr (1) through dj,curr (5) are used. The coefficients γl (n) are fixed positive real numbers, with the guideline that
In general, performance is seen to show a significant improvement when filtering is applied to the data estimates from several previous algorithm iterations.
As will be recognized by those skilled in the art, the specific number of taps and the specific coefficients are parameters which can be optimized during design. It should be stressed that for a fixed set of coefficients, the performance improvement is significant as compared with generic PIC with no interstage filtering. A person skilled in the art will appreciate that there are other forms of multistage interference cancellation where symbol decisions are made each iteration and then used to regenerate an estimate of interference. In these other forms of interference cancellation, interstage combining of symbol decisions is possible. Further, interstage combining can be used on soft symbol decisions with respect to the resultant interference estimates.
Tuning of the coefficients is generally made during the design and simulation stage. It is possible to optimize coefficients for any particular channel model, but a set of coefficients that performs well for a class of channels can be found. A starting point for coefficient optimization is described in Table 2, where symbol estimates from the oldest iteration are successively further weighted by one-half in the filter. It should be noted that these coefficients are starting values, and performance can still be improved by tuning and optimization for the particular channel conditions expected.
TABLE 2 Coefficient generation scheme for interstage filter. First Iteration: Take γ1 (1) ≦1. Second Iteration: Take γ2 (2) = 0.5 and γ1 (2) = 0.5. Third Iteration: Take γ3 (3) = 0.5, γ2 (3) = 0.25, and γ1 (3) = 0.25. Fourth Iteration: Take γ4 (4) = 0.5, γ3 (4) = 0.25, γ2 (4) = 0.125, and γ1 (4) = 0.125. Fifth Iteration: Take γ5 (5) = 0.5, γ4 (5) = 0.25, γ3 (5) = 0.125, γ2 (5) = 0.0625, and γ1 (5) = 0.0625.
Sixth Iteration: Take γ6 (6)=0.5, γ5 (6)=0.25, γ4 (6)=0.125, γ3 (6)=0.0625, γ2 (6)=0.0625, and γ1 (6)=0
Notice that for the sixth iteration and further, the coefficients may still change, even though the filter remains at the same size. This flexibility is provided because the cancellation process is at stages closer to convergence where older data estimates may be weighted weaker to stress the more reliable recent stage data estimates.
It has been found that mid-way through the cancellation stages, an improvement occurs when the filter is 'flushed' of the older estimates. This is accomplished, for example at Stage 5, by setting coefficients:
Then setting the Stage 6 coefficients back to the Stage 2 values,
There are two alternative implementations of the interstage filter. The first incorporates direct filtering of data estimates. In
I i (n) =I i,curr b j,curr (n−1) +I i,prev b j,prev n−1 +I i,next b j,next n−1.
The vectors in Ii,total (k)(m) are defined to be
Ii,curr=[Ii,j,currIi,2,curr . . . Ii,N,curr]
Ii,prev=[Ii,j,prevIi,2,prev . . . Ii,N,prev]
Ii,next=[Ii,j,nextIi,2,next . . . Ii,N,next]
b (n)(m)=[b 1 (n)(m)b 2 (n)(m) . . . b N (n)(m).]
where N is the number of interferers, n is the iteration index, and m is a symbol index. Although this example relates to symbol rate PIC, such filtering of data estimates is equally applicable to chip rate PIC, as shown in
The second embodiment incorporates direct filtering of interference estimates. In
I i,UNFIL (n) =I i,j,curr d j,curr +I i,j,prev d j,prev +I i,j,next d j,next.
The vectors in Ii,UNFIL (n) are defined as previously, with the addition of
d(n)=[d1 (n)d2 (n) . . . dN (n)].
The filtered interference estimates Ii (n) represent the total interference and are represented by:
I i (n) =γ n (n) I i (n)+
. . .
+γ3 (n)Ii (3)+γ2 (n)Ii (2)+γ1 (n)Ii (1)
Filtering here is performed on interference estimates rather than hard symbol decisions. This simplifies the implementation as compared to filtering hard symbol decisions, as only the aggregated interference term is filtered, rather than the hard symbol decisions. In particular, unfiltered interference estimates Ii,UNFIL (n−1) through Ii,UNFIL (n−6) are multiplied by the corresponding filter coefficients, γu (n) through γn−5 (n), by multiplication functions 84, and the results are combined with summing function 86 to arrive at the total interference term Ii (n). This is possible because of linearity of the interference calculation for Ii (n) with respect to the hard symbol estimates, and because all symbols are filtered using the same coefficients for the same iteration. This filtering of interference estimates is most applicable to symbol rate PIC. From a system performance perspective, the two embodiments of the interstage combining are equivalent. Implementation particulars (i.e. chip versus symbol rate processing) may cause one technique to be favored over the other.
Regenerated interference is based on hard symbol decisions. Typical complexity estimates are given in Table 3 for interstage combining filtering of interference terms (as shown in
Complexity estimate per symbol for N users.
QMACs per
Real Additions per
Real Multiplies per
Iteration #
Complexity is related to iteration number in Table 3 because the interstage combining filter grows in length with the number of iterations. The additional complexity per iteration maximizes at the sixth iteration when, in this example, the memory of the filter is reached and the filter is full of interstage results. The "Real Additions" column contains a fixed component of 2N reflecting the final subtraction used in each stage of cancellation where a complex subtraction is implemented as two real additions. The other entries in Table 3 represent complexities due to interstage combining filtering of interference for N users.
Numerical results for a UMTS-TDD example are shown in Table 5, where system parameters are listed in Table 4. The interpretation of the complexity quantities is made when compared with conventional receiver complexity for a four finger rake in Table 6. The numbers give the ratio of complexity increase for the interference cancellation receiver when using interstage combining, and demonstrate that implementing PIC requires a modest increase in complexity as compared with the conventional rake receiver, and is essentially proportional to the number of iterations performed. Note that the absolute complexity of the interference cancellation scheme would also include the rake receiver numbers, as they are required for the first stage data estimates.
Complexity estimate parameters.
Number of Users
Symbol Rate (symbols per second)
Number of RAKE fingers
Complexity breakdown of interference regeneration and cancellation
using interstage combining in terms of real multiplies, QMACs, and
real additions, and conventional rake receiver.
Number of Real Multiplies
Number of QMACs
Number of Real Additions
(billions per second)
(billions per second)
(billions per second)
Generation of Total Interference
Iteration 1
Iteration 2 (cumulative)
Iteration 3 (cumulative)
Iteration 4 (cumulative)
Iteration 5 (cumulative)
Iteration 6 (cumulative)
Iteration 7 (cumulative)
Iteration 8 (cumulative)
Subtraction of Interference
Iteration 1
Iteration 2 (cumulative)
Iteration 3 (cumulative)
Iteration 4 (cumulative)
Iteration 5 (cumulative)
Iteration 6 (cumulative)
Iteration 7 (cumulative)
Iteration 8 (cumulative)
RAKE Receiver
Relative complexity increase of regeneration and cancellation with
interstage combining as compared with baseline rake receiver in
terms of real multiplies, QMACs, and real additions.
Real Multiples
Real Additions
normalized to
QMACs normalized to
normalized to
Iteration #
PIC may be implemented in hardware, software, DSPs, ASICs, FPGAs, or reconfigurable logic. Interstage filtering is amenable to all platforms. In a hardware implementation, either hard symbol estimates or regenerated interference estimates would be stored in arrays of memory, and the coefficients are stored possibly in programmable registers. The coefficient registers are programmable from the partner DSP or microcontroller, and the PIC can essentially be customized by choice of the programmable coefficients. The filtering would occur when the weighted sum of the in-phase and quadrature data elements are made, with the weighting determined by the coefficient registers. This could be heavily parallelized for calculating PIC stages of several symbols simultaneously. In software, the hard data estimates or regenerated interference estimates are stored in in-phase and quadrature arrays, and again weighted sums are computed using stored arrays of filter coefficients. These implementations are only given as examples, as the nature of this invention is not dependent on any particular hardware or software implementation.
The concepts of the present invention may be applied to receivers using multiple antennas to obtain spatial diversity.
Since the rake demodulation function 66 i has a limited number of fingers, it can only process a number of multipath signals for User i equal to the number of fingers. In spatial diversity applications, the same multipath signal received at the main antenna 26 M may be very strong while being very weak when received at the diversity antenna 26 D. Thus, the received signal 60 M will contain multipath signals for User i that are relatively weaker or stronger than the same signals in the received signal 60 D from the diversity antenna(s) 26 D. In operation, the present invention selects the strongest multipath signals received at either the main antenna 26 M or the diversity antennas 26 D and assigns the data in these signals to the various fingers based on their relative strengths.
If there are four fingers in the rake demodulation function 66 i, the four strongest multipath signals from either the main antenna 26 M or the diversity antennas 26 D are assigned to the fingers. Thus, three strong multipath signals on the main antenna 26 M may be assigned to fingers 1-3, while the fourth strongest multipath signal is received at diversity antenna 26 D and assigned to finger 4. Again, each finger representing a relative delay corresponds to the delay between the multipath signals based on channel delays τ received from the channel estimation functions 64 M and 64 D. The output of the fingers, regardless of whether the data was received in the received signal 60 M from the main antenna 26 M or the received signal 60 D from the diversity antenna 26 D, are combined using maximum ratio combining in traditional fashion to provide an MRCi output, which is used by the PIC function 68 i as described above. In an iterative fashion, the total interference from the interfering users, Ii, is subtracted from the MRCi output to provide soft outputs Yi (n), and is provided to the symbol decision function 70 i to obtain hard symbol decisions di (n).
The diversity embodiment of the present invention individually calculates interference contribution terms for each of the main and diversity antennas 26 M and 26 D based on channel delays τ and channel estimates h provided by the respective channel estimation functions 64 M and 64 D for the main and diversity antennas 26 M and 26 D. The interference contribution terms for the main antenna 26 M are calculated as described in reference to
The resulting total interference Ii from the interfering users is iteratively subtracted from the MRCi output at the PIC function 68 i to provide the outputs which are sent to the symbol decision function 70 i. Again, computation complexity is significantly reduced by only needing to calculate the interference contribution terms Ii,j,current, Ii,j,previous, and Ii,j,next when channel conditions change, which may encompass over 100 received symbols. Further, the intermediate interference contribution terms are easily summed together to form the actual interference contribution terms in an infrequent and computationally efficient manner.
For further detail regarding PIC, reference is made to U.S. patent application Ser. No. 10/001,877, entitled TIME VARIANT FILTER IMPLEMENTATION and filed Nov. 16, 2001, and U.S. patent application Ser. No. 09/998,564, entitled SYMBOL-DIRECTED WEIGHTING IN PARALLEL INTERFERENCE CANCELLATION and filed Nov. 16, 2001, which are incorporated herein by reference. For further detail regarding multi-user detection techniques, reference is made to U.S. patent application Ser. No. 09/950,776, entitled MULTI-USER DETECTION IN CDMA COMMUNICATIONS SYSTEM and filed Sep. 12, 2001, which is incorporated herein by reference.
Those skilled in the art will recognize improvements and modifications to the preferred embodiments of the present invention. All such improvements and modifications are considered within the scope of the concepts disclosed herein and the claims that follow.
|Cited Patent
|Filing date
|Publication date
|Feb 2, 1981
|Sep 14, 1982
|General Electric Company
|Minimization of multipath and doppler effects in radiant energy communication systems
|May 26, 1995
|Feb 20, 1996
|Nec Corporation
|Maximal deversity combining interference cancellation using sub-array processors and respective delay elements
|Jan 18, 1994
|Jul 16, 1996
|Ntt Mobile Communications Network Inc.
|Interference signal cancelling method, receiver and communication system using the same
|Aug 24, 1994
|Aug 27, 1996
|U.S. Philips Corporation
|Direct sequence code division multiple access (DS-CDMA) communication system and a receiver for use in such a system
|Apr 24, 1995
|Jul 1, 1997
|California Institute Of Technology
|Parallel interference cancellation for CDMA applications
|Jul 14, 1997
|Nov 9, 1999
|Nec Corporation
|Reception timing detection circuit of CDMA receiver and detection method
|Sep 29, 1997
|Jan 11, 2000
|Interdigital Technology Corporation
|Spread spectrum CDMA subtractive interference canceler system
|Aug 11, 1998
|Nov 28, 2000
|Industrial Technology Research Institute
|FFT-based CDMA RAKE receiver system and method
|Jul 31, 2000
|Nov 11, 2003
|Rf Micro Devices, Inc.
|Multipath parameter estimation in spread-spectrum communications systems
|Jan 25, 2001
|Feb 7, 2002
|Fujitsu Limited
|Spread-spectrum signal receiver
|Co-Pending U.S. Appl. No. 10/355,783.
|Fuller, Arthur et al., "3GTDD Feasibility," RF Head Study Report, Nortel Networks dabtd005-Issue BJM v0.1, Sep. 28, 2001.
|Moshavi, Shimon, "Multi-User Detection for DS-CDMA Communications," IEEE Communications Magazine, pp. 124-136, Oct. 1996.
|Xue, Guoqiang et al., "Adaptive Multistage Parallel Interference Cancellation for CDMA," IEEE Journal on Selected Areas in Communications, vol. 17, No. 10, pp. 1815-1827, Oct. 1999.
|Citing Patent
|Filing date
|Publication date
|Jul 29, 2005
|Dec 9, 2008
|Tensorcomm, Inc
|Interference cancellation within wireless transceivers
|Feb 27, 2006
|Jan 6, 2009
|The Mitre Corporation
|Sub-symbol parallel interference cancellation
|Sep 6, 2005
|Aug 10, 2010
|Interdigital Technology Corporation
|Soft and softer handover in time division duplex code division multiple access (TDD-CDMA) networks
|Oct 21, 2009
|Nov 15, 2011
|Intel Corporation
|System and method for enhanced symbol generation
|Jul 1, 2010
|Aug 28, 2012
|Telefonaktiebolaget Lm Ericsson (Publ)
|Multi-path timing tracking and impairment modeling for improved grake receiver performance in mobility scenarios
|Nov 16, 2007
|Dec 4, 2012
|Electronics And Telecommunications Research Institute
|Iterative reception method and iterative receiver
|Oct 1, 2012
|Feb 11, 2014
|At&T Intellectual Property I, L.P.
|Delay restricted channel estimation for multi-carrier systems
|Mar 9, 2007
|May 27, 2014
|Qualcomm Incorporated
|MMSE MUD in 1x mobiles
|Oct 31, 2012
|Oct 20, 2015
|Telefonaktiebolaget L M Ericsson (Publ)
|Method for correcting receiver in TDD system and devices associated therewith
|Jun 25, 2014
|Dec 15, 2015
|Huawei Technologies Co., Ltd.
|Interference cancellation method and system
|Dec 28, 2007
|Feb 2, 2016
|Qualcomm Incorporated
|High performance station
|Oct 26, 2015
|Aug 23, 2016
|Iii Holdings 1, Llc
|Iterative interference suppressor for wireless multiple-access systems with multiple receive antennas
|Oct 28, 2015
|Nov 8, 2016
|Iii Holdings 1, Llc
|Systems and methods for parallel signal cancellation
|Dec 13, 2010
|Jan 10, 2017
|Iii Holdings 1, Llc
|Systems and methods for parallel signal cancellation
|Aug 30, 2010
|May 9, 2017
|Iii Holdings 1, Llc
|Advanced signal processors for interference cancellation in baseband receivers
|Sep 6, 2005
|Jan 12, 2006
|Interdigital Technology Corporation
|Soft and softer handover in time division duplex code division multiple access (TDD-CDMA) networks
|Feb 27, 2006
|Jun 29, 2006
|The Mitre Corporation
|Sub-symbol parallel inteference cancellation
|Jul 29, 2005
|Feb 1, 2007
|Scharf Louis L
|Interference cancellation within wireless transceivers
|May 24, 2005
|Sep 20, 2007
|Koninklijke Philips Electronics, N.V.
|A method for signal processing and a signal processor in an ofdm system
|Dec 28, 2007
|Jul 10, 2008
|Qualcomm Incorporated
|High performance station
|Mar 9, 2007
|Sep 11, 2008
|Qualcomm Incorporated
|MMSE MUD IN 1x MOBILES
|Nov 16, 2007
|Feb 11, 2010
|Electronics And Telecommunications Research Instit Ute
|Iterative reception method and iterative receiver
|Oct 21, 2009
|Apr 29, 2010
|Ahmed Said
|System and method for enhanced symbol generation
|Aug 30, 2010
|Dec 30, 2010
|Rambus Inc.
|Advanced Signal Processors for Interference Cancellation in Baseband Receivers
|Jul 1, 2010
|Jan 6, 2011
|Jaroslaw Niewczas
|Multi-path timing tracking and impairment modeling for improved grake receiver performance in mobility scenarios
|Dec 1, 2010
|Mar 24, 2011
|Rambus Inc.
|Advanced Signal Processors for Interference Suppression in Baseband Receivers
|Dec 13, 2010
|Apr 28, 2011
|Rambus Inc.
|Systems and Methods for Parallel Signal Cancellation
|Oct 1, 2012
|Feb 28, 2013
|At&T Intellectual Property I, L.P.
|Delay Restricted Channel Estimation for Multi-Carrier Systems
|Oct 31, 2012
|May 2, 2013
|Fan He
|Method for correcting receiver in TDD system and devices associated therewith
|Dec 18, 2012
|Sep 24, 2014
|Huawei Technologies Co., Ltd
|Signal processing unit, and interference cancellation method, device, and system
|Dec 18, 2012
|Sep 24, 2014
|Huawei Tech Co Ltd
|Signal processing unit, and interference cancellation method, device, and system
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Jan 31, 2003
Owner name: NORTEL NETWORKS LIMITED, CANADA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VIGNERON, PHILIP JULIUS;DUGGAN, JASON ROBERT;XU, HUA;REEL/FRAME:013728/0558
Effective date: 20030124
|Jun 22, 2011
|Fee payment
Year of fee payment: 4
|Oct 28, 2011
Owner name: ROCKSTAR BIDCO, LP, NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:027164/0356
Effective date: 20110729
|Jul 30, 2012
Owner name: APPLE INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ROCKSTAR BIDCO, LP;REEL/FRAME:028679/0661
Effective date: 20120511
|Jul 15, 2015
|Fee payment
Year of fee payment: 8


text:
Author | exchange4media News Service | Monday, May 31,2004 7:21 AM
After the ban on advertising of tobacco products, the next big challenge is arriving at a consensus on the new packaging design. Different manufacturers have expressed divergent views on how to accommodate the `Tobacco Kills' line and the skull-and-bones depiction on the packs.
According to senior officials in the Health Ministry, at the last meeting of the expert committee on tobacco, the beedi and gutka companies expressed their difficulty in changing the packaging design.
"While the cigarette companies do not have too many problems except that it would require investment, the gutka companies have said that since their pack sizes are small, it would be difficult for them to accommodate large warning signs. A similar view was also expressed by the beedi-makers," said officials.
However, the Government is unlikely to relax the norms for any product category. The tobacco legislation has said that the manner in which specified warning should be made and the language in which it would be expressed will be notified in the rules to the Act.
Meanwhile, the tobacco industry is keen on a uniform policy. An official at Godfrey Phillips India said that there were question marks over the ability of the entire industry to shift to the uniform norms, more so in the case of the unorganised sector including beedi and smaller gutka players, who account for 86 per cent of the market.
According to the Tobacco Institute of India, which represented the tobacco industry in the meeting, the industry view was unanimous that the regulations should be applicable equally and uniformly on all forms of tobacco consumption. The institute said that adequate time should be given to implement the product labelling provisions, as has been the practice followed by other countries where tobacco regulations have been legislated.
It further added that the regulations needed to take into account the fragmented and unique nature of tobacco consumption in India.
"The regulations should not be based on a Western model, where cigarettes represent the dominant form of tobacco consumption, accounting for as much as 90 per cent of the tobacco consumed," it said.
Programming HeadRadio Mango

subset: commoncrawl


text:
Popular Now
Popular Now
Popular Now
Popular Now
01803 865913
+44 1803 865913
By: Thor Kerr(Author)
256 pages, b/w illustrations
University of Western Australia Press
When property developers, politicians, and a vocal community debate how local land should be used – with the media intent on exposing conflicting interests and incompatible ideologies – it is only a matter of time before plans change and careers take new paths. Written as an engaging account of Australian politics and coastal property development in Fremantle, To the Beach is a creative non-fiction account of the politics of ecological crisis in Australia. To the Beach encourages readers to reflect on perceptions of environmental threats and solutions, and it describes how environmental movements form around a shared desire to live a local experience – in this case, the experience is Australia's beaches. To the Beach will be a useful scholarly resource and an engaging study for readers with an interest in Australian politics and culture, particularly at the nexus of property development and environmental activism.
There are currently no reviews for this product. Be the first to review this product!
Your orders support book donation projects
Prompt and trustful service.
Search and browse over 110,000 wildlife and science products
Multi-currency. Secure worldwide shipping
Wildlife, science and conservation since 1985


text:
Today- Sunday, 5/31, take:
50% Off Sitewide + Extra 50% Off Sale Items
With Code: BONVOYAGE at checkout!
Shop Now!
*All sales are final and are not eligible for exchange, refund, or return*
This promotion is for purchases made online at MinxAsheville.com between 5/9-5/31/15. As always, in-store pickup is free for NC residents. US orders over $75 + Intl. orders over $250 USD ship free too.


text:
'Thus, the best prospects for the Sabres' long-term future in Buffalo may lie with Kailbourne's ability to keep a slimmed-down Adelphia alive and thriving. And that still remains a fairly long shot.'
Note: While we are busy tweaking the front page design to make it more appealing and functional (especially for our mobile readers), you may notice odd layout errors. Please hit "control-F5" to refresh the page and load the latest files. Thank you!


text:
Heritage projects
These projects are helping to preserve Palmerston North's cultural and heritage assets.
Peter Black Conservatory upgrade
Dating back to 1939, the Peter Black Conservatory on Victoria Esplanade was due for some care and attention. We have restored the greenhouse that houses exotic and special plants, and updated the signage that tells the conservatory's story.
Earthquake prone buildings
The Christchurch earthquakes led to a review of the system that manages earthquake-prone buildings in New Zealand. Here's an overview of what the changes mean for building owners in Palmerston North.
Notable trees
A notable tree is one that has historical or cultural value. By keeping a schedule of notable trees within the District Plan we are able to protect and recognise those of value to the city.


text:
Listen to free music played by laurahab
Blip.fm is internet radio made social. It's easy to search for, play, and discover free music recommended by real people. Join today to create your own free station and start listening to @laurahab.
Rihanna – Whats My Name Feat Drake HQ.| play
Dec 1, 2010 at 6:42 pm via YouTube | AMAZON | ITUNES


text:
|Harry Potter Mafia II
|Game information
|Shadow7 & Akriti
|Harry Potter Mafia II
|13 Players (Medium)
|Start Date
|Winning Faction
| 1. peace
2. darth nox
|First to Die
|Last Remaining
| 1. peace
5. yoDell
Harry Potter Mafia II was a game designed and hosted by Shadow7 (co-hosted by Akriti) based on the second installment of J.K. Rowling's Harry Potter series.
It began on June 4th, 2011 and ended in a Goodies win in N4 (June 10th, 2011).
Game Mechanics
- Order of actions (chronological): RID kill >> block >> NK >> redirect >> spy (who will know that they were redirected, but not to whom)
- After Riddle dies, Ginny has no even cycle action.
- Once Basilisk dies, Baddies choose NK carrier
- Dumbledore is removed from randomisation, but you are not told whether Dumbledore was in the tie or not. Basically, two people are tied, one dies. Post says that, doesn't say whether it's pure random or the living is Dumbledore.
Role Description
Goodies: Wincon=eliminate baddies
- Harry--RID kill (kill only if he correctly IDs the target's role)
- Ron--block
- Hermione--role spy
- Dumbledore--can't be lynched
- Colin--follow spy (sees target of action only)
- 4 other people who get turned to stone--vanilla
Baddies: Wincon=majority, BTSC and NK
- Basilisk--NK carrier, block
- Riddle--redirect
- Ginny--even days her vote matches Riddle's (secretly), odd nights action spy (doesn't see target, but sees action (kill, spy, block, redirect))
- Malfoy--vanilla
Host's Summary
Game Idea and Expectations
- Second of my HP series, following Harry Potter Mafia I, this one ups it a bit, continuing the gradual build of the series
Special commendations
Host disappointments
- God, I needed to replace inactives quicker. In future, one period without a post and without warning in public means you will be replaced. Without warning from me. Inactive banned from my next game: Segul, Q-cumber, EDM.
Alternate endings
Winning Faction
- Peace*out - Ron
- Aaryan - Hermione
- Anon26 - Stone 1
- yoDell - Colin
- Thalia - Harry
- Chaits - Stone 2
- Araver - Stone 4
- KlueMaster - Stone 3
- Auramyna - Dumbledore
MVP: None. The baddie inactivity lost this game more than goodie activity won it.
Day and Night Posts
"A no-holds-barred, pull-out-all-the-stops, breathless tangle of thriller..........................A new year at Hogwarts."
A new year at Hogwarts..................... After a weary journey through the "Hogwarts Express", all the students found themselves in the main dining hall, where in front of them, in the middle of the long teachers' table, sat Albus Dumbledore , smiling to see the children back at Hogwarts. Many innocent people (stone) among a few vicious ones. Malfoy gave a disgusted look at Harry, who was busy talking with Hermione and was soon joined by a boy. With that red hair, it was not difficult to identify Ron. There, in the crowd, stood Ginny, a little nervous but more calm and contented. And among them, stood Colin, happy as ever..............
Nobody knew that among the happy and merry environment of Hogwarts, there existed a "Chamber of Secrets", where Riddle waited, planning viciously and smiling. Another side, Basilik was ready for the night adventures.............
Though some students were new to Hogwarts, they knew of the adventures of last year. They all knew, one mistake and a great damage would ensue.............
|Night 1 : One Goodie Lost
|Everyone knew that they were not safe till Voldemort is gone. They all knew that he had some agents who will do their work soon, but they didn't know that they will work that soon.
As darkness enveloped Hogwarts, everybody got ready to perform their duties. Hermione had some suspicions in her mind. So, she slipped out of her bed and went on to spy. Just as she came out of the Gryffindor Tower, she found what she wanted. While Hermione was busy, Harry sought his target, but could not succeed. Colin was also active this year. Even on the first night, he was ready to follow somebody. Ron found EDM, and used a spell that set EDM as Stone, temporarily. While goodies were busy with their spying activities, Basilik stepped out of darkness. The first thing he saw was EDM, who had just recovered from Ron's spell.As she was moving, Basilik sprang and read a spell that made EDM sleep for the whole night. Riddle waited for who to redirect when he saw Yodell. He smiled to himself. He had found his target. Even Ginny found Riddle's diary and was ordered to keep watch. She went away to fulfill the demands. While Basilik was over with EDM, he still had somebody to kill. He thought for a while and thern smiled. He knew who was to be killed. It was Anon26.
|Day 1
|Accusations flew as the students met in the Great Hall to discuss recent events. Peace, nox, Aura were questioned. But Aaryan felt the pressure more than most. He stepped out for a bit of fresh air; rather than worrying, though, the others took it as a sign of guilt--until, as they filed out at day's end, all witnessed the awful sight.
There, just at the foot of the stairs, lay Aaryan, mirror in one hand, paper in the other, a perfect stone image of Hermione.
|Night 2
|"Saiii aaashietth" Harry spoke, commanding the Basilisk to gaze upon nox rather than his chosen target. Thus a great victory was won: the Basilisk himself lay slain.
Seeking Harry, Colin crept from the dorm, close behind his suspect. At the same time, Riddle sought out Chaits. "Imperio", he cried; Chaits would obey Riddle this night.
|Day 2
|Again, accusations flew across the Great Hall; "Why did Peace defend the Basilisk?" "Why is Q-Cumber so silent?" "She must be bad" "or is he?" But by day's end, not even Riddle's control of Ginny could change the outcome.
Silenced by no one knew what forces, Q-Cumber was dragged into the dungeons, where Snape forced Veratiserum down Riddle's throat. Now, he would never again walk these hallowed halls; he had been cast out, wand broken, never more to live amongst wizardkind.
|Night 3
|Harry sought his nemesis without success as Colin snuck after tonight's target. Just down the stairs, Ron spotted Slick; "petrificus totalus". He would not act tonight.
|Day 3
|Discussion began early, with a vote on Slick. Nearly all seemed sure he was bad--the only question, it seemed, was whether to kill the known one, or seek out the unknown.
Both sides voiced their opinions--kill Slick, or one of the new transfers. By day's end, agreement was reached. Ginny was finally freed, but also expelled.
|Night 4
|Harry was indecisive. He knew he wanted Malfoy, but which mask hid the boy? Finally he decided on curr3nt and cast his spell. "Sectumsempra" he cried; Malfoy doubled over in pain.
At the same time, Ron tracked down Chaits and cried "stupefy".
End of Game Roster
Hosts: Shadow7 and Akriti
- Peace*out - Ron
- darth nox - Basilisk - RID Killed by Harry in N2
- Aaryan - Hermione - Lynched in D1
- Anon26 - Stone 1 - Killed by Baddies in N1
- yoDell - Colin
- Thalia - Harry
- Chaits - Stone 2
- Q-Cumber - Riddle - Lynched in D2
- Slick - Ginny - Lynched in D3
- Araver - Stone 4
- KlueMaster (EDM) - Stone 3
- Auramyna - Dumbledore
- Curr3nt (Segul) - Malfoy - RID Killed by Harry in N4
|List of actions
Night 1
Night 2
Night 3
Night 4


text:
From butt glue to the 20-second absurd responses to complex questions, such as how the United States should deal with ISIS, John Oliver presented a thorough takedown of the Miss America beauty pageant on "Last Week Tonight."
"How the f*** is this still happening?" Oliver asked before addressing the inaccurate claim from the Miss American organization that it provides millions of dollars in scholarships for women.
Mocking Miss America's assertion that it is also an educational pageant, Oliver said, "Right. You need to see them in bathing suits because as we all know, the intelligence portion of the brain is located somewhere in the upper thigh."
In addition, the comedian shrewdly pointed out the absurd conditions set for the participants to compete in the first place.
"Currently, the biggest scholarship program, exclusively for women in America, requires you to be unmarried, with a mint condition uterus, and also rewards working knowledge of buttock adhesive technology."
RECOMMENDED: Miss America Channels Anna Kendrick With A Red Cup Performance
The most important part of the entire segment was, however, when Oliver disproved the Miss America organization's claim that it makes $45 million a year available for scholarships to contestants.
"If it's actually true that Miss America is the world's largest provider of scholarships for women, that's a little bit weird because Miss America does not offer scholarships to all women," Oliver said, adding the organization grants the prize to "only those who compete in those pageants."
The "Last Week Tonight" team also found that the pageant winners do not even come close to actually receiving that amount because of some really complicated reasons Oliver explains.
ALSO: Stephen Colbert Mocks 2014 Miss America's Racist Twitter Critics
Miss America defended its policies in a statement shortly after the program was aired. You can read it here.


text:
Nadia White - Nadia White is metal bound while brutally fucked. Several massive orgasms get ripped out of our slut
Released: September 30, 2016
Welcome Nadia White to the pages of Sexually Broken. This hot blonde big titted MILF was made for rough sex and bondage. We have Nadia bound in a custom bondage device. Hard metal hold her legs spread, and her hand are stuck in metal shackles. Completely helpless, Nadia can do nothing but moan, cum and scream as the dicks fuck her tight little pussy into oblivion. We even introduce the plastic sheet to Nadia cute face. It's amazing how a lack of air will cause a slut to cum harder than she ever has before. Big dicks, big tits, amazing bondage, and honest real brutal fucking is why Sexually Broken has over 8 Nominations from both Xbiz and AVN for best BDSM site of the year 2 years running. Join today to see the very best in custom bondage and rough sex.
Size: 631 MB | Duration: 12 min | Video: 1280x720, 7591 kbits/s | Audio: 48000 Hz, 110 kbits/s
Spare link: (try when other links are dead)


text:
Kapil Sharma is creating a lot of buzz in Telly Town. Immediately after Kapil announced about his love, Ginni Chatrath to his fans, the comedian and actor was in news for assaulting his co-actor Sunil Grover. Not just this, he had also miffed with Begam Jaan actress Vidya Balan with his unprofessional behaviour!
According to reports from an entertainment portal, Kapil was aware that his fight with Sunil would make negative headlines. So, to avoid this, he announced about his engagement/marriage on the same day! Read on to know what Kapil has to say about his marriage plans...
It has to be recalled that he shared a picture of his girlfriend Bhavneet Chatrarth aka Ginni and wrote, "Will not say she is my better half .. she completes me .. love u ginni .. please welcome her .. I love her so much:)"
Kapil Sharma's Girlfriend Ginni
When asked whether the announcement was for real, he was quoted by a leading daily as saying, "I don't understand why people are not believing something when I tweet about it? What is there to be shocked?"
Kapil Reveals About His Marriage Plan
He added, "Yes, I am getting married to Ginni and she is the love of my life. I have known her for 10 years since my college days in Jalandhar. I used to go to her college to do stand-up comedy."
Ginni Is Kapil's Better Half!
"I fell in love with her first, then my mother fell in love with her and that's when I felt I should make it official. She not only completes me but is my better half."
Kapils' Wedding Plan
"The wedding should hopefully happen in January 2018. I know I've been flirting a lot with Deepika Padukone and other actresses on my show, but I guess now it's time for me to settle down. And I am happy that I have found whatever I wanted, in Ginni."
Immediately after he introduced his girlfriend on social media fans and the celebrities congratulated him. Colors CEO, Raj Nayak wrote, "Congratulations !!!! @KapilSharmaK9 🥂." Kapil even thanked the celebrities individually.
About Ginni, Kapil's sister had said, "Ginni is a very good girl and is very sanskaari. She has all the qualities what Kapil is looking for in a girl. I am happy for them."
But, even after making such a big announcement, Kapil hasn't failed to make the headlines for the wrong reason. Apparently, Kapil and Sunil have unfollowed each other on social media.
Kapil even opened up on social media to reveal what went wrong. He said there are other serious issues which need to be given more importance than his and Sunil's fight. He even added that it is family matter and he will sort it out!
Do you also think Kapil's announcement about his girlfriend was a planned move? Hit the comment box to share your views...


text:
© Copyright 2017 Internet Gardener
Company Number: 5729164 | VAT Number: 882896359
We securely accept
This Landmann Salerno Masonry Barbecue makes a wonderful centre piece in the garden. It can be painted and styled to match your existing decor. Read More
This stylish Landmann Salerno Masonry Barbecue creates a central focal point in your garden or patio area for when guest gather round the garden. This masonry barbecue is supplied unpainted so you can paint any colour you wish to match with your existing outside décor. Assembly is required but with full instructions provided it is quick and easy to set up so you can be cooking in no time. It comes with an adjustable shelf and 2 built in shelve underneath the cook area. This Landmann Salerno Masonry Barbecue is only suitable with charcoal or briquettes, so if you have a few friends round why not cook some burgers or sausages in style with a handy shelving to place your plates and condiments.
Landmann 11712 Salerno Masonry Barbecue Dimensions:
Complete with a high quality chrome cooking grill this masonry BBQ is a delight to cook and entertain with. The chimney helps to duct away the smoke from cooking and so the chef isn't 'smoked out'.
The product is supplied un-painted as the construction process requires mortar beds to be placed in between each component (as with all masonry BBQ's).
Please Note: All Landmann Masonry BBQ's are delivered on a shrink wrapped pallet in component form to the front of the delivery property. Please allow up to 21 days for delivery.
*Some areas may attract an additional delivery surcharge
© Copyright 2017 Internet Gardener
Company Number: 5729164 | VAT Number: 882896359
We securely accept


text: Class 4 LEGO® → LEGO Writing → Pens → Batman P2064 << P2065 (Set 2) >> P2146 Batman Pen The Joker Item №: P2065 Released: 2006 Theme: Pens Batman P2065 Batman Pen The Joker was a Batman Pen set released in 2006. Retrieved from "http://lego.wikia.com/wiki/P2065_Batman_Pen_The_Joker?oldid=1213487" Ad blocker interference detected! Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers Wikia is not accessible if you've made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected. Categories: Class 4 articles Duplicate numbered sets Sets with unknown piececount Unknown Price Unknown Ages 2006 merchandise Batman P0000 sets Pens LEGO Writing


text: Formerly "of counsel" to the legendary King of Torts, Melvin Belli, Cary Silberman has been teaching law courses since 1991. He routinely receives amazing student evaluations and is known for making complex legal concepts easily comprehensible. Cary also teaches online seminars for Skillpath. You will learn about contracts, employment law, workers compensation, tax law and personal injury. Mr. Silberman received his BA from UC Berkeley, his law degree from JFK University Law School and his mediation certificate from Stanford. He has also taught at the following law schools: Silicon Valley University Law School, Golden Gate University Law School. He currently teaches business law at San Jose State University.


text:
Question: If you owned a small business would you develop a
If you owned a small business, would you develop a code of business conduct? If yes, what variables would you include? If no, how would you ensure that your employees were following ethical business standards?
View Solution:
View Solution:
Answer to relevant QuestionsWhat do you feel is the relationship between personal ethics and business ethics? Are they, or should they be the same? Describe the business culture in Japan. Give specifics regarding the nature and role of "Union Membership across Europe." What are the strategic implications of these facts and figures? Wa, quanxi, and inhwa are important management terms in Japan, China, and South Korea, respectively. What would be analogous terms to describe American management practices? Describe the business culture in Germany.
Post your question


text:
At least social media is good for something during the Olympics. (Side-eyeing the haters.)
As if we didn't have enough reasons to love Michael Phelps and Katie Ledecky for, you know, winning a billion gold medals and possibly being half mermaid, the duo recreated an adorable decade-old picture of a then 9-year-old Ledecky getting an autograph from Phelps. Only this time, he stepped up to get an autograph from the breakout star of Rio.
Vice-Versa: @katieledecky @MichaelPhelps re-create famous photo with opposite roles #riotoday #SwimUnited pic.twitter.com/S06rkRkcTz— USA Swimming (@USASwimming) August 15, 2016
RELATED: Michael Phelps Explains Why He's Really Retiring After Rio: 'This Is What I Came Back For'
Ledecky took to her own Instagram to give a big, emotional goodbye to the Games. After winning four gold medals and a silver, the 19-year-old swimmer wrote, "This picture captures the joy I have had this past week in representing the USA...I'm happy to be bringing home some medals and memories!"
This picture captures the joy I have had this past week in representing the USA, as well as the emotions of completing an unforgettable four-year journey. Thank you to everyone for the support. I am honored to be a member of the 2016 U.S. Olympic Swim Team. Special thanks to my family, coach Bruce Gemmell, trainer Lee Sommers, my teammates and coaches over the years from NCAP (and Palisades and Stone Ridge), my friends, my teachers and classmates, everyone back home in Bethesda especially my Stone Ridge and Little Flower friends, and many more. I'm happy to be bringing home some medals and memories! (Photo: @gettyimages)
Meanwhile, Phelps took home five gold medals and a silver, cementing his status as the most decorated Olympian of all time. He shared a photo with his teammates and wrote, "Wow! The best way to finish! It has been an honor to represent the USA! A true dream come true!!!"
Rio also marks Phelps' official retirement, with the swimmer explaining his decision to Bob Costas, "This is what I came back for. At the age of 31, I'm happy to start moving forward into a new chapter of my life. I am retiring, this is it. That was the last race ever."
In other adorable moments from the Olympics, Phelps got choked up over having his son, Boomer, watch him win gold. Check it out in the video below.


text:
|<< Previous book
|Next book >>
Speculative Japan(2007)
An anthology of stories edited by Grania Davis and Gene van Troyer
The time is long overdue to present the work of Japanese science fiction and fantasy writers to the world in English. The first book in a planned series, Speculative Japan presents a selection of outstanding works of Japanese science fiction and fantasy in English translation... and a glimpse into new worlds of the imagination. Drawing on the talents of some of the most famous and respected fiction writers of Japan, this anthology will guide you to new dimensions of wonder. First released at Nippon 2007, the 65th World Science Fiction Convention in Yokohama, Japan, it is now available worldwide.
Similar Books by other authors...
The Hard-boiled Wonderland and End of the World
Haruki Murakami
Invisible Planets
Ken Liu
The Best Japanese Science Fiction Stories
John L Apostolou and Martin H Greenberg
Used availability for Grania Davis's Speculative Japan
See all available used copies of this book at Abebooks UK or Abebooks US
Paperback Editions
August 2007 : Paperback
|Title: Speculative Japan: Outstanding Tales of Japanese Science Fiction and Fantasy
Author(s): David Brin
Publisher: Kurodahan Press
Availability: Amazon Amazon UK Amazon CA
Genre Pages


text:
Tel: 01283 559200 | Email: email@example.com
Skip to Content
In September 2014 Archbishop Ilsley moved to Vertical Tutoring. Your child will be in a House/family group and will have two tutors. They should be your first point of contact if you have concerns. A Head of House will have responsibility for all pupils in their family group.
Tutor grups will be mixed ages, consisting of students for years 7 - 13 and your Child will have at least one assembly a week. Tutors will closely monitor your child's attendance as well as co-ordinating inter form and participating in House competitions.
Mr Crehan is the Line Manager of the Pastoral Team. He is responsible for the care, support and guidance of pupils from years 7-13.
To find out more about a House click on its Saint's image or name:
St. Augustine of Hippo
St. Brigid of Ireland House
St. Catherine of Siena House
St. Francis Xavier House
St. Joseph the Betrothed House
St. Monica of Hippo House
Go to Pupil Voice Page


text:
Recruiter Discounts
This is a marketplace for HR tech vendors and recruiters to connect. Vendors post promo codes and other special savings for recruiters to save money. Features a daily email summary of the savings being offered. The site is free to all sides. Vendors can upgrade their offers with extra features.


text:
40 E Center Street, Douglas 49406
See more homes for sale in Douglas, MI
Well built and dramatically designed newer commercial building in the heart of the Downtown Douglas Business District. Currently leased to Center Stage Salon for $1,800 a month. Very bright with 22' ceilings a lovely balcony and street side courtyard. The vacant lot adjacent is currently for sale and offers expansion opportunity with Kalamazoo Harbor water views. Zoning allows many commercial applications. It would make a great gallery, restaurant or bar. The building also includes a huge 1,400 sq. ft. basement with 9' ceilings and plumbing hook ups. One of the owners is a licensed Michigan real estate sales agent.
Property Information
- Status
- Active
- Address
- 40 E Center Street
- City
- Douglas
- Zip
- 49406
- Year Built
- 2007
- County
- Allegan
- Above Grade SqFt
- 1,784
- Waterfrontage
- 500.0
- Price/SqFt
- 168.11
School Information
- School District
- Saugatuck
- Current Use
- Hair Salon retail sales
- Comm. Warehouse Space
- 1400.00
- Comm. Retail Space
- 1784.00
- Features
- Barrier Free
- Water
- Public
- Sub Property Type
- Retail/ Commercial
- Cooling
- Central
- Heating
- Forced Air, Natural Gas
Listing Video for 40 E Center Street, Douglas MI 49406
Mortgage Calculator
Listing Broker
Listing Courtesy of Re/Max Saugatuck-Douglas
Office Address P.o. Box 986 2914 Blue Star Hwy
Listing Agent Richard Waskin
Listings last updated: . Some properties that appear for sale on this web site may subsequently have been sold and may no longer be available.
Our Michigan real estate agents can answer all of your questions about 40 E Center Street, Douglas MI 49406. Real Estate One, Max Broock Realtors, and J&J Realtors are part of the Real Estate One Family of Companies and dominate the Douglas, Michigan real estate market. To sell or buy a home in Douglas, Michigan, contact our real estate agents as we know the Douglas, Michigan real estate market better than anyone with over 100 years of experience in Douglas, Michigan real estate for sale.
The data relating to real estate for sale on this web site appears in part from the IDX programs of our Multiple Listing Services. Real Estate listings held by brokerage firms other than Real Estate One includes the name and address of the listing broker where available.
IDX information is provided exclusively for consumers personal, non-commercial use and may not be used for any purpose other than to identify prospective properties consumers may be interested in purchasing.
All information deemed materially reliable but not guaranteed. Interested parties are encouraged to verify all information. Copyright© 2017 MichRIC LLC, All rights reserved.


text:
Building 3D Flash Sites that Work
http://www.airtightinteractive.com/news/?p=166 »
http://www.airtightinteractive.com/news/?p=166 »
FIVe3D is unlike other 3D engines ( such as Papervision or Alternitva3D ) in it's approach. We're not talking shape primatives here, we're talking extending the basic flash »
3D Flash engines seem to be popping up everywhere at the moment. [Although I wouldn't call that a bad thing] - Each one tends to take »


text:
Congressman David Rivera (FL-25) reacted to North Korea assuming the presidency of the United Nations Conference on Disarmament in a statement:
"North Korea assuming the presidency of the Conference on Disarmament continues a long-established pattern of nonsensical council and conference assignments by the United Nations. This is the same body that entrusts oversight of human rights to countries like China and Cuba. So it seems only natural that the U.N. would give oversight of the single multilateral disarmament negotiating forum of the international community to a country that is building up its arsenal of nuclear weapons and missiles even in the face of sanctions from the U.N. It defies comprehension why the U.N. continues to irrationally appoint countries to councils and conferences that violate the very purpose of the body they are members of.
It is also inexcusable that the U.N. has reiterated its support for Iran's government-sponsored conference on terrorism that accused the United States, Great Britain and Israel of cultivating terrorism, and called for terrorist attacks on all three countries.
"With each of these actions, the U.N. guarantees its lack of credibility.
"The United Nations is in dire need of reform if it is truly going to serve its intended purpose of facilitating cooperation between nations to make the world a safer place for all."
Source: http://rivera.house.gov/press-release/congressman-rivera-north-korea-president-un-conference-disarmament-continues-long


text:
It only takes a minute to get started. Fill out our uncomplicated sign up form and login to the website.
This step is voluntary but will seriously increase your chances of getting interest from other over 50s members on the site. Write a little about yourself, your pasttimes and upload your best photograph.
Utilise our website's sophisticated search to encounter over 50s members who match your requirements. Or just leaf through listings and encounter members that you like.
Found someone who you're attracted to? Drop them a line or just a wink and let it develop from there. With a little luck you'll be on your way to uncover your ideal match.
It only takes a few clicks


text:
GENEVA: De Tomaso looks to Italian government for Sicily loan guarantee
Luxury automaker De Tomaso has asked the Italian government for guarantees underwriting a loan request to finance its proposed new operation in Fiat's Termini Imerese plant.
Get full access to all content, just $1 for 30 days
A Message From The Editor
just-auto gives its paid members access to the very best automotive market coverage.
And now there's just-auto plus, our premium membership that gives you exclusive component forecast data, company profiles and extended news coverage - just for premium members.
Today I can offer you 30 days access for $1 - and that includes just-auto plus.
Dave Leggett, editor of just-auto
* plus VAT if applicable
Only on


text:
After dedication in the region of the fact that abundant race go on about state "fat", yet do null around it, I thought it could be a honourable theory to construct one astir a way you can be unable to find weight. Well, perchance not any fastidious way, but a mixed bag of distance.
For starters, if you deprivation to mislay weight, you can take the self-evident road - Jenny Craig. Why not? It has worked remarkable for many, several people, together with the inflated, and now slightly deflated, Kirste Alley. But whatsoever citizens are too embaressed to waddle into a Jenny Craig. Maybe because society can see you do it, but thats beside the thorn. What other can you do?
Take pills! Sure.... It too has worked for a terrible number of family. Weight loss pills are terribly common, and flowing to get your guardianship on. There is many another types specified as Phentermine, Xenical, Bontril, Meridia and Adipex Diet Pill. But peak family air for excuses not to do that either, as it can be embaressing if being is to see you income them.
Caribbeana: An Anthology of English Literature of the West Indies, 1657-1777
Palgrave Advances in Irish History
Die Naturalisierung der peripheren Ungleichheit
William G. Brownlow: Fighting Parson of the Southern Highlands
The Psychologist's Companion: A Guide to Scientific Writing for Students and Researchers
The Bells in Their Silence: Travels through Germany
The Stabilization of Rabbinic Culture, 100 C.E. - 350 C.E. : Texts on Education and Their Late Antique Context
Les mutines de la revolte
Understanding Development: Theory and Practice in the Third World, 2nd Edition
Full Catastrophe Living: Using the Wisdom of Your Body and Mind to Face Stress, Pain, and Illness
An Introduction to the History of Modern Arabic Literature in Egypt (Studies in Arabic Literature , No 10)
Van in a Jam
Amazon Top Seller Secrets: Insider Tips from Amazon's Most Successful Sellers
Designers' Guide to EN 1993-1-1 Eurocode 3: Design of Steel Structures
Information Gathering in Classical Greece
Production and inventory management in the computer age
Lie Theory and Special Functions (Mathematics in science and engineering, Volume 43)
Liberalism (Galaxy Books)
Well then, that brings us to the clear mixture - WATCH WHAT YOU EAT! There is no have need of to pay all kinds of plunder for "Weight Watchers" or "Jenny Craig", or takings embaressing weight loss pills, right simply give somebody a lift write down of what you are eating, and try to issue on few improved behaviour. If you promulgation that you are feeding a lot of scrap food, try and cut backmost. Try to conveyance your bite foods to fruits and vegetables, or mayhap even just eat smaller number. Watch the amount of feed you are winning in, and that in itself can provide you grades.
For any other than weight loss ideas, you can try the scrap book store, a nutritionist, or inquire your physician.
Computer Algebra in Scientific Computing: 12th International Workshop, CASC 2010, Tsakhadzor, Armenia, September 6-12, 2010, Proceedings (Lecture ... Computer Science and General Issues)
The Economics of Business Enterprise: An Introduction to Economic Organization and the Theory of the Firm
Kant's Transcendental Psychology
A Little Guide to Christian Spirituality: Three Dimensions of Life with God
Hidden Teachings of Tibet: An Explanation of the Terma Tradition of Tibetan Buddhism
The Currency Trader's Handbook: Strategies For Forex Success
Learn to Play Go: A Master's Guide to the Ultimate Game (Volume I)
The Culture of Teenage Mothers
Common Sense, Reasoning, and Rationality
Down to Earth: Agriculture Iand Poverty Reduction in Africa (Directions in Development)
Evidence Synthesis in Healthcare: A Practical Handbook for Clinicians
The Way to Trade: Discover Your Successful Trading Personality (Harriman Modern Classics)
The Children of the New Forest
Suchmaschinen-Marketing: Konzepte, Umsetzung und Controlling fur SEO und SEM
The Author Event Primer: How to Plan, Execute and Enjoy Author Events
J.K. Lasser's Your Winning Retirement Plan (J.K. Lasser Guide Series,)
Mexican American and Immigrant Poverty in the United States
Bauman's Challenge: Sociological Issues for the 21st Century


text:
What is JotForm?
JotForm is a free online form builder which helps you create online forms without writing a single line of code. No sign-up required.
At JotForm, we want to make sure that you're getting the online form builder help that you need. Our friendly customer support team is available 24/7.
We believe that if one user has a question, there could be more users who may have the same question. This is why many of our support forum threads are public and available to be searched and viewed. If you'd like help immediately, feel free to search for a similar question, or submit your question or concern.
Why I cannot navigate through submissions nor download them?Asked by brooke on March 09, 2017 at 10:16 AM
Cannot download or get past page 1. need the rest of my rsvp list.
JotForm Support
I have checked this on my end and I can see it works fine, I can navigate through the submissions and download them as Excel or CSV report.
Does this happen when you're logged into your account or have you generated a submissions link?
I would suggest you to provide us the form where you're experiencing this issue and also take a screenshot of the web console, that will help us to know if there's something related to the issue you're getting.
These keyboard shortcuts will help you to get the console on your end:
Google Chrome:
Mac: Command + Option + J
Windows: Control + Shift + J
Windows: Ctrl+Shift+K
Mac: Command+Option+K
This guide will help you to upload the screenshot with your next reply: How-to-add-screenshots-images-to-questions-in-support-forum
You could also try logging-in in from a different computer, this may also be a cache issue, please do let us know how it goes.


text:
- Acold
- Acold A*cold", a. [Prob. p. p. of OE. acolen to grow cold or cool, AS. [=a]c[=o]lian to grow cold; pref. a- (cf. Goth. er-, orig. meaning out) + c[=o]lian to cool. See {Cool}.] Cold. [Obs.] ``Poor Tom's acold.'' --Shak. [1913 Webster]
The Collaborative International Dictionary of English. 2000.


text:
You have no items in your shopping cart.
Regular Price:
Special Price
Product is currently out of stock
Write a Review
Free Shipping!*
Put on for the Bulls in the New Era 950 Rubberized Print Snapback (11343536). This blazing red snapback hat features a white brim and a large Chicago Bulls logo emblazoned in bold black rubber with an icy white embroidered outline for premium style. A white New Era flag branding is embroidered on wearer's left side and a second Cardinal logo is found above the adjustable sizing enclosure at back of hat. Pair this hat to look fresh with any outfit. For sizing information, be sure to check our Size Chart. Looking for a store near you? Head over to our Store Locator.
© CityGear.com 2017


text:
Title won't be once in a blue moon
The idea that the Chelsea team attempting to wrap up the Premier League title today are boring or uninspiring to watch is being promoted by begrudging critics who are jealous of Jose Mourinho's success.
I just can't get my head around the criticism that has been flowing in Chelsea's direction as they have cruised towards the most comfortable title challenge you will ever see in the Premier League, with the sceptics fuelled by an agenda that is blurring their senses.
As regular readers of my Sunday World column will know, I have long been a big Chelsea supporter and I'll be glued to my TV for the Crystal Palace game this afternoon cheering them on to a title success that is well deserved after a wonderful season from Mourinho and his players.
Let's not forget the thrilling passing football Chelsea were producing before Christmas that inspired people to suggest they were capable of going through the whole season unbeaten and beating every team at home and in the Champions League on their way to complete domination.
Okay, that hasn't quite panned out, but it was an unrealistic expectation for a team that has only really been together for 12 months after the signings of Diego Costa and Cesc Fabregas last summer gave them such a dynamic edge as they established themselves at the top of the table.
I've loved watching Chelsea play this season and while some of their football over the last few weeks has been less thrilling from an entertainment perspective, Mourinho's ability to shut up shop and stopping opponents like Manchester United and Arsenal from playing is incredible to watch. No one can do it as well as he does.
Jose Mourinho
As I recall from my own playing days, forward players tend to get all the big headlines, but there is a skill in getting a draw on days when you are not at your best or when some of your best players are out injured.
Mourinho is brilliant at adapting his tactics to suit the occasion and maybe some people struggle to appreciate what a complete manager he is. He has different game plans, alternative ways to go about winning and in the end, he generally comes out on top.
Now, just as he is about to confirm his abilities as a tactical genius by winning the Premier League title again, some people are trying to pick holes in his success and I think that is down to soup grapes from people who wanted other teams to win.
How can you say a team featuring PFA Player of the Year Eden Hazard, with a brilliant striker like Diego Costa and featuring classy players like Cesc Fabregas and Nemanja Matic is boring? Come on guys, who are you kidding.
I can appreciate why Mourinho winds people up at times he gets on my nerves when comes out with some silly pronouncements from time to time. He can't help himself when he is offered a chance to goad a rival and it doesn't reflect well on him.
He was up to his old tricks again last weekend as he poked fun at Arsenal boss Arsene Wenger and suggested his failure to win the Premier League for a decade was what boring football was really all about. It was unnecessary, but that is the Mourinho way.
You know what you are going to get when you appoint this guy as your manager and you also know there is a very good chance you are going to end up with your team winning trophies because that is what he guarantees wherever he goes.
His latest Chelsea team are on their way to becoming is the complete package. They can turn on the style when things are going their way and then they can switch into a defensive mode when required, with John Terry a magnificent leader at the back on days when they revert to a counter-punching style.
Terry has been incredible this season. As a former defender myself, I can appreciate the qualities he has brought to the Chelsea team this season and while many people don't like him for a variety of reasons, you can't deny he is a wonderful footballer.
Diego Costa
In fact, you can't really pick out anyone in what is a relatively slim Blues squad and say there are short on quality and for that, the manager deserves all the credit because Chelsea were a long way from winning the Premier League title when Mourinho arrived back at the club.
The opposition may have been pretty poor as Chelsea have romped away with the Premier League title race, but that should not diminish the scale of the achievement Mourinho should finish off with one last victory this afternoon.
Like any Chelsea supporter, I couldn't care less if our rivals are annoyed by the success the Blues are set to enjoy in the coming years because in this game, you only remember the winners.
In Jose Mourinho, Chelsea have the ultimate winner and today's title success is just the start of a new era of winning for him at Stamford Bridge. His detractors better get used to it.