text:
63 - 69 Final
Louisville shakes off big deficits, dumps No. 1 PittsburghJan 18, 2009 - 5:46 AM LOUISVILLE, Kentucky (Ticker) -- Pittsburgh has to learn that when you are the top team in the country and have a double-digit lead, you must lock it up.
Terrence Williams scored 20 points and Earl Clark added 16 and 11 rebounds Saturday as No. 20 Louisville handed top-ranked Pittsburgh its first loss of the season, 69-63.
Freshman Samardo Samuels chipped in 10 points and seven rebounds for the Cardinals (13-3, 4-0 Big East), who overcame a double-digit deficit in both halves.
One of two undefeated teams left in the Big East Conference along with Marquette (4-0), Louisville has defeated the nation's top team in each of its last two meetings, topping Kentucky on December 27, 2003.
By knocking off the top team again, the Cardinals continued an excellent stretch where they have won eight of their last 10 games against ranked opponents - including their last three overall.
"Once the effort got to the level we wanted it to be, I think we became a good basketball team," Louisville coach Rick Pitino said. "I think everybody picked it up, each and every one of them. The time is now and our guys have picked it up and played well. They played very good basketball team tonight because of that."
Entering the day one of three remaining undefeated teams in Division I, the Panthers (16-1, 4-1) lost their third straight regular-season meeting with the Cardinals.
"It's our first loss of the season so it's really disappointing," Pittsburgh coach Jamie Dixon said. "I think any loss is. We're going to learn from it, we're going to get better for it. We're going to get ready for Syracuse (on Monday)."
With Pittsburgh's loss and Wake Forest's win over Clemson, the Demon Deacons are the lone undefeated team in the country and will probably move atop the USA Today/ESPN coaches' poll on Monday.
Williams shot 7-of-12 from the field with three 3-pointers and grabbed seven rebounds. Clark, who was celebrating his 21st birthday, grabbed four offensive boards, blocked three shots and collected two steals.
Jermaine Dixon scored a career-high 19 points for Pittsburgh, which won its previous two games with the No. 1 ranking - the school's first.
Dixon finished 3-of-4 on 3-pointers, an impressive stat considering the junior entered the game with only nine baskets from the arc.
"We got great minutes out of Jermaine (Dixon)," Jamie Dixon said.
The Panthers came out strong in this one, catching the Cardinals flat-footed as they took a 17-5 advantage on the first of Dixon's three 3-pointers.
Yet, Louisville was able to get back into the game behind its full-court pressure, forcing Pittsburgh into 10 first-half turnovers to trail just 32-30 at the break.
"We took good shots and we executed, but our press was the key to the game because we were able to wear people out," Pitino said.
The Panthers, who entered the contest averaging 11.5 turnovers, finished with 20.
"We really talked about the press in the backcourt, but also in the frontcourt as far as getting across and making decisions," Jamie Dixon said. "We really emphasized that as much.
"Teams that press usually are going to get a few more turnovers and give up other things and we took advantage of that. At the end of the day, 20 is too much. But I'm sure they're saying the same thing about their 19 turnovers. Again they're pretty much evened out."
Despite the slip-up, Pittsburgh was able to charge back into the lead again after the break, with Sam Young's 3-pointer capping a 7-0 run for a 41-35 advantage with 16:21 remaining.
Young hit another shot from the arc with 9:35 left, making it 51-45. The senior forward then came up with a steal on the other end, knocking the ball away from Clark before flying in for a windmill dunk.
Dixon capped a 9-3 run with a layup, giving the Panthers a 55-45 cushion with 8:55 to play.
Williams responded with a jumper, igniting a 9-0 burst. Clark sandwiched a jumper and a dunk around a 3-pointer by Preston Knowles, bringing the Cardinals within 55-54 with 6:30 left.
Although Dixon had three straight free throws for Pittsburgh, Louisville could not be stopped, as Edgar Sosa hit a layup and then found Samuels open in the middle of the lane for a dunk that tied it at 58-58 with 3:53 to play.
Williams' sweeping layup gave the Cardinals the lead with 2:53 left, and Clark added two free throws before hitting a jumper that just beat the shot clock with 45 seconds to play that capped a 19-3 run.
"He didn't know the time and I kept yelling shoot," Pitino said. "The fans were yelling so loud he couldn't hear it. We made great plays. This is the fourth game in a row right now where we did really smart things going down the stretch."
Tyrell Biggs converted two free throws to bring the Panthers within 64-60 with 18 seconds left, but not even a late three-point play by DeJuan Blair could stop Louisville.
Hampered by foul issues for most of the contest, Blair ended up with nine points and 10 rebounds.
"Our strategy tonight was to go at him," Pitino said of Blair. "When he plays defense he likes to swat the ball away in the low post. We were going to go at him and then we were going to pass opposite when they trapped. Our guys did a good job on that."
Young scored 14 points for Pittsburgh and Levance Fields added eight and seven assists, but also committed six turnovers.
- 124
roots#1 Cards Fan Added 10 roots
Pittsburgh(1) 63, Louisville(20) 69 FinalJan 17 8:37 PM
--- --- -----
Jan 17 8:24 PM
- 114
rootsRUWTbot Added 34 roots (Close Finish, Upset, Ranked Teams)
Pittsburgh(1) 58, Louisville(20) 58 2nd - 3:27Jan 17 8:02 PM
- 80
rootsRUWTbot Added 36 roots (Close Finish, Upset, Ranked Teams)
Pittsburgh(1) 55, Louisville(20) 54 2nd - 6:11Jan 17 7:55 PM
Jan 17 7:04 PM
- 44
rootsRUWTbot Added 34 roots (Ranked Teams)
Pittsburgh(1) 0, Louisville(20) 0 1st - 19:55Jan 17 6:13 PM
- 10
rootsGREGnKY Added 5 roots
Pittsburgh(1) vs. Louisville(20)Jan 17 9:10 AM
- 5
rootsaqualung1 Added 5 roots
Pittsburgh(1) vs. Louisville(20)Jan 8 11:12 PM
Related News
- Louisville appeals 'draconian' NCAA penalties in escort case Aug 12
- Louisville sophomore Onuaku to undergo heart procedure May 17
- Louisville students' lawsuit against escort is dismissed May 3
- Louisville announces more sanctions for men's basketball Apr 6
- Stallings ready for new challenge at Pittsburgh Mar 28
- Pittsburgh hires Kevin Stallings to replace Jamie Dixon Mar 28
- Dixon's departure leaves Panthers at crossroads Mar 22
- New-look Badgers back in NCAA Tournament against Pittsburgh Mar 17
- Pitino elevates Johnson to Louisville associate head coach Mar 15
- Cardinals' Pitino says he saw nothing 'unusual' at dormitory Mar 15
- Pitt hoping to play itself off the bubble at ACC tourney Mar 7
- Pitino: Will use offseason to decide future with Louisville Mar 1


text: The Black Swan Inn at Culgaith sits in the gentle Eden Valley just east of Penrith. The perfect gateway into the Lake District National Park and the North Pennines AONB, this stunning inn with rooms and restaurant has undergone a superb recent refurbishment, and has its very own stretch of the river Eden where guests are welcome to fish. This area of the Eden Valley is famed for its salmon fly fishing and Brown trout fishing season. The Coast to Coast Path popular for cycling is nearby.

subset: commoncrawl


text:
MapleStory (2006 GMS) 2-Hour Music Compilation MP3
Ripped from GMS v0.22 official client 0:00 Title - Login 6:16 FloralLife - Henesys (Town) 8:34 GoPicnic - Maple Road: Southperry / Henesys (Henesys Market) ...
MapleStory Henesys Background music: Remix MP3
A remix of henesys' background music 320kbps download link: http://www.mediafire.com/?sthqy8l093lt1l9 Vid by MAMplayer, midi by VGmusic.
Maplestory Henesys City (Background Music) MP3
Background music from Henesys. The music is made by Nexon. I do not take any credit for the music.
MapleStory 2 - Henesys BGM (Spring Breeze) MP3
The background music (BGM) for the Henesys village in MapleStory 2 has been released. Give it a listen and comment below what you think. The title of the ...
MapleStory Henesys Market 8-bit theme song Background music MP3
Another 8-bit song. Have any other games that you want 8-bit tized? Make a comment below.
MapleStory BGM 2 Hour Compilation 2006 GMS MP3
This channel is dedicated to upload MapleStory BGMs Most of the BGMs are owned by Nexon. I do not own anything 0:00 Login 6:16 Henesys 8:34 Southperry ...
HENESYS ON- Maple Marriage! [HD] SKIP TO 0:35 seconds MP3
See the funny, surprising reactions of regular players around Henesys! I set up my microphone and walked many distances around Henesys gathering up ...
MapleStory Music - Henesys Hunting Grounds MP3
MapleStory Music - Henesys Hunting Grounds (CavaBien.mp3) Image and music are Copyright (c) NEXON Corporation and NEXON Europe Limited.
MapleStory - Links Skills Are Important! MP3
Welcome to a quick MapleStory tutorial on how to get more damage using your Link Skills. This video is made on the Europe MapleStory server. Subscribe and ...
Maplestory Soundtrack - East of Henesys MP3
Maplestory Soundtrack - East of Henesys.
Maple Story El Nath Background Music MP3
Maple Story El Nath Background Music.http://spreadsheets.google.com/viewform?formkey=dEhVYUJhVGZxS1dCZXR3c0NFdW9SQWc6MQ.
Maple Story Music-Henesy Market MP3
Nexon Copyright.


text:
How will you be spending your Christmas this year?
With only two sleeps until Christmas we thought it might be nice to ask our stores and our customers how they will be spending the happy holiday. Christmas isn't just about presents it's a fantastic time to bring together families and distant friends. So here we go let's start, how will you spending your Christmas this year?
Toby Bensimon, our Managing Director is looking forward to spending his days off indulging and enjoying all the yummy Christmas food he can fit in. He's also looking forward to his nieces and nephews being around.
Lorraine from Shiels Joondalup will be spending her Xmas day on the beach, whilst Channelle from the same store will be spending her Christmas with family playing with nieces and nephews. Leanne again from Shiels Joondalup, will be spending Christmas at her sister's house eating lots of lovely food.
Lara from Shiels Munno Para will be spending Christmas day with her 2 sisters and all their children. We think there will be lots of presents to be opened!
Jemma from Maroochydore will be spending her day like this:
"I will be with family spending the day gorging on Christmas food, watching the kids enjoy their presents. Having family time with maybe a 'drinky' or two and thoroughly enjoying the day and the company".
Belinda from Head Office will be enjoying Christmas like this: "We have a big family, so Christmas is a big get together for lunch. Gifts are exchanged and lots of food consumed"
Stephanie from Head Office will be spending her Christmas having a "jolly good" time with her family including an excited six year old, some good food and perhaps a champagne or too whilst opening a million presents.
Wherever you are and whatever you are doing we hope that you and your family have a fabulous and safe Christmas enjoying the best things in life - family, friends and food (booze). Maybe if you have been good you might get a diamond or two.
Diamond Angel Pendant in Sterling Silver on Chain is pictured above and you can shop it here
Don't panic if you have left your Christmas shopping too late you can always head in-store and buy a gift card or perhaps order a belated Christmas gift online.


text:
Bang Bros Remastered Ashley Blue: A Threesome Of Big Ass and Titties!
Added: Sunday, December 15, 2013
Loading Bang Bros Remastered Ashley Blue: A Threesome Of Big Ass and Titties! Video
Bang Bros Remastered Ashley Blue: A Threesome Of Big Ass and Titties!
Here we are, this week with another Remaster classic of BigTitsRoundAsses! This shoot is one of the movies ever! These two girls have hot bodies, warm pussies, and cute faces. They have big tits and big round asses. Ashley has bigger tits and Mia has an even bigger ass. It doesn't even matter! You won't be disappointed. There performance was outstanding! They both sucked cock like professionals despite being amateurs. Once they got the oil action started, thats when I knew it was on, They had good chemistry, they played and sucked on each other's tits like there was no tomorrow. They couldn't wait any longer, they needed Jordan to come over and fuck them the shit out of them. The sex was dynamite!It was fucking insane. There was hot lesbo action all over the place. I love me some girl action, it gets me hot. They both made out all over Jordan's cock! Then they fucked like crazy. It went on for a while. That was stimulating in so many ways. Enjoy!
Bang Bros Remastered Video Galleries
More Video Galleries
Dads Friend Fucks The BestViews: 2,167
Sexy Ebony Neighbor Receives A Hard FuckViews: 1,881
Big Surprise From Santa ClausViews: 1,900
Arabian Big Tits Hotie Takes A Big Black CockViews: 1,953
Daddy Punish Very RoughViews: 2,526
Funny Blonde Whore Gets A Massive LoadViews: 1,000
Stepbrother Fucks The BestViews: 680


text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 29, 2006
|Filing date
|Jan 28, 2004
|Priority date
|Jan 30, 2003
|Fee status
|Also published as
|Publication number
|James P. Dunyak, John D. Fite, Jerome M. Shapiro
|Original Assignee
|The Mitre Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (5), Non-Patent Citations (10), Referenced by (29), Classifications (8), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims the benefit under 35 U.S.C. 119(e) of provisional application 60/443,655, filed Jan. 30, 2003, entitled "Multi-User Detection Techniques for CDMA," the entire contents of which are hereby incorporated by reference.
1. Field of the Invention:
This invention relates generally to communications, more particularly to improving communication system performance through interference cancellation, and still more particularly to improved cancellation of multiple access interference in a code division multiple access communications environment.
2. Description of the Related Art:
Code Division Multiple Access ("CDMA") provides an effective communications technique for several users to share a communications channel. Unfortunately, when the channel becomes overcrowded, the conventional CDMA receiver performs poorly and multiple access interference ("MAI") can severely degrade performance. Although the optimal maximum likelihood receiver in this case is easy to describe, it is nearly impossible to implement.
Various conventional techniques examine interference cancellation at the symbol level. Symbol-level matched filters can provide a sufficient statistic for multi-user detection ("MUD") in an additive white Gaussian noise channel. This well known result concludes that the optimal user bit estimation procedure can be written at the symbol level. Accordingly, these various conventional MUD approaches use symbol-level estimation and cancellation approaches. However, these symbol-level techniques are only approximations to the optimal estimator, and there is no guarantee that these symbol level approximations fully exploit the signal structure.
Additionally, conventional procedures can involve the following computationally expensive process for canceling interference: (1) interpolating the data for each source (base station) to the sampling lattice of the signature waveform (chip center), (2) computing the bit estimates for each user, (3) synthesizing the entire symbol's binary waveform and (4) interpolating the waveform of the whole symbol back to the sampling grid of the data to perform the cancellation.
Some sample-level approaches have been proposed. One example uses a continuous time (i.e., analog) maximum likelihood estimator ("MLE") approach, which can be used as continuous decision feedback. This MLE approach can be purposed as a single-stage analog process using filters controlled by relative user power levels. Although relatively easy to implement, these approaches are not a good theoretical match to the interference cancellation problem. To remedy such shortcomings, linear minimum mean squared error (MMSE) techniques, such as those based on standard applications of the Kalman filter and other least-squares generalizations, could be used to reduce un-cancelled interference. These techniques fully couple the users (resulting in large matrix computations) and perform interference cancellations in the innovation term in the filter. Accordingly, they remain quite computationally expensive.
The above described techniques are also considered to be single stage algorithms. Multiple stage designs have also been considered. For example, in parallel with the development of symbol-level MMSE receivers, multi-stage parallel interference-cancellation (PIC) methods have been developed. In multi-stage PIC formulations, code matched filters are applied to the difference between the receive signal and the sum of the interference signals estimated from the previous stage. These multiple stage designs remain inadequate.
Each of the conventional techniques have been found to either be too complicated to embody in practical applications, or inadequate in terms of actual MAI cancellation in actual usage. Thus, techniques for canceling MAI that can be practically implemented while still providing effective cancellation remain needed.
The present invention reduces MAI in communications systems, in one embodiment asynchronous CDMA systems using long codes.
One technique uses parallel interference cancellation (PIC) on a chip-by-chip basis. Particularly, a decoupled binary minimum mean squared error (MMSE) estimate is applied for each user at each time sample, instead of waiting for a complete symbol estimate. According to another aspect, the pseudorandom properties of the spreading codes lead to a conditional expectation based on an underlying mixture-of-Gaussians (MG) distribution. This results in performance nearly as high as the single-user bound, even at high loads. Furthermore, these techniques significantly outperform conventional ones at an affordable computational cost.
Another aspect of the present invention cancels multiple user interference in a communications system wherein a plurality of users communicate over a shared channel by receiving a set of data (e.g., baseband data) that provides a plurality of discrete values produced at a sub-symbol interval that is less than a full symbol period, and estimating bits for a symbol corresponding to a given user by interpolating the signature waveforms for at least some of the plurality of users to a common sampling lattice of the received set of data. This aspect can be applied to various MUD approaches including the Mixed Gaussian Demodulator, PIC, partial PIC, and the Decoupled Kalman Demodulator and provides a substantial reduction in complexity since the interpolation of the binary signature waveforms can be performed easily with lookup tables, whereas the interpolation of each source to chip center requires filtering operations involving traditional multiply-accumulate structures.
Other aspects of the present invention include hybrid multi-stage multi-user detection (MUD) methods and a reconfigurable Recursive Multi-Stage MUD (RMSM) algorithm architecture that, through the selection of an update gain factor and a non-linear function, can implement various MUD algorithms. MUD algorithms supported by the RMSM architecture include the Mixed Gaussian Demodulator, PIC, Partial PIC, Decoupled Kalman Demodulator, and hybrid multi-stage MUD methods.
The present invention can be embodied in various forms, including computer implemented methods, computer program products, communications systems and networks, receivers, transmitters and transceivers, and the like.
These and other more detailed and specific features of the present invention are more fully disclosed in the following specification, reference being had to the accompanying drawings, in which:
In the following description, for purposes of explanation, numerous details are set forth, including particular equations, in order to provide an understanding of one or more embodiments of the present invention. However, it is and will be apparent to one skilled in the art that certain specific details are not required in order to practice the present invention. For example, the details of one aspect of the invention may not be required to practice another aspect of the present invention. For ease of description, the description is separated into separate sections pertaining to various aspects of the present invention.
As indicated, each aspect of the present invention can be embodied in various forms, including computer implemented methods, computer program products, communications systems and networks, receivers, transmitters and transceivers, and the like. For example, in one embodiment a hand held device such as a cellular telephone includes conventional memory, as well as a processing unit for executing instructions provided in memory. Conventional programming techniques are used to implement the various techniques described in detail in the following sections, as provided by software that can be stored in the memory. Alternatively, the same software can be stored on various computer readable media (e.g., disks, CDs, etc.). Still further, when the instructions provided by the software are executed, computer implemented processes result.
According to one aspect, the present invention provides multi-user detection (MUD) techniques that may be used in a CDMA communications system. The MUD techniques receive complex baseband discrete time input, implement parallel interference cancellation (PIC), and perform estimations at a sub-symbol level, preferably on a chip-by-chip basis. In a receiver (e.g., CDMA, cell phone), these techniques improve performance by minimizing the potential for multiple access interference, and do so at relatively low computational cost. According to additional aspects, the MUD techniques implement recursive multistage based estimation and non-linear functions to further improve interference cancellation when compared with linear and single stage techniques.
In one embodiment, the present invention implements with the users coupled only through the interference cancellation, which occurs on a discrete sub-symbol sampling lattice. By way of introduction,
with y(t)=the complex received baseband signal, hk(t)=the complex asynchronous spreading functions (which can also be referred to as signature waveforms), ck(t)=the complex transmitted constellation symbol associated with the K users, and v(t)=the complex additive white Gaussian noise. This formulation allows, if necessary, for the presence of signals yp(t) which contain known signals such as pilots, preambles, midambles, and so on. These yp(t) allow for the acquisition of coherent channel information, timing, and so on as is standard in the art. The discrete sampling interval, the time between t and t+1, is less than a symbol period and generally less than or equal to a chip period.
Here, the pilot information is estimated and the pilot signal is cancelled before user multi-access interference is estimated and removed. This is suggested when the pilots are strong enough to estimate the needed information. In some cases, the pilot information should be re-estimated and pilot signals re-cancelled after the intermediate stages of interference cancellation. This is advantageous, for example, when near-far problems cause weak pilots to be obscured by strong pilots and user signals.
The interference cancellation occurs on the discrete sub-symbol sampling lattice, instead of using interpolation to move these measurements to chip center for each user or using symbol-level sampling. The decoupled processing units 1404 a–c use i(t) and any pilot/preamble or midamble information to produce an estimate ĉk(t+1)hk(t+1) for this user's contribution to MAI at the next sample time.
to make an estimate of the constellation symbol ĉk(t+1). The addition 1508 of the estimated multi-access interference ĉk(t)hk(t) restores the contribution of user k and simplifies the algorithm flow to produce yk(t) in the decoupled MUD processing. Although one embodiment is described, other functionally equivalent designs can be used for
Another aspect of this invention is that the residual term
is viewed as additive noise during signal processing, which leads to substantial savings in computational complexity when compared to standard Kalman filtering and other fully coupled techniques. The internal states of the decoupled processor maintain the information needed to generate an estimate of the constellation point ĉk(t) at each sub-symbol time step t. The decoupled MUD processor block produces an estimate at each t, instead of waiting until the end of a symbol period. This significantly improves cancellation at each pass (as in the Mixed Gaussian MUD embodiment discussed below) and improves computational efficiency by allowing reuse of signature waveforms for both demodulation and reconstruction even when applying more traditional algorithms (such as classic parallel interference cancellation) in the decoupled MUD processor. In the signature waveform synthesis module 1502, the signature waveform is interpolated to the sub-symbol sampling lattice of the data, rather than interpolating the data yk(t) to a user k-based sampling grid, such as chip center. This produces a substantial reduction in complexity in many cases, since the hk(t+1) interpolation can often be implemented with binary lookup tables, in contrast to fixed point filters for interpolating yk(t) to a different chip center grid for each user.
In one embodiment, these aspects can be implemented through what is referred to as a Mixed Gaussian (MG) multi-user demodulator (referred to as MG-MUD), which implements a non-linear minimum mean square error estimation technique, full decoupling, and multiple stages to estimate and cancel interference on a sub-symbol basis, preferably on a chip-by-chip basis. Other embodiments include the Decoupled Kalman Demodulator and the Decoupled Kalman Demodulator with nonlinear refinement, which are described further in provisional application 60/443,655, filed Jan. 30, 2003, entitled "Multi-User Detection Techniques for CDMA." The architecture in
Although applicable to any communication methodology, MG-MUD is described in connection with a CDMA system for ease of discussion. The technique uses decoupled filters to estimate symbols for each user while accomplishing parallel interference cancellation on a sub-symbol basis. A minimum mean squared error estimate is made at each time sample, and interference cancellation is performed without waiting for the complete symbol. Decoupling is accomplished through the pseudorandom properties of the spreading codes, resulting in an algorithm with excellent performance even in the presence of high levels of multi-access interference.
By way of introduction, the MG-MUD technique is first described, followed by particular embodiments implementing the technique.
By way of example, a model using the IS95 standard with a Binary Phase Shift Keyed (BPSK) CDMA signal for K asynchronous traffic channels using long codes is described. Consider the received signal
with y(t)=the complex received signal, hl(t)=the complex asynchronous spreading functions, Al(t)=the real traffic channel magnitude, bl(t)=the transmitted bit, and v(t)=the complex additive white Gaussian noise. Note, in this formulation, that the spreading function contains the channel effects, while the traffic channel magnitude is separated to simplify traffic channel power tracking (relative to the pilot) in the IS95 embodiment described below. In the presence of resolvable multipath, a formulation similar to the rake receiver is employed. In this case, each arrival is tracked separately during MUD, with the separate measurements of a user's arrivals coherently combined when making the MMSE estimate.
Here, the phase of the channel coefficient in the spreading functions and the amplitude in the channel magnitude are estimated using standard techniques, and the channel coefficient is assumed to be approximately constant over a single symbol period.
For user k, consider a MMSE estimate {circumflex over (b)}k(t) of bk(t) with
σk 2(t)=E(|{circumflex over (b)} k(t)−b k(t)|2).
The demodulator uses a predictor-corrector structure similar to a Kalman filter that implements interference cancellation through the innovation signal. Consider hk(t) and Ak(t) to be known, and let {circumflex over (b)}k(t)− be the prediction of bk(t) based on {circumflex over (b)}k(t−1). Then
The demodulator is developed for a fixed user k. For notational convenience, assume that the user k starts a new symbol in the sampling interval immediately before t=0. First, cancel the estimated multi-access interference, defining:
Consider sampling at the chip rate and make an MMSE estimate of bk(t) based on the vector of measurements:
ĩ k(τ)=Re{h k(τ)*i k(τ)}
with τ=1,2, . . . , t and 0≦t<the spreading gain. Note that the estimate for bk(t) depends on all measurements of the current symbol up to time t. The estimate at the end of the symbol is the converged estimate. For the BPSK case, the imaginary component of hk(τ)*ik(τ) also contains limited information that does not necessarily need to be exploited. Next used are the pseudorandom properties of the spreading codes sampled once per chip. Then, for user k, the other users' spreading functions are considered to be random variables, and hl(t) is approximated as independent and identically distributed with
E(h l(t))=0,
E(h l(t)*h l(t))=H 2,
E(h k(t)*h l(s))=0 for k≠l,
E(h l(t)*h l(s))=0 for t≠s.
The relative power of the users is captured in the real magnitude Al. Liberal application of the central limit theorem results in conditionally Gaussian distributions
From the pseudorandom properties of the spreading functions, it is expected that ĩk(τ1)|b
with special function G defined by
This section introduces an approximation that substantially reduces the computational load, while improving demodulator performance. To simplify the demodulator, consider the approximation
This approximation is quite accurate for lower-powered users. Higher-powered users are easily demodulated and not significantly affected. Defining
allows estimation of the denominator in equation (3) directly from the time series. A simple low pass filter
{circumflex over (σ)}i 2(t)=(1−α){circumflex over (σ)}i 2(t−1)+αi(t)*i(t) (7)
can be used, but in a specific application the filter should be more closely matched to the dynamics of the channel. The resulting demodulator for stage 1 of a multi-stage approach is then simply
{circumflex over (σ)}i1 2(t)=(1−α){circumflex over (σ)}i1 2(t−1)+αi l(t)*i l(t) (10)
{circumflex over (b)} k1(t)=tan h(Sk1(t)). (12)
Equations (6–10) consider the case when no resolvable multipath is present. When multiple arrivals occur, the arrivals are tracked separately and information from these arrivals is coherently combined. For a user k with Pk multipath arrivals, equations (6–10) then become
{circumflex over (σ)}i1 2(t)=(1−α){circumflex over (σ)}i1 2(t−1)+αi 1(t)*i 1(t)
{circumflex over (b)} k1(t)=tan h(S k1(t)).
The case of a single arrival per traffic channel is illustrated in the embodiment below.
To provide a straightforward demonstration, the above theoretical development provides the MGMUD approach for a BPSK system. In the BPSK case, the bits are directly estimated. Modulations with more complicated constellations require a different approach. This different approach is also used in mixed modulation cases, in which different users may have different modulation constellations. Consider the received signal
with y(t)=the complex received signal, hl(t)=the complex asynchronous spreading functions, Al(t)=the real traffic channel magnitude, cl(t)=the complex transmitted constellation symbol, and v(t)=the complex additive white Gaussian noise.
For user k with constellation set C, we can maximize interference cancellation by making a mean squared error estimate of the constellation state ck for this user, in contrast to the BPSK bit estimate. For complex innovation i(t), we have the MMSE estimate from the approximate conditional expectation
with σi
Equations (1–5) implement the BPSK demodulator, while (13) describes the demodulator for a multiple bit constellation. Both the hyperbolic tangent, special function G, and other exponential functions may be implemented as a table lookup for numerical efficiency, in which case equations (3) and (4) can be efficiently implemented through the accumulation of the summations. They may also be approximated, such as in the piecewise-linear approximation demonstrated in the embodiment below. Multiple passes are then performed by repeatedly passing through the data and continuing to accumulate terms in the summations in equations (2) and (3).
Equations (8–12) describe the first pass of the algorithm, which is indicated by the subscript 1 in the parameters. Remember that for notational convenience these equations are for a user k starting a new symbol at time t=0 and for 0≦t<the spreading gain. The summation in equation (9) restarts at each symbol boundary. In this formulation, the estimate of σi 2 used in equation (9) is fixed. Use of equations (8–12) provides another significant benefit, in that the algorithm is less model-driven and provides a more robust demodulator. The algorithm needs no estimate for the power of the additive noise, which is often difficult to estimate during heavy multi-access interference. In addition, the algorithm is no longer heavily dependent on the accuracy of the error variance dynamics in equations (4) and (5). Numerical experiments reveal that the additive noise approximation approach, as described in equations (8–12), leads to higher-fidelity approximations in the MMSE estimation.
Several choices are available for implementing a multiple pass algorithm. For example, we may first use the earlier pass bit estimate and summations as an initial condition. For spreading gain L and user k, define Fk(t) to be the time index of the first sample of the current symbol for user k. Then, for example, the first sample of a symbol for user k is
F k(t start)=t start
and for the remaining samples in the symbol
F k(t)=t start for t start ≦t<t start +L−1.
We can then write multipass equations for pass m as
{circumflex over (b)} k0(t)=0 for all t (14)
S k0(t)=0 for all t (15)
{circumflex over (σ)}im 2(t)=(1−α){circumflex over (σ)}im 2(t−1)+αi m(t)*i m(t) (18)
Equations (14–20) show how new symbols are handled at each pass. The slightly complicated time-indexing schemes in equations (16) and (19) simply restart the bit estimate and accumulator at converged estimates for the earlier pass whenever a symbol boundary is reached.
The multi-pass implementation in equation (19) continuously accumulates between passes. To maintain the interpretation of converged symbol estimates as log likelihoods, as preferred in decoding, we may alternately use
This function linearly removes the initial condition in the accumulator. A third approach is to save all of the matched filter values
in a circular buffer, which is filled with data from the symbol as the new data is available. The entire buffer is then summed at each time step. In this case,
In practice, equation (22) would be implemented by subtracting the old term and adding the new term. Each of the three techniques (19), (21) and (22) provide increased accuracy in estimating the bit log likelihoods at the cost of increased implementation complexity.
Thus, described herein is a practical multi-user detection technique for high user loads. Through decoupled filters based on the underlying mixed Gaussian distributions, the technique cancels interference on a chip-by-chip basis instead of waiting for a complete symbol estimate. Further numerical efficiency results from estimating the un-cancelled interference power from the time series itself, instead of using a model-based approach. This technique compares favorably to an optimized partial PIC algorithm using the IS95 standard. This embodiment illustrates various features of the invention. First, the separate MUD processor blocks are coupled only through the interference cancellation. Second, this interference cancellation occurs on the data sampling lattice (as compared to individual user chip center or the symbol level lattice) using the sub-symbol level structure introduced in
Another aspect of the present invention is provision of hybrid multi-stage (or multi-pass) MUD techniques that use different sample-level methods at each stage as introduced in
Although the present invention is applicable to various communications systems, for ease of description some example are described in the context of usage with the IS95B CDMA standard. The input to the SSCR 100 is a digitized complex baseband signal where the sampling rate of the signal can be at any integer multiple (usually 1, 2 or 4) times the chipping rate, which in the case of IS95 is 1.2288 million chips per second. For the system described, a version of the signal digitized at 1 sample of chip is needed as is a version sampled at a rate of at least 4 samples per chip. If the input is clocked at 4 samples per chip, then the decimation module 102 uses conventional decimation techniques to obtain a version clocked at 1 sample per chip. If the input is clocked at 2 samples per chip, then the interpolation module 104 uses conventional interpolation techniques to generate a version sampled at 4 samples per chip as is used by the active user detection module 110, with decimation being used to generate a version sampled at 1 sample per chip for use by the rest of the system. Finally, if the input is sampled a 1 sample per chip as in the figure, then interpolation is used to generate a version at 4 samples per chip.
With reference to the pilot acquisition module 106, each CDMA base station (called a source) emits a pilot signal that is used for acquisition of code timing. In IS95B, the pilot signal uses a repeating 32768 chip code sequence. Each base station has a different timing offset from its neighbors. In the pilot acquisition module 106, the number of sources, and their timing offsets, and optionally Doppler offsets are estimated. In the exemplar system, timing offsets accurate to 1/16 of a chip are used. Additionally, a preliminary estimate is made of the complex amplitude of the channel. The result provided by the pilot acquisition module 106 is a list of sources, along with their timing offset, Doppler offset, and complex amplitude.
Preferably, the active user detection module 110 uses a complex baseband input signal of at least 4 samples per chip. If the input to the system is less than 4 samples per chip, interpolation is performed. Additionally, the list of sources and their respective parameters derived by the pilot acquisition module 106 are used. Furthermore, there may be a list of known or required users. In IS95, such a list would normally include paging and synch channels and the receiver user's own channel. The active user detection module 110 attempts to identify which of the available sub channels (A CDMA base station has 64 sub-channels, including pilot, paging, synch, and traffic channels) have users on it by comparing the power seen in that channel to a threshold. The output of the active user detection module 110 is a list of users for each source, along with their corresponding channel index and amplitude.
The CTCE module 108 takes in the complex baseband input signal sampled at one sample per chip and correlates it with a pilot signal at −�, 0 and � chip delays. The correlation with the pilot at 0 delay is used to estimate the channel's complex amplitude, while the correlations at delays of −� and � are used to track changes in the timing offset. The output of the CTCE module 108 is a list of sources, their updated timing offset, Doppler offset, and complex channel amplitude.
The pilot cancellation module 114 takes the complex baseband signal sampled at 1 sample per chip as its data input and the list of sources and their timing offsets, Doppler offsets and complex channel amplitudes. It then uses the source information to synthesize a replica of the pilot for each source which it then subtracts from the complex baseband input. The output of the pilot cancellation module 114 is a pilot-less complex baseband signal which is fed into the MUD module 116. The MUD module 116 also uses the list of sources and their corresponding timing offsets, Doppler offsets and complex channel amplitudes, and the list of users and their corresponding Walsh code index, and amplitude.
The MUD module 116, in conjunction with remaining components performs interference cancellation by receiving and processing a discretely sampled waveform, performing estimation at a sub-symbol level, preferably down to the chip level, and incorporating parallel interference cancellation. Non-linear estimation and multistage architecture may also be provided, as described further below. Preferably, the MUD module 116 applies the previously described MG-MUD functionality. A more detailed embodiment of the MUD module 116 including components for carrying out such functionality is described further below.
The output of the MUD module 116 is a stream of soft decision symbols that are fed to the back end for error correction decoding and subsequently either the output data stream or into a vocoder to produce audio output.
The SCCR 100 internals may be provided as software, hardware, firmware, or any possible combination of hardware, firmware and/or software. The SCCR 100 may also be variously implemented such as on an Application-Specific Integrated Circuit or on a Digital Signal Processor, which include elements for executing the software or the like. The preferred implementation solution will depend on ease of integration with the overall system design.
For each Doppler offset, the correlation at N positions is calculated. For each point in the CAF, the magnitude squared is computed 202. A removal-of-outliers approach is used with a noise threshold 204 a to generate noise statistics 204 b. From this, a threshold is computed 204 c and the CAF magnitude squared is compared to this threshold 204 d. Positions whose corresponding magnitude squared exceeds a threshold are identified and added to a list of "mountains" 204 d. Points on this list of mountains are clustered to identify CAF points corresponding to the same source. Maintained along with each mountain are the timing offset, the Doppler offset, and complex amplitude of each point 206. Additionally the same information is also maintained for the two adjacent Doppler bins for each point.
Timing offsets are then refined with a successive approximation procedure 208. For each cluster, the point with the largest magnitude squared is selected, and the point corresponding to one of the two adjacent Doppler bins with the larger magnitude of the two is also selected. The Doppler offset is computed by interpolating the Doppler offsets of the two points. The interpolation assumes that the CAF surface will have a sin x/x shape about the peak. Once the Doppler interpolation is completed, a pilot signal is synthesized and correlated with the same timing offset at the interpolated Doppler peak. The input signal is then correlated with the synthesized pilot and the complex amplitude is computed. The correlations are also computed with a timing offset of −� and � chip from this point. A successive approximation procedure is used to refine the Doppler offset estimate to the required resolution. In the exemplar, this resolution is 1/16th of a chip. For each of the iterations, in successive approximation, three points (two intervals) are necessary. Starting with the two intervals already identified [−�, 0], and [0, �], the interval whose magnitudes sum to a larger value is selected, and, for example the point at offset � chip is computed. The iteration continues until we have a point at resolution 1/16th of a chip.
After a designated period, in the exemplar every 512 chips, an error metric is calculated as follows: (1) each of the three correlations (early, late and prompt) is multiplied by its complex conjugate to calculate early energy, prompt energy and late energy; and (2) the error metric is calculated as (early energy−late energy)/prompt energy.
The update to the timing offset is given by some feedback coefficient, typically 0.1–0.3, multiplied with the error metric. The estimate of the channel's complex amplitude is calculated by dividing the prompt correlation (before squaring) by the energy in the prompt pilot. Once the update to the timing offset and update to the channel's complex amplitude are calculated, the four accumulators (early, late, prompt, and pilot energy) are initialized to zero, and the processing continues.
Each MUD stage 800 a–c is built around one or more MUD Processing Elements (MUDPE), preferably matching the number of users (K), sixty-four in the described example. For ease of depiction, three MUDPEs 804 a–c are shown. A MUDPE contains two basic functions: a demodulator that decodes the input and estimates the current symbol, and a synthesizer, which based on the estimate of the symbol estimates the contribution of the current user to the next chip. For a given stage, the outputs of all MUDPE's 804 a–c are summed together to form an estimate of the next chip of the pilot-less baseband input. The current chip's estimate for the stage (which would have been computed on the previous chip) is then subtracted from the pilot-less baseband input to form the innovation signal. This innovation is the component of the pilot-less baseband that cannot be predicted out. The innovation signal for a given stage is the input to all MUDPE's 804 a–c for that stage 800 a.
Each MUDPE 804 a–c produces two additional outputs either to initialize the next stage for a given user, or as the final soft decision output for the user of interest. The first output is the soft decision output for that stage. For each user it is the linear accumulator of a matched filter operating on the pilot-less baseband input with the multi-access interference removed. Internal to the MUDPE, this pilot-less baseband input with the user's multi-access interference removed is formed as the summation of the innovation with the MUDPE's prediction of the user's contribution to the pilot-less baseband. For the first stage, this accumulator is initialized with zero. For later stages, this accumulator is initialized with the soft decision output of the previous stage.
The second output of the stage is the initial bit, (or in the case of non-BPSK modulation the initial constellation point) estimate for the next stage. This bit estimate is used for the initial bit estimate on the first chip of a given symbol processed by a stage. For the first stage, the bit estimate is zero. The actual bit is either −1 or +1. However, there are at least three approaches to producing a soft bit estimate internal. The first approach is to use a hard decision limiter, which is simply the sign of the soft decision accumulator. The second approach, which produces the optimal MMSE estimate is to compute the hyperbolic arctangent of the soft decision accumulator. The third and preferred approach approximates the hyperbolic arctangent function using a piecewise linear function whereby the output is equal to the input if the magnitude of the input is less than 1, but is clipped to either −1 or 1 if the magnitude is greater or equal to 1.
Both the soft decision output and the bit estimate outputs are latched during the processing for a given symbol. The latch is clocked at the end of the completed symbol. For IS95, a symbol is 64 chips. Therefore the input to a next stage is delayed 802 a, 802 b by the number of chips in a symbol since the output of the current stage won't be ready until it has processed all chips for a symbol. Similarly, a buffer of the size of the number of chips in a symbol is preferably be placed on the input between each successive stage.
i k(t)=i(t)+h k(t)A k {circumflex over (b)} km(t)−
The MUDPE 900 a includes a signature synthesizer 906 which receives the timing offset and the Walsh index for the user, and calculates the signature waveform. Calculation of the signature waveform is described further below with reference to
The user estimator 902 calculates an estimate of Ak, the user's complex amplitude. The user's complex signature waveform Akhk(t+1) is constructed from the multiplication 936 of the user's complex amplitude estimate and the signature waveform. This waveform is computed during the current chip to estimate the user's contribution to the next chip, The one-chip delay provided by delay 914 d accommodates providing the appropriate value for the contribution to the current chip.
For the receiver (which can be viewed equivalently as a matched filter or as a correlator), ik(t) is multiplied by the complex conjugate of the signature waveform and then the real part of that product is taken to provide a matched filter term. This functionality comprises (1) multiplying 926 the real part of ik(t) with the real part of the signature waveform, (2) multiplying 928 the imaginary part of ik(t) with the imaginary part of the signature waveform, and (3) adding 930 the two products together, yielding the real component thereof. This value is provided to accumulator 912. In conjunction with feedback passed through delay element 914 a, which passes the prior chip accumulated value to the accumulator 912, which effectively accumulates the value for input to the user amplitude estimator 902, which is used in user amplitude estimation as described further with reference to FIG. 10(10 or 11?) below. At every symbol boundary, the accumulator is cleared by multiplexing 944 in a zero.
In order to normalize the accumulator 934, the matched filter output value is scaled by 2 times the reciprocal of an estimate of the innovation variance (2/σ2), through multiplier 932. A running estimate of the innovation variance can be calculated outside the MUDPE 900 a by computing the following running sum: 0.01� the current innovation squared plus 0.99 times the previous value in the accumulator 934.
The normalized matched filter output value for the current chip is provided to the accumulator 934 for the soft symbol output Skm(t). The accumulator 934 also receives the previous accumulated value through delay 914 c, which thereby retains an accumulated value for the soft symbol, incremented on a chip-by-chip basis. The soft symbol output Skm(t) is provided to latch 908 a, which is clocked at the symbol end to store the accumulated output Skm(Fk(t)+L−1) for the user k for a full symbol period.
The soft symbol output Skm(t) is also passed through a bit estimate computing module 904. In one embodiment, the bit estimate computing module 904 implements a non-linear computation, more particularly a piecewise linear approximation to the hyperbolic tangent function. In alternative embodiments, other non-linear computations, or a linear computation may be used for the bit estimation. The resultant bit estimate {circumflex over (b)}km(t) is output to latch 908 b, which is clocked at the symbol end to provide the final bit estimate {circumflex over (b)}km(t+L−1). This latch 908 b provides the soft bit estimate for this user k for this stage m at the end of the symbol period.
The multiplexer 942 controls the predicted a priori bit estimate {circumflex over (b)}km(t+1)−. If (t+1) represents the first chip in a symbol, the multiplexer selects the bit estimate from the previous stage or 0. Otherwise, {circumflex over (b)}km(t+1)−={circumflex over (b)}km(t).
The predicted bit estimate {circumflex over (b)}km(t+1)− is also multiplied 938 by the previously described signature waveform Akhk(t+1). To allow cancellation at the next time step, this prediction is fed forward to the accumulation of the innovation signal for the next time step. The result is the prediction of the user's contribution to the signal for the next chip. This quantity is both fed back through a chip delay 914 b to be summed with the next innovation signal for the next chip (as hk(t)Ak{circumflex over (b)}km(t)−), and also output from the MUDPE 900 a to be added to the predictions of all of the other users.
The MUDPE 900 a also operates in conjunction with the previously introduced multistage processing. To accommodate this, at the beginning of a symbol, accumulator 934 takes its input from the accumulated soft symbol from the previous stage and is selected by multiplexer 940. If there is no previous stage, then a zero is input as the accumulated soft symbol value.
The MUDPE 900 a functionality may be embodied within a receiver. It may be provided as software, or also as hardware, firmware, or any possible combination of hardware, firmware and/or software. The MUDPE 900 a software may also be part of a computer system wherein its instructions are executed by a processor. It may also take the form of a storage medium that stores the software, such as an optical disc in CD or other formats, magnetic storage, flash memory, or others.
It is noted that although conceptually, there is one MUDPE 900 a for each user for each stage, it is also possible to embody multiple logical MUDPEs as a single physical MUDPE 900 b as indicated in
There are several different approaches to combining estimates from different stages together.
According to still another aspect of the present invention, a reconfigurable architecture implements various MUD methods through the selection of an update gain factor and a non-linear function. This architecture (referred to as the Recursive Multi-Stage MUD (RMSM) algorithm architecture) is a multi-stage, sample-level implementation of the basic functions common to various MUD methods. The common functions include multi-stage state prediction and update equations and diagonal gain matrix update equations. The RMSM architecture is configured to a specific MUD method by calculating and applying the time and stage-dependent gain factor that corresponds to that method. The configuration also requires the selection of a method-specific non-linear function used for symbol estimation and decision, and the selection of a method-specific state update equation. MUD algorithms supported by the RMSM architecture include the Mixed Gaussian Demodulator, PIC, Partial PIC, Decoupled Kalman Demodulator, and hybrid multi-stage MUD methods.
By selecting the right set of gain factors, setting various switches, and selecting the desired non-linear decision function, this processing element 900 g can easily be reconfigured to perform a single stage of any of various MUD algorithms, such as PIC, PPIC, DKD, MGMUD, or various hybrid multi-stage methods.
Often, the method-specific set of gain factors can be pre-computed and stored in a table. In its most general form, the size of each table is a [N�M�K] table where N is the number of chips/symbol, M is the number of stages, and K is the total number of users (or channels). The current user, the current processing stage, and the current chip within a symbol determine the indices into a table.
The gain-factor vectors βkm(t) are a function of the current algorithm in effect and the stage number.
For PIC, the gain factors are independent of both the stage and user and are:
where nk={1, . . . , N} is the current chip index within the symbol and N is the number chips per symbol.
The gain factors for the Partial PIC algorithm is similar to PIC but include a stage dependent weighting:
where 0≦λm≦1. Normally, the 1m approaches 1.0 as the stage number increases.
As the name implies, the gain factor for the Block-structured Fixed-gain Kalman Demodulator (BFKD) is simply
where αm takes on a user defined value between 0 and 1. Refer to B. Flanagan and J. Dunyak, "Steady State Kalman Filter Technique for Multiuser Detection," Proceedings of the IEEE Milcom 2003 Conference, Oct. 13–16, 2003, for algorithm description and related references.
Gain factors for the Decoupled Kalman Demodulator ("DKD Gain Factors") can be defined according to J. Dunyak, "A Decoupled Kalman Filter Technique for Multiuser Detection of Pulse Amplitude Modulation CDMA," IEEE Proc. of Wireless and Optical Communications, 2002.
It is assumed that one of several non-linear decision functions can be selected depending on the desired algorithm desired. Candidate functions include the hard-limiter, the sign function, the clipping limiter, erasures, and the hyperbolic tangent. An Erasure is a 3-level function that assigns an output of −A, 0, +A depending on the input signal.
As stated previously, with but a change of a few parameters, the RMSM architecture can be adapted to a specific algorithm. Referring to
For PIC:
For PPIC:
For MG-MUD:
For DKD:
For BFKD:
The user's relative amplitude is a positive number typically less than one which measures the ratio of the user's amplitude to that of the pilot. The user amplitude estimator 1000 will compute a point-estimate of the square of this quantity every symbol, and will then take a convex combination of the point estimate and the prior current estimate of the square of the user's relative amplitude. More specifically, for the parameter α, which in the figure is 0.99, the estimator 1000 takes 0.01 (1−α) times the point estimate plus 0.99 (α) times the prior estimate. The result is clocked at the symbol rate (1014) and the square root of the result (1016) is multiplied by the complex channel estimate to provide the user's complex amplitude estimate.
The point estimate is computed by taking the magnitude squared (1002) of the matched filter accumulator output at the end of a symbol and multiplying it by the reciprocal of the prior estimate (1004) of the user's relative amplitude squared. The result is than multiplied by a scale factor and a bias is removed. Finally the point estimate is limited to the range 0 to 1 (1008). The square root of the new estimate of the user's relative amplitude squared is taken and then multiplied by the complex channel amplitude estimate to obtain the complex amplitude estimate for that user. The scale and bias terms used in the calculation are computed as follows. The magnitude squared of the complex channel estimate (1012) is multiplied by twice the reciprocal of the innovation variance. It is also multiplied by the pilot power, as provided from the pilot power LUT 1010, which may be different depending on the 4-bits denoting the fractional part of the timing offset. The reciprocal is taken of the result (1018) as the bias. The quantity is then multiplied by twice the reciprocal of the innovation variance and the output squared (1006) to produce the scale.
Thus embodiments of the present invention produce and provide improved interference cancellation in a CDMA communications environment. Although the present invention has been described in considerable detail with reference to certain embodiments thereof, the invention may be variously embodied without departing from the spirit or scope of the invention. Therefore, the following claims should not be limited to the description of the embodiments contained herein in any way.
|Cited Patent
|Filing date
|Publication date
|Aug 27, 1990
|Mar 24, 1992
|Zeger-Abrams Incorporated
|Multiple signal receiver for direct sequence, code division multiple access, spread spectrum signals
|Apr 15, 1999
|Aug 27, 2002
|Ericsson Inc.
|Method and apparatus for successive cancellation using multiple signal timings
|Dec 22, 2000
|Dec 13, 2005
|Institut National De La Recherche Scientifique
|Interference suppression in CDMA systems
|Dec 20, 2001
|Apr 10, 2003
|In-Kyeong Choi
|Interference cancellation receiver for use in a CDMA system
|Aug 15, 2002
|Sep 25, 2003
|Industrial Technology Research Institute
|Method and system of interference cancellation in multi-cell CDMA systems
|Abrams, B.S. et al., "Efficiently Structured CDMA Receiver With Near-Far Immunity", IEEE Transactions on Vehicular Technology, Feb. 1995, 44(1), pp. 1-13.
|Dunyak, J. et al., "A Chip-Level Interference Cancellation Technique for CDMA", Submitted to IEEE WCNC, 2003.
|Dunyak, J. et al., "A Decoupled Kalman Filter Technique for Multiuser Detection of Pulse Amplitude Modulation CDMA", Proceedings of the WOC, Jul. 17-19, 2002.
|Dunyak, J. et al., "A Kalman-PIC Multistage Technique to Reduce Multiaccess Interference", Proceedings of the IEEE ISWC, Sep. 23-24, 2002.
|Dunyak, J. et al., "Multiuser Detection Using Interference Cancellation at Each Chip", Proceedings of IEEE ISWC, Sep. 23-24, 2002.
|Dunyak, J., "Multiuser Detection of Pulse Amplitude Modulation CDMA Using a Decoupled Kalman Filter Technique", Submitted to IEEE VTC, Sep. 24-28, 2002.
|Flanagan, B. et al., "Performance of a Joint Kalman Demodulator for Multiuser Detection", Proceedings of IEEE VTC, Sep. 24-28, 2002.
|Lim, T.J. et al., "An Asynchronous Multiuser CDMA Detector Based on the Kalman Filter", IEEE Journal on Selected Areas in Communications, Dec. 1998, 16(9), pp. 1711-1722.
|Suprin, C. et al., "A Kalman Filter Approach to Joint Channel Estimation and Multiuser Detection", Submitted to WOC, Jul. 17-19, 2002.
|Verdu, S., "Multiuser Detection", Cambridge University Press, 1998, pp. 1-393.
|Citing Patent
|Filing date
|Publication date
|May 12, 2004
|Apr 1, 2008
|Benq Corporation
|Method of partial parallel interference cancellation
|Feb 14, 2005
|Mar 24, 2009
|Intel Corporation
|Apparatus and method of canceling interference
|Oct 11, 2007
|Sep 21, 2010
|Mediatek, Inc.
|Signal acquisition/tracking method and correlator for the same
|Jul 27, 2007
|Mar 1, 2011
|Mediatek Inc.
|Signal receiver and method for estimating residual doppler frequencies of signals thereof
|Jan 9, 2007
|Mar 8, 2011
|Qualcomm Incorporated
|Method and apparatus for canceling pilot interference in a wireless communication system
|Aug 16, 2010
|Mar 29, 2011
|Mediatek Inc.
|Signal acquisition/tracking method and correlator for the same
|Jul 29, 2005
|Jan 17, 2012
|Qualcomm Incorporated
|Adaptation of transmit subchannel gains in a system with interference cancellation
|Jan 18, 2011
|Apr 3, 2012
|Mediatek Inc.
|Signal receiver and method for estimating residual doppler frequencies of signals thereof
|Aug 9, 2006
|Feb 26, 2013
|Qualcomm Incorporated
|Method and system for signal reconstruction from spatially and temporally correlated received samples
|Jul 29, 2005
|Mar 26, 2013
|Qualcomm Incorporated
|Joint interference cancellation of pilot, overhead and traffic channels
|Jul 29, 2005
|Apr 16, 2013
|Qualcomm Incorporated
|Channel estimation for interference cancellation
|Jul 29, 2005
|May 14, 2013
|Qualcomm Incorporated
|Traffic interference cancellation
|Apr 19, 2006
|Jun 25, 2013
|Qualcomm Incorporated
|Iterative interference cancellation system and method
|Jun 30, 2005
|Dec 17, 2013
|Qualcomm Incorporated
|Method and apparatus for canceling pilot interference in a wireless communication system
|Oct 7, 2010
|Feb 4, 2014
|Qualcomm Incorporated
|Method and apparatus for canceling pilot interference in a wireless communication system
|Aug 17, 2004
|Jan 20, 2005
|Coralli Alessandro Vanelli
|Method and apparatus for canceling pilot interference in a wireless communication system
|May 12, 2004
|Feb 10, 2005
|Benq Corporation
|Method of partial parallel interference cancellation
|Jun 30, 2005
|Jan 12, 2006
|Coralli Alessandro V
|Method and apparatus for canceling pilot interference in a wireless communication system
|Jul 29, 2005
|Jun 29, 2006
|Jilei Hou
|Joint interference cancellation of pilot, overhead and traffic channels
|Jul 29, 2005
|Jun 29, 2006
|Stefano Tomasin
|Adaptation of transmit subchannel gains in a system with interference cancellation
|Feb 14, 2005
|Sep 21, 2006
|Shimon Moshavi
|Apparatus and method of canceling interference
|Jul 21, 2006
|Mar 15, 2007
|Mahadevappa Ravishankar H
|Reduced complexity soft output demapping
|Apr 19, 2006
|Apr 26, 2007
|Jilei Hou
|Iterative interference cancellation system and method
|Jan 9, 2007
|May 17, 2007
|Qualcomm Incorporated
|Method and apparatus for canceling pilot interference in a wireless communication system
|Jul 27, 2007
|Jan 29, 2009
|Mediatek Inc.
|Signal receiver and method for estimating residual doppler frequencies of signals thereof
|Oct 11, 2007
|Apr 16, 2009
|Mediatek Inc.
|Signal acquisition/tracking method and correlator for the same
|Aug 16, 2010
|Dec 9, 2010
|Kun-Tso Chen
|Signal acquisition/tracking method and correlator for the same
|Oct 7, 2010
|Mar 24, 2011
|Qualcomm Incorporated
|Method and apparatus for canceling pilot interference in a wireless communication system
|Jan 18, 2011
|Jun 16, 2011
|Mediatek Inc.
|Signal Receiver and Method for Estimating Residual Doppler Frequencies of Signals Thereof
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Sep 16, 2004
Owner name: MITRE CORPORATION, THE, VIRGINIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DUNYAK, JAMES P.;FITE, JOHN D.;SHAPIRO, JEROME M.;REEL/FRAME:015793/0067;SIGNING DATES FROM 20040805 TO 20040806
|Mar 9, 2010
|Surcharge for late payment
|Mar 9, 2010
|Fee payment
Year of fee payment: 4
|Apr 11, 2014
|Maintenance fee reminder mailed
|Aug 29, 2014
|Surcharge for late payment
Year of fee payment: 7
|Aug 29, 2014
|Fee payment
Year of fee payment: 8


text:
The CA was in Canada on Saturday, March 21 and had a Q & A with the pillar youth. A number of questions were pre-submitted and from what I understand, there was also supposedly some time at the end for random questions although I didn't listen to the whole session. The one question in particular that he answered was the following:
"Can I be sealed by a living Apostle - just to make sure the rebirth has truly occurred and that I am indeed a child of God - but then go to another church (which I feel is better suited to my likes/dislikes, has more interesting music, etc.) to be perfected as a Christian and become worthy for the return of Christ?"
Go to about the 48 minute mark for his answer to the question. He spends about from 43-48 talking about "earning" salvation. So glad that I left the NAC. As one of my buddies who was part of the text conversation this morning that actually made me aware of this blather so perfectly stated, "They don't even operate a church well, how dare they tell me I'm going to hell."
Here's also the link to the main page with other downloads/documents from the event.


text:
China is planning its first space launch later this year and said the safety measures are meant to prevent a disaster similar to that which destroyed the space shuttle Columbia Feb. 1 as it re-entered the atmosphere. Seven astronauts were killed.
The safety systems are designed to rescue taikonauts from danger or mishaps at any time during their flight, according to an article on the Web site of the Communist Party's People's Daily.
Taikonauts can escape the pod before liftoff via cables, high-speed elevator or ejection seats, the article said. During orbit, they can exit the craft and be picked up by another spaceship.
Upon re-entry, the stage during which Columbia broke apart, taikonauts can escape by ejecting or reducing speed, said the article, entitled "Safety of Chinese Astronauts Guaranteed and Emergency Escape Assured."
Safety also is guaranteed by reliability of the ground control system, which will ensure the craft is placed into the proper orbit and re-enters along the correct route, the article said. The craft's shell also has been reinforced to withstand greater extremes of heat and vibration, it said.
"If these problems are not well solved then it is possible for the accident to happen as it did the US 'Columbia' spacecraft," the report said.
Following four successful unmanned flights of its Shenzhou-series spacecraft, China has said it will put one or more humans into space sometime in the second half of this year.
The space program has close ties to the secretive military and precise launch dates never are announced in advance.
If successful, the launch would make China the third nation in history — after Russia and the United States — to launch a manned spacecraft. China has been training a corps of taikonauts — based on the Chinese word for space — reportedly with Russian help.


text:
I would like to remove any old devices that have not been active in the last 3 months. Is there a way to do this or would it be easier to remove all the devices and let spiceworks find them again?
This topic was created during version 5.1.
The latest version is 7.5.00101.
2 Replies
May 31, 2011 at 3:58 UTC
go to http://community.spiceworks.com/plugin/222
Install the plugin then go to unknowns and delete it. After that scan again your network.
hope help.
May 31, 2011 at 4:40 UTC
I posted virtually the saem qusetion a week ago... got a great answer (although different than above). It was a VBS script (and was currently set in the script for anything older than 1 month, which can easily be changed). I had to make two minor changes to reflect updates in Spiceworks but it works great. Iniitally when I tried it and ran trhe script (after dealign with the couple of minor errors)... the next issue was I had to hit "enter" for each device it wanted to delete.... ended up hitting enter a couple hundred times the first time..... then it occured to me I could output the output to a file... spiceworks_cleanup_script.vbs > output.txt and it saved me having to hit enter over and over...... let me know if you want the script and I can cut and paste or something..... or if you keep diging..... it's on here somewhere because that is where I got it in the first place.
This discussion has been inactive for over a year.
You may get a better answer to your question by starting a new discussion.


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.
Booking FormAsked by Marco on June 27, 2014 at 05:59 AM
Hi, if I want to create a booking form like trenitalia.it has on their website what should I do? Is there a way that if I have option one leaving in Milan and option 2 arriving in Rome when pressing the ok button will bring me the price of my service? Thanks!
JotForm Support
Hi Marco,
I have this form: http://www.jotformpro.com/form/30907307744960. This is an example booking form that shows the same format from the example website. This form has no pricing options for trips. Can you please add some details on how the pricing works to the booking form? Is it based on From and To location? How many locations are involved in the booking form?


text:
Red Sail Sports is Grand Cayman's premier dive and watersports operation offering activities and excursions to suit every vacationer. Super Stingray City trips, Watersports to suit all the family, including exhilarting waverunner safaris, and you can even learn to scuba dive in just one day with a discover scuba resort course! There is always something new and exciting to do at Red Sail Sports. We want to see your videos, so share them with us on Facebook!
Keep up to date with our latest photos, videos, news and specials by following us on Facebook!


text:
An exact electroelastic analysis of generalized plane strain and torsion of a piezoelectric circular tube or bar is presented. The problem is formulated in the state–space framework and exact solutions are derived for the tube or bar subjected to extension, torsion, pressuring, shearing, uniform electric loading and temperature change. Electromechanical coupling is shown to have significant effects on the internal field. Axial extension, radial and circumferential deformations, twisting and warping of the cross–section occur concurrently even when the tube or bar is subjected to simple loading conditions.
Royal Society Login
Sign in for Fellows of the Royal Society
Fellows: please access the online journals via the Fellows' Room
Not a subscriber? Request a free trial
Log in using your username and password
Log in through your institution
Pay Per Article - You may access this article or this issue (from the computer you are currently using) for 30 days.
Regain Access - You can regain access to a recent Pay per Article or Pay per Issue purchase if your access period has not yet expired.


text:
Boudoir Photography Is What I Love, And What I Do.
There is certainly no shortage of boudoir photographers floating around local towns and cities. Just about anyone with a camera, and $49 can register a business name, throw up a Facebook page and claim to be the all knowing Buddha of boudoir photography. This doesn't necessarily mean that you would want to give them your hard earned money, and let them mash their finger on the shutter button a few hundred times as you sit half naked on an old bed, which you have no idea how many bare behinds have occupied before you. Before entrusting a boudoir photographer with your time and money, here a few suggestions that will most definitely make your choice the right one.
What Kind Of Boudoir?
Before you start the daunting task of finding the perfect boudoir photographer, you must find out exactly what type of boudoir you feel comfortable doing. Do you want to do something more traditional in a bedroom with lingerie, or maybe something outside on a beach or in a beautiful meadow? Would be more comfortable doing something less risqué, such as a shoot wearing only an oversized men's dress shirt? Maybe you would prefer finding a photographer who specializes in retro pin-up boudoir, complete with a classic 67 Camaro and bright red lipstick. No matter what kind of boudoir photography you want to do, you must first make that decision so that you can narrow down a list of photographers who specialize in what you want. There are tons of boudoir ideas on the web, but one of my personal faves are boudoir ideas on Pinterest. You will find countless boudoir styles and ideas that you may want to replicate. Once you have an idea of what you want to do, you can then look through the website's of your local boudoir photographers, and try to find someone who has some experience doing what you like.
Should I Find The Best Deal?
First and foremost, I would like to say that boudoir photography is no different than cheese. You get what you pay for. Boudoir photographers may be plentiful, but you can certainly expect a wide variance in their pricing structures. It won't take you long to figure out that the more experienced photographers will most undoubtedly charge for their experience. This is where you need to decide if you are willing to settle for less than the best. My advice is to find the photographer you love and say "To hell with it, I'll save until I can pay for what I want!." This is an experience that you will cherish for the rest of your life, and look back upon in the years to come. If the photographer you want to work with is out of your price range, then suck it up and find a way to make it happen. Work some overtime, have a yard sale, give some plasma or shine up your Volvo and spend your weekends picking up drunk college kids as an Uber driver. Just remember…the smell of Eternity and well vodka in your back seat will eventually fade away, but your photographs will last forever.
It's Gotta Feel Right
Now that you know what kind of boudoir you want to do, found a photographer you love and saved up your money, it's time to meet your photographer. I would highly suggest taking the time to meet with the photographer before you book the shoot. If you haven't realized it yet, you will be stripping down to your skivvies, while letting a complete stranger take pictures of you in an extremely intimate setting. Trust your instincts when you meet, and make sure that you mesh well from the very beginning. If something doesn't feel right from the very start, then chances are you won't be comfortable prancing around in your underwear as they tell you "Give me your sexy smile.". If it doesn't feel right, then find another photographer.
Shoot Day
Once you've found your new photographer BFF, it's time to make sure that you are prepared for the shoot. A great photographer will make this extremely easy on you, and give you some simple and detailed instructions to get prepared. Just in case yours flunked out of photography school, here are a few things to keep in mind.
- Don't wear contacts. Contacts will prevent your eyes from having a sharp clean look in the photographs. Even though you may not be able to see, your eyes will look amazing, which will make it all worth while.
- Wash the bottom of your feet. There's nothing less sexy than a girl with dirty feet. You may end up in a pose with your legs straight up in the air, and you will certainly want to avoid looking like you've been running around in a barn.
- Alcohol is your friend. The last thing you want to do is show up to the shoot as a drunk mess, but there is nothing wrong with having a couple glasses of wine before you pull out your headlights. Some photographers will have wine or champagne handy, but just in case they don't, keep some delicious boxed wine in the trunk of your car.
All-in-all, your boudoir experience should be one of the most memorable days of your life. With the right preparation and the right photographer, I'm certain that you will become a raging boudoir junkie who will eventually put out your own calendar.


text:
I met this fantastic girl that I really like and that I woud love to be with her.
She's very extrovert with everyone , she laughs , plays and hugs almost any person that approaches her.
On the other hand , with me she behaves differently. She is extremely cold and when she approaches a group where I am part of it , she is warm with everyone but me. I really do not exist for her.
It is a weird relationship because for example , we had to talk on the phone a few days ago and we litterly spent 4 hours! on the phone , not because I did not want end the call , but because she was very warm and conversational.
In general , if anything , all I get from her is eye contact , yet this is hard to tell because I also look at her when I can.
All I can think right now is thay maybe she sensed that I had feelings for her, and she does not have feelings back and that this is her way to tell me that I need to move on
Girls, Why an extrovert girl would avoid a guy?
Have an opinion?
What Girls Said 1
Only if she doesn't like him or is very shy due to attraction for this guy.00|00|0
Click "Show More" for your mentions
Most Helpful Opinion(mho) Rate.
Learn more
Learn more
Select as Most Helpful Opinion?
You cannot undo this action. The opinion owner is going to be notified and earn 7 XPER points.


text:
Neoadjuvant Study Investigating Degarelix in Patients Suffering From Prostate Cancer
This study has been completed.
Ferring Pharmaceuticals
Information provided by (Responsible Party):
Ferring Pharmaceuticals
ClinicalTrials.gov Identifier:
First received: January 30, 2009
Last updated: September 27, 2012
Last verified: September 2012
- Full Text View
- Tabular View
- Study Results
- Disclaimer
- How to Read a Study Record
The purpose of this phase 3B trial was to see how well a new trial drug (degarelix) works in terms of reducing the size of the prostate volume in prostate cancer patients who were scheduled to undergo subsequent radiotherapy for treatment of their prostate cancer. Prior to receiving radiotherapy, it is recommended that patients with intermediate to high risk prostate cancer are pre-treated with hormone therapy (so-called neoadjuvant therapy) which is known to reduce the size of the prostate and thereby decrease the required radiation field and enable a more safe and effective treatment. In this trial, participants were randomly selected (like flipping a coin) to receive either degarelix given alone or a standard hormone therapy (combination of goserelin and bicalutamide. The treatment was given for three months and the prostate size was measured by ultra sound at the beginning and at the end of the trial. The participants were required to come to the clinic for 5 or 6 visits during the three months.
|Prostate Cancer
|Drug: Degarelix Drug: Goserelin Drug: Bicalutamide
|Phase 3
|Study Type:
|Study Design:
|Allocation: Randomized
Intervention Model: Parallel Assignment
Masking: None (Open Label)
Primary Purpose: Treatment
|Official Title:
|A Randomised, Parallel Arm, Open-label Trial Comparing Degarelix With Goserelin Plus Anti-androgen Flare Protection (Bicalutamide), in Terms of Prostate Size Reduction in Prostate Cancer Patients of Intermediate-to-high Risk, Who Require Neoadjuvant Hormone Therapy Prior to Radiotherapy (Curative Intent)
Resource links provided by NLM:
Genetics Home Reference related topics: prostate cancer
MedlinePlus related topics: Prostate Cancer
Drug Information available for: Goserelin Bicalutamide Goserelin acetate DegarelixU.S. FDA Resources
Further study details as provided by Ferring Pharmaceuticals:
Primary Outcome Measures:
- Change From Baseline in Prostate Size Based on Trans Rectal Ultra Sound (TRUS) at Week 12 (Full Analysis Set) [ Time Frame: After treatment of 12 weeks compared to Baseline ]TRUS is a method of measuring the size of the prostate.
- Change From Baseline in Prostate Size Based on Trans Rectal Ultra Sound (TRUS) at Week 12 (Per Protocol Analysis Set) [ Time Frame: After treatment of 12 weeks compared to Baseline ]TRUS is a method of measuring the size of the prostate.
Secondary Outcome Measures:
- Change From Baseline in Total International Prostate Symptom Score (IPSS) at Week 4, 8, and 12 [ Time Frame: After treatment of 4, 8, and 12 weeks compared to Baseline ]The IPSS is a tool commonly used to assess the severity of lower urinary tract symptoms (LUTS), and to monitor the progress of the disease once treatment has been initiated. The participant completes a questionnaire containing 7 questions regarding incomplete emptying, frequency, intermittency, urgency, weak stream, straining, and nocturia. Each question is assigned a score of 0-5. The total score is then classified according to the following scale: 0 to 7 = mildly symptomatic; 8 to 19 = moderately symptomatic; and 20 to 35 = severely symptomatic.
- Change From Baseline in Serum Testosterone Levels During the Study [ Time Frame: After treatment of 4, 8, and 12 weeks compared to Baseline ]
- Change From Baseline in Serum Prostate-Specific Antigen (PSA) Levels During the Study [ Time Frame: After treatment of 4, 8, and 12 weeks compared to Baseline ]
- Change From Baseline in Serum Oestradiol Levels During the Study [ Time Frame: After treatment of 4, 8, and 12 weeks compared to Baseline ]
- Change From Baseline in Quality of Life (QoL) Related to Urinary Symptoms at Each Visit [ Time Frame: After treatment of 4, 8, and 12 weeks compared to Baseline ]The IPSS questionnaire included an additional single question to assess the participant's QoL in relation to his urinary symptoms. The question was: 'If you were to spend the rest of your life with your urinary condition the way it is now, how would you feel about that?' The possible answers to this question ranged from 'delighted' (a score of '0') to 'terrible' (a score of '6').
- Number of Participants With Markedly Abnormal Values in Vital Signs and Body Weight [ Time Frame: Baseline to 12 weeks of treatment ]This outcome measure included incidence of markedly abnormal changes in blood pressure (systolic and diastolic), pulse, and body weight. The table presents the number of participants with normal baseline and at least one post-baseline markedly abnormal value.
- Number of Participants With Markedly Abnormal Values in Safety Laboratory Variables [ Time Frame: Baseline to 12 weeks of treatment ]The figures present the number of participants who had abnormal (defined as above upper limit of normal range (ULN)) levels of safety laboratory variables. Only the laboratory variables that had at least one percentage of participants in either group with abnormal value are presented, more variables were included in the study.
|Study Start Date:
|April 2009
|Study Completion Date:
|September 2011
|Primary Completion Date:
|September 2011 (Final data collection date for primary outcome measure)
|Assigned Interventions
Experimental: Degarelix 240 mg/80 mg
The degarelix doses were administered into the abdominal wall every 28 days. A starting dose of 240 mg (40 mg/mL) degarelix was administered on Day 0 as two 3 mL subcutaneous (s.c.) injections. The second and third doses of 80 mg (20 mg/mL) degarelix were administered as single 4 mL s.c. injections on Days 28 and 56, respectively.
Drug: Degarelix
The degarelix doses were administered into the abdominal wall every 28 days. A starting dose of 240 mg (40 mg/mL) degarelix was administered on Day 0 as two 3 mL subcutaneous (s.c.) injections. The second and third doses of 80 mg (20 mg/mL) degarelix were administered as single 4 mL s.c. injections on Days 28 and 56, respectively.
Other Names:
Active Comparator: Goserelin (3.6 mg) + bicalutamide (50 mg)
On Day 0, the participants began once-daily oral (p.o.) treatment with bicalutamide as anti-androgen flare protection. This treatment continued for 2 weeks after the first dose of goserelin (i.e. 17 days in total).
On Day 3, the first goserelin implant was inserted s.c. into the abdominal wall. The second and third doses of goserelin were administered on Days 31 and 59, respectively.
Drug: Goserelin
Goserelin implants (3.6 mg) were inserted s.c. into the abdominal wall every 28 days. The first dose was administered on Day 3. The second and third doses of goserelin were administered on Days 31 and 59, respectively.
Other Name: ZoladexDrug: Bicalutamide
On Day 0, participants began once-daily per-oral (p.o.) treatment with bicalutamide (50 mg) as anti-androgen flare protection; this treatment continued for 14 days after the first dose of goserelin.
Other Name: Casodex
|Ages Eligible for Study:
|18 Years and older (Adult, Senior)
|Sexes Eligible for Study:
|Accepts Healthy Volunteers:
Inclusion Criteria:
- Patient has given written informed consent before any trial-related activity is performed.
- Has a confirmed prostate cancer in which this type of treatment is needed.
Exclusion Criteria:
- Previous treatment for prostate cancer
- Previous trans-urethral resection of the prostate
- Patients who are lymph node positive or have other metastatic disease
- Use of urethral catheter
- Current treatment with a 5-alpha reductase inhibitor or α-adrenoceptor antagonist.
- History of severe untreated asthma, anaphylactic reactions, or severe urticaria and/or angioedema.
- Hypersensitivity towards any component of the investigational product
- Other previous cancers within the last five years with the exception of prostate cancer and some types of skin cancer.
- Certain risk factors for abnormal heart rhythms/QT prolongation (corrected QT interval over 450 msec., Torsades de Pointes or use of certain medications with potential risk)
- Clinical disorders other than prostate cancer including but not limited to renal, haematological, gastrointestinal, endocrine, cardiac, neurological, psychiatric disease, alcohol or drug abuse or other conditionals as judged by the investigator.
Contacts and Locations
Choosing to participate in a study is an important personal decision. Talk with your doctor and family members or friends about deciding to join a study. To learn more about this study, you or your doctor may contact the study research staff using the Contacts provided below. For general information, see Learn About Clinical Studies.
Please refer to this study by its ClinicalTrials.gov identifier: NCT00833248
Hide Study Locations
Please refer to this study by its ClinicalTrials.gov identifier: NCT00833248
Hide Study Locations
|United States, Alabama
|Alabama Research Center
|Birmingham, Alabama, United States, 35209
|Urology Centers of Alabama
|Homewood, Alabama, United States, 35209
|United States, Alaska
|Alaska Urological Association
|Anchorage, Alaska, United States, 99508
|United States, Arizona
|Arizona Urologic Specialists
|Tuscon, Arizona, United States, 85712
|United States, California
|Orange County Urology
|Lagua Hills, California, United States, 92653
|Tri-Valley Urology Medical Group
|Murrieta, California, United States, 92563
|United States, Connecticut
|Connecticut Clinical Research Center
|Middlebury, Connecticut, United States, 06762
|United States, Florida
|South Florida Medical Research
|Aventura, Florida, United States, 33180
|DCT -Celebration, LLC dba Discovery Clinical Trials
|Celebration, Florida, United States, 34747
|Pinellas Urology Inc.
|St. Petersburg, Florida, United States, 33710
|Palm Beach Urology Associates
|Wellington, Florida, United States, 33449
|United States, Indiana
|Summit Research Institute
|Bloomington, Indiana, United States, 47403
|Northeast Indiana Research
|Fort Wayne, Indiana, United States, 46825
|United States, New Jersey
|Urology Center Research Institute
|Englewood, New Jersey, United States, 07631
|United States, New Mexico
|Urology Group of New Mexico
|Albuquerque, New Mexico, United States, 87109
|United States, New York
|Premier Medical Group of Hudson
|Columbia, New York, United States, 12601
|University Urology Associates
|New York, New York, United States, 10016
|United States, Tennessee
|Urology Associates
|Nashville, Tennessee, United States, 37209
|United States, Virginia
|Urology of Virginia
|Norfolk, Virginia, United States, 23502
|Hopital Jean Minjoz
|Besancon, France, 25000
|Institut Bergonié
|Bordeaux Cedex, France, 33076
|Centre Francois Baclesse
|Caen, France, 14000
|CHU Henri Mondor
|Creteil, France, 94000
|Centre Oscar Lambret
|Lille, France, 59020
|Centre Leon Berard
|Lyon, France, 69008
|Hopital de la Timone
|Marseille, Cedex 5, France, 13385
|CRLC Val d'Aurelle Oncology Radiotherapy
|Montpellier, France, CX5 34298
|Hôpital Tenon
|Paris, France, 75000
|Hôpital Saint Louis, Radiotherapy Departement
|Paris, France, 75010
|Clinique Francheville
|Perigueux, France, 24000
|CHU La Milétrie, Oncology Radiotherapy
|Poitiers, France, 86000
|Centre de Lutte Contre le Cancer Nantes-Atlantique Centre René Gauducheau
|Saint Herblain Cedex, France
|Institut de Cancérologie de la Loire
|Saint Priest en Jarez, France, CX 42271
|Clinique Saint Brieuc
|St Brieuc Cedex, France, 22015
|Centre Paul Strauss
|Strassbourg, France, 67085
|Centre de radiologie Saint Louis
|Toulon, France, 83100
|Clinique du Parc
|Toulouse, France, 31400
|Villejuif, France, 94805
|Charité-Universitätsmedizin, Campus Benjamin Franklin Klinik für Urologie
|Berlin, Germany, D-12203
|Städtisches Klinikum Braunschweig
|Braunschweig, Germany, D-38126
|Universitätsklinikum Dresden, Klinik und Poliklinik für Urologie
|Dresden, Germany, D-01307
|Universitätsklinikum Ulm, Klinik für Strahlentherapie und Radioonkologie
|Ulm, Germany, D-89081
|General University Hospital of Alexandroupolis
|Alexandroupolis, Greece, 68100
|General Hospital of Athens, "Sismanogleio", University of Athens, Marouse
|Athens, Greece, 15126
|University General Hospital of Loannina, Medical School
|Loannina, Greece, 45110
|University General Hospital of Patras
|Patras, Greece, 26504
|Albert Schweitzer Ziekenhuis, Ioc., Dordwijk
|Dordrecht, Netherlands, 3318 AT
|Groene Hart Ziekenhuis, urology
|Gouda, Netherlands, 2803 HH
|Franciscus Gasthuis, Dept. urology
|Rotterdam, Netherlands, 3045 PM
|Maastad Ziekenhuis, Ioc. Clara
|Rotterdam, Netherlands, 3078HT
|Vlietland Ziekenhuis, Dept. urology
|Schiedam, Netherlands, 3118 JH
|St. Elisabeth Ziekenhuis Tilburg
|Tilburg, Netherlands, 5000 LC
|Hospital de la Santa Creu i Sant Pau
|Barcelona, Spain, 08025
|Hospital Universitari Vall d´Hebron
|Barcelona, Spain, 08035
|Hospital Universitario La Paz
|Madrid, Spain, 28046
|Fundación IVO
|Valencia, Spain, 46009
|United Kingdom
|Kent Oncology Centre Maidstone Hospital
|Maidstone, Kent, United Kingdom, ME16 9QQ
|Mount Vernon Cancer Center
|Northwood, Middlesex, United Kingdom, HA6 2RN
|Oncology Royal United Hospital Bath NHS Trust
|Bath, United Kingdom, BA1 3NG
|Addenbrooke's Hospital, Oncology Centre
|Cambridge, United Kingdom, CB2 0QQ
|St. James' University Hospital
|Leeds, United Kingdom, LS9 7TF
|The Royal Marsden NHS, Foundation Trust
|London, United Kingdom, SW3 6JJ
|Charing Cross Hospital
|London, United Kingdom, W6 8FR
|Northern Centre for Cancer Treatment, Newcastle General Hospital
|Newcastle upon Tyne, United Kingdom, NE4 6BE
|Southhampton General Hospital, Cancer Care Directorate, Southhampton Oncology Centre
|Southhampton, United Kingdom, SO16 6YD
|Velindre Hospital, Cardiff University
|Whitchurch, United Kingdom, CF14 2TL
Sponsors and Collaborators
Ferring Pharmaceuticals
|Study Director:
|Clinical Development Support
|Ferring Pharmaceuticals
More Information
Publications automatically indexed to this study by ClinicalTrials.gov Identifier (NCT Number):
Additional relevant MeSH terms:
ClinicalTrials.gov processed this record on August 18, 2017
Publications automatically indexed to this study by ClinicalTrials.gov Identifier (NCT Number):
Mason M, Maldonado Pijoan X, Steidle C, Guerif S, Wiegel T, van der Meulen E, Bergqvist PB, Khoo V. Neoadjuvant androgen deprivation therapy for prostate volume reduction, lower urinary tract symptom relief and quality of life improvement in men with intermediate- to high-risk prostate cancer: a randomised non-inferiority trial of degarelix versus goserelin plus bicalutamide. Clin Oncol (R Coll Radiol). 2013 Mar;25(3):190-6. doi: 10.1016/j.clon.2012.09.010. Epub 2012 Dec 17.
|Responsible Party:
|Ferring Pharmaceuticals
|ClinicalTrials.gov Identifier:
|NCT00833248 History of Changes
|Other Study ID Numbers:
2008-005232-33 ( EudraCT Number )
|Study First Received:
|January 30, 2009
|Results First Received:
|August 27, 2012
|Last Updated:
|September 27, 2012
Additional relevant MeSH terms:
Prostatic Neoplasms
Genital Neoplasms, Male
Urogenital Neoplasms
Neoplasms by Site
Genital Diseases, Male
Prostatic Diseases
Androgen Antagonists
Hormones, Hormone Substitutes, and Hormone Antagonists
Physiological Effects of Drugs
Antineoplastic Agents, Hormonal
Antineoplastic Agents
Hormone Antagonists
ClinicalTrials.gov processed this record on August 18, 2017


text:
About Gran Torres Edit
Gran Torres is a Spanish orange liqueur. Gran Torres is made in Spain from Valencia orange peel steeped in aged brandy, flavoured with herbs such as thyme and rosemary, and with orange blossom honey. Cinnamon, cardamom, cloves, coffee and molasses also add to the flavour.
It is aged in oak barrels.
Its orange flavour is more subtle than in other orange liqueurs; more of the brandy taste comes through.


text:
Printed Circuit Board Assembly & PCB Design Forum
SMT electronics assembly manufacturing forum.
Views: 2125
Does anyone have any information regarding troubleshooting f... - Jun 15, 2014 by chantel
There are two IR sensor (one for tipdown detector and other ... - Jun 19, 2014 by haiae
Thanks so much. That was definitely the issue and I was deal... - Jul 01, 2014 by chantel
Become a member now and receive the value and benefits of membership.


text:
Unicircuit, Inc. serves the Semiconductor and ATE (Automated Test equipment) marketplace of which is continually faced with the following issues: timing, series resistance, planarity, and structural strength (to name a few). Unicircuit, Inc. meets these challenges head on with our core competencies of hybrid / composite printed circuit boards utilizing high speed materials; carbon reinforced materials, impedance matching, and decoupling approaches that are unparalleled in the industry.
Unicircuit, Inc. ability to manufacture custom products for DUT (Device under Test), DIB (Device Interface Board), PIB (Probe Interface Board), Burn in Boards, and Handler applications in compressed cycle times, has played an intergral role in Unicircuit, Inc. growth over the last 29 years.
The continued development of advanced manufacturing techniques ensures that Unicircuit, Inc. remains ahead of the technology curve as new component footprints (of which are now at .4mm pitch) are implemented in OEM designs.


text:
- List your item for as low as $30 - Advertise your item in both print and online
Create your ad
Browse: See our comprehensive list of earthmoving equipment specifications.
Compare: Try the compare button to see multiple specs side-by-side
Enquire: Hit the enquire button to talk to a dealer about your selection
Ron Horner has found another old-school excavator classic, this time a 1968 Kato 750G.+MORE
HASTINGS DEERING USED EQUIPMENTArcherfield, QLD, 4108
Trade Safely. Use our anti-scam guide to protect yourself.
Sorry, map view is not available right now. Please search by seller location to enable map view.
6.7m Hensley Bucket. AFFF tyre suppression system. FSI fire suppression. Lockable battery isolator. 2 x 9kg fire extinguishers. First Aid Kit. AM/FM radio with MP3. Turbo Timer.
Rotating amber beacon & guard engine air 770L pre cleaners & voltage reducer
The item you are attemping to add to compare is a different subtype to the items(s) in your list.
Only items of the same subtype may be compared.


text: Burda 5885; ca. 1987; Drop Waist Dress in three versions Contents[show] Links to reviews/blog postsEdit Sources/VendorsEdit Vintage Vignettes GalleryEdit WishlistEdit Retrieved from "http://vintagepatterns.wikia.com/wiki/Burda_5885?oldid=612877" 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: Vintage Sewing Patterns Burda 1980s Drop Waist Long Sleeves Collarless Standing Collar Back Zippered Bow Stretch Knits Dresses Flared Skirts Flounce Gathers Tiers Bias Binding Contrast Jewel Neck Band Trim Button Trim Sleeveless Chemise Dresses 1987 Add category Cancel Save