text:
Relevant offers
What's On
A lot of you will be familiar with comedian-personality Jesse Mulligan.
He's the bloke who was plucked from the relative obscurity of TV3s 7 Days to become one of the original anchors of the ill-fated Seven Sharp programme on TV One. The anchors must have weighed heavily on the show, because Jesse is the only one left. Greg Boyed showed excellent survival skills by opting to leave and return to being a late-night newsreader, where he does an excellent job.
Alison Mau did not have her contract renewed, something she found out from the media, and as we all know now, in came Mike Hosking and Toni Street to save the sinking ship. That's been pretty successful with much improved ratings, but it has left Jesse as very much the odd man out in the new arrangement. Toni and Mike seem pretty chummy, with their ever so-carefully coiffured hairstyles competing for star attraction. Personally I like Toni's better, with Mike's ruffled little thatch looking more messy than inspired.
That leaves Jesse looking very much the spare part. He joins Toni and Mike on that previously crowded bench on Mondays and Fridays, being out in the field doing all sorts of assignments midweek.
Rumour has it that Jesse was none too happy about staying on Seven Sharp [and who could blame him?], so as a sweetener he was given the extra incentive of hosting Best Bits [Thursdays 8.30pm] Never mind poor old Te Radar, who did a fine job in the first series, he was a bit like Warriors' coach Matt Elliot - no longer wanted.
Naturally it was worth having a look at this fun half-hour of Kiwi humour, which TVNZ bills as "Jesse Mulligan and guests poke fun at the most ridiculous moments from this week's television and more".
The opening sequence suggests all manner of madcap humour about to explode onto our screen. Instead we get the biggest panel and longest bench on telly. Obviously Jesse feels at home with lots of panellists and there are four of them to keep him from feeling lonely.
We start off with a clip from Motorway Patrol "to show just how romantic some Kiwi blokes are" [sarcasm is a staple part of the show]. Some guy who gets pulled over decides to take advantage of the camera and proposes to his front-seat passenger.
He even has an engagement ring, so she quickly accepts. I did see the programme and it looked contrived then, and even more so when it was shown again on Best Bits. The panellists guffawed at that one though.
"If you've just tuned in, that was the finale of The Bachelor, South Auckland," Jesse says with a grin. The panel guffaw at that too.
The Aussie panellist on the show points out that they have to show a percentage of Kiwi shows over the pond and says "are almost all cop shows which show Kiwis as being drunk and violent. In fact I'm waiting here now thinking I'm going to be glassed any time". This gets the loudest guffaws of the night from the panellists.
That triggers a few more anecdotes from the other panellists. One tells of watching two episodes of Motorway Patrol when he was living in Britain. "I remember thinking, I love that piece of road!" Sadly, despite more panellist guffaws, neither Mrs Brown nor I loved that so-called joke.
She reckoned it was already obvious that Jesse's quintet obviously thought the show should be about them, and their feeble attempts at humour, rather than poking the borax at silly things on the telly. Mrs B doesn't miss much [I can vouch for that, she does take steady aim] and she was right. What transpired was a procession of me, me, me jokes which turned it into one of those horrible American comedian panels shows which comments on the "World's Dumbest Criminals" or similar.
Yet another panellist explained why lover boy was pulled over. "He had no warrant of fitness, no rego and he was on a restricted licence."
Cue Jesse looking into the camera ready to unleash yet another of his mortal lines: "Tell you what, you want a restricted licence, try a marriage licence."
This was clearly hilarious for the other people in the studio and the panellists. They laugh hard and long and burst into scripted, sorry, spontaneous applause.
Jesse beams. Another panellist predictably asks him a follow-up question.
"So, how long have you been married for?"
"About three weeks."
They laughed and guffawed at that one!
I didn't like it. Neither did Mrs B. And neither did her dear Mother, who is here to brighten up our existence for an all-too-brief two weeks. Jesse has one fatal drawback for a comedian - he's not funny.
He would do well to look at some old Clive James Show tapes.
- The Timaru Herald
Sponsored links
South Canterbury dates confrimed for Jordan Luck's reunion with old band
Family fundraising for daughter's US cerebral palsy operation
Exhibition 'a good learning experience' for students
Rural brigades struggle to get volunteers, fire engines – and even water
Mamma Mia! It's a big job keeping track of over 1000 costumes
Roncalli College casts ogre, fairies and a dragon in upcoming Shrek show
South Canterbury weekend pass: July 22-24, 2016
Timaru Miss Universe NZ contestant says competition has made her 'better version of herself'
Former Temuka mayor Joe Clarke turns 90
The Hoover Diaries: the Mockers, murders and 1980s Timaru
Film compares modern life in Timaru with the 1980s
South Canterbury weekend pass: July 15-17, 2016
South Canterbury weekend pass: July 8-10, 2016
Significant drop in speeding offences in South Canterbury
Constable Ben Grant named NZ Police Sport Official of the Year
Timaru cafe scoops national pie award
Concerns raised over community policing resources
Couple caught having sex in Timaru's The Warehouse car park
Editorial: Have church, willing to negotiate
Crash victim's body heading home to Jordan
Rising basketball star Bianca Small aims to impress in the US
Residents gradually warming up to idea of home-heating appraisals
More jobs if wool scour firms merge
Charging battery bursts into flames
White crosses mark those who fell in WWI
Dream for Timaru Titans league team fails to get off the ground
Art feeds the soul at Bread of Life
Team granted funding to plan response for Alpine Fault megaquake
Couple caught having sex in Timaru's The Warehouse car park
Safety box cutter called 'health and safety gone mad'
Disappointing end to Crusaders season curtails Blackadder's era
Matthews appointed NZ Heartland coach
North Otago helicopter company founder dies
Timaru cafe scoops national pie award
Constable Ben Grant named NZ Police Sport Official of the Year
Farming at a frantic pace at Glenbrook Station


text:
Hi ,
We're in the early stages of planning a 15 day European trip. starting and ending in Frankfurt We would like to get to Munich, Salzburg, Lucerne, & Rome. Is 15 days sufficient? Any suggestions are appreciated. Thanks very much,
Recent ActivityView all Europe activity »
- 1 Southern Italy
- 2 Iceland: When to Go
- 3 Ian McKellen & Patrick Stewart in No Man's Land
- 4 England in a week - what's realistic
- 5 French Gov't Passes New Labor Law Despite...
- 6 Our time in Rome
- 7 Paris, the Bernese Oberland, and Bavaria with 2 kids
- 8 Les bons plans de Whathello
- 9 Day Trip from Lausanne
- 10 France 2016: Paris--Avignon--Provence--Nice
- 11 Restaurants and sights in Puglia
- 12 Avoid Viking River Cruises
- 13 Visiting St. Mark's Basilica in Venice
- 14 Enjoying England for a year!
- 15 Trip Report with Kids: Germany/Austria/Benelux
- 16 French Riviera
- 17 0ne day trip from Lisbon to Porto
- 18 Stonehenge and Bath
- 19 Decrepit dame does Deutschland
- 20 3 hours or so in Milano (quick stopover)
- 21 Greek Itinerary Help: 8 days Early November w/ 12-yr-old
- 22 Seeking apartment recommendations in a Chanti village
- 23 Tuscan Winery Suggestions
- 24 transfer from Civitavecchia to Fiumicino airport
- 25 Car necessary in Wengen, Switzerland
15 days in Europe
Hi ,
Report Abuse
Start in Frankfurt but end in Rome to save a day.
It may not be more $$$
Report Abuse
To elaborate on bob's reply, that's a lot of places in 2 weeks. If you get open jaw plane tickets, into Frankfurt, out of Rome, (multi-city on airline websites), then you'll save money and precious time by not having to backtrack. Open-jaws tickets should cost about the same as round trip.
Are you coming from North America? If so, you'll probably fly overnight -- losing one night there. And you'll probably be jet-lagged and sleepy the first couple of days. So allow a little extra time at your first stop.
You can take the train directly from Frankfurt airport to Munich. Might as well spend that first jet-lagged day getting to some place you want to be.
Report Abuse
Or get a connecting flight - they leave pretty much hourly.
Report Abuse
LOL, Frankfurt to Rome and return can be driven in about 3 days return. The only issue is if you want to stop for any worthwhile periods of time anywhere along the way. But yeah, it can be done if you want to.
For my money, spending less than 4 nights in any place is not best use of time. So with 15 days if that includes your arrival and departure days which are already basically a write off, that leaves you with 13 nights which I would consider a minimum amount of time to spend visiting 3 places.
The two commonest mistakes travellers make are packing too much and trying to see/do too much in too little time.
Report Abuse
Thanks very much for all the help. We're probably going to take Salzburg out as it's not too far from Munich and we can day trip to the Linder Hoff , etc.
Report Abuse
Also, we have to back track to Frankfurt to pick up My Mother to fly back to the US with us (she'll spend the 2 weeks with my uncle (her brother) while we're vacationing. I know, I'm a good son..LOL
Report Abuse
I'm with the connecting flight group. Take a flight to the place you want to go rather than coupling a long train ride with the long flight to get to Frankfurt.
How do you plan to travel on the ground? I would consider flying into Munich, daytripping from Munich to Salzburg and then flying to Rome. I know I left out Lucerne but there is always next time to ride the cog train or cable car up Mt Pilatus.
Report Abuse
I missed the later post about coming back to Frankfurt to pick up Mom. Reverse the order. See if you can get a Lufthansa flight to Rome that connects in Frankfurt (Lufthansa's hub), drop off Mom, go on to Rome, fly back to Munich then back through Frankfurt.
Sign in to comment.

subset: commoncrawl


text:
Therapists in Philadelphia County, PA
- Any Insurance
- ACI Specialty Benefits
- APS Healthcare
- Aetna
- Alliance
- AmeriHealth
- American Behavioral
- Anthem
- AvMed
- Beacon
- Beech Street
- Behavioral Health Systems
- Blue Care Network
- Blue Cross
- Blue Shield
- BlueCross and BlueShield
- CHIP | Children's Program
- Cascade Health
- Ceridian
- ChoiceCare
- Cigna
- Cofinity
- ComPsych
- Connecticare
- Corphealth
- Coventry
- EmblemHealth
- Empire BlueCross
- Fidelis
- First Choice Health
- First Health
- Great-West
- Guardian
- HAP | Health Alliance Plan
- HIP | Health Plan of New York
- Harvard Pilgrim
- Health Choice
- Health Net
- HealthFirst
- HealthLink
- HealthPartners
- Highmark
- Holman Group
- Horizon Healthcare
- Humana
- Integrated Health Plan
- Interplan
- Kaiser
- LifeSynch
- MHNet Behavioral Health
- Magellan Behavioral Health
- MagnaCare
- Medica
- Medicaid
- Medical Mutual
- Medicare
- Meridian
- Military OneSource
- Molina
- Multiplan
- Neighborhood Health Plan
- New Directions
- Optima
- Optum
- Oxford
- PacifiCare
- PacificSource
- Penn Behavioral Health
- PreferredOne
- Premera
- Presbyterian
- Providence
- PsychCare
- QualCare
- Regence
- Reliant
- Sagamore
- TriWest
- Tufts
- United
- ValueOptions
- WellCare
- WellPoint
- Addiction
- Adoption
- Alcohol Abuse
- Alzheimer's
- Anger Management
- Antisocial Personality
- Anxiety
- Asperger's Syndrome
- Autism
- Behavioral Issues
- Bipolar Disorder
- Borderline Personality
- Career Counseling
- Child or Adolescent
- Chronic Impulsivity
- Chronic Pain
- Chronic Relapse
- Codependency
- Coping Skills
- Depression
- Developmental Disorders
- Divorce
- Domestic Abuse
- Domestic Violence
- Drug Abuse
- Dual Diagnosis
- Eating Disorders
- Emotional Disturbance
- Family Conflict
- Gambling
- Grief
- Infertility
- Infidelity
- Intellectual Disability
- Internet Addiction
- Learning Disabilities
- Life Coaching
- Marital and Premarital
- Medical Detox
- Medication Management
- Men's Issues
- Narcissistic Personality
- Obesity
- Obsessive-Compulsive (OCD)
- Oppositional Defiance
- Parenting
- Peer Relationships
- Pregnancy, Prenatal, Postpartum
- Racial Identity
- Relationship Issues
- School Issues
- Self Esteem
- Self-Harming
- Sex Therapy
- Sexual Abuse
- Sexual Addiction
- Sleep or Insomnia
- Spirituality
- Sports Performance
- Substance Abuse
- Suicidal Ideation
- Teen Violence
- Testing and Evaluation
- Transgender
- Trauma and PTSD
- Traumatic Brain Injury
- Video Game Addiction
- Weight Loss
- Women's Issues
Treatment Orientation
- Acceptance and Commitment Therapy (ACT)
- Art Therapy
- Attachment-based
- Coaching
- Cognitive Behavioral (CBT)
- Culturally Sensitive
- Dialectical (DBT)
- Eclectic
- Emotionally Focused
- Existential
- Expressive Arts
- Family / Marital
- Family Systems
- Feminist
- Forensic Psychology
- Gestalt
- Gottman Method
- Humanistic
- Hypnotherapy
- Imago
- Integrative
- Interpersonal
- Intervention
- Jungian
- Mindfulness-based (MBCT)
- Motivational Interviewing
- Multicultural
- Narrative
- Neuro-Linguistic
- Neurofeedback
- Play Therapy
- Psychoanalytic
- Psychodynamic
- Psychological Testing and Evaluation
- Relational
- Sand Play
- Solution Focused Brief (SFBT)
- Somatic
- Transpersonal
- Trauma Focused
Online Therapy
See Nearest
"Welcome! Contacting a therapist can be your first step to a happier, more balanced life. Whether you've been struggling with a painful past or are unsure of your current path in life, I provide practical, nonjudgmental feedback in a warm, welcoming atmosphere."
Philadelphia, Pennsylvania 19145
"I am a behavior specialist who uses applied behavior analysis to help individuals with ASD and other developmental disabilities and/or behavioral disorders. I work along with the family to create and implement the most suitable treatment plan necessary for learners to engage in socially-appropriate behavior and live higher-quality lives."
Philadelphia, Pennsylvania 19153
"Are you stressed to the breaking point at school or work? Are you suffering from anxiety or depression? Do you often experience difficulty or turmoil in your relationships? Are you going through a life transition such as a move, divorce, or death of a loved one, and having a hard time adjusting? Perhaps you are not having any major problems, but wish you could feel happier, more fulfilled or be more productive. Or maybe you need to make some big life decisions and don't know where to start."
"I believe that everyone should have access to quality affordable therapy. With thirty five years of experience, I work with individuals and couples, straight and gay, African Americans, Caucasians and other racial and ethnic groups as well as other therapists helping with their unique life challenges. I also work with those having chronic illness and cancer. Challenge and loss are inevitable-- whether they be associated with love, family, health or trust or over how we hoped our life would turn out. Living well means learning a repertoire to deal with challenges so we don't remain stuck, angry or depressed."
Philadelphia, Pennsylvania 19119
"When working with clients, I strive to tailor each session to meet the clients where they are, and serve their needs as best suited for them. My passion lies in sexuality, and working with my clients to navigate their way through various issues such as, intimacy, gender identity, sexual dysfunction and understanding healthy sexual practices. *At this time I do not accept insurance.*"
"I see myself as a life consultant and partner in change. Clients who work with me are tired of feeling stuck in behaviors or emotional ruts that don't afford them freedom to live well. Trying new things, taking risks and experimenting with new ways of thinking, feeling and behaving are all part of the therapy. The client who sees me is ready, willing and, even if a bit scared, ready to find a centered self."
"With over 40 years of experience, Therapy Center of Philadelphia (formerly Women's Therapy Center) nurtures individual well-being and personal growth by providing high-quality, affordable psychotherapeutic services in a feminist environment to women and transgender communities. We create this feminist environment through supporting client empowerment, collaboration, a de-emphasis on diagnosis, and on the recognition that the way in which we experience oppression is influenced and shaped by our concurrent identities. You and your therapist determine together what your goals are and amount of time you need in therapy."
"Having the tools we need to navigate our way through life's challenges is often the key to greater happiness and fulfillment. I believe that human beings start from a place of health and resilience, and when we have difficult or traumatic experiences, we can often be sidetracked by self-doubt, anxiety, depression and more. This can make life and relationships feel overwhelming, confusing and at times unmanageable. Therapy provides a safe space to explore and understand ourselves better while developing the tools we need to move forward. Through this process, we can begin to heal from the past while creating a more intentional future."
"I am a licensed, general clinical psychologist who enjoys helping others work through difficult times in their lives, achieve their goals, and maximize their enjoyment and fulfillment in their lives. I use relationship-based, culturally sensitive, practical, cognitive, mindfulness, and strength-based strategies that have been validated by research to affect positive changes in clients with whom I have the pleasure of working."
Philadelphia, Pennsylvania 19127
"The desire to be known, and to know oneself, is what motivates people to seek therapy. Working together, we can explore the meaning of your own internal experience as it relates to the external world. The therapeutic relationship is one of collaboration - I believe the answers are within each person, waiting to be known. It is important to create a safe, comfortable space for clients to explore what motivated them to begin therapy. Humor, when appropriate, can assist in expanding our perspective. In this space, clients can best integrate feelings and experiences to create more of the life they want."
Philadelphia, Pennsylvania 19146
"I have over 20 years experience working with ages 2-80 providing unique individualized treatment."
"Hello! Welcome- feel free to look around. Often people find themselves to be stuck or unhappy and they don't know how they got there. Or maybe there is a specific problem you're dealing with and you need an outside perspective and unbiased help working through it and getting back to a more comfortable and productive place. I consider therapy a natural and helpful extension of your regular daily life."
"Deciding to begin psychotherapy is one of the kindest and most important choices you can make for yourself. It can be a turning point in your life, but it can also feel scary to talk to someone you don't know well. I provide a warm, safe, confidential environment where I will listen carefully and where we will work together to understand and resolve the issues you are struggling with--both in terms of how they affect your current life and in terms of how they became issues in the first place."
Philadelphia, Pennsylvania 19147
"My client and service focus is on individuals or entities seeking treatment, psychological evaluations, risk assessment, expert witness representation, and related services for sexual misconduct, sexual abuse, sexual victimization, or trauma. Other areas of specialty include assessment of violence; standards of professional practice; program development; supervision and training of forensic practitioners; treatment or supervision of professionals and clergy with sexual misconduct; pretrial defendants; juveniles delinquency and sexual offending; and supervision or training of clinical personnel involved in various relevant psychological, civil, or criminal justice interventions. Also, I have extensive training in treatment of general psychological conditions as well as providing psychological and psycho-educational evaluations."
"I believe it is the relationship in therapy that is truly healing. Honesty, compassion and sometimes a sense of humor can be powerful medicine. I enjoy working with people who are truly ready to make some changes in their life, even if they're terrified to do so."
Philadelphia, Pennsylvania 19146
"My speciality is working with individuals experiencing issues with panic, phobias, anxiety, depression, over-eating, grief and trauma. My approach is to first identify coping strategies to deal with the current stress and emotional strain by focusing on strengths and existing coping mechanisms. Together, we sort out the underlying problems and identify more effective coping strategies to deal with every day stressors and overwhelming emotional reactions to current and past trauma. I think the relationship between therapist and client is really important for growth and change; and do my best to provide a warm, natural, humorous and relaxed atmosphere."
Philadelphia, Pennsylvania 19118
"Life can be difficult at times, sometimes overwhelming. We may not trust ourselves to walk the path that is best for us, second-guessing and blocking our innate knowing of what is right and wrong. I work with adults, children and couples, providing a safe environment of warmth and unconditional positive regard, so that each person can have the space to discover who he or she is and what steps are needed to better manage conflicts. I work with those suffering from low self-esteem, trauma, relational and transition issues, chronic pain and addiction."
"Do you want to convert negative energy and relationships into more positives forces in your life? Are you struggling with feelings of sadness, stress, or low self-esteem and do not feel you are living a fulfilled life? Self-awareness is an important first step is creating the life you want for yourself. Through our work you will come to a better understanding of yourself and the origin of your often painful feelings. Additionally, our work will provide relief from these feelings in order to make room for more healthy behaviors and relationships."
Philadelphia, Pennsylvania 19104
"For more than 30 years, I have been helping people thrive in a changing world. As a psychologist, I have learned that when someone feels stuck, unhappy or unproductive, that person is often trying to solve the wrong problem. I help individuals and couples identify the problems they really need to solve, teach them the skills they need to solve them help them and refocus their lives in a positive direction. ."
"...To see ourselves as others see us..." Most people enter therapy after they experience some event which feels like the proverbial "final straw". Their immediate goal is to feel better as soon as possible. My goal is to help them achieve that. I accomplish this via ongoing conversations, which help people see themselves, others and their difficulties more clearly. Human beings often have difficulty solving problems because we do not ask ourselves the right questions. Additionally, we have both ends of the conversation in our heads. We ask ourselves the same questions and answer ourselves with the same"


text: Home > Sports Bulls coach Thibodeau receives 4-year extension Reuters Posted at Oct 02 2012 10:09 AM | Updated as of Oct 02 2012 10:19 PM Share Facebook Twitter GPlus LinkedIn Pinterest Chicago Bulls coach Tom Thibodeau, whose regular-season record for the past two years is the best in the National Basketball Association, has had his contract extended through the 2016-17 season, the team said on Monday. Per team policy, terms were not disclosed, but media reports indicated Thibodeau's four-year extension had a base salary of $17.5 million, with bonuses that could reach $20 million. "Tom has proven to be one of the top coaches in the NBA and we are happy that he has agreed to a long-term extension that will ensure he is our coach for many years to come," Chicago Bulls General Manager Gar Forman said in a statement. In two seasons with the Bulls, Thibodeau has led Chicago to a regular-season record of 112-36 (.757; the highest winning percentage ever by an NBA head coach for a two-year period). He was named NBA coach of the year for the Bulls' 62-20 record in 2010-11 and was runner-up for the honor after a 50-16 campaign in 2011-12. Share Facebook Share on Twitter GPlus LinkedIn Pinterest Read More: NBA Chicago Bulls contract extension Tom Thibodeau /classified-odd/07/28/16/hunt-on-for-life-saving-mythical-plant/overseas/07/28/16/indian-couple-hacked-to-death-over-22-cent-debt/business/07/28/16/samsung-extends-lead-over-apple-in-smartphone-market/video/news/07/28/16/duterte-may-babala-sa-mga-rebeldeng-npa/video/news/07/28/16/nupl-nababahala-sa-mga-pagpatay


text:
- Swimmer Ryan Lochte reveals one of his worst dates - US Weekly
- Get the latest on Dr. Dre's arrest - TMZ
- Despite rumors, Eddie Murphy's daughter is not pregnant - Gossip Cop
- The Vampire Diaries star Michael Trevino steps out for a good cause - Just Jared Jr
- Are Blac Chyna and Kylie Jenner on good terms? - Radar
- Blue Ivy is just as stylish as her mom Beyonce! - Lainey Gossip
- This Narcos star confirms he's not coming back for another season of the show - The Hollywood Reporter
16 May 2014 at 2:32 PM
Claire Danes Supports Hubby Hugh Dancy at his BAFTA Conversation!
About this photo set: Claire Danes keeps close to her husband Hugh Dancy as they pose for photographs while attending BAFTA New York Presents: In Conversation with Hugh Dancy held at… Read More Here
Photo #: 3114951
Posted to Claire Danes, Hugh Dancy, Mamie Gummer
powered by ZergNet


text:
I've changed fuel pump fuel filter main relay and did over all tune up
civic won't start when it rains only during warm days why? on 1996 Honda Civic
Get Your Car Fixed at a RepairPal Certified Shop.
We certify shops based on expertise, quality work, and verified customer reviews
0 answers


text:
|Publication number
|Publication type
|Application number
|Publication date
|Jul 22, 2003
|Filing date
|Dec 7, 1999
|Priority date
|Dec 7, 1999
|Fee status
|Also published as
|Publication number
|Ali S. Khayrallah, Gregory E. Bottomley, Ravinder David Koilpillai, Kambiz Zangi
|Original Assignee
|Ericsson Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (13), Non-Patent Citations (2), Referenced by (36), Classifications (7), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates generally to coding algorithms for a digital communications system and, more particularly, to a reduced search symbol estimation algorithm for decoding convolutional codes.
The basic function of a communication system is to send information over a communication channel from a source that generates the information to one or more destinations. In a digital communication system, the information is converted into a digital format and then transmitted over the communication channel. The transmission of digital information is subject to the adverse effects of the communication channel, such as co-channel and adjacent channel interference, noise, dispersion, and fading. These effects introduce errors called "channel errors" into the transmitted data stream. These effects are particularly severe in a radio communication system.
In 1948, Claude E. Shannon demonstrated in a landmark paper that by proper encoding of the digital information prior to transmission, the errors introduced by a noisy channel can be reduced to any desired level without sacrificing the rate of information transmission. Encoding is the process of adding redundancy to information prior to its transmission so that errors which may occur during transmission can be detected and/or corrected. At the receiving end, the decoder makes use of the redundant information and a priori knowledge of the coding scheme to detect and/or correct errors that may have occurred during transmission of the information.
One class of error correcting codes commonly used in digital communication systems are convolutional codes. In convolutional codes, an information sequence is fed into the encoder k bits at a time. For each k bits input to the encoder, n bits (n>k) are output. The n output bits form a codeword selected from a set of codewords C. Thus, a convolutional code represents a mapping of the k input bits into an n bit codeword selected from a codeword set C.
One fundamental characteristic of a convolutional code is that each codeword output by the encoder is determined not only by the k input bits, but also by the information bits input during a previous coding interval. This dependence on the previous information bits causes the encoder to act like a finite state machine. One method commonly used to represent a convolutional code is with a trellis diagram. An exemplary trellis diagram for a rate � convolutional code is shown in FIG. 1. In the code shown in FIG. 1, one bit is input to the encoder during each coding interval and two bits are output. The coded output can thus take one of four possible values. Each trellis node corresponds to one of the four possible values and is often returned to as a node or state. Each column of nodes in the trellis diagram represents an instant of time called a coding interval or stage. The set of nodes repeats for each coding interval. Transitions between states are represented in the trellis diagram as branches connecting nodes in adjacent coding intervals. Each branch is associated with a particular symbol or codeword that could have been transmitted. A series of connected branches defines a path through the trellis. Each path represents a valid received symbol sequence.
Encoding proceeds from left to right through the trellis diagram. At each coding interval, k bits are input to the encoder, which generates a coded output containing n bits. Each path through the trellis diagram extending from the starting state to the ending state corresponds to a valid symbol sequence. It is important to note that there is a one-to-one correspondence between valid symbol sequences and paths through the trellis. The function of the decoder is to determine the symbol sequence transmitted based on the received sequence.
Numerous techniques have been devised for decoding convolutional codes. The fundamental task implemented by each of these various approaches is essentially the same; to find a path through the trellis that is "closest" to the received sequence. The closest path corresponds to the code sequence which has the highest probability of being transmitted given the received sequence.
The method for decoding a received symbol sequence that is considered optimum is called maximum likelihood sequence estimation (MLSE). In MLSE, the decoder tries to find the path through the trellis that best matches a received symbol sequence. Each branch of the trellis is assigned a metric that represents the likelihood of the symbol corresponding to that branch being part of the transmitted symbol sequence. A path metric is then computed for a path by summing the branch metrics associated with each branch in that path. The path that most closely matches the received symbol sequence is the one with the lowest accumulated path metric. The symbol sequence corresponding to the path with the lowest path metric is output as the decoded sequence.
In most codes, the number of possible paths through the trellis is quite large and it is therefore not possible to compute a path metric for every possible path through the trellis. Therefore, great effort has been expended in finding new algorithms that simplify the task of finding the closest path to the received symbol sequence. One such algorithm is called the Viterbi algorithm.
In the Viterbi algorithm, the path with the lowest path metric is found by sequentially moving through the trellis from beginning to end and, at each stage, retaining one "survivor path" for each state or node.- The survivor path is defined as the path leading up to a particular node that has the lowest accumulated path metric. For any given interval, there will be M survivors where M is the number of possible states or nodes. Once the survivor path is determined for each state, the survivor paths are extended to the next interval and the survivors for the next stage are determined. Recursion can proceed indefinitely without the number of surviving paths exceeding M. When the final stage is reached, the decoder determines which of the final survivor paths is optimum and outputs the corresponding bits.
Even though the Viterbi algorithm greatly simplifies the task of finding the closest path, the complexity of the Viterbi algorithm grows exponentially as the memory of the encoder increases. Consequently, the Viterbi algorithm is not used for codes with a long constraint length. Another drawback is that the Viterbi algorithm generates a hard decision.
Another commonly used algorithm is called the M-algorithm (MA). In the MA, for each coding interval in the trellis, the number of surviving paths retained by the decoder is restricted to a fixed number N less the number of possible states. At each stage, the MA chooses the N best paths based on the accumulated path metrics. Thus, the MA restricts the search through the trellis to a fixed number of states at any given time interval. If the selected value for N is too small, there will be a high probability of deleting the path corresponding to the transmitted symbol sequence and hence a high error probability.
Symbol estimation algorithms provide an alternative to sequence estimation algorithms. While typically more complex than sequence estimation algorithms, and not as well understood, this class of algorithms has some advantages. One advantage is that symbol estimation algorithms produce symbol reliability values (soft values) as part of their normal design. In contrast, the Viterbi algorithm needs to be modified in order to produce reliability values. Moreover, the soft values produced by a modified Viterbi algorithm are not as accurate as those produced by symbol estimation algorithms.
Although in this patent application we focus on applications of our invention to decoders for convolutional codes, it is obvious to one skilled in the art that our invention can also be used for estimation of digital symbols in the presence of inter-symbol interference (i.e., for MAP equalization).
The present invention is a reduced search symbol estimation algorithm that approximates a MAP decoder. The reduced search symbol estimation algorithm includes a forward recursion, a backward recursion, and a combining step. For each stage k, the decoder performs a forward recursion up to stage k-1 and a backward recursion up to stage k. To reduce complexity, the decoder does not retain all stages during the forward and backward recursions. Instead, at each stage of the forward and backward recursions, the number of surviving states is limited to a predetermined number of states which is less than the total number of possible states. Surviving states in the forward recursion are denoted Qk. Surviving states in the backward recursion are denoted Rk. At each stage of the recursion, the decoder extends branches one stage forward (or backward) from the survivors at the previous stage. The states at which the extended branches end become candidate states. The decoder compares the accumulated path metrics for the branches BK for each candidate state and retains a predetermined number of states that is less than the total number of states.
During the combining step, a log-likelihood ratio or soft value is computed for the current stage k by combining the forward state metrics for the survivors in Qk−1, the backward state metrics for the survivors in Rk, and the branch metrics connecting survivors in both sets. To calculate the likelihood ratio, the set of connecting branches Bk is partitioned into two subsets, Bk0 and Bk1, corresponding respectively to either 0 or 1 for the current bit. The log likelihood ratio is then given by the following equation:
To prevent the set Bk from being empty, the decoder can perform an augmenting step during the forward and backward recursions. For example, assume that the augmenting step is performed during the backward recursion. The decoder would perform a complete forward recursion, storing the state metrics for the survivors at each stage. During the backward recursion, the decoder would determine the survivor states at each stage based on the accumulated path metrics. The decoder would then determine whether the survivors at stage k in the backward recursion include a survivor from the forward recursion at the same stage. If not, the decoder would select a survivor state from the same stage of the forward recursion to include as a survivor in the backward recursion. This procedure can also be used to ensure that neither subset of Bk is empty.
In another embodiment of the invention, an augmenting step is performed after the forward and backward recursions but prior to the computation of the likelihood ratio. That is, prior to computing the likelihood ratio, the decoder determines whether any connecting branches exist connecting survivors in QK−1 to backward survivors in RK. If not, an alternate survivor is selected for inclusion in either QK−1 or RK to enable calculation of the likelihood ratio. The alternate state could be selected by extending branches forward (or backward) one stage from one of the survivors and selecting the best extended path. Another method would be to trace back along a survivor path from one of the current survivors to find a path that had been previously deleted. For example, the decoder could trace back from the survivors in Rk to find deleted branches that connect to members in Qk. The shortest regenerated path would then be included in Rk.
FIG. 1 is a trellis diagram for a rate � convolutional code.
FIG. 2 is a block diagram of a digital communication system.
FIG. 3 is a trellis diagram illustrating a method for computing a likelihood ratio for a decoded symbol using accumulated path metrics from forward and backward recursions.
FIG. 4 is a flow diagram illustrating the decoding method of the present invention.
FIG. 5 is a flow diagram illustrating the modified M Algorithm used to implement the decoding method.
FIG. 6 is a flow diagram illustrating the modified M Algorithm with an additional augmenting step.
FIG. 7 is a flow diagram showing a second embodiment of the decoding method having an augmenting step.
FIG. 8 is a trellis diagram illustrating a method for regenerating that is used to implement the decoding method.
FIG. 2 illustrates a digital communication system, generally indicated by the numeral 10. The system 10 consists generally of a transmitter 14 and a receiver 30 which are coupled by a communications channel 12. The transmitter 14 includes a source encoder 16, a channel coder 20, and a modulator 22. An information source provides the source data stream, I, that is to be ultimately conveyed to the receiver 30. This source data is assumed to be in a digitized format and is passed directly to the source encoder 16. The source encoder 16 removes redundancy or randomizes the source data stream, producing an information sequence, X, which has been optimized for maximum information content. The information sequence from the source encoder 16 is passed to the channel coder 18.
The channel encoder 18 is designed to introduce an element of redundancy into the information sequence, X, which is supplied by the source encoder 16 to generate a coded output, Y. While initially appearing at odds with the function of the source encoder 16 previously discussed, in reality the redundancy added by the channel coder 18 serves to enhance the error correction capability of the communication system. By introducing redundant information into the information sequence in a controlled manner, a receiver having knowledge of the code used can detect and possibly correct errors which may occur during transmission by making use of the redundant information.
The modulator 20 interfaces the channel coder 18 to the communications channel 12. The modulator 20 receives coded output from the channel coder 18 and generates waveforms that can be efficiently transmitted over the channel 12. The term "signal constellation" is often used to refer to the set of possible signal waveforms available for mapping of the coded output of the channel coder 18. These output waveforms, or signal constellation schemes, are generally selected with regard to either simplification of the communication system, optimal detection performance, power requirements, or bandwidth availability. Typical signal constellations used in digital communications system modulation include 16QAM, 8-PSK, 4-PSK and the like.
At the receiver 30 of the digital communications system 10, a demodulator 32 processes the output waveform (which is corrupted by the channel 12 during transmission) at any given time to determine which of the possible signals in the signal constellation was transmitted. For example, when binary modulation is used, the demodulator 32 processes the received waveform and decides whether a transmitted bit is a 0 or 1. The output of the demodulator is the received sequence Z. The output of the demodulator 32 is passed to a decoder 34 which attempts to reconstruct the original information sequence X from its a priori knowledge of the code used by the channel coder 16. A measure of how well the demodulator 32 and decoder 34 perform is the frequency with which errors occur in the decoded sequence. As a final step, when an analog output is desired, a source decoder 36 accepts the output sequence from the decoder 34, and from knowledge of the source encoding method, attempts to reconstruct the original signal from the information source. The difference between the reconstructed signal and the original signal is a measure of the distortion introduced by the communication system.
A MAP decoder uses the a posteriori probabilities to obtain estimates of the information symbols that were transmitted. Assume, for example, that an information sequence x is mapped into a codeword y. For the kth bit xk, let C0 denote codewords y in C corresponding to information blocks having a 0 at the kth position and C1 denote codewords y in C corresponding to information blocks having a 1 at the kth position. The MAP decoder processes the received sequence z to produce a log-likelihood ratio Lk for a given information bit xk using the following formula:
The MAP decoder calculates a likelihood ratio at each stage of the decoding process and chooses a symbol based on the likelihood ratio. The numerator of the likelihood ratio is the sum of the probabilities for all codewords y in C0. The denominator is the sum of the probabilities for all codewords y in C1. If the ratio is greater than 1, the decoder outputs a 0 as the estimate of xk. If the ratio is less than 1, the decoder outputs a 1 as the estimate of xk. A well-known technique used for producing (1) is the BCJR algorithm. The BCJR algorithm is described in detail in Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate, IEEE J. Trans. Information Theory, vol. IT-20, pp. 284-287, 1974, which is incorporated herein by reference. The MAP decoder is computationally intensive, but has the advantage of the generating soft values as a normal part of the decoding process.
Equation (1) can be used not only to find log-likelihoods of information bits, but also log-likelihoods of coded bits. This is particularly useful in multi-pass demodulation, sometimes referred to as Turbo equalization, in which demodulation is performed a second time using information from the decoder. Preferably, extrinsic information would be passed to the second-pass demodulator, which would be formed by subtracting the first pass demodulator log-likelihood value from the decoder output log-likelihood value. In general, log-likelihood or likelihood values may be used and are generally referred to as soft values.
In An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes, IEEE J. Selected. Areas in Communication, Vol. 16, pp. 260-264 (1998), a method of MAP decoding is described consisting of a forward and backward Viterbi decoding step and a combination step. Referring to FIG. 3, suppose that Lk is sought for the kth bit. To simplify the discussion, it will be assumed that the trellis is binary so that one branch corresponds to a single bit. The process can be easily generalized to treat multiple bits per branch. A forward state metric is computed for each beginning state s′ at the kth stage by applying the Viterbi algorithm. Denoting the state metric for state s′ at the (k−1)th node as ak−1(s′), the state metric for state s at the kth node as ak(s′), and the branch metric connecting state s′ at nodek−1 and state s at node k as ck(s′, s), the forward metric for a given state s can be given by the following equation:
A backward state metric is computed for each ending state s at the kth stage by performing a backward Viterbi algorithm. Denoting the state metric for state s′ at the (j−1)th node as bj−1(s′), the state metrics for state s at the kth node as bj(s), and the branch metric connecting state s′ at node k−1 and state s at node k as ck(s′, s), the backward metric for a given state s′ can be given by the following equation:
The function max* used in the forward and backward recursions is defined as follows:
For a given stage k, the likelihood ratio is then computed by combining the forward state metrics for the beginning states s′, the backward state metrics for the ending states s, and the branches connecting the beginning and ending states, s′ and s. The set of connecting branches B is partitioned into the set B0 of branches that correspond to xk0 and the complementary set B1 of branches that correspond to xk=1. The likelihood ratio is then given by the following equation:
One problem with MAP decoding is that it is generally more complex than sequence decoding. The present invention is a reduced complexity symbol estimation algorithm that approximates a MAP decoder with a much lower degree of complexity.
To briefly summarize, the reduced search symbol estimation algorithm includes a forward recursion, a backward recursion, and a combining step. To reduce complexity, the present invention does not retain all states during the forward and backward recursions. Instead, at each stage of the forward and backward recursions, the number of surviving states is restricted to a predetermined number of states selected from a group of candidate states. Candidate states are those states connected by branches to survivors from the previous stage of the recursion. The decoder compares the accumulated path metrics for each candidate state and retains a specified number of states that is less than the total number of states in the trellis. For the forward recursion, the retained states or survivor states, denoted as Qk1 are stored along with the corresponding state metrics. For the backward recursion, the retained states, denoted as Rk, are stored along with the corresponding state metrics. During the combining step, the computation of Lk is restricted to branches (s′,s) connecting survivor states s′ and s in the forward and backward recursions respectively.
FIG. 4 is a flow diagram illustrating the decoding method of the present invention. Suppose that Lk is sought for the information bit xk. A forward recursion through the trellis is performed for all stages using a reduced complexity search algorithm such as the M Algorithm (block 102). The forward recursion is defined by the following equation:
where αk−1(s′) is the state metric associated with a state s′ belonging to the set Qk−1 of surviving states at the k−1 stage. A backward recursion is performed beginning at the ending state of the trellis up to stage k (block 104). The backward recursion is defined by the following equation:
where βk−1(s′) is the state metric associated with a state s belonging to the set Rk of surviving states at stage k. For all pairs (s′, s) for which a connecting branch exists, it is possible to combine the forward state metric for state s′, the backward state metric for state s, and the branch metric for the connecting branch to obtain the likelihood for the kth bit. Branches connecting pairs (s′, s) are denoted as Bk. After performing the backward recursion, the decoder 34 determines whether any branches Bk exist connecting pairs (s′,s) (block 106). Where no branch Bk exists, the decoder 34 must perform additional operations to produce a likelihood ratio (block 110). To calculate the likelihood ratio, the set of connecting branches Bk is partitioned into two subsets, Bk0 and Bk1, corresponding respectively to either 0 or 1 for the current bit. The log-likelihood ratio is then given by the following equation:
which is computed (block 108) and output as a soft decision (block 112). After outputting a symbol the decoder checks whether the last stage has been reached (block 114). If not, the decoder moves to the next stage and repeats steps 104-112. When the last stage is reached, the recursion terminates (block 116).
The algorithm used to perform the forward and backward recursions is preferably a variation of an algorithm known as the M Algorithm (MA) and is shown in FIG. 5. This algorithm is referred to herein as the modified M Algorithm (M*A). The decoder 34 is initialized, usually to the all zero state and the accumulated path metric is initialized to zero (block 202). The decoder 34 extends branches from each current survivor to the next stage (block 204). The states at the ends of the extended branches are called candidate states. At the initial stage of the recursion, there will be only a single survivor, which is the all zero state. A path metric is then computed for each candidate state (block 206) using the max* function shown in equation (4) or any approximation to (4). Some states may have multiple paths leading into the state. In that case, the decoder 34 may use the greater of the path metrics for all paths leading into the state, which shall be referred to as the maximum accumulated path metric. Or, it may use the max * operation to combine path metrics. After computing the maximum accumulated path metric for the candidate states, the decoder 34 chooses the best m states (where m is an integer less than the total number of possible states) based on the accumulated path metrics. The path metrics for the set of survivor states at the current stage k, denoted as Qk for the forward recursion and Rk for the backward recursion, are then stored in memory (block 210). This process is repeated until the final stage is reached (block 212) at which time the recursion terminates (block 214).
There are several drawbacks to using the reduced search symbol estimation algorithm described above if the number N of survivor states retained at each stage of the forward and backward recursion is small compared to the total number of states. First, the set Bk may be empty because the survivors in Qk−1 and Rk are far apart. That is, there are no branches connecting survivor states in the forward recursion to survivor states in the backward recursion. This means that the decoder 34 will not be able to compute a reliability value for the current bit. Even if the set Bk is not empty, one of the subsets, Bk0 and Bk1, could be empty. If Bk0 is empty, then its corresponding max* term must be replaced by negative infinity, or some other large negative number. In a sense, this means that the decoder 34 is producing a hard value for the current bit.
Referring now to FIG. 6, a modification of the M*A will be described that ensures that the set BK will not be empty. First, a complete forward M*A is performed as shown in FIG. 5 to obtain the set Qk of survivor states at each stage k of the trellis. During the forward recursion, the state metrics for the survivor states Qk at each stage k are then stored in memory. A backward recursion is then performed as shown in FIG. 6. The decoder 34 is initialized (block 302) and then the branches are extended from the beginning state to the next stage (block 304). Path metrics for the candidate states are computed (block 306) and the survivors Rk are chosen (block 308). After the survivors are selected, the decoder determines whether Rk includes a member of Qk at the same stage k of the trellis. If not, in addition to the best N states, at least one state Qk from the forward recursion is retained. The chosen member of Qk could replace an existing member of Rk or could simply be added to the existing members of Rk. This additional step ensures that Bk is not empty. Equivalently, the same procedure could be used to augment Qk instead of Rk To prevent the subsets of Bk from being empty,,two members of Qk could be selected for inclusion in Rk − one with an ending branch corresponding to Xk=0 and the other with an ending branch corresponding to Xk=1.
FIG. 7 illustrates another modification to the decoding method that ensures that the subsets of Bk are not empty. In this method, a complete forward recursion (block 402) and backward recursion (block 404) are performed. An augmenting step is then performed before the combining step. As shown in FIG. 7, the decoder determines whether the subsets Bk0 or Bk1 are empty. If either subset is empty, the decoder performs the additional augmenting step (block 408). Say, for example, that the subset Bk0 is empty. The decoder 34 augments the set Qk−1 by adding an alternate state s′a that was not selected during the forward recursion. One method for finding the alternate state s′a would be for the decoder 34 to extend branches corresponding to Xk=0 from each of the survivors in Rk and choose the state that is the best and add it to the set Qk−1. The alternate state could be added as an additional member to Qk−1 or could replace an existing member of Qk−1. The same method could be used to ensure that the subset Bk1 is not empty. After the augmenting step, the likelihood ratio can then be computed (block 410). Following the computation of the likelihood ratio the decoder 34 chooses a symbol to output (block 412). After outputting a symbol, the decoder 34 checks whether the last stage has been reached (block 416). If not, the decoder 34 moves to the next stage (block 418) and repeats steps 406-412 until the end of the information block is reached, at which time the process ends (block 420).
FIG. 8 shows another method for augmenting QK that involves regenerating previously deleted branches. FIG. 8 shows the state of the decoder 34 after the forward recursion and backward recursion have been performed. As seen in FIG. 8, there are no branches connecting the survivor states s′, s in Qk−1 and Rk. When the set Bk is empty, the decoder 34 can trace back along the survivor paths in either the forward or backward recursions to find a path that was previously deleted connecting to a survivor in Rk or Qk, respectively. As shown by arrows in FIG. 8, the decoder 34 traces back along the survivor path from each of the survivors in Rk. While tracing back, the decoder 34 finds the deleted paths (shown in dotted lines) which connect to the members in Qk. The decoder 34 then selects one of their paths and regenerates the selected path. FIG. 8 shows four deleted branches leading to possible alternate states A1-A4. One of the alternate paths is selected. The node A1, A4 at stage k along the selected path is included in Rk. The same approach can be used to regenerate a path in the forward direction starting from a state in Qk. This approach can also be used to find alternate states for Qk−1 and Rk that makes Bk0 and Bk1 non-empty.
The present invention is useful when decoding Turbo codes. Typically, multiple stages of MAP decoding are used. The present invention can be used to reduce the complexity of each stage, reducing the signal processing power required. For cellular terminals, this reduces battery drain, increasing talk time.
|Cited Patent
|Filing date
|Publication date
|Sep 13, 1994
|Mar 26, 1996
|Nokia Mobile Phones (U.K.) Limited
|Maximum likelihood sequence detector
|Sep 1, 1995
|Nov 4, 1997
|Motorola, Inc.
|Method and apparatus for decoding convolutionally encoded information
|Oct 28, 1996
|Jul 14, 1998
|Lsi Logic Corporation
|Differential trellis decoding for convolutional codes
|Jun 26, 1995
|Jul 21, 1998
|Nokia Mobile Phones Ltd.
|Viterbi decoder with l=2 best decoding paths
|May 24, 1996
|Dec 1, 1998
|Mitsubishi Denki Kabushiki Kaisha
|Soft-decision receiver and decoder for digital communication
|Mar 11, 1997
|Mar 9, 1999
|Samsung Electronics Co., Ltd.
|Viterbi decoder
|Feb 13, 1997
|Mar 23, 1999
|Oki Electric Industry Co., Ltd.
|Viterbi decoding method and viterbi decoding circuit
|Oct 3, 1996
|Mar 23, 1999
|Deutsche Itt Industries Gmbh
|Logical block for a Viterbi decoder
|Mar 26, 1997
|May 4, 1999
|Sharp Laboratories Of America, Inc.
|Metric sifting in breadth-first decoding of convolutional coded data
|Dec 27, 1995
|May 18, 1999
|Ericsson Inc.
|Method and apparauts for symbol decoding
|Nov 6, 1996
|Aug 3, 1999
|Qualcomm Incorporated
|Soft decision output decoder for decoding convolutionally encoded codewords
|Oct 24, 1995
|Feb 22, 2000
|U.S. Philips Corporation
|Soft-output decoding transmission system with reduced memory requirement
|Oct 9, 1998
|Aug 27, 2002
|Texas Instruments Incorporated
|Method and apparatus for transmission of digital data
|Anderson, John B.; "Limited Search Trellis Decoding of Convolutional Codes"; IEEE Transactions on Information Theory, Sep. 1989, No. 5, pp,944-955.
|Viterbi, Andrew J.; "An Intuitive Justification and a Simplified Implementation of the Map Decoder for Convolutional Codes"; IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, Feb. 1998, pp. 260-264.
|Citing Patent
|Filing date
|Publication date
|Sep 21, 2001
|Jul 13, 2004
|The Directv Group, Inc.
|Method and system for performing decoding using a reduced-memory implementation
|Sep 22, 2000
|Sep 7, 2004
|Tioga Technologies Inc.
|Trellis-based decoder with state and path purging
|Dec 13, 2001
|Mar 8, 2005
|Conexant Systems, Inc.
|System of and method for decoding trellis codes
|Nov 13, 2000
|Nov 29, 2005
|Telefonaktiebolaget Lm Ericsson (Publ)
|Methods and systems for accumulating metrics generated by a sequence estimation algorithm
|Dec 13, 2001
|Dec 6, 2005
|Conexant Systems, Inc.
|System of and method for decoding trellis codes
|Nov 28, 2000
|Mar 28, 2006
|Lucent Technologies Inc.
|Method and apparatus for determining channel conditions in a communication system
|Jul 22, 2002
|Aug 8, 2006
|Agere Systems Inc.
|High speed arithmetic operations for use in turbo decoders
|Apr 14, 2003
|Jul 17, 2007
|Agere Systems Inc.
|Turbo decoder employing simplified log-map decoding
|Nov 10, 2004
|Apr 15, 2008
|Rf Micro Devices, Inc.
|System and method for transitioning between modulation formats in adjacent bursts triggering on ramps
|Jun 16, 2004
|Nov 4, 2008
|Seagate Technology, Inc.
|Soft-decision decoding using selective bit flipping
|Nov 17, 2009
|Kabushiki Kaisha Toshiba
|Signal decoding methods and apparatus
|Dec 29, 2009
|Cisco Technology, Inc.
|Method for decoding tail-biting convolutional codes
|Jul 13, 2010
|Agere Systems Inc.
|Turbo decoder employing simplified log-MAP decoding
|Aug 31, 2010
|Telefonaktiebolaget Lm Ericsson (Publ)
|Joint multi-code detectors in CDMA communications system
|Nov 30, 2010
|Nokia Corporation
|Delayed branch decision in quadrature decomposition with M-searching
|Jan 10, 2012
|Arrowhead Center, Inc.
|List-based detection in fading channels with long intersymbol interference
|Jul 11, 2008
|Jan 17, 2012
|Freescale Semiconductor, Inc.
|Error correcting Viterbi decoder
|Aug 5, 2005
|Dec 25, 2012
|Mstar Semiconductor, Inc.
|Soft decision enhancement
|Jan 22, 2013
|Sarath Babu Govindarajulu
|High throughput and low latency map decoder
|Jun 8, 2010
|Jan 29, 2013
|Receiver equipped with a trellis viterbi decoder
|Dec 13, 2001
|Jul 18, 2002
|Eran Arad
|System of and method for decoding trellis codes
|Sep 21, 2001
|Mar 27, 2003
|Bharath Venkataraman
|Method and system for performing decoding using a reduced-memory implementation
|Jul 22, 2002
|Jan 22, 2004
|D'arcy Paul Gerard
|High speed arithmetic operations for use in turbo decoders
|Apr 11, 2003
|Oct 14, 2004
|Wang Yi-Pin Eric
|Joint multi-code detectors in CDMA communications system
|Apr 14, 2003
|Oct 14, 2004
|Shuzhan Xu
|Turbo decoder employing simplified log-map decoding
|Jun 16, 2004
|Dec 22, 2005
|Yingquan Wu
|Soft-decision decoding using selective bit flipping
|Oct 31, 2005
|Jul 13, 2006
|Kabushiki Kaisha Toshiba
|Signal decoding methods and apparatus
|Apr 21, 2006
|Oct 26, 2006
|Navini Networks, Inc.
|Method for decoding tail-biting convolutional codes
|Feb 12, 2007
|Jul 3, 2008
|Nokia Corporation
|Delayed branch decision in quadrature decomposition with M-searching
|Sep 10, 2008
|Mar 12, 2009
|Mbit Wireless, Inc.
|High throughput and low latency map decoder
|Aug 5, 2005
|Apr 30, 2009
|Navid Fatemi-Ghomi
|Soft decision enhancement
|Jul 11, 2008
|Jan 14, 2010
|Freescale Semiconductor, Inc.
|Error correcting viterbi decoder
|Dec 9, 2010
|Receiver Equipped with a Trellis Viterbi Decoder
|Jul 27, 2012
|Nov 22, 2012
|Khayrallah Ali S
|Method for post detection improvement in mimo
|Apr 21, 2006
|May 30, 2012
|Method for decoding tail-biting convolutional codes
|Apr 21, 2006
|Nov 2, 2006
|Navini Networks, Inc.
|Method for decoding tail-biting convolutional codes
|U.S. Classification
|375/265, 375/261, 375/262
|International Classification
|Cooperative Classification
|European Classification
|Dec 7, 1999
Owner name: ERICSSON, INC., NORTH CAROLINA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KHAYRALLAH, ALI S.;BOTTOMLET, GREGORY E.;KOILPILLAI, RAVINDER D.;AND OTHERS;REEL/FRAME:010451/0516
Effective date: 19991203
|Jan 22, 2007
|Fee payment
Year of fee payment: 4
|Jan 24, 2011
|Fee payment
Year of fee payment: 8
|Jan 22, 2015
|Fee payment
Year of fee payment: 12


text:
"I have been a fan since Baker, I love the innocent curiosity. IQ of a billion, and he still asks 'why'..."
"Ever since one Saturday morning on KSTP CH. 5 I was fascinated with a curly haired hawked nosed gentleman known as the Doctor. "
"Reptile lover, photographer, former hoosier and all around IT guy."
"Hi! I stumbled onto Dr. Who in the 1970s and watched it every Sunday morning. I've fallen away from it over the years and would like to get caught up on it."
"Born and raised in Mn(I couldn't escape!) Married, Have 2 cats that do not yet get along. I am hoping in the near future they will. I have been a doctor who..."
"Began as a NewWho fan and am loving watching & learning about the Classic Doctors. Currently indoctrinating my children into the fandom with the help of tasty..."
"I have been a Dr. Who fan since the '70's. Was so excited when Christopher Eccleston became the new Doc. My family and friends think I am weird or do..."
"Love Dr Who binging."
"Stay at Home mom north of the TC area. My kids and I are all Whovians! I watched the show on PBS as a kid and my kids have really gotten me into the new series!"
"Viki Martins"
"I've been a Who fan for many years now and really enjoyed introducing my kids to the Doctor."
"Used to watch Dr. Who when I was a kid. Brother got me hooked again and here I am!"
Meetup members, Log in
By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy


text:
This job is no longer available. We've found other interesting jobs for you.
Jobs you might like
Application Support Specialist
Prolim Global in Rochester Hills, MI
PROLIM Global Corporation (www.prolim.com) is currently seeking Application Support Specialist for location Rochester Hills, MI for one of our Top client. This position is based in Rochester Hills, MI and requires travel to specific site locations ...
Material Flow Specialist Job
FCA in Auburn Hills, MI
The Material Flow Specialist will be responsible for documenting, constructing, and improving internal material flow plans for stamping operations. This position will spend a considerable amount of time within the manufacturing facilities working ...
Manufacturing Process Engineer
Systems Technology Group, Inc. (STG) in Pontiac, MI
Systems Technology Group (STG) is in need of Manufacturing Process Engineer for our direct client in Pontiac, MI. The duration is long-term (1+ year). Must be able to successfully complete the required,Drug Testing and Background Checks prior to ...
Operations Manager - Manufacturing/Automotive/LEAN
Randstad Engineering in Auburn Hills, MI
We are looking for an Operations Manager to work for an Automotive Supplier in Auburn Hills, MI. Lead, manage and measure performance of overall company operations in such a way that strategic company objectives are met and Plan (Budget) financial ...
Technical Trainer
Prolim Global in Rochester Hills, MI
PROLIM Global Corporation (www.prolim.com) is currently seeking Technical Trainer for location Rochester Hills, MI for one of our Top client. You will develop and deliver training classes that support Manufacturing Intelligence at our North American ...


text:
|Preview Image
Item images are no longer available
|Item ID #
|Start Time
|End Time
|Great Falls Goodwill
|Great Falls, MT
|MUST BE RECEIVED WITHIN seven (7) DAYS from auction close.
Available Payment Methods:
|Shipping / Handling
|Buyer pays shipping No International Shipments
This item ships via
Shipping Weight 12 lbs. This item has a fixed shipping price of $25
Minimum shipment weight is 1lb., items weighing less than 1lb. will be calculated at the 1lb. rate.
Items are shipped using a major carrier usually within 5 business days after receipt of payment. Shipping charges are calculated at payment time.
A 5% handling fee applies to all purchased items, regardless of delivery method including pick up.
|Returns Policy
|Please read our return policy below.
|High bidder
|S******t For the protection of our buyers, the bidder name is only visible to the bidder.
|# of bids
9 ( bid history)
Frequently asked questions:
I can't remember my Buyer ID and Password.
What is proxy bidding?
What is a reserve price?
Can I lose by less than the minimum bid increment?
Vintage Poloron Blow Mold Christmas Reindeer
Current Price: $61.00
Seller: Discover Goodwill of Southern and Western Colorado
20" Light Up Ceramic Christmas Tree
Current Price: $28.00
Seller: Goodwill of North Central Wisconsin - http://goodwillncw.org/
Vintage Aluminum Christmas Tree With Stand
Current Price: $131.00
Seller: Goodwill Industries of Akron, Ohio, Inc.
Item images are no longer available
The Greatland Holiday Express Train Set in our auction is in the original package and has a copyright date 1994. The train works well and all pieces are present. The set is in like new condition and shows little/no wear. Due to the size of the box this item will ship at a charge of $25.00 through UPS. Good luck in your bidding.
View other items for sale by this seller
Seller Contact Information:Great Falls Goodwill
1201 7th Street South
Great Falls, MT, 59405
Return Policy: Merchandise is sold As Is. Returns will only be accepted with prior authorization and under the terms stated in this Return Policy. A 15% restocking fee will apply to any return, except in the case of damage during shipping or gross misrepresentation. Grab bags and Lots, including jewelry scrap, are non-refundable. Contact us within seven (7) days of merchandise receipt to request a Return Authorization. Returns must be postmarked within ten (10) days of Return Authorization. PLEASE NOTE THAT WE DO NOT REFUND SHIPPING AND HANDLING CHARGES. All non-deliverable items, unauthorized returns or items not picked up locally within thirty (30) days from close of auction will be considered a donation and relisted without further notice; no refunds will be issued.


text:
Katie Holmes Drops Her Top and Peels Off Her Bra in Jewelry Campaign
Katie Holmes is nearly naked in an ad campaign for high-end jewelry H.Stern. The former wife of Tom Cruise removes her clothes, wearing only a bra which is slipping off her shoulder in a beach-themed photoshoot for the brand.
The mother of one oozes sexiness as she models H.Stern's Iris collection, which is inspired by the sea, and gives a sultry stare at the camera with her smoky eyes. In one of the photos, she is seen frolicking on the sand wearing a white bikini.
Katie is currently living in New York with her little daughter Suri after reaching an agreement with Tom that she gained primary custody of their daughter with generous visitation from him. The "Don't Be Afraid of the Dark" actress filed for divorce from the "Top Gun" actor after five years of marriage.
More Katie Holmes News
- Morgan Freeman Eyed to Join Disney's New 'Nutcracker' Film
- Get Your First Look at Tyler Hoechlin as Clark Kent on 'Supergirl'
- Taika Waititi Hints at Thanos' Connection to 'Thor: Ragnarok' in New Photo
- Lindsey Vonn Accidentally Flashes Underwear on the Red Carpet
- Rihanna Swarmed by Her Fans in 'Goodnight Gotham' Music Video
- Tony Parker Welcomes Second Child With Wife Axelle Francine
- Candice Swanepoel Bares Baby Bump While Posing Completely Naked in This Photo
- 'Sesame Street' Reconsiders Layoffs After Public Outcry, Actor Says


text:
The FCC has been making life much easier for those of us who need to scratch their Internet itch while they fly the friendly skies as they eased rules to allow for quicker in-flight Internet deployment late last year. Now it looks like the FCC is taking its plans to allow more flights to have in-flight Wi-Fi and is now looking to increase its speeds.Advertisement, article continues below
The FCC on Thursday proposed the auctioning off of rights to use newly available wi-fi spectrums to provide better in-flight Wi-Fi connections. The goal is to provide in-flight Internet service that can either match or exceed the speeds most U.S. customers experience in their home or can find in public Wi-Fi locations, such as a coffee shop.
If the proposed auction goes through, the newly available Wi-Fi spectrums would help in providing a more reliable connection between the aircraft and the ground, and should also allow providers to offer more consistent service that could potentially provide a speed increase of up to 30 times faster than what U.S. residents have in their homes.
Read more about FCC, in-flight and internet. Source: nytimes
Take action: Like | G+ | Tweet | Pin | User Comments
You May Also Like
FCC Wants To Subsidize Broadband For Low-Income Households
FCC Chairman Wants Gigabit Internet Across All 50 U.S. States By 2015
BlackBerry Hamburg Spotted At The FCC
Moto E3 Spotted At The FCC, Could Launch Stateside In September
Nexus Player With Refreshed Hardware Spotted At The FCC
OnePlus 3 Gets FCC Certification
AirPort Extreme, Time Capsule Out Of Stock At Apple Stores
Most Shared
The Sega Saturn Has Finally Been Cracked After 20 Years
Lady Advertises Herself As A Pokemon GO Trainer For $20 An Hour
Samsung Galaxy Wide Officially Announced
LG To Restructure Mobile Division Following Poor LG G5 Sales
HTC 'Marlin' Nexus Specs Leaked
Some OnePlus 3 Users Complaining Of Yellowish Smudge On Their Screens
It Looks Like China Ripped Off Super Smash Bros. As Well
id Software Explains Why Quake Champions Is A PC-Only Game
Man Sues Apple For $10bn Alleging iOS Devices Infringed On His Ideas
Game Of Thrones Confirmed To Have 13 Episodes Left In The Series
Blizzard Wants To Help Combat Harassment On Twitch
Russian Embassy Tweets Image From Command & Conquer To Warn Of Terrorism
Fans Want Help Raising $20 Million To 'Fix Dorne' In Game Of Thrones
Hyperloop One's First Public Speed Test Is A Success
Apple Hit With $2.8 Billion Lawsuit Over iMessage & FaceTime


text:
BEIRUT — After months of fighting to encircle its opponents in Aleppo, Syrian authorities backed by Russia on Thursday offered safe corridors out for residents and rebels in the northern city's besieged quarters
PARIS - French officials on Thursday identified the second man responsible for attacking a Catholic church in Normandy as a 19-year-old who was spotted last month in Turkey as he supposedly headed to Syria - but returned to France instead.
NEW YORK - The relentless series of mass killings across the globe poses a challenge for experts trying to analyze them without lapsing into faulty generalizations.
Tibor Nagy, vice provost for the Office of International Affairs at Texas Tech, will temporarily head the U.S. Embassy in Nigeria as charge d'affaires (interim ambassador) during the month of August.
Read about a new program called YouthMappers that map to help assist countries who have had a natural disaster or have limited resources. YouthMappers is a global community of university students, faculty, and scholars who create and use open geospatial data to assist developmental needs and challenges worldwide.
TOKYO - The killing of 19 people at a home for the mentally disabled raised questions about whether Japan's reputation as one of the safest countries in the world is creating a false sense of security.
SAINT-ETIENNE-DU-ROUVRAY, France — The Islamic State group crossed a new threshold Tuesday in its war against the West, as two of its followers targeted a church in Normandy, slitting the throat of an elderly priest celebrating Mass and using hostages as human shields before being shot by police.
PARIS (AP) — The Latest on the hostage-taking in the French region of Normandy. (all times local):
3:40 p.m.
SAGAMIHARA, Japan - At least 19 people were killed and about 20 wounded in a knife attack Tuesday at a facility for the handicapped in a city just outside Tokyo in the worst mass killing in generations in Japan.
NEW YORK - If you want to see a tall population of men, go to the Netherlands. Tall women? Latvia. And in the United States, which lags behind dozens of other countries in height, the average for adults stopped increasing about 20 years ago.
Our Websites/Apps
Our Products
A-J Services
Lubbock Avalanche-Journal ©2016. All Rights Reserved.


text:
Crazy Substitute Teachers
Enjoy, NG4.03 / 5.00 2,284 Views
Vacuum Salesman
This dude and his Megazord vacuum cleaner4.00 / 5.00 2,659 Views
Markiplier Animated | Mark Of The Survey Corps
This took far too long to make...3.97 / 5.00 5,904 Views
This is very awesome. The actual game, however, is unfortunately far inferior to this. Still, kudos to you.
was based on a video games crossovers
This is better than the actual game. Well done!
animations dont fit together but i like it
dude in all honest opinion this reminded me of when I first played MK vs DC and I played as scorpion and Sub-Zero alot against the whole DC and in DC i played as batman and the flash. LOVE THAT GAME SPECIALLY WITH THE JOKER!!! :D


text:
Killiane Castle Country House & Farm, Wexford (county)
- Free cooked-to-order breakfast, free WiFi, and free parking
Main amenities
- 8 smoke-free guestrooms
- Outdoor tennis court
- Daily housekeeping
- Garden
- Lobby fireplace
- Laundry service
- Concierge services
- Picnic area
- Barbecue grills
- Luggage storage
- Tour/ticket assistance
- TV in a common area
For families
- Free cribs/infant beds
- Private bathroom
- Television
- Free toiletries
- Garden
- Daily housekeeping
What's around
- Irish Agricultural Museum (2.6 mi / 4.2 km)
- Wexford Opera House (3.9 mi / 6.3 km)
- Selskar Abbey (4 mi / 6.4 km)
- Westgate Tower (4.1 mi / 6.6 km)
- Irish National Heritage Park (6.1 mi / 9.9 km)
Killiane Castle Country House & Farm, Wexford (county)
Hotel Info: 01 65 69 441from €117
- Standard Double Room
- Twin Room, 2 Single Beds
- Standard Double Room, Courtyard View
- Triple Room
- Family Room
- Superior Double Room
- Deluxe Double Room, Garden View
Recommended hotels
At a glance
Key facts
Hotel size
- This hotel has 8 rooms
- This hotel is arranged over 2 floors
- Check-in time 3 PM-11 PM
- Check-out time is 11:30 AM
Required at check in
- Credit card or cash deposit required
- Government-issued photo ID required
Travelling with others
- No pets or service animals allowed
- Free WiFi in public areas
- Free WiFi in rooms
- Free self parking
- Free RV/bus/truck parking
Other information
- Smoke-free property
Nearby Four Star Wexford (county) hotels
In the hotel
- Free cooked-to-order breakfast daily
- Barbeque grills
- Outdoor tennis court
- Golf driving range on site
- Bicycle rentals nearby
- Golf lessons available nearby
- Tennis on site
- Concierge services
- Tours/ticket assistance
- Dry cleaning/laundry service
- Laundry facilities
- Luggage storage
- Number of buildings/towers - 1
- Year Built 1700
- Garden
- Picnic area
- Fireplace in lobby
- Television in common areas
In the room
- Iron/ironing board (on request)
- Hypo-allergenic bedding available
- Premium bedding
- Individually decorated
- Individually furnished
- Private bathroom
- Shower/tub combination
- Free toiletries
- Hair dryer
- Digital TV channels
- Free WiFi
- Free bottled water
- Daily housekeeping
Top Wexford (county) hotels
Nearby hotels
Killiane Castle Country House & Farm, Wexford (county)'s small print
Also known as
- Killiane
- Killiane Castle Country House Farm Agritourism
- Killiane Castle Country House Farm Wexford
- Killiane Castle Country House Farm
- Killiane Castle
- Killiane Castle Agritourism
- Killiane Castle Agritourism Wexford
- Killiane Castle Wexford
- Killiane Castle Hotel Drinagh
- Killiane Castle Hotel Wexford
- Killiane Castle Wexford, Ireland - Drinagh
- Killiane Castle Country House Farm Agritourism Wexford
This property does not have elevators.
We have included all charges provided to us by this hotel. However, charges can vary, for example, based on length of stay or the room you book.
Recent reviews
Outstanding 4.7 /5 from 113 reviews
We loved the place which was really near to Wexford town but yet in the heart of the country. An actual working farm, steeped in history and tastefully renovated and decorated. We were offered tea and homemade biscuits on arrival and a most sumptuous breakfast. The bed was luxurious and comfortable. Family run and maintained we felt welcome there. The price was very good for such an excellent place to spend a night. We would definitely go back there.
One night stay in convenience for early morning ferry next day out of Rosslare 15 minutes drive away. Would have preferred an earlier breakfast opening to relax into it a bit more, but in saying that, the owners were mindful about our travel schedule and provided a fantastic hot serving in super quick time. It was definitely a breakfast not to miss with all sorts of healthy fresh cold options as well as the hot served to order choices. Great dining area and efficient friendly service. If the breakfast time was half hour earlier it would accommodate morning Ferry travellers less stressfully for the start of the travelling day. Everything else about the hotel was great, but be aware there is no dinner service. We enjoyed a casual 20 minutes rural walk out to the main rode for the nearest pub which was called the farmers kitchen. Great friendly service and brilliant food there, so it was worth the walk. The castle Country House is a working farm, so expect some dairy farm odours from the sheds if the wind isn't favourable. All in all we would stay there again just for the character of the place and the peace and quiet. Would bring a couple of golf clubs next time to take advantage of the driving range just across the paddock. A rushed breakfast would be the only thing to deter us staying there again if catching the early ferry.
excellent still have not received rewards after renewing password
Fabulous guesthouse located in truly beautiful grounds. First class breakfasts. Really friendly proprietor. Will stay there again. Would recommend to everybody.
We thoroughly enjoyed our stay. It was comforting and relaxing, and all we aspired to.
Is the description of this hotel not correct? Tell us


text:
This action might not be possible to undo. Are you sure you want to continue?
Learning outcome: 3, 4 Targeted pass criteria: P9-P11, P13-P15
Assignment Number: 2
Submission deadline: 11th June 2012
Select an organisation which you are familiar with and have good access to.
You are required to produce a business proposal of 1,500 words, specifically looking at the communication processes of your chosen organisation. You are addressing the business proposal to the Managing Director of the company and you are writing to him explaining what the current communication systems are and convincing him how these systems can be improved and suggesting how you would implement them.
Write a business proposal: Communication Processes
• • •
Report how the organisation communicates within a chosen business area and with different departments (P9) Describe in detail how the business could improve the way that it communicates to improve its appropriateness (P10) Once these improvements have been suggested, explain how you would implement them and how they would improve overall communications of the business. (P11)
You are also required to deliver a Power Point Presentation (in groups of two-minimum 8 slides and maximum 15 minutes), specifically looking at the Information and Knowledge Systems of the same organisation. Again, your presentation is addressed to the Managing Director of your chosen company. You are explaining to him how information is collected, formatted, stored and then disseminated in his/her organisation. Additionally you are identifying areas which could benefit from either an improvement or a new approach and suggesting how these changes could be implemented, using examples where appropriate.
Deliver a Power Point Presentation: Information and Knowledge Systems • Identify and explain how information is collected, formatted, stored and then disseminated (P13) • Identify areas which could benefit from either improvement or a new approach and suggest how these changes could be implemented, using examples where appropriate (P14, P15)
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.


text:
At this time there is no more inventory available for this item.
Please make another selection.
Colorful Snowman Family of 6 Christmas Ornament
Personalized Christmas Ornament
Dimensions: 6 1/2" x 4 1/4"
Material: Clay
The male snowman is wearing his black top hat and the female is wearing her favorite red hat for spending the day out with their four little ones. The snow kids are keeping warm in brightly colored scarfs and hats. This ornament is made with love out of clay. You will be impressed with the attention to the details that are on this family of six ornament. There is space for a first name to be written on each snowman and space for a last name or holiday greeting on the snow. This is a wonderful gift to give to a family of six, or to grandma and grandpa from the grandkids.
Read what our customers say about our Personalized Christmas Ornaments and their shopping experience!Hover over testimonials to stop scrolling
12/10/2015 - "Was very happy to find these items as ornaments. Nancy J."
11/8/2015 - "Received my ornament today, super fast service and the ornament is beautiful. Love it...Betty G."
7/7/2016 - "The ornaments I ordered last year were very much liked by all. Linda J."
1/20/2016 - "IT WAS VERY EASY TO COMPLETE THE ORDER. I WAS ABLE TO FIND WHAT I WANTED VERY EASILY. Dee Dee"
9/21/2015 - "I received my order today, and I am beyond pleased with every ornament! I am very impressed with the quality of each, and they are all adorable. I know these gifts will be a hit this Christmas. Thank you too for the fast shipping! Consider me a new and loyal customer! Jolene M."
11/28/2015 - "I love this website. I have purchased ornaments from this site for the pas t 5 years and will continue to do so. Cindy F."
12/3/2015 - "Loved them! Anonymous Respondent"
4/28/2016 - "Had shopped here previously, so came back to find what I was looking for. Shirley S."
11/23/2015 - "These ornaments were even prettier than the pictures on the website! Very nice quality. Kristi B."
11/17/2015 - "Love the free shipping for 5 or more. Anonymous Respondent"


text:
|By Marketwired .
Article Rating:
|July 25, 2014 04:35 PM EDT
CALGARY, ALBERTA -- (Marketwired) -- 07/25/14 -- Newalta Corporation (TSX:NAL) will issue its results for the second quarter of 2014 on Wednesday, August 6, 2014 after the market closes. Newalta will hold a conference call to discuss its results on Thursday, August 7, 2014 at 11:00 a.m. Eastern Time (9:00 a.m. Mountain Time).
Newalta's management will review financial results for the second quarter of 2014. The call will be hosted by Al Cadotte, President and CEO, and Mike Borys, Executive Vice President and CFO, and Linda Dietsche, Vice President Finance.
To participate in the teleconference, please call 416-340-8010 or toll free 866-226-1792. To access the simultaneous webcast, please visit www.newalta.com.
For those unable to listen to the live call, a taped broadcast will be available at www.newalta.com and, until midnight on Thursday, August 14, 2014, by dialing 800-408-3053 and using pass code 3240258.
Newalta is North America's leading provider of innovative, engineered environmental solutions that enable customers to reduce disposal, enhance recycling and recover valuable resources from industrial residues. We serve customers onsite directly at their operations and through a network of 85 locations in Canada and the U.S. Our proven processes, portfolio of more than 250 operating permits and excellent record of safety make us the first choice provider of sustainability enhancing services to oil, natural gas, petrochemical, refining, lead, manufacturing and mining markets. With a skilled team of more than 2,100 people, two decade track record of profitable expansion and commitment to commercializing new solutions, Newalta is positioned for sustained future growth and improvement. Newalta trades on the TSX as NAL. For more information, visit www.newalta.com.
Newalta Corporation
Anne M. Plasterer
Executive Director, Investor Relations
(403) 806-7019
Newalta Corporation
Stephanie MacVicar
Director, Investor Relations
(403) 806-7391
When people aren't talking about VMs and containers, they're talking about serverless architecture. Serverless is about no maintenance. It means you are not worried about low-level infrastructural and operational details. An event-driven serverless platform is a great use case for IoT. In his session at @ThingsExpo, Animesh Singh, an STSM and Lead for IBM Cloud Platform and Infrastructure, will detail how to build a distributed serverless, polyglot, microservices framework using open source tec...
Jul. 23, 2016 11:00 PM EDT Reads: 2,209
The 19th International Cloud Expo has announced that its Call for Papers is open. Cloud Expo, to be held November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, brings together Cloud Computing, Big Data, Internet of Things, DevOps, Digital Transformation, Microservices and WebRTC to one location. With cloud computing driving a higher percentage of enterprise IT budgets every year, it becomes increasingly important to plant your flag in this fast-expanding business opportuni...
Jul. 23, 2016 10:15 PM EDT Reads: 2,403
"We're bringing out a new application monitoring system to the DevOps space. It manages large enterprise applications that are distributed throughout a node in many enterprises and we manage them as one collective," explained Kevin Barnes, President of eCube Systems, in this SYS-CON.tv interview at DevOps at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 10:00 PM EDT Reads: 1,569
"Being the one true cloud-agnostic and storage-agnostic software solution, more and more customers are coming to Commvault and saying ' What do you recommend? What's your best practice for implementing cloud?" explained Randy De Meno, Chief Technologist at Commvault, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 10:00 PM EDT Reads: 1,567
From wearable activity trackers to fantasy e-sports, data and technology are transforming the way athletes train for the game and fans engage with their teams. In his session at @ThingsExpo, will present key data findings from leading sports organizations San Francisco 49ers, Orlando Magic NBA team. By utilizing data analytics these sports orgs have recognized new revenue streams, doubled its fan base and streamlined costs at its stadiums. John Paul is the CEO and Founder of VenueNext. Prior ...
Jul. 23, 2016 09:30 PM EDT Reads: 1,936
Let's face it, embracing new storage technologies, capabilities and upgrading to new hardware often adds complexity and increases costs. In his session at 18th Cloud Expo, Seth Oxenhorn, Vice President of Business Development & Alliances at FalconStor, discussed how a truly heterogeneous software-defined storage approach can add value to legacy platforms and heterogeneous environments. The result reduces complexity, significantly lowers cost, and provides IT organizations with improved efficienc...
Jul. 23, 2016 09:30 PM EDT Reads: 1,869
Continuous testing helps bridge the gap between developing quickly and maintaining high quality products. But to implement continuous testing, CTOs must take a strategic approach to building a testing infrastructure and toolset that empowers their team to move fast. Download our guide to laying the groundwork for a scalable continuous testing strategy.
Jul. 23, 2016 09:00 PM EDT Reads: 1,805
A critical component of any IoT project is what to do with all the data being generated. This data needs to be captured, processed, structured, and stored in a way to facilitate different kinds of queries. Traditional data warehouse and analytical systems are mature technologies that can be used to handle certain kinds of queries, but they are not always well suited to many problems, particularly when there is a need for real-time insights.
Jul. 23, 2016 08:45 PM EDT Reads: 1,637
CenturyLink has announced that application server solutions from GENBAND are now available as part of CenturyLink's Networx contracts. The General Services Administration (GSA)'s Networx program includes the largest telecommunications contract vehicles ever awarded by the federal government. CenturyLink recently secured an extension through spring 2020 of its offerings available to federal government agencies via GSA's Networx Universal and Enterprise contracts. GENBAND's EXPERiUS™ Application...
Jul. 23, 2016 08:30 PM EDT Reads: 1,764
"My role is working with customers, helping them go through this digital transformation. I spend a lot of time talking to banks, big industries, manufacturers working through how they are integrating and transforming their IT platforms and moving them forward," explained William Morrish, General Manager Product Sales at Interoute, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 08:30 PM EDT Reads: 2,010
Internet of @ThingsExpo, taking place November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, is co-located with the 19th International Cloud Expo and will feature technical sessions from a rock star conference faculty and the leading industry players in the world and ThingsExpo Silicon Valley Call for Papers is now open.
Jul. 23, 2016 08:00 PM EDT Reads: 2,408
Big Data engines are powering a lot of service businesses right now. Data is collected from users from wearable technologies, web behaviors, purchase behavior as well as several arbitrary data points we'd never think of. The demand for faster and bigger engines to crunch and serve up the data to services is growing exponentially. You see a LOT of correlation between "Cloud" and "Big Data" but on Big Data and "Hybrid," where hybrid hosting is the sanest approach to the Big Data Infrastructure pro...
Jul. 23, 2016 08:00 PM EDT Reads: 1,779
In his session at 18th Cloud Expo, Sagi Brody, Chief Technology Officer at Webair Internet Development Inc., and Logan Best, Infrastructure & Network Engineer at Webair, focused on real world deployments of DDoS mitigation strategies in every layer of the network. He gave an overview of methods to prevent these attacks and best practices on how to provide protection in complex cloud platforms. He also outlined what we have found in our experience managing and running thousands of Linux and Unix ...
Jul. 23, 2016 07:45 PM EDT Reads: 1,663
The IoT is changing the way enterprises conduct business. In his session at @ThingsExpo, Eric Hoffman, Vice President at EastBanc Technologies, discussed how businesses can gain an edge over competitors by empowering consumers to take control through IoT. He cited examples such as a Washington, D.C.-based sports club that leveraged IoT and the cloud to develop a comprehensive booking system. He also highlighted how IoT can revitalize and restore outdated business models, making them profitable ...
Jul. 23, 2016 07:15 PM EDT Reads: 1,864
"We view the cloud not really as a specific technology but as a way of doing business and that way of doing business is transforming the way software, infrastructure and services are being delivered to business," explained Matthew Rosen, CEO and Director at Fusion, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 07:00 PM EDT Reads: 1,426


text:
Canada: Man launches drunken assault over presence of rainbow flag in gay politician's office
These comments are un-moderated and do not necessarily represent the views of PinkNews. If you believe that a comment is inappropriate or libellous, please contact us.
More like this
- Man hospitalised after 'brutal' homophobic attack in Edinburgh city centre
- Chris Brown sued over alleged homophobic assault 4
- UK: Gang of three jailed over anti-gay assault on man lured to house off chat room 17
- UK: Two men jailed for five and a half years over homophobic claw hammer attack 2
- UK: Brothers who were 'having a laugh' as they punched and stamped on trans woman, avoid prison 19
- Gay journalist undergoes brain surgery after hate attack in New York 3
Most commented this week
- Nicola Sturgeon: Scotland is in a 'very strong position' to block Brexit 106
- Labour's Owen Smith says he's 'normal' candidate because he has a wife and three kids 100
- Boarding schools given new guidance on accepting transgender students 90
- Church of England Synod member: Gay Christians are 'children of the devil' 85
- Gay billionaire tells Republican convention: 'I am proud to be gay' 74
- Jerusalem mayor snubs memorial Pride parade to avoid 'upsetting' religious groups 71
- Government slammed for 'lukewarm' commitment to transgender reforms 60
- Isle of Man opens civil partnerships to straight couples as equal marriage law gains royal assent 47
- Gay Breitbart editor Milo Yiannopoulos banned from Twitter 47
- Nice terrorist 'used hook-up apps to find men' before ISIS radicalisation 45


text:
Meet fellow book lovers who want to read great books of all types. We'll get together once a month to discuss our book and hang out. Fiction or non-fiction, not to worry - we will either take turns or vote on book choices. No pressure, no stress, no agenda, just read and chat. Come to laugh, share stories and make some new friends. All are welcome! (FYI - we read books in English and our discussions are in English.)
Membership is open to everyone
Content of this Meetup Group is only visible to members
Meetup members, Log in
By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy


text:
We are searching for a nice home for a extra adorable and friendly year old gelding named Journey. Journey is a stout and muscular . hand stock type Quarter…No Price Listed
Solid year old Dun Gelding for Sale. Has had mountain and ranch work. Just completed up to dateNo Price Listed
this girl can cover some nice ground. Ready to make your next all around reiner western dressage SHOT barrelNo Price Listed
things, e.g. to start and pony colts off him, rope and gather cattle - a working horse all around. Easy$6,500
and is current on all vaccines, coggins, de worming and hoof care. I started him January 2016 and put approx 90$6,500
and more. BEEN THERE DONE THAT!!! Has shown in ranch pleasure, ranch horse versatility, working cowhorse$7,500
Devyn is a Morgan mare who is in her 20's. She is a large pony and an absolute sweetheart! She is rideable and would be best suited for trail rides with…No Price Listed
and was started under saddle last year. She is currently walking and trotting under saddle with our riding internsNo Price Listed