text:
#70 of 803
Comment, Like, Favorite
Expert Printing and Assembly
Shipping Within 2 - 3 Business Days
Millions of Satisfied Customers
Buy the Original Painting
16.000 x 20.000 x 0.750 inches
This original painting is currently for sale. At the present time, originals are not offered for sale through the Fine Art America secure checkout system. Please contact the artist directly to inquire about purchasing this original.
Click here to contact the artist.
Frog I Padding Amongst Sunflowers
Xueling Zou
Painting - Oil On Canvas - Original Art By Xueling Zou
Thank you for viewing my original art. ©Xueling Zou -
Shipping included in USA.
This piece won the 1st place in the Contest - Childrens Room Art Contest on June 22nd, 2013.
March 25th, 2013
Viewed 2,897 Times - Last Visitor from Wilmington, DE on 10/09/2015 at 10:54 AM
Sales Sheet
More from Xueling Zou
Bay Area, CA - United States
Thank you buyer from Bayside, NY for purchasing this print. My sincerely thanks to you for supporting my fine art :D!
Pueblo West, CO - United States
Pueblo West, CO - United States
Clever nicely done.
Chapin, S. - United States
Thank you for participating in my contest. Wonderful colors in your painting. L
Stockholm, SE - Sweden
Lovely concept and Beautiful painting! L&F
Lawrenceville, nj - United States
I see you are "inportaint" as an "artist".!!.........humm.!!.........like that.!!.........wm
Wylie, TX - United States
Wow Xueling, this is such a beautiful Artwork!! love it!! l/f/v
Glendale, AZ - United States
Turda, CJ - Romania
Very lovely painting !
South Lake Tahoe, CA - United States
Great work Xueling !L
Cieszyn, Sl - Poland
Very interesting painting. Love it! L/F
Reno, NV - United States
I love your frogs and flowers, Xueling. Sorry I missed you lovely comment on my "Sleepy Time Kitten" quite a while ago.I have not receive many notices in comment on my art. I have missed you. V/F
Reno, NV - United States
Came back to offer this adorable froggy more support!...tweet/g+
North Windham, CT - United States
Beautiful cute painting and great work, Xueling!! F/V
Porterville, CA - United States
This is awesome Xueling! Delightful work! LF!!
Rome, La - Italy
Happy to re-visit and re- vote this fantastic work ! :)
Bucharest, Ro - Romania
Brilliant sense of humor and such a greatly executed painting, Xueling. Your use of colors is so wonderful. Delightful work ! Just had to see it again. :)
London, mi - United Kingdom
stunning piece Xueling a lovely happy image and so beautifully painted such warm colours vote
Monroe, CT - United States
beautiful work, f&l
Glastonbury, So - United Kingdom
ps Many congrats on your well deserved contest win for this piece!
Glastonbury, So - United Kingdom
So lovely to greet again this cheerful blue frog again at the front of your gallery Xueling! He always make me smile and the sunflowers add more uniqueness and joy.So beautifully whimsical! L/F
BS, It - Italy
Cool piece Xueling! f/v
Christchurch, E9 - New Zealand
This is a beautiful painting. L/F
Belgrade - Yugoslavia
This is so colourful and cute... very interesting idea... Congratulations for the first place :) Liked
Kamloops, BC - Canada
Oh Xueling! This is just great! I love it! It is whimsical and makes me smile...but I also love the vibrant colours! L
Brookline, MA - United States
Love this Xueling! Greetings, Juergen
Sussex, WI - United States
Revisiting this art, LOVE this work!!!:)
Reno, NV - United States
Love this piece Xueling!...Adorable frogs!...f/t/v75
Christchurch, E9 - New Zealand
Xueling,Outstanding art work love the little Frog.!!
Sussex, WI - United States
Love your choice and use of color Xueling, pleasing to view;) v/f
Oregon Coast - United States
Beautiful artwork, Xueling! Congrats on you winning 1st place in the Children's Room Art...I can see why, it's so whimsical and colorful! Love the concept of the frog reading to the little froggy...so cute F/V ~ Blessings and Peace :)
Houston, TX - United States
Very nice! v
North Windham, CT - United States
Fantastic painting and work!! F/V
Fürth, Ba - Germany
Wonderfully funny and imaginative painting, Xueling..v/f
Lyon - France
Love your blue frog Ipadding, Xueling!!! It is such a beautiful and special painting! I'm back for another fv and g+! :)
Tucson, AZ - United States
Wonderful painting! vf
Palmdale, CA - United States
Beautiful work and color, Xueling! V
Reno, NV - United States
Such a sweet and lovely painting Xueling, great work! v/f
Cobourg, On - Canada
Lovely painting - nice idea
Livonia, Mi - United States
What a wonderfully whimsical painting, Xueling! Love the colors! f/v
Forest Grove, OR - United States
Very cool and unique image! Great concept too! Live the frogs and sunflowers!
Fairfax, VA - United States
So cute!!!
Turda, CJ - Romania
Nice painting ! Beautiful colors ! Vote
Stourbridge - United Kingdom
Classy but cute, congratulations !
Kelowna, BC - Canada
Congrats on your 1st place win in The Children's Room contest Xueling:)
Maple Ridge, BC - Canada
Congratulations on your win Xueling!!! It was a great contest....:)
Washington, DC, DC - United States
Winchester, Ha - United Kingdom
So cool :-) vf
Worcester, MA - United States
Frogs are one of my favorite creatures... Well done Xueling! Interesting twist with the technology/ipad. Fav/Vote
Strykersville, NY - United States
I love that you work in so many different media and in each case with such artistry. This is an absolute delight my friend. F/V
Please Wait...
Beverly Hills, CA (United States)
Sign up for our newsletter for exclusive deals, discount codes, and more:
Unsubscribe at any time.
Server Status OK
Copyright © 2015 FineArtAmerica.com - All Rights Reserved


text:
Currently BrowsingRoundups
The other half of the new gaming console coin drops today, so just like last week we're here with some iOS game recommendations to help you pass the time while you pick up your pre-order, stand in line, or totally ignore the big consoles!
Click through for some incredible adventures, including one very familiar looking RPG…
Big day in gaming today as we kick off the next generation of consoles, but the industry has become much bigger than that now.
Whether you're not interested in the big gaming machines, or you're just after something fun to do while you're waiting in line for a pre-order, we have some sweet iOS games for you…
It's a blockbuster week for iOS gaming, friends. We're looking at some incredible sequels and some creative new spins on familiar franchises.
Click through and let's get gaming!
Alongside the deluge of Halloween updates we've seen this week, there have also been some remarkable new titles released.
Let's work off that candy hangover with some gaming, shall we?
Another week's worth of wonderful iPhone gaming awaits you, friends.
Robotic puzzles, paper folding, hidden objects, dead pixels, and perhaps the most fascinating bit of storytelling on the App Store are yours to explore after the jump!
This week's roundup includes an all-star set of new titles from some of our favourite developers.
Rejoin Dr. Cavor for a new Cavorite sequel, meditate on the challenges colour arrangements in a new puzzle game, go for a run with your Random Heroes characters, or learn about the history of typography. Come on in and have a look…
This week's games include some stealthy office work, a sci-fi mystery, vehicular warfare, chickens, and a familiar cave…
I may not speak for everyone–and judging by a bevy of social media comments I've see, I don't– but I've really enjoyed iOS 7 thus far. From the moment the update install finished, I was captivated by an experience that was both new and familiar. Even now, I still find myself unlocking my phone just to play with the new OS. To say iOS 7 is a major change is an understatement, and I know it's easy to feel lost or confused about how certain functions now work. Also, there's quite a number of new features to tinker with.
That's where I come in. I've perused iOS 7 in order to compile a list of useful tips and tricks, which I hope will be of great use to you. So, journey forth and discover! (more…)
Autumn brings more than orange leaves and pumpkin spice lattés—it brings games!
We've collected this week's best for you, so come on in and equip yourself for a weekend of fun…
Where do we even start this week?
In the wake of the new iPhones hitting the market, we've seen an incredible wave of new games hitting the App Store—as expected— so let's not waste any time taking a look at what's new!

subset: commoncrawl


text:
Boston forward Paul Pierce makes fun of Miami's LeBron James's "Decision" on Twitter after the Celtics beat the Heat on Thursday night. Posted by Ben Golliver.
Nothing tastes sweeter than a big win in a rivalry game, and the Boston Celtics are surely exuberant after dominating the Miami Heat in their own house on Thursday night in front of a national television audience. Pierce finished with 25 points on the night, and turned to Twitter for some post-game trash talking after the game.
"It's been a pleasure to bring my talents to South Beach, now on to Memphis," Pierce tweeted.
The tweet is a clear reference to "The Decision," a televised special in which Miami forward LeBron James announced to the world that he would be leaving the Cavaliers to join the Heat using the phrase, "I'm taking my talents to South Beach."
James' arrival in Miami was supposed to establish a Heat dynasty, one capable of overcoming Boston's aging Big Three of Pierce, Ray Allen and Kevin Garnett. It hasn't worked out that way so far, as the Celtics are up in the season series 2-0, thanks to fantastic play from point guard Rajon Rondo and some unorganized, inefficient and inconsistent offense for Miami.
Pierce has every right to throw this jab, as James opened himself up completely to criticism and jokes by making his free agency decision in such a public manner. And because Pierce has won an NBA title, whereas James has not. Call this one of the spoils of being a victor.
For James, silence is the best response. It's time for James to join his Heat teammates in licking their collective wounds and to start figuring out how to stack up some Ws, given their 5-4 record on the season is well below their own lofty expectations.
As Pierce mentioned, the Celtics conclude their current four-game road trip against the Grizzlies on Saturday night in Memphis.


text:
Thomson's Josh Jones leading the way for the Dogs
Posted: 10/20/2011 - They are the highest scoring team in the state of Georgia and the points Thomson is putting up this year, is kind of scary to be honest with you. What's even more scarier, most of the points are in the first half. One big cog in that machine is our player of the week, quarterback Josh Jones.


text:
Copyright 2015 Nexstar Broadcasting, Inc. All rights reserved. This material may not be published, broadcast, rewritten, or redistributed.
Brad's Beat: Diamond Man Born with Cerebral Palsy Inspires Others
By Brad Douglas
JOPLIN, MO.--- A Diamond man is inspiring you to get back into the gym and not give up on those New Year's resolutions. Dakota Vincent was born with cerebral palsy. A few years ago, he underwent a surgery that will help him walk. He trained for months and has gotten so strong, he's now a personal trainer at Power House Gym in Joplin. Vincent received a lot of help from the CP center in Joplin and is selling hearts for a dollar to raise money for the center. He says if you set your mind to something, it can happen.
"Keep on going and try your best at whatever you do," said Dakota Vincent, Personal Trainer.
"You can do anything if you try. If you don't take that first step, you're never going to get there," said Christy Graham, CP Executive Director.
You can pick up the dollar hearts until the end of February at Powerhouse Gym. It's located near the Northpark Mall at 530 S. Northpark Lane. For more information, click here.
Don't Miss
FourStates Professionals
Local professionals all in one place.
All in a Days Drive
Information on places to visit that are all in a days drive away.
Community Calendar
Check out all the Community Events!
Connect with FourStatesHomepage
Follow us on Facebook and Twitter
HOT Branson Deals
50% off certificates for Branson, MO entertainment
Dining Deals
50% off certificates for area restaurants
Par Fore Pennies
50% off certificates for golf courses
Half-Off Merchant Deals
50% off certificates for area retail merchants
Come by and see us at the KSN/KODE Summer Road Show!
Come by and see us!
Think you know Football? Play our Pigskin Picks Contest!
Think you know Football?
Enter for YOUR chance to WIN the Ultimate Football Party!
Enter for YOUR chance to WIN
Stay Connected
Top Stories
Featured Coupon


text:
Browsing by Title
Showing results 660 to 679 of 1061 < previous next >
|Issue Date
|Job satisfaction amongst doctors working at rural hospitals of Waterberg District in the Limpopo Province
|Rangongo, M.F.; Somo, Tlou
|The Knee injuries in women soccer players in South Africa
|Mtshali, B F; Mohamed, Ehab Elsayed
|Knowledge ,attitude and practice of voluntary counseling and testing (VCT) for HIV/AIDS amongst the health professionals in Umpumulo Hospital , Mapumulo , Ilembe District , Kwazulu-Natal Province
|Obiajulu, Anthony
|Knowledge and attitudes of women regarding mother-to-child transmission of HIV infection in the Ehlanzeni District, Mpumalanga Province, South Africa
|Jali, M.N.; Sechabe, Ednah Virginia; Lekhuleni, M.E.
|Knowledge and attitudes of women regarding mother-to-child transmission of HIV infection in the Ehlanzeni district, Mpumalanga Province, South Africa
|Sechabe, E. V.; Jali, M. N.; Lekhuleni, M. E.
|Knowledge and experiences of child care workers regarding care and management of children with special needs in four institutions of the department of social development in Tshwane Metro, South Africa
|Pengpid, Supa; Tshitake, Ramokone Sylvia
|The knowledge and practice of patients suffering from cancer of the breast about their disease at Princess Marina Hospital (PMH) Gaborone, Botswana
|Mbuka-Ongona, Deogratias
|Knowledge and practice of Tswaing High School learners regarding diet, nutrition and exercise
|Letlape, Segametsi
|Knowledge and practice on the use of metered dose inhalers by asthmatic patients seen at a Private General Practice in the Vhembe District, Limpopo Province
|Ogunbanjo, G. A.; Magwentshu, Zolelwa Temperance
|Knowledge and practices of health care workers at Medunsa Oral Health Centre regarding post exposure prophlaxis for blood-borne viruses
|Hoque, M. E.; Burnett, R. J.; Nkambule, Ntombizodwa R.
|The knowledge and practices of mothers regarding exclusive breastfeeding in the Mahwelereng Local Area of the Waterberg District, Limpopo Province
|Malema, R. N.; Matlala, S. F.; Frans, Raesetja Annah
|Knowledge attitude and practice of breast cancer examination among women attending Extension 2 Clinic Gaborone, Botswana
|Tiengo, Jane Gillead
|Knowledge management as a competitive edge in a global economy : a case study of Thuto ke Lefa training
|Beyers, J L E; Kanjere, Maria Matshidiso
|Knowledge of basics and ocular manifestations of HIV/AIDS among high schools learners in the Capricorn District of Limpopo Province, South Africa
|Oduntan, O.A.; Melwa, Irene Tersia
|The knowledge of impending heart attack and by-stander cardiopulmonary resuscitation among students at Turfloop University of Limpopo, South Africa
|Mpolokeng, M.B.L.; Nkoko, Koena Joseph
|The knowledge of pregnant women about polymerase chain reaction HIV testing of infants in the Molemole Municipality of the Capricorn District, Limpopo Province
|Malema, R. N.; Ramoraswi, Sophy Ramadimetja; Mothiba, T. M.
|Knowledge, attittudes and practices of healthcare professionals towards adverse drug reaction reporting in Mafikeng Provincial Hospital
|Ntuli-Ngcobo, Busi; Segomotso, Nametso Patience
|Knowledge, attittudes and practices of healthcare workers about prevention and control of multidrug-resistant tuberculosis at Botsabelo Hospital Maseru, Lesotho
|Malangu, Ntambwe; Adebanjo, Omotayo David
|Knowledge, attitude and practices regarding personal protective equipment amongst Stevens Lumber Mills empolyees in the Capricorn District of Limpopo Province, South Africa
|Malema, Rambelani Nancy; Magoro, Flora Madinane; Kekana, P.
|Knowledge, attitude and practices regarding HIV/ AIDS among dental students at Medunsa Oral Health centre
|Mndzebele, S.; Galane, Mpatikana Leslie


text:
Niall Ginnity's contacts (42)
See who has added Niall Ginnity as a contact »
Katherine Nak
I'm Katherine Nak, I've been an artist most of my life. Photography is my passion.
Jeff Johannsen
There are moments in our lives that are precious, views that are breathtaking,...
Michael F. OBrien
I am a retired art and photography teacher. As a photography teacher I told my...
Adam Dooley
Adam Dooley has been a member since Jul 2012 and goes by adamdooley3.
Killian Ginnity
18 Irish
mathew reed
im interested in all facets of photography, but would like to focus on fashion....
Brenda Burk
I am BBurk-Brenda . I love Film
Krzysztof Nowakowski
Krzysztof Nowakowski has been a member since Apr 2009 and goes by novakovsky.
Troy Lim
Thank you for stopping by...I am a part-time published photographer from Sarasota,...
Darrin Mottler
I am an avid outdoor photographer currently residing in Colorado, which makes for...
! SS has been a member since Mar 2009 and goes by szkudlarek.
tim dalton
Live in Boulder, CO Have 9 kids (with the same woman - i always get asked this ?)
Brandon Edwards
I am an amateur photographer from the Northwest. I hope you enjoy my photos and...
Ted Gorczyca
Shooting photography for over thirty years. Had a few photos published (Country...
Chessaddict *
I'm not a professional photographer. I am a spontaneous person and I like to click...
Jerome Crouse
I am a young semi-professional photographer. I like to do a lot of experimenting...
Bianca Trifoi
Like a liar looking for forgiveness from a stone
Ron LaFond
If you can see it, you can shoot it! Article on Photographer's Rights You can...
Mark Rosenbaum
I am new at photography. Well that is relative to those who have been doing this...
! Ralf Kobert !
I am ... german, nursery gardener, town and country planner, webdesigner, son,...


text:
Llodra Reports To Newly Seated Council On School Security DevelopmentsThursday, December 5, 2013
It was an odd image, seeing Jeff Capeci seated at an audience microphone during the public comments portion of Wednesday's Legislative Council meeting.
But as he was briefly honored by newly elected council Chair Mary Ann Jacob for his years of elected service, the former chairman had nothing but congratulations to offer.
"I look forward to following everything you do," Mr Capeci said to the 11 members who gathered for the first meeting of their new two-year term. Council member Lisa Romano arrived later.
An HonorWednesday, November 13, 2013To the Editor: I'm writing to say thank you to the folks who took a few minutes to cast their vote and elect me for a second term on the Legislative Council representing District 1. This is an honor. With the interests and concerns of all residents in mind, I wish to continue moving forward finding common ground with fellow council members. Please feel free to contact me with any thoughts. I look forward to continuing serving our great community. Joe Girgasky Legislative Council – District 1 Lake Road, Newtown November 13, 2013
Communication And AccessibilityWednesday, November 13, 2013
To the Editor:
I'd like to take a moment to thank all the voters who cast their ballots to elect me as one of the four representatives from our district on the Legislative Council. It's a tremendous honor, and I look forward to acting on your behalf in all the challenging decisions ahead. It has a deep personal meaning for me because my grandfather, James Knapp, Sr, who many of you may have known, also served Newtown on the Legislative Council. I know I have some big shoes to fill.
Involvement Is ImportantTuesday, November 12, 2013
To the Editor:
Newtown's Best InterestTuesday, November 12, 2013
To the Editor:
I would like to say thank you to all the voters in Newtown that came to the polls to vote, especially the voters in District 3 for reelecting me to serve as your representative.
I look forward to working with my fellow council members for what is in Newtown's best interest.
Phil Carroll
1 Fieldstone Drive, Newtown November 11, 2013
Meeting The Needs Of District 3Tuesday, November 12, 2013
To the Editor:
I would like to thank the voters in District 3 for allowing me the privilege of representing their interests on the Legislative Council.
It is always a bit of a leap of faith to select someone new to a position, and I will strive to see that faith rewarded. There are many initiatives and moving pieces in town at the moment and I will endeavor to see to it that the needs of District 3 are not lost in the shuffle.
The Importance Of Facts And Common SenseTuesday, November 12, 2013
To the Editor:
I would like to thank Newtown for granting me the opportunity to continue serving on our Legislative Council. I appreciate the support from the District 3 voters, and I look forward to helping our town prosper and grow. Whereas serving as an un-elected official this past year has been a challenging experience, it has primarily been immensely rewarding. I am grateful to be able continue in this role as an elected official.
Appreciative And HopefulMonday, November 11, 2013
To the Editor:
I'm writing to say thank you to the voters of District 1 for allowing me to continue my role as your Democratic Legislative Council representative. I truly appreciate the opportunity.
To those who didn't vote for me, I promise do my best to earn your respect and see if maybe next time around I can earn your vote too.
Looking Forward To Serving NewtownWednesday, November 6, 2013
To the Editor:
Thank you to the voters of Newtown and Sandy Hook's District 2, and to everyone who supported me from all parts of town. I am honored to be elected to the Legislative Council in District 2.
In the weeks ahead, I will be reaching out to my fellow council members, and I look forward to getting to know them better so that we can work collaboratively in issues that are important to our town.
Working Hard For NewtownWednesday, November 6, 2013
To the Editor:
I would like to say thank you to the voters who came out to the polls this week. I am again honored to represent District 2 on the Legislative Council.
Just as before, I am committed to working with the rest of the council and all the people of Newtown to better our community. As we move ahead, I again look forward to hearing your ideas and concerns. You can write to me at the address below, or drop me an email at any time at email@example.com.


text:
Highly stylized, nonstop 80's show, Tainted Love offer a refreshing change from the usual party bands with enough energy and excitement to dance all night.
$19 + fee ADV
$24 + fee NOS
At Fox Theater in RWC
OR next door at CLUB FOX is Pride and Joy- details below
****** EMAIL LYNDA to let her know which show you prefer to go to IF you are going for sure! [masked]
I know many of us DO NOT like the big theater and prefer the smaller club setting. BUT keep in mind that Pride and Joy WILL sell out at Club Fox so let's decide FAST what do do!!!
Lynda's cell 650--996-6652. Text us when you arrive!
Hey Everyone-
It turns out that the club will save us some high tables and chairs upstairs overlooking the stage...if you are facing the stage we will be top left, so go up the stairs right when you walk in the club and we should have reserved tables right there.
This show is sold out so this way we can be out of the huge crowd below unless we want to dance. And their is a bar and bathrooms up there too! And best of all we do NOT have to arrive so early to get in line.
We will plan to arrive at the time the doors open though. We may be 4-5 chairs short of what we need but we can rotate as everyone is up and down dancing as usual.
See you later! Lynda
Text my cell is nee be[masked]
0 · March 8, 2014
Hello Guys, this is Siddharth. I just joined this group and looking forward to tomorrow's event. Just a little confused which show is everyone attending. Tainted love or Pride and Joy. I guess the tickets for pride and joy have been sold off. Can anyone please let me know where should I get the tickets from for the Tainted Love show ?
0 · March 8, 2014
Looks like we are going to attend after all! Just to.have to get tix!
1 · March 6, 2014
Will be at my pal's bachelorette party! Rock on!
0 · March 6, 2014
I worked out a deal with the Club Fox- Go online ASAP and buy your tickets for Pride and Joy at Club Fox. Once we arrive they will give us passes to go back and forth to BOTH shows as much as we like!! NO extra charge. I suggest you do this ASAP!
Once you buy your tickets, let me know ASAP so I have have your name on the list from our group!
Door for Club Fox show opens at 8:30... We plan to arrive by about 7:45-ish..so we can be sure to get a table!
1 · March 4, 2014
Tainted Love is great! We are just returning from vacation so we'll see how tired we are but are a tentative yes!
1 · February 24, 2014
I started the group because there wasn't any other type of group like this. I've met some great folks in the group who have become close friends and have also met some amazing business owners.
— Bill, started New York City Gay Craft Beer Lovers
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:
Dental, aesthetic and surgical procedures are performed at this clinic in London. Dental treatments provided at the clinic are implants, oral surgery, root canal surgery, gum disease treatments. Aesthetic procedures include, Treatment for lines and wrinkles, chemical peels, dermal fillers, Sclerotherapy and semi permanent makeup.Other clinical treatments at the clinic include podiatry & cataract correction
Endodontic Services
Dental Implants
Oral Surgery
Periodontic Services
Facials and Makeup
Medical Aesthetics
Parking - There is limited patient parking available.
Public transport access - The nearest tube is Woodside Park on the High Barnet Branch of the Northern Line
Private Patients Welcome
AXA PPP Healthcare
CIGNA Healthcare
© 2015 WhatClinic.com | Privacy Policy | Terms of Service
Global Medical Treatment Ltd trading as WhatClinic.com 12 Duke Lane Upper, Dublin 2, Ireland
email@example.com, Tel: +353 1 652 0520: Co. Reg. No. 428122 All Rights Reserved


text:
SKIPPACK, Pa., Dec. 14 /PRNewswire/ -- At GeoInvesting.com, we have been tracking Tianyin Pharmaceuticals (NYSE Amex: TPI) for some time now. Our largest hang up had been with the potential dilution from "in-the-money" warrants. Although the Company's fiscal June 2010 net income guidance of $11.3 million represents a 43.0% increase from the fiscal 2009 reported net income of $7.9 million, the increase in shares poses some uncertainty regarding the near term EPS growth scenario, which depends upon the share price and the Treasury method of accounting for these warrants under GAAP. (Tianyin reported 32 cents per share for its 2009 fiscal year, based on 24.8 million shares).
Having said that, on December 3, 2009 Tianyin issued fiscal 2011 net income guidance of $19.6 million, implying earnings per share figure of 50 cents, fully taxed. Combine this with an overall positive outlook, a very accomplished management team, cash available to make potential future acquisitions, and the TPI story begins to gain strength.
Biostar Pharmaceuticals (OTC Bulletin Board: BSPM) is another pharmaceutical company whose stock we own. Through our interview with management, BSPM demonstrated that it has a coherent understanding of its markets and the steps necessary to accelerate growth.
Biostar manufactures & distributes 15 nonprescription, prescription and nutraceutical products. There are 3 aspects of the Company's story that are worth considering. First, Biostar's Hepatitis flagship drug is the only one offered over the counter in Chinese drug stores.
To view more on TPI and BSPM , please visit the following link:
|SOURCE GeoInvesting.com
Copyright©2009 PR Newswire.
All rights reserved


text:
Re: [backpackgeartesters] [EDIT] IR - ExOfficio Storm Jacket - Bob Sanders
Expand Messages
- Thanks James,
I have made the changes. I am still trying to figure out why the HTML code gets changed when I upload. If I can't figure it out (I have posted a question to the BGTFileUpload Group. Maybe someone over their can steer me in the right direction.
The font issues you described are one of the things that gets changed upon upload.
Thanks so much,
On Oct 3, 2011, at 9:05 AM, jetriple@... wrote:
> Bob Sanders <rscreative@...> wrote on 10/02/2011 04:33:59 PM:
> > Hi James,
> >
> > Here is my Initial Report for the ExOfficio Logic Jacket. My
> > apologizies for being a couple days late.
> >
> > I have uploaded the HTML into the test folder and here is the link.
> > http://tinyurl.com/694uejl
> >
> Hi Bob. Thank you for your ExOfficio Storm Jacket Initial Report. Sorry
> to hear you are having troubles with the layout once the report is
> uploaded. I think it actually looks really good, although there a font
> issue described below. If you need help you can join the
> BGTFileUploadHelp group and ask for help there.
> http://groups.yahoo.com/group/BGTFileUploadHelp/
> You have a very well written report with excellent pictures. Please see
> my edits below and adjust your report accordingly. Once you are satisfied
> with the report, please upload it to the official folder. Please don't
> forget to delete the copy in the test folder.
> Thanks again!
> James E. Triplett
> ExOfficio Storm Logic Jacket Monitor
> ++++++++++++++++++++++++++++++
> [Edit] General comment. The font of your report starts out as Times New
> Roman, until the "INITIAL IMPRESSIONS" section. There it changes to what
> looks like Arial. Then the paragraphs that start "The jacket is primarily
> marketed as a travel jacket" and "The other travel oriented feature of the
> jacket is the integrated pillow" are back to Times New Roman, as well as
> the "Presto, Chango - Travel Pillow" caption. After that it's back to
> Arial.
[Non-text portions of this message have been removed]
Your message has been successfully submitted and would be delivered to recipients shortly.


text:
阿姆斯特丹 Hotel Max in Mokum
Hemonystraat 7 1018 ep
Hotel Max is a simple and clean hotel located in the center of Amsterdam near the De Pijp District.
It offers basic accommodation at reasonable prices.
Double and Quadruple rooms are available, all with private shower and W.C.
Reception for Hotel Max is located just across the street in Hotel Iris. A Breakfast Buffet is also served in Hotel Iris for every day from 08:00 - 11:00 for 8 euro per person.
Visa, MasterCard and Maestro are all accepted, American Express unfortunately not.
Guests are required to present the credit card used for the reservation upon arrival. The cardholder must also be present at check-in for pre-paid reservations. If not, the guest will be asked to pay for the full amount of the reservation and the original amount will be refunded to the card used to make the reservation. Please note that all refunds are processed within 10 working days.
Check-in is from 14.30 - 22:00.
Check-out is until 11.00.
The hotel is non-smoking.
Hotel Max offers clean accommodation in the heart of Amsterdam. It is located in the center not far from the 'De Pijp' district.
Dam Square, Rembrandtplein and Leidseplein are a short distance away. Museums such as the famous Rijksmuseum, the Van Gogh Museum, the Anne Frank House are all accessible by public transportation.
Pets are unfortunately not allowed.
Hotel Max Reception will re-open starting March 15, 2015. Reception hours will be 9:00 – 21:00h.
All necessary services outside the mentioned hours of operation must be done at Hotel Iris
(Sarphatikade 17, 1017 WV, Amsterdam), located only minutes away walking.
你住过这里吗? 写一篇评论


text:
by Margaret Hartley
A Daily Gazette community blog
Ideas on greener living
Thursday, July 30, 2015
Trying to take vacation wherever I am
If it's summer, it's summer vacation, right?
Tuesday, July 21, 2015
Garden overproducing? Consider donating
If you're a gardener, you know some plants insist on overproducing. Think about donating some of the extra. Especially if you've got an overproducing zucchini plant.
Saturday, July 11, 2015
Free-range, cage-free: What do the labels mean?
Turns out some of them don't mean anything.
Monday, July 6, 2015
Flowers preferable to mowers, which are preferable to sprayers
I went out looking for wildflowers one early morning last week, and came home with a pint of wild blueberries for our breakfast.
Monday, June 29, 2015
No shawls, but ducks act like storybook characters
"What a funny sight it is to see a brood of ducklings with a hen! Listen to the story of Jemima Puddle-duck, who was annoyed because the farmer's wife would not let her hatch her own eggs." So begins my sister's favorite Beatrix Potter book, one that my kids grew ...
Saturday, June 20, 2015
Losing the battle against plastic
Recycling's great, but isn't it better to reduce from the source? If we don't pick up plastic bags in the first place, we don't have to recycle them, or throw them in the garbage or — and someone's doing this — out our car windows.
Friday, June 12, 2015
Farmhouse chic: Boots, chicks and feed bags
Is 'farmhouse messy' considered a style?
Sunday, May 31, 2015
Even after rain, conserving water's important
Here in the Northeast, we have dry summers and wet summers, and we tend to think it will all even out.
Friday, May 22, 2015
A fine hiking partner
Getting outside for long walks with my favorite son.
Saturday, May 16, 2015
Lots of flowers, fewer bees
How planting from seed can help the bees


text:
Feb 24, 2012 — Fox 5 San Diego has issued an apology for their anchor's remarks. Great work everyone! Only by calling out sexism do we stop it. Naming it really does change it!
We were unable to post to Facebook. If you still want to share this petition, please try again.


text:
State Street woman denies growing potSeptember 19,2013By Josh O'Gorman
Staff Writer
A Rutland woman denied charges she was growing marijuana in her State Street home.
Tammy Duquette, 50, pleaded innocent in Rutland criminal court Monday to a felony charge of cultivating three or more pot plants, which carries a maximum penalty of three years in prison and a $10,000 fine.
According to an affidavit filed with the court, in late July, state police received a tip of a grow operation at 182 State St. When police arrived, they met Duquette outside, who reportedly told police she had three pot plants inside, records state.
Affidavits state Duquette allowed police to search her residence, and the search revealed a grow operation – including lights, timers, plant food and fertilizer – with 17 plants.
"While inside this room Duquette advised me that she was responsible for growing the marijuana plants and that she was not very good at it," Sate Police Detective Cpl. David LaChance wrote in his affidavit. "She advised she had been growing the marijuana plants for her own used (sic) and was not selling any of the marijuana."MORE IN This Just In
Two deny incidents
at Price Chopper
Two people were in Rutland criminal court... Full Story
Flu vaccines
being offered
Free flu shots are available for Rutland County... Full Story
Phil Scott to
visit Castleton
CASTLETON — Lt. Gov. Full Story
- Most Popular
- Most Emailed


text:
Scosche specializes in Car Audio Installation Dash Kits, Speakers, Subwoofers, Amplifiers, Sub Boxes and Enclosures, Harnesses and Interfaces, Hardware and Wiring, Tools, Adaptors, Bluetooth and Mobile Accessories, Stereo Install Kits, Installation Kits for Car Radio, and much more. Scosche has everything you need to replace your vehicle's factory stereo to improve the overall sound quality of your vehicle's audio system.
car audio installation
Installation - kits and more
TA2108MGB2011-Up Toyota Sequoia/Tundra Double DIN or DIN w/pocket Install Dash Kit Learn More$39.95
TA03B2000-Up Toyota Amplifier Interface Learn More$39.95


text:
Coming up in the next {{countdown}} {{countdownlbl}}
Coming up next:
Skip to this video now
Now Playing:
Play Video
This transcript has been automatically generated and may not be 100% accurate.
Search Warrants Reveal Details in Shooting Death of Texas DA
Relatives of the couple told police they hadn't spoken to them in a day.
DA Killing Reignites Hunt for Links to Colo. Murder
Texas DA was killed in incident similar to slain Colorado prisons chief.
Now Playing: Texas D.A. Killing: Are Other Officials at Risk?
Now Playing: Oregon College Shooting: More Details Emerge on Gunman
Now Playing: How This Family Became Millionaires Through Vlogging
Now Playing: Dogs Compete in California Surf Competition
Now Playing: Multiple Casualties Reported in Oregon Community College Shooting
Now Playing: How This Pastor Wants to Make Going to Church Cool
Now Playing: The Mystery Woman Behind Donald Trump
Now Playing: Meet Police Offers Trained to Respond to Mental Illness Calls
Now Playing: Why 'The Walk' Star Joseph Gordon-Levitt Is 'Uncomfortable' With Fame
Now Playing: Inside a Peru Hotel Suspended on the Edge of a Cliff
Now Playing: On a Mental Health Call With Trained Texas Police Officers
Now Playing: Oklahoma Man Fights Death Sentence Day Before Execution Date
Now Playing: Meet the Smokejumpers: Wildfire Fighters Who Jump Out of Planes
Now Playing: Inside Amy Robach's Fight For Her Life Against Cancer
Now Playing: The Shocking Dangers of High School Football
Now Playing: How 'Quantico' Star Priyanka Chopra Dealt With Race Issues
Now Playing: NASA Reveals Traces of Water Found on Mars
Now Playing: Inside the Infamous O.J. Simpson White Bronco Chase
Now Playing: What O.J. Simpson Said in Rarely Seen Deposition Tapes
Now Playing: How This Man and His Man Bun Became a Social Media Celebrity
Now Playing: {{itm.title}}


text:
Back to school Wednesday in Ardmore
Updated: 08/13/2008 - ARDMORE, OK -- Many youngsters had to get up early Wednesday morning, as schools all over southern Oklahoma resumed classes. Robin Beal reports.
Updated: 08/13/2008 - ARDMORE, OK -- Many youngsters had to get up early Wednesday morning, as schools all over southern Oklahoma resumed classes. Robin Beal reports.
Posted: 08/13/2008 - HEALDTON, OK -- The boil advisory issued by Healdton city officials on Monday has been lifted.
Posted: 08/13/2008 - HOUSTON - Two Houston churches will conduct memorial and funeral masses this week for 11 victims of Friday's bus crash in Sherman.
Updated: 08/13/2008 - DALLAS - The federal government says it halting licenses to new bus companies on a temporary basis as a result of the crash in Texas that killed 17 people.
Updated: 08/13/2008 - Commander John Herrington, a Chickasaw citizen and the first Native American in space, begins a new 4,000 mile journey Wednesday, August 13.
Updated: 08/13/2008 - DENISON, TX -- At the heart of Denison is a milestone and soon, a new museum will be dedicated to the Missouri-Kansas-Texas Railroad and its employees.
Posted: 08/12/2008 - CARTER COUNTY, OK -- A debate brewing over land rights and a planned multimillion dollar facility is right in the middle of it. It was the first of the year when Oklahoma State University announced plans to build a 70-acre research facility in Carter County on the Ardmore-Dickson town limits. Now questions are being raised over which municipality the facility will call home.
Posted: 08/12/2008 - FANNIN COUNTY, TX -- A Bonham man pled guilty to illegally recording children taking a bath. Assistant county attorney James Noss says 32-year-old Jacob Clyde Eaton entered the guilty plea on charges of improper visual recording to receive sentencing from a judge rather than a jury.
Posted: 08/12/2008 - ARDMORE, OK -- Oklahoma Corporation Commissioner Jim Roth was in Ardmore on Tuesday to speak to the Democratic Ladies Luncheon.
Posted: 08/12/2008 - GRAYSON COUNTY, TX -- A man with Denison ties is being sought by federal and local authorities Tuesday night. Authorities say 25-year-old Brandon Harris Smith has 11 outstanding warrants in Grayson County, including charges for evading arrest, theft, and bail jumping
Posted: 08/12/2008 - DURANT, OK -- Some Oklahoma officers beefed up their skills Tuesday in preparation for the upcoming national "Over the Limit, Under Arrest" campaign.
Posted: 08/12/2008 - DURANT, OK -- Durant police are investigating an unusual home invasion that happened early Sunday morning. Investigators say at least two people burglarized a home in the 400 block of Tennessee.
Posted: 08/12/2008 - TULSA, OK--- Bankrupt Tulsa-based SemGroup has started laying off employees. About 250 employees nationwide are expected to lose their jobs. A company spokesperson says that none of those layoffs will be at Sherman's SemGas facility, but the Sherman location is for sale.
Updated: 08/12/2008 - OKLAHOMA CITY - If you think the price of watermelons has gone up in Oklahoma, you're right.
Updated: 08/12/2008 - ARDMORE, OK -- A mock training drill was held Tuesday for emergency personnel in Ardmore. Members from the Ardmore Fire, Police, and Health Departments held a joint training session Tuesday morning at the Southern Oklahoma Technology Center. Robin Beal has more.
Updated: 08/12/2008 - Carter County is now back on the list of burn bans across Texoma. To see all the counties under burn bans, click on full story.
Updated: 08/12/2008 - Protecting yourself against identity theft is something all of us should consider. The Justice Department says it has charged 11 people with stealing and selling more than 40 million credit and debit card numbers in what it calls the largest hacking and identity theft case it has ever prosecuted. There are ways to protect yourself from becoming the victim.
Updated: 08/12/2008 - DALLAS - Harris County prosecutors say they are considering criminal charges against a Houston bus owner and president whose bus crashed near Sherman, killing 17.
Updated: 08/12/2008 - KINGSTON, OK -- The start of a new school year in Oklahoma means enrolling your child, but the paperwork often does not stop there. Another important form for a lot of schools is the household income paperwork.
Updated: 08/12/2008 - SHERMAN, TX--- The community is stepping up to give blood for those affected by the crash.The Texoma Regional Blood Center reports hundreds of caring residents have come by to donate.
Posted: 08/11/2008 - SHERMAN, TX -- As the investigation progresses, safety officials now are uncovering disturbing information about these two tour companies and the driver of the bus. Emi FitzGerald has the details.
Posted: 08/11/2008 - ARDMORE, OK -- This week marks a nervous time for a lot of youngsters as they head back to school. Robin Beal reports from Ardmore where classes at Ardmore city schools resume on Wednesday.
Posted: 08/11/2008 - DENISON, TX -- Earning a Bachelor's Degree takes a lot of time and hard work, and sometimes life can get in the way of earning that degree. On Monday, Grayson County College signed an agreement to help students achieve that goal. Stephanie Brletic has the details.
Posted: 08/11/2008 - DURANT, OK -- Durant police now have a new four-legged officer on the team. 'Baron' is not only new to the force-- he's new to the country. The one-year-old German shepherd arrived from a training facility in the Czech Republic.
Posted: 08/11/2008 - SHERMAN, TX -- It may be hard to imagine how police and other emergency agencies stay organized in situations like Friday's bus accident in Sherman. Stephanie Brletic talked with Sherman Police Chief Tom Watt on Monday about how those officers who worked a scene that became the focal point of Texas and much of the country late last week.


text:
At the Forte Village Resort there is something for everyone - from 12 well lit tennis courts, to a nine-hole putting green, several mini soccer fields, and basketball and volleyball courts.
Professional instructors are on hand for tennis lessons, windsurfing, aerobics, water-skiing, scuba diving and sailing.
Horse riding and a 27-hole golf course are available nearby.
Why not ask your friends and family to contribute towards your dream honeymoon?
Order one of our gorgeous hotel directories.
Experience the therapeutic waters at Vidago Palace
Enter the draw


text:
Former Gator wide receiver Riley Cooper has officially accepted an invitation to participate in the 2010 Under Armour Senior Bowl, game officials announced on Saturday. He will join former UF quarterback Tim Tebow (Jacksonville, Fla.) at the senior showcase event.
UF's Riley Cooper Invited To Participate In Senior Bowl
Welcome to SECTalk.com
|Welcome to SECTalk.com -- The Home of 6 Straight National Titles!
You are currently accessing our site as a guest which means you can't access all of our features such as social groups, sports betting, and many more. By joining our free community you will have access to all of these great features as well as to participating in our forums, contacting other members, and much more. Registration only takes a minute and SECTalk.com is absolutely free, so please join today!
If you have any problems registering or signing in, please contact us.
Latest Topics
Latest News
Top Bettors
Top High Fived
UF's Riley Cooper Invited To Participate In Senior Bowl
Started by GatorUnvrsty, Jan 16 2010 10:20 PM
Similar Topics
|Started By
|Last Post Info
Senior Feature: Kris Frost
Started by Spunk, 29 Sep 2015 In: The West → Auburn Sports → Auburn News
- 0 replies
- 60 views
Fahn Cooper Tabbed SEC O-Lineman of the Week
Started by GoldenRebel, 28 Sep 2015 In: The West → Ole Miss Sports → Ole Miss News
- 0 replies
- 40 views
Senior Feature: Jonathan Wallace
Started by Spunk, 14 Sep 2015 In: The West → Auburn Sports → Auburn News
- 0 replies
- 75 views
Scheu selected as candidate for Senior CLASS Award
Started by SECTalk.com, 14 Sep 2015 In: The East → Vanderbilt Sports → Vanderbilt News
- 0 replies
- 60 views
#Storify: #Vols Bowl Over Falcons, 59-30
Started by SECTalk.com, 05 Sep 2015 In: The East → Tennessee Sports → Tennessee News
- 0 replies
- 135 views


text:
Atlanta, September 23, 2013Limiting the amount of radiation absorbed in the hippocampal portion of the brain during whole-brain radiotherapy (WBRT) for brain metastases preserves memory function in patients for up to six months after treatment, according to research presented today at the American Society for Radiation Oncology's (ASTRO's) 55th Annual Meeting.
The single-arm, phase II study was a multi-institutional, international clinical trial in the U.S. and Canada, conducted through the Radiation Therapy Oncology Group (RTOG). Researchers compared the study group to a historical control group of patients who had received WBRT without hippocampal avoidance in the PCI-P-120-9801 phase III trial (Li 2007).
This study enrolled 113 adult patients from 2011 through 2013 who had a measurable brain metastasis outside a 5-mm margin around the hippocampus. Of those patients, 100 were analyzable and 76 percent were categorized as recursive partitioning analysis (RPA) class II. All patients received hippocampal avoidance whole-brain radiotherapy (HA-WBRT) to 30 Gy in 10 fractions. In all analyzable patients, the dose received by the entirety of the hippocampus did not exceed 10 Gy, and the maximum dose did not exceed 17 Gy. Patients were assessed using the Hopkins Verbal Learning Test - Delayed Recall (HVLT-DR), the HVLT - Recall (HVLT-R) and the HVLT - Immediate Recognition (HVLT-IR) at baseline and post-treatment at two-, four- and six-month intervals. The primary endpoint of the trial was the HVLT-DR at four months.
Results showed that the 42 patients who were analyzable at four months post-RT had a seven percent decline in HVLT-DR from baseline to four months (95 percent confidence interval (CI): -4.7 percent to 18.7 percent). This is statistically significant when compared to the historical control group (p=0.0003), which demonstrated a 30 percent decline in HVLT-DR at four months. Six months after treatment, the 29 analyzable patient
|Contact: Michelle Kirkwood
American Society for Radiation Oncology


text:
|Publication number
|Publication type
|Application number
|Publication date
|Oct 1, 1985
|Filing date
|Sep 9, 1983
|Priority date
|Sep 9, 1983
|Fee status
|Publication number
|Robert C. Davis
|Original Assignee
|Harris Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (3), Non-Patent Citations (2), Referenced by (27), Classifications (4), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates in general to digital communication systems, and is particularly directed to a Viterbi algorithm decoder for convolutional error-correction codes.
The objective for all error correction coding/decoding techniques is to provide, at the digital data receiver, an ability to correct errors introduced into the digital bit stream when the data is transmitted over a noisy communication channel. This objective may be accomplished by suitable encoding of the digital data stream by an error-correction coder prior to transmission over the channel. Then, at the receiver end of the communication channel, an error correction decoder is employed to map the received coded data back into the original information bit stream. If not too many errors occur in the channel, this decoding process at the receiver produces error-free data reception, even though some errors are introduced into the coded bit stream as it passes through the noisy communication channel.
Where the error correction coding scheme at the transmitter takes the form of a convolutional encoding technique, a decoding procedure, known as a Viterbi algorithm decoder, has been found to be particularly attractive for recovering the transmitted digital data from a receiver of a noisy bit stream. For an overview of the Viterbi algorithm attention may be directed to articles by A. J. Viterbi entitled "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inform. Theory, Vol IT-13, pp. 260-269, April, 1967, and "Convolutional Codes and Their Performance in Communication Systems," IEEE Trans. Commun. Technol., Vol. COM-19, pp 751-722, October 1971 and an article by G. D. Forney entitled "The Viterbi Algorithm," Proc. IEEE, Vol. 61, pp 268-278, March 1973.
Of the signal processing techniques that have been developed to date for implementing the Viterbi Algorithm, all are essentially digitally based schemes, requiring the interfacing of a number of different functional components, resulting in a decoding system that is both costly and complicated. For an illustration of such proposals attention may be directed to the U.S. Pat. No. 4,015,238 to Davis; Clark et al U.S. Pat. No. 3,789,360; Melvin U.S. Pat. No. 4,087,752; and Acampora U.S. Pat. No. 4,087,707.
In accordance with the present invention, a significant departure from the digital approach of conventional Viterbi algorithm decoder has been developed. The present invention involves what is essentially an analog hardware configuration comprised of a diode-switch-trellis network, that effectively executes the solution to a shortest route problem in the decoding process. In its basic configuration, the novel decoder of the present invention contains a trellis of branch-distance circuits each of which is formed of sets of diodes and controlled interconnecting switches. During a respective bit time, the branch-distance circuits are controlled so as to connect a number of diodes in each branch of the trellis proportional to the distance of the diode branch of interest to the received code branch. Due to the nonlinear voltage-current characteristic of a diode, only the path through the trellis of the branch-distance circuits having the minimum distance from the received data will draw current. Because of the simplicity of the components of which the branch-distance trellis network is formed, the present invention is readily implemented using a large scale integrated circuit (LSI) chip.
FIG. 1 shows a block diagram of a generalized convolutional encoder employed at a transmitter site;
FIG. 2 is a trellis diagram illustration of the transitions in encoder state values for successive bit times;
FIG. 3 is a block diagram of digital data transmission system controlling convolutional encoder, transmission channel, and receiver/decoder;
FIG. 4 is a block diagram of rate 1/2, n=1 convolutional encoder;
FIG. 5 is a trellis diagram of the transitions in encoder state values for successive bit times for the convolution encoder of FIG. 4;
FIG. 6 is a diagram showing the decoding process for a trellis diagram of FIG. 5;
FIG. 7 shows a two-path, two-node diode network for finding the minimum distance path between two nodes;
FIG. 8 shows the typical current vs. voltage characteristic of a zener diode;
FIG. 9 shows the basic circuit configuration of a branch distance circuit;
FIG. 10 is a schematic block diagram of a shortest-route Viterbi algorithm decoder in accordance with the present invention;
FIG. 11 shows a quantization scheme for an eight-level decision circuit; and
FIG. 12 shows a branch distance mapping function for soft decision decoding.
In order to facilitate an understanding of the present invention, a brief discussion of convolutional encoding and the use of the Viterbi algorithm will initially be presented. For further details on such encoding techniques attention may be directed to the above-referenced literature.
FIG. 1 shows a general convolutional encoder used to encode the data at the transmitter prior to passing the signal through the communication channel. Raw data bits from the original information source are presented serially over data input line 10 to an n-stage binary encoder shift register 11 for encoding. As shown in FIG. 1, the ith bit bi in the serial input bit stream is entering stage 1 of the encoder register. Prior bits bi-1, b1-2, . . . , bi-n are still in stages zi-1. . . zi-n of the encoder shift register 11. These bits are connected to two modulo-2 adders 12 and 13 to form two output bits, T1i and T2i on lines 14 and 15, respectively. These bits may be mathematically described as follows: ##EQU1## where
g1k =0 if bi-k is not connected to Mod 2 adder 12,
g1k =1 if bi-k is connected to Mod 2 adder 12,
g2k =0 if bi-k is not connected to Mod-2 adder 13, and
g2k =1 if bi-k is connected to Mod-2 adder 13.
The glk coefficients for a specific code thus determine which bits in the encoder register are connected to the modulo-2 adders. The sets of connection coefficients are often defined as generator polynomials for the convolutional code, i.e. ##EQU2## would be the two generator polynomials for the general rate 1/2 code shown in FIG. 1.
For each bit time a new bi bit is presented to the encoder, two new bits, T1i and T2i, are produced, and the multiplexer 17 is switched to pass first T1i, then T2i sequentially out of the encoder over output line 18 for transmission over the channel. The code rate of the convolutional encoder is defined as the ratio of the uncoded input bit rate to the coded output rate and, for the example in FIG. 1, the code rate is 1/2. Thus, the output bit rate is twice the input bit rate in the encoder of FIG. 1.
Other code rates are possible: for example, by including a third modulo-2 adder, a third set of connection coefficients or generator polynomial and a 3-to-1 multiplexer in place of 2:1 multiplexer 17, a 1/3 code rate is obtained wherein the output bit rate is three times the input bit rate. To simplify the present discussions only rate 1/2 convolutional encoders of the type shown in FIG. 1 will be considered.
Other terms to be defined to facilitate further discussion of the convolutional codes are as follows. The constraint length, K, of the convolutional code is defined as
K=n+1. (5)
The constraint length thus defines the span of input bits which influences the encoder output.
Another very useful concept for convolutional codes is that of the state of the encoder. The state of the encoder at bit time i will be defined as Si, where ##EQU3## From equation (6) it is seen that the state of the encoder is simply the binary number representation of the last n input bits stored in the encoder shift register 11. The encoder can thus be viewed as a finite state machine with the number of states defined as Ns given by
Ns =2n (7)
The output bits T1i and T2i from the encoder are obviously determined when bi and Si are given, since all the bits defining the outputs in equations (1) and (2) are then known. Also, it can be seen that given Si and bi, Si+1 can be determined, that is, the state to which the encoder will advance on the next bit time, because of the insertion of bi into the encoder shift register 11. Mathematically, the new state Si+1 resulting from the insertion of bi into the register (hence pushing bi-n out) can be defined by
Si+1 =(2�Si +bi) Modulo-2n (8).
Equation (8) defining state transitions leads to one of the most useful graphic description of convolutional codes for understanding the decoding process to be described later. This graphic description is known as a trellis diagram and is obtained by plotting the encoder state, Si, at bit time i versus i for all possible sequences of bits, (bi).
FIG. 2 shows an exemplary trellis diagram for an n=2 code for which there are four possible states: 0, 1, 2, and 3. In FIG. 2, it has been assumed that at i=0 the encoder is in state 0, i.e., So =0. All possible state transition paths through this trellis diagram thus emanate from state 0 at i=0. The particular sequence of encoder states encountered, as data bit encoding proceeds from i=0, depends, through Equation (8), on the particular sequence of data bits, (b0, b1, b2, . . . ), presented to the encoder by the data source. In FIG. 2, the path followed by the sequence of bits, (b0 =1, b1 =0, b2 =0, b3 =0, b4 =0) is accentuated by heavy solid line 20. Along this path it can be seen (and calculated from equation (8)) that the sequence of encoder states encountered (S0, S1, S2, S3, S4 , S5) is (0, 1, 2, 0, 0, 0). Likewise, a path through this trellis diagram can be traced for any other sequence of input data bits. Thus all possible sequences of encoder states versus bit time are contained in and represented by a trellis diagram continuing ad infinitum for positive time.
The trellis diagram representation for convolutional codes will assist in understanding the functioning of the novel decoder of the present invention to be detailed below. However, several other comments should first be made about the properties of this trellis diagram. First, it should be noted that every line, or branch, connecting the encoder states in the trellis diagram can be labeled with the input data bit causing the state transition to occur. This has been shown in FIG. 2 by indicating below a number of the branches the value of bi corresponding to that particular branch. Secondly, note that each branch may also be labeled with the two coded bits, T1i and T2i, from Equations (1) and (2), that are produced by the encoder as each branch of the code is produced. Such labels have not been included in FIG. 2 to avoid cluttering the diagram. However, it should be observed that the trellis diagram is a complete description of the encoding process, indicating bits input to the encoder and the corresponding coder output bits placed on the channel at each bit time.
Another property of the code paths contained in the trellis diagram that is useful in the present discussions is that of merging. From FIG. 2 it can be seen that from each state, two branches emanate (corresponding to bi =0 and bi =1 respectively in Equation (8)). Also, it should be noted that two different branches converge on each state. This convergence or merging of paths occurs because of the independence of state Si+1 on bi-n, the bit that is pushed out of the encoder register 11 in FIG. 1 as the new bit bi is inserted into the encoder register 11.
With the trellis diagram representation for convolutional encoding having been briefly described a discussion of the decoding of such codes at the receiver will next be presented.
FIG. 3 is a consolidated block diagram of an overall digital data transmission system and illustrates the problem that the decoder for the convolutional code described above with the trellis diagram of FIG. 2 encounters at the receiver. As shown, the encoded bit stream on output link 18 from the convolutional encoder passes through a noisy communication channel 30 which includes the modulator at the transmitter, the demodulator at the receiver, and the interconnecting noisy link between transmitter and receiver. For simplicity, only binary quantization at the receiver where hard decisions are made on (the bit rate=2r) encoded bits transmitted over the channel will be considered. Because of the noise introduced in the channel, the encoded bits at the receiver are occasionally in error, and it is the task of a decoder 40 to determine the transmitted raw data bit stream in the face of such errors. In FIG. 3 the received encoded bit stream bits have been indicated as possibly differing from those transmitted by the primed quantities, T'1i and T'2i. In general, for hard decision decoding
T'1i =T1i ⊕e1i (9)
T'2i =T2i ⊕e2i (10)
where e1i, e2i =1, if an error is made in the reception of the ith bit.
e1i, e2i =0, if no error is made on the ith bit, and ⊕ denotes modulo-2 addition.
As shown in FIG. 3, the serially received T'1i and T'2i bits are separated by a demultiplexer 31 with a pair of T'1i, T'2i bits being coupled over lines 32 and 33 (at rate r) to the decoder 40. The correct demultiplexing of the bits for application into the decoder 40 is effected by circuitry called a branch synchronizer 41 in practical hardware implementations. The understanding of the operation of the branch synchronizer 41 is nonessential to the understanding of the decoding process currently being explained, so it will not be discussed here. (It will be described below in conjunction with the description of the novel decoder of the invention.)
It is assumed that the demultiplexer 31 has been controlled to cause T'1i bits to always appear on the upper demultiplexer output line 32 and T'2i bits on the lower demultiplexer output line 33 as shown in FIG. 3. Thus, at a rate=r per second, a pair of possibly errored coded bits T'1i and T'2i for raw data bit time=i is presented to the decoder 40, and the decoder 40 is expected to produce on its output 42 an estimate of the raw data bit at time i-D, where D is the number of bit times of decoding delay allowed to the decoding process. The bit estimate is labeled bi-D in FIG. 3 and these estimates emerge from the decoder 40 at bit rate=r and are passed to the user.
In the discussion of the operation of the error-correction decoder to follow, the utility of the trellis diagram representation of FIG. 2 for the convolutional encoder in understanding the operation of the decoder will become very evident. Most simply stated, the task of the decoder 40 is to fine the path through a trellis diagram like that in FIG. 2 having the sequence of encoded bits, (T1i,T2i), that best matches the sequence of actually received noisy encoded bits, (T'1i,T'2i). This path is the one most likely to have been transmitted since it requires hypothesizing the smallest number of errors as having occurred in transmission through the channel. With independent errors occurring from bit time to bit time on the channel (as is often the case for practical channels) the path requiring the hypothesis of the smallest number of errors is the maximum likelihood path to have been transmitted. The Viterbi Algorithm for decoding convolutional codes is a technique for finding the path through the trellis diagram that is best matched to the received data represented by the (T'1i,T'2i) branch pairs bit sequence and the number in which this algorithm is implemented will be described below. After determining the path best matched over the span from bit time i-D to bit time i (D is the allowed decoding delay) the bit, bi-D, in the oldest position of this path is selected by the decoder as the output decision, bi-D.
In order to better appreciate some of these operations the decoding of the specific n=1 code having an encoder shown in FIG. 4 and a trellis diagram shown in FIG. 5 will be described. The encoder of FIG. 4 has the two generator polynomials g1 (x)=1 and g2 (x)=1+x. As shown by the trellis diagram of FIG. 5, for this code, there are only 2n =21 =2 encoder states Si possible for each bit time i. On the trellis diagram each state transition branch has been labeled below the line with bi and with the T1i,T2i encoded bit pair labeled above the line.
The manner in which the Viterbi algorithm decoder locates the minimum distance path through the trellis diagram for this n=1 code shown in FIG. 4, and thus accomplishes the decoding of the information will be explained with reference to FIG. 6. At the top of the trellis diagram is an indication, for each branch of the diagram, of the bit time, i; an assumed sequence of raw data bits, bi, for each bit time; the corresponding encoded bits, T1i T2i ; an exemplary set of errors, e1i,e2i ; and finally, the resulting errored encoded bits, T'1i,T'2i. Note that in this example a single error, that is, e10 =1, in receiving T10 is assumed.
On each branch of the trellis diagram in FIG. 6, there is an indication, by the number in parentheses, of the distance (i.e., the number of errors) between the received branch, T'1i,T'2i and the T1i,T2i pair for that branch of the trellis. The objective of the decoder is to find the path through the trellis with the least accumulated distance relative to the entire received sequence of T'1i,T'2i bit pairs. In FIG. 6, each state node of the diagram is labeled by a circled number indicating the smallest accumulated distance for a path into each of the state nodes. Thus, the path into each state producing the minimum accumulated distance up to that state has been emphasized.
A key point in the operation of the Viterbi Algorithm decoder is that once two paths converge on a common state node in the trellis diagram, the larger distance path into that state node can be eliminated from further consideration as a candidate for the smallest distance path through the continuing trellis diagram. This occurs because further identical extensions from that common state are indicated for both paths and thus there is no way for the larger distance path at the common node to subsequently overcome a distance disadvantage relative to some other path at the common state node.
On the basis of the above description, the Viterbi decoding algorithm of prior art implementations can be explained succinctly as follows. At each data bit time i, the decoder has stored in 2n memory locations the smallest accumulated distance (called survivor distance) at each of the 2n states of the trellis diagram. Upon the receipt of the next T'1i,T'1i branch the distance between T1i,T2i for each branch of the trellis is computed. These branch distances are analogous to the numbers in parentheses in FIG. 6. Next, two competing distances at each node are computed by adding the appropriate present branch distances to the appropriate stored survivor distance. The smallest of these two competing distances is stored as the new surviving distance at the state node. The survivor distances are analogous to the circled numbers in FIG. 6. One bit is also stored for each node to indicate whether the upper or lower of the two transitions into the node produced the survivor distance. Conceptually, this bit, termed a trellis connection bit indicates which of the two transitions into the state to emphasize in FIG. 6 as still being contained along a candidate path for the minimum distance path through the overall trellis diagram.
The 2n trellis connection bits are stored in standard implementations for each of the D branch times, where D is the allowed decoding delay. Thus standard implementations of the Viterbi algorithm decoder required circuitry for storing 2n survivor distances as well as 2n xD trellis connection bits. In addition, digital add-compare-select circuitry must be provided to update the survivor distances each bit time, and further, circuitry must be provided to traceback along the minimum distance path through the D branches of trellis connection bits to determine the decoder's output decision, bi-D, along this path.
This traceback operation can be understood with reference to FIG. 6 by noting that after branch 3 is processed, state 0 has the minimum distance path (distance=1). Tracking backwards from this state 0 at branch 3 along emphasized branches leads to bo =1 at branch 0 and the output decision from the decoder is thus determined. This is the way Viterbi algorithm decoders have typically been implemented in the prior art, i.e., by digital circuitry performing the survivor metric updating and storage function, by calculation of the trellis connection bits and storing them, by determining smallest distance path state at each branch time and then digital implementation of the traceback process to ascertain a decoder output bit decision from this minimum distance path. Many refinements have been made to these operations to simplify hardware, but the basic decoder operation has remained essentially the same digital processing scheme in most prior art implementations. As mentioned previously, however, and as will be described in detail below, the present invention involves a new and improved technique for Viterbi decoding that uses an analog circuit based on the concept of finding the shortest route through the trellis diagram.
FIG. 7 shows a basic two-path, two-node network configured to find the shortest of two routes between the two nodes A and B. Route 1 is assumed to have distance=1 and Route 2 has distance=2. Diode D1 is provided in Route 1, while diodes D2 and D3 are provided in Route 2. The number of diodes in each path is proportional to the distance of each path. The diodes, D1, D2 and D3 are each assumed to have the zener current versus voltage characteristic shown in FIG. 8 which is an approximation of the characteristic of real semiconductor diodes. This characteristic shows that the diode does not conduct current until the voltage exceeds Vd. Also, as shown in FIG. 8, the voltage across a conducting diode is clamped at Vd volts.
Returning to the circuit of FIG. 7 which contains diodes with the characteristic in FIG. 8, one notes that only Route 1 will draw current, i.e. ##EQU4## When diode D1 conducts, v is clamped to Vd and this voltage is impressed across the two series-connected diodes D2 and D3 in Route 2. Since the two series connected diodes D2 and D3 would require v=2Vd to conduct, they remain in the nonconducting state. Thus, it can be seen that only the shortest route path (i.e. the path containing the smallest number of diodes) between Nodes A and B will conduct current in the circuit of FIG. 8. Accordingly, it is only necessary to detect which path is drawing current (or, the most current with realistic diodes) to solve the shortest route problem.
In accordance with the present invention, described in detail below, the property that only the minimum diode path in a network draws current is advantageously incorporated in a signal processing network to find the minimum distance path in the trellis diagram for a convolutional code as a means of implementing a Viterbi Algorithm decoder. For a general overview on the use of diode networks to solve mathematical programming problems, attention may be directed to "Mathematical Programming and Electrical Networks" by Jack B. Dennis, MIT Technology Press and John Wiley and Sons, Inc. 1959.
As pointed out previously, by using the novel analog scheme of the present invention, the complicated and costly circuit refinements that have been developed to date in digital signal processing approaches are obviated by making use of the shortest route technique and integrating that scheme in a practical hardware implementation. For this purpose, the present invention is comprised essentially of an analog hardware arrangement of a plurality of fundamental circuits termed branch distance circuits as shown in FIG. 9. Pursuant to the invention, this circuit is employed on each trellis diagram branch to define the distance between the T1i,T2i branch bit pair produced by the encoder at the transmitter and the received branch bit pair T'1i,T'2i derived from the noisy channel.
As shown in FIG. 9, the branch distance circuit contains series connected diodes D1, D2 and D3 with a first controlled switch SW1 connected across diode D1 and a second controlled switch SW2 connected across the series connection of diodes D2 and D3. Switches SW1 and SW2 are opened or closed in response to respective control bits C0 and C1, so that the appropriate number of diodes equal to the branch distance are connected between the terminals T1 and T2.
FIG. 10 shows the manner in which the basic Branch Distance Circuits (BDCs) are used to construct a network for finding the shortest route (minimum distance path) through the n=1 trellis diagram of FIG. 5. This network makes use of the fact that only the shortest route path through the network connected between Nodes A and B will draw current. The principle is the same as for the case shown in FIG. 7, but in FIG. 10 the network connected between Nodes A and B has been replaced with the complex diode trellis diagram circuit wherein each branch contains a BDC as shown in FIG. 9.
As shown in FIG. 10, the network is comprised of a trellis of branch distance circuits 61-78 connected between Nodes A and B which are coupled to sources of respectively different potentials. Control of the switch inputs of each circuit is obtained for the respective stages 101-133 of shift registers 151-154, which are disposed in output links 141-144 of a branch distance calculation circuit 82 to which the receive noisy channel signals T'1i and T'2i are applied. Branch distance calculation circuit 82 operates on the unknown incoming signals T'1i and T'2i from the noisy channel and produces sets of binary outputs on links 141-144 representative of the successive data values. For this purpose circuit 82 may comprise a two level decision from this, such as a hard limiter circuit, or a multilevel soft decision function, described below. Links 141 and 142 are coupled to multiplexer 91 the output of which is coupled to control bit register 93, while links 143 and 144 are coupled to a multiplexer 92 the output of which is coupled to a control bit register 94. Each of multiplexers 91 and 92 is switchably controlled by a signal on link 95 from a bit decision circuit 81. Each BDC is also labeled by the T1i,T2i bit pair for the branch. For purposes of clarity, FIG. 10 does not show the control bit connections (C0, C1 in FIG. 9). However, each BDC for a branch is connected to these 2-bit controls which are stored in the Clm register stages 101-133 for the branch at the top of the diagram in FIG. 10. BDC lm is controlled by the 2-bit number, Clm.
The operation of the decoder in FIG. 10 is as follows. At each bit time, the received code branch, T'1i,T'2i, is input to the Branch Distance Calculator 82. The Branch Distance Calculator 82 computes the distances of the received branch, T'1i,T'2i, from each of the four possible code branches, T1i,T2i =00, 01, 10, and 11 and outputs these 2-bit distances as C00, C01, C10, and C11, respectively, over links 141-144, to control the BDCs 61-78. This set of eight control bits is input to stages 103-133 of shift registers 151-154 which store the D most recent sets of these control bits. Through the control connections from shift registers 151-154 to the BDCs 61-78, the diode trellis network is reconfigured at each data bit time to contain a number of diodes on each branch of the trellis network equal to that branch's distance from the received code branch.
After a new set of control bits C00, C01, C10, C11 is clocked into shift registers 151-154 and all the BDC's switches are controlled, the two diverging currents i1 and i2 at the "oldest" end of the trellis (at Node A) are compared in bit decision circuit 81, and a decision is made by the decision circuit 81 on which of the two branches is drawing the most current. If the diodes comprising the BDC's had the ideal characteristic shown in FIG. 8, only one of the currents would be non-zero and would correspond to the shortest route path through the trellis. To allow for nonideal diodes, the decision circuit 81 is constructed of comparator circuitry to implement the decision on bi-D as ##EQU5## The decision on bi-D is coupled over output link 95 to the user as the decoded output bit. It is also connected to multiplexers 91 and 92 for multiplexing the proper control bits to control branch i-D BDC's on the next bit time, as pointed out above. Multiplexers 91 and 92 are required since if bi-D =0 (i.e., i1 i2) then on the following bit time the upper state 0 node must be conceptually "pulled over" and connected to Node A. In this case, (C'00)i-D =(C00)i-D+1 and (C'11)i-D =(C11)i-D+1. If, however, bi-D=1 (i.e., i1 <i2) then on the following bit time the lower state 1 node must be conceptually "pulled over" and connected to Node A. In this case (C'00)i-D =(C01)i-D+1 and (C'11)i-D =(C10)i-D+1. Multiplexers 91 and 92 are necessary, therefore, to continue following the shortest route through the trellis based on prior decisions.
On the next bit time, a new received branch T'1(i+1),T'2(i+1) pair in input to the decoder and new control bits are produced from branch distance calculation circuit 82 and input to register stages 103-133, all control bit registers shift to the left thus advancing the trellis diagram one branch further along the received sequence, and the decoding operation repeats.
The circuitry shown in FIG. 10, for n=1, provides an analog network that accomplishes almost all of the functions required of a Viterbi Algorithm decoder for convolutional codes. Advantageously, the network is fairly simple, consisting primarily of many controllable analog Branch Distance Circuits (BDC's) as shown in FIG. 9. Each is made up of three diodes and two single pole-single throw switches. Auspiciously this structure lends itself readily to implementation on an integrated circuit (IC) with semiconductor diodes and switches, so that the entire Viterbi Decoder may be configured in a single IC package and capable of operating at very high bit rates.
The Viterbi Algorithm decoder is obtained with this simple shortest route diode circuitry without the requirement for the more complicated digital add-compare-select circuitry for updating survivor metrics in each state, trellis connection storage, and traceback circuitry required in prior art implementations of this algorithm.
It will be recalled from the description of FIG. 3 that the decoding scheme for the channel employs a branch synchronizer for operating the received channel demultiplexer in response to the output of the error correction decoder. This is accomplished with the decoder of FIG. 10 in the following way. Note that the voltage drop across the diode trellis from node A to node B is proportional to the number of diodes (i.e., distance) in the minimum distance path through the trellis. Thus the voltage across the trellis at each bit time serves as an indication of the reliability of decoding. Low voltage indicates that not many channel errors exist on the minimum distance path. Thus, if the branch synchronization is improper, the average voltage across the trellis will be high due to the algorithm's inability to find a path through the trellis having a small distance from the erroneously synchronized branches input to the decoder. Therefore, the branch synchronizer demultiplexer in FIG. 3 is controlled such that T'1i,T'2i pairs are presented to the decoder in the manner that the average trellis voltage drop remains below some predetermined threshold.
It is also possible to use a quantized version of the instantaneous trellis voltage at each bit time to provide a reliability of decoding indication for each decoded bit, since that voltage is proportional to the distance of the minimum distance code path in the trellis from the received sequence.
To determine the complexity of the diode trellis Viterbi decoder as a function of the n parameter of the encoder, it is necessary to compute the number of diodes, switches and control bit register elements used. Taking into account the reducing number of BDC's for the n branches at the oldest end of the trellis where the number of branches is halving for each older branch, the total number of BDC's, NBDC, is given by
NBDC =(D-n+2)2n+1 -2 (14)
It has been found experimentally that the decoding delay D=6n, produces almost all the performance capability of the decoder. Thus assuming D=6n, Equation (14) becomes:
NBDC =(5n+2)2n+1 -2. (15)
Since each BDC requires three diodes and two switches (as seen in FIG. 9), the number of diodes, Nd, and number of switches Ns, required to implement the decoder are:
Nd =3NBDC =3(5n+2)2n+1 -6 (16)
Ns =2NBDC =2(5n+2)2n+1 -4, respectively. (17)
Considering that each branch of decoding depth in the trellis requires 8 bits of storage (the 4, 2-bit quantities C00, C01, C10, C11 in FIG. 10) and disregarding any small savings that may occur as control bits are multiplexed at the oldest end of the trellis as in MUX 1 and MUX 2 in FIG. 10, the number NR of register bits required is:
Again, assuming that D, the decoding delay is 6n, equation (18) becomes:
NR =8(6n+1) (19)
In Table 1, there are tabulated Nd, Ns, and NR from Equations (16), (17) and (19), respectively versus n, the encoder memory (which is one less than the encoder constraint length). The number of elements required are well within the capabilities of present Large Scale Integration (LSI) techniques. The n=6 decoder (which is about the largest n, high bit rate, error correcting Viterbi decoder presently commercially available, requires 12,282 diodes; 8,188 semiconductor switches; and 296 bits of register storage, which is readily implemented on a single LSI chip using present LSI technology.
TABLE 1______________________________________Number of Elements Required to Implement the DiodeTrellis Viterbi Decoder for n = 1 to 7.EncoderMemory, # Diodes # Switches # Bits Storagen Nd Ns NR______________________________________1 78 52 562 282 188 1043 810 540 1524 2,106 1,404 2005 5,178 3,452 2486 12,282 8,188 2967 28,410 18,940 344______________________________________ Note: Decoding delay, D, is assumed to be 6n. K = n + 1.
In the above description of the diode trellis Viterbi decoder it has been assumed that hard decisions (i.e., binary quantization) were carried out by decision circuit 82 on the received code branch bit pairs, T'1i,T'2i. Also, it has been assumed that the distance measured for branches is the Hamming distance between the code branch, T1i,T2i in the trellis and the received branch, T'1i,T'2i. That is, the branch distance, d(e1i, e2i), computed to control the BDC's in the diode trellis has been given by:
d(e1i, e2i)=e1i +e2i (20)
where, from Eqs. (9) and (10):
e1i =T1i ⊕T'1i (21)
e2i =T2i ⊕T'2i (22)
and e1i and e2i are either 0 or 1. From equation (20) it is noted that branch distances can be 0, 1 or 2 depending on the particular values of e1i and e2i for the trellis branch. The Branch Distance Circuit (BDC) shown in FIG. 9 has the capability of producing branch distances 0, 1, 2 or 3, which is one more than necessary for hard decision decoding discussed above. The provision of this excess capability in the BDC's permits extension of the application of this decoder implementation to the case of soft decision quantization of the T'1i,T'2i pairs at the receiver as described below. Soft decision decoding typically can provide about 2 dB better performance than hard decision decoding.
Considering the case of 3-bit (or 8 level) quantization of the T'1i and T'2i decision voltages at the receiver, 8-level quantization of these decision voltages may be represented as shown in FIG. 11. FIG. 11 shows that each received signal voltage for each of the T'1i or T'2i encoded bits is quantized into one of the numbers 0 to 7. In the absence of channel noise, the received signal voltage for a coded bit would lie at the mean level -V.sub.μ or +V.sub.μ depending on whether the transmitted coded bits, T1i and T2i, are 0 or 1, respectively. The quantizer output number for T'1i will be termed Q1i and the quantizer output for T'2i will be termed Q2i. With these definitions, eight-level errors for each of these quantized branch bits may be defined as:
e1i =|Q1i -T1i | (23)
e2i =|Q2i -T2i | (24)
where x=Absolute value of x.
With the eight-level branch errors e1i and e2i as defined in equations (23) and (24), a branch distance mapping function, d(e1i, e2i), must be determined for each of the 64 possible combinations of e1i, e2i. FIG. 12 shows a mapping function d(e1i, e2i) table restricted to the set of integers, (0, 1, 2, 3).
Significantly the branch distance mapping, d(e1i, e2i) of FIG. 12, which only employs the integers, 0, 1, 2, 3, performs within 0.25 dB of true eight-level quantization performance and within about 0.5 dB of an unquantized (infinite levels) soft decision scheme. With the mapping of FIG. 12, since only branch distances of 0, 1, 2 or 3 are required, one can use the Branch Distance Circuit of FIG. 9 to effect soft decision Viterbi decoding using the diode trellis shortest route circuit of the present invention.
As will be appreciated from the foregoing description, the trellis-configured diode array approach to a Viterbi algorithm decoder according to the present invention provides a significant reduction in complexity and cost compared to digital processing techniques of previously available decoders. This simplicity and its capability of being implemented using large scale integrated circuit packaging techniques makes the invention a particularly attractive solution to the convolutional code error correcting problem.
While I have shown and described several embodiments in accordance with the present invention, it is understood that the same is not limited thereto but is susceptible of numerous changes and modifications as known to a person skilled in the art, and I therefore do not wish to be limited to the details shown and described herein but intend to cover all such changes and modifications as are obvious to one of ordinary skill in the art.
|Cited Patent
|Filing date
|Publication date
|May 29, 1967
|Nov 3, 1970
|Datamax Corp
|Matrix decoder for convolutionally encoded data
|Oct 13, 1972
|Jan 29, 1974
|Harris Intertype Corp
|Convolutional decoder
|Apr 19, 1977
|May 2, 1978
|Bell Telephone Laboratories, Incorporated
|Decoder for implementing an approximation of the Viterbi algorithm using analog processing techniques
|Clark, Jr. et al., Error Correction Coding for Digital Communications, Plenum Press, New York, 1981, pp. 227 235.
|Clark, Jr. et al., Error-Correction Coding for Digital Communications, Plenum Press, New York, 1981, pp. 227-235.
|Citing Patent
|Filing date
|Publication date
|Oct 10, 1984
|Aug 12, 1986
|Nec Corporation
|Error correction apparatus using a Viterbi decoder
|Dec 28, 1984
|Dec 23, 1986
|Codex Corporation
|Coded modulation system with feedback
|Oct 10, 1984
|Jun 23, 1987
|Signal Processors Limited
|Digital data decoders
|Mar 13, 1985
|Nov 24, 1987
|Viterbi decoder for wireline modems
|Feb 25, 1985
|Dec 22, 1987
|Nec Corporation
|Viterbi decoder comprising a majority circuit in producing a decoded signal
|Sep 27, 1985
|Mar 8, 1988
|California Institute Of Technology
|Method and apparatus for implementing a maximum-likelihood decoder in a hypercube network
|Apr 14, 1987
|Aug 29, 1989
|National Research Development Corporation
|Channel estimation and detection for digital communication systems
|Aug 18, 1987
|Sep 19, 1989
|California Institute Of Technology
|Method and apparatus for implementing a traceback maximum-likelihood decoder in a hypercube network
|Feb 24, 1988
|Nov 14, 1989
|Centre National D'etudes Des Telecommunications
|Method and installation for digital communication, particularly between and toward moving vehicles
|Apr 2, 1987
|Feb 27, 1990
|Kabushiki Kaisha Toshiba
|Path memory control method in Viterbi decoder
|Sep 15, 1988
|Jul 31, 1990
|The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration
|Trellis coded modulation for transmission over fading mobile satellite channel
|Aug 12, 1988
|Dec 25, 1990
|Telebit Corporation
|Multi-channel trellis encoder/decoder
|Jul 24, 1989
|Jul 7, 1992
|Motorola, Inc.
|Symbol state trellis maximum likelihood detection method
|Mar 29, 1989
|Sep 29, 1992
|Siemens Corporate Research Inc.
|Self-repairing trellis networks
|Mar 11, 1992
|May 4, 1993
|At&T Bell Laboratories
|Generalized viterbi decoding algorithms
|Dec 12, 1994
|Sep 5, 1995
|Fujitsu Limited
|Apparatus and method using analog viterbi decoding techniques
|Jun 18, 1992
|Feb 13, 1996
|The United States Of America As Represented By The Secretary Of The Air Force
|De bruijn graph based VLSI viterbi decoder
|Apr 28, 1995
|Jul 30, 1996
|Pericle Communications Company
|Adaptive data rate modem
|Apr 19, 1995
|Oct 28, 1997
|Universite Du Quebec A Montreal
|Method and apparatus for correcting and decoding a sequence of branches representing encoded data bits into estimated information bits
|Feb 13, 1996
|Aug 29, 2000
|Motorola, Inc.
|System and method for calculating a state transition metric in a viterbi equalizer
|Jan 14, 1999
|May 13, 2003
|Intersil Americas Inc.
|Method of performing antenna diversity in spread spectrum in wireless local area network
|Jan 14, 1999
|Aug 5, 2003
|Intersil Americas Inc.
|Spread spectrum transceiver for use in wireless local area network and having multipath mitigation
|Jan 14, 1999
|Jan 13, 2004
|Intersil Americas Inc
|Wireless local area network spread spectrum transceiver with multipath mitigation
|Feb 5, 2001
|May 30, 2006
|Paradyne Corporation
|Interleaved generalized convolutional encoder
|Feb 5, 2001
|Nov 1, 2001
|Paradyne Corporation
|Interleaved generalized convolutional encoder
|Aug 9, 1990
|Feb 20, 1991
|AT&T Corp.
|Generalized viterbi decoding algorithms
|Oct 8, 1990
|Apr 17, 1991
|Deutsche Forschungsanstalt f�r Luft- und Raumfahrt e.V.
|Method for coding and decoding of binary datas and arrangement for the realization of this method
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Nov 28, 1983
Owner name: HARRIS CORPORATION MELBOURNE, FL 32901
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:DAVIS, ROBERT C.;REEL/FRAME:004193/0524
Effective date: 19830902
|Apr 3, 1989
|Fee payment
Year of fee payment: 4
|Oct 3, 1993
|Lapse for failure to pay maintenance fees
|Dec 21, 1993
|Expired due to failure to pay maintenance fee
Effective date: 19931003


text:
Regional Leaders Take More Confrontational Approach to Zimbabwe's Crisis
Over a week has passed after the partial withdrawal of the opposition party (MDC) from the unity government.
The agreement we sign today is a product of painful compromise.
The latest development on talks between the opposition party -- the Movement for Democratic Change (MDC) -- and ZANU-PF President Robert Mugabe is that they have produced a 50-page document as a way forward in power-sharing and the installation of a transitional government. The duration of the transitional government is still being debated -- the opposition wants two years and ZANU-PF wants five. The plan is to eventually dissolve the transitional government and hold fresh [...]


text:
View Singles in Numa
By clicking continue, I agree to receive transactional and promotional emails from Match.com. I understand that I am free to withdraw consent at any time.
By using our site, you agree to the Match.com Terms of Use.
Search for your match in the Hoosier State and find online personals in Indiana. Are you looking for a date or a serious relationship with a Indiana single? Match.com has been the leading online dating site for over 10 years. On Match.com, surrounded by thousands of Numa's hottest singles, you'll only stay single if you want to be single.
Bellmore, Blanford, Bloomingdale, Brazil, Bridgeton, Carbon, Catlin, Centenary, Clinton, Coloma, Coxville, Dana, Diamond, Fairview Park, Fontanet, Harmony, Hillsdale, Judson, Knightsville, Libertyville, Lyford, Mansfield, Mecca, Montezuma, New Goshen, North Terre Haute, Rockville, Rosedale, Saint Bernice, Saint Mary of the Woods, Sandford, Sandytown, Seelyville, Shepardsville, Staunton, Terre Haute, Turner, Universal, Vermilion, West Terre Haute view all states »
Asian , Black , Catholic , Christian , Divorced , Free Online Dating, Gay Singles, Gay Dating, Jewish , Lesbian Singles, Single Parents, view all communities »


text:
Skip to Main Content
IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards,
eBooks, and eLearning courses.
Learn more about:
IEEE membership
IEEE Xplore subscriptions
The performance of large-scale real-world applications may be enhanced by more efficient utilization of today's powerful parallel computing hardware. The authors describe a novel MIMD (multiple instruction, multiple data) static task allocation methodology created to achieve this goal for a wide range of real-time and deterministic systems. The method performs automatic assignment, mapping, and scheduling of the executable tasks to the available set of processors, assuming synchronous nonbuffered (lock-step) communication between the sending and receiving processors and an arbitrary static message-passing topology. The algorithm incorporates a set of list-based heuristics and graph-theoretical procedures designed to balance computational load with communication requirements. The effectiveness of the method has been verified by applying it to a large number of randomly generated task systems that span a wide range of inherent concurrency as well as to a task system of a real-world simulation of the Space Shuttle main rocket engine
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.© Copyright 2015 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.


text:
I had my mind set on sampling that James Blake song. He beat me to it. This shit is 5 stars
Same man. Heard that song at the end of entourage and had that thought late last night. Now I heard this
Oh shut up
Maaaan... this is real good stuff dawg... Geah
Cant stop listening to this!!! People STOP sleeping on this dude!!! K.R.I.T.
james Blake x Big K.R.I.T. = fire
Hot song !!
when does K.R.I.T. drop?
The Official Video of "Pink Matter" (Feat. Frank Ocean x Andre 3000) By J.Royale (Charlotte,NC) Play, Like, Comment, SHARE! http://www.youtube.com/watch?v=Hc_C68CZkmk&feature=youtu.be
Pink Matter Feat Frank Ocean and Andre 3000 By J.Royale (Charlotte,NC Artist) http://www.youtube.com/watch?v=Hc_C68CZkmk&feature=youtu.be
bbas cant sell out
fuckin great
Big S/o to Krit. He's a major part of todays hiphop
tru dat
krit is on the track to be a fucking legend
K.R.I.T. 1 of the illest of the last decade.
i agree
I swear if you can create a whole album with this type of vibe I will buy 6 a month and hand them out a whole year. Dope!!!!!!!!!!!
he definitely doesnt need you to hand his shit out on the street corner. If he did, i doubt i'd own three of his albums on vinyl, while living 3000 miles away.
you must not have any of his mix tapes check out krit wuz here and return of foreva they are not entirely this vibe but that would get old so i'd say rya
B I G Krit
Intellectual Property: Megaupload, Lupe Fiasco & "Interactive Playthings"


text:
Our new "How to Study the Bible" series starts soon! Sign up today.
In the final four chapters we finally meet the man whose name the work bears. Ezra's journey to Jerusalem is recorded in chs. 7 and 8; in 9 and 10 he deals with the problem of mixed marriages. He reappears in Ne 8-10 to play a significant role in the reorganization of the covenantal community.


text:
Music and Mommies: #US and #Canada - #Win 1 of 2 Prize Packages from Gar...
Gardein offers a large selection of award winning meatless entrees. The entrees are vegan certified, no-GMO and made with soy grown in the U
Coupon Codes, Online Coupons & Deals - Offers.com
Save with the best free online coupon codes, deals, online coupons, and more - verified and updated daily. Thousands of online stores and l
Mommy Who Loves Giveaways
Fun place to read great product reviews, enter giveaways and more....
A Mom's Take
reviews, giveaways, moms, parenting, blog, win, contests, gift guides, Phoenix events
Tales From the Nursery
Tales of babies, parenting, and products for the family.
Whirlwind of Surprises
product reviews, giveaways, technology, cooking, gaming, health, fitness, fashion/style, coupons, cars
Pandora® internet radio
Pandora radio is a personalized radio service that streams music on your phone.Pandora is free, personalized radio that plays music and come
It's My Life: #Giveaway - Perricone MD Cream With DMAE
The one part of my body that I don't ever want to neglect is my face. Perricone MD makes it easy to keep your skin looking young and hea
Half-Pint House Handouts - Giveaway: Scrubbing Bubbles One Step Toilet B...
Okay, this may sound like a funny giveaway, but y'all, this stuff is amazing. I installed one of these in our guest bathroom a couple of wee
It's My Life: #Giveaway - POUND PUPPIES: Homeward Pound
Puppy lovers rejoice! Pound Puppies: Homeward Pound will arrive on DVD on March 6, 2012, from Shout! Factory Kids in collaboration with Hasb
It's My Life: #HGG Review & #Rafflecopter #Giveaway: Santa Claus...
Pages. Home; About Me/Pitch Me; My Giveaways; Rafflecopter Giveaway Linky; Giveaway Linky; Holiday Gift Guide; Reviewer Resources; Join My C
It's My Life: #Giveaway - Fashion To Figure Item
Think that if you wear plus-size clothes, you have to look frumpy? No way! Fashion to Figure has trendy apparel for women sizes 12-26. Strut
GSOM - Coachella Sweeps - PacSun.com
The Latest. New Arrivals · Online Exclusives · PacSun Gift Cards · Great Deals · Snow Shop · Buyer Ashley's Picks · Top 20 Under $20 · S
This N That with Olivia
A little of this and a little of that!
Mom Blog Society
Giveaways & Reviews-Connecting Mom Bloggers From Around The World!
This Mama Knows
This Mama Knows where to shop, what to buy and how to save!
Woman Of Many Roles
My life as a mom!
Your source for great deals, giveaways and living the good life!
Join Scentsy
Join Scentsy And Change Your Life Hi, I'm Stephanie Keith. I'm a wife and a mother of three. My family is my pride and joy, they keep me ve
Mom and More » Tonka Roadway Rigs Review (& Giveaway Ends 1/5)
Tonka Roadway Rigs Review (& Giveaway Ends 1/5). Submitted by Cher on December 21, 2011 – 11:21 AM79 Comments. Tonka Roadway Rigs. Funri