Channel Coding Theory Algorithms and Applications 1st Edition David Declercq (Editor) - The ebook in PDF/DOCX format is ready for download now
Channel Coding Theory Algorithms and Applications 1st Edition David Declercq (Editor) - The ebook in PDF/DOCX format is ready for download now
or textbooks at https://ebookultra.com
https://ebookultra.com/download/channel-coding-theory-
algorithms-and-applications-1st-edition-david-declercq-
editor/
https://ebookultra.com/download/sparse-modeling-theory-algorithms-and-
applications-1st-edition-irina-rish/
https://ebookultra.com/download/elements-of-quasigroup-theory-with-
applications-in-coding-and-cryptology-1st-edition-shcherbacov/
https://ebookultra.com/download/fundamentals-of-wavelets-theory-
algorithms-and-applications-2ed-edition-goswami-j/
https://ebookultra.com/download/speech-coding-algorithms-foundation-
and-evolution-of-standardized-coders-1st-edition-wai-c-chu/
Coding theory a first course Ling
https://ebookultra.com/download/coding-theory-a-first-course-ling/
https://ebookultra.com/download/image-fusion-algorithms-and-
applications-tania-stathaki/
https://ebookultra.com/download/introduction-to-coding-theory-2nd-
edition-bierbrauer/
https://ebookultra.com/download/bayesian-phylogenetics-methods-
algorithms-and-applications-1st-edition-ming-hui-chen/
Channel Coding Theory Algorithms and Applications 1st
Edition David Declercq (Editor) Digital Instant Download
Author(s): David Declercq (editor), Marc Fossorier (editor), Ezio Biglieri
(editor)
ISBN(s): 9780081013304, 0081013302
Edition: 1
File Details: PDF, 19.53 MB
Year: 2014
Language: english
Channel Coding
Theory, Algorithms, and
Applications
Edited by
Permissions may be sought directly from Elsevier’s Science & Technology Rights Department
in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333; email: permis-
[email protected]. Alternatively you can submit your request online by visiting the Elsevier
web site at http://elsevier.com/locate/permissions, and selecting Obtaining permission to use
Elsevier material.
Notice
No responsibility is assumed by the publisher for any injury and/or damage to persons or
property as a matter of products liability, negligence or otherwise, or from any use or opera-
tion of any methods, products, instructions or ideas contained in the material herein. Because
of rapid advances in the medical sciences, in particular, independent verification of diagnoses
and drug dosages should be made.
Channel coding has long been recognized as an important feature for the transmis-
sion or the storage of digital information, to combat the unstructured noise incurred
by small to nano-electronics. Data are always used in coded form for their transmis-
sion through wireless or wired channels, or for their storage on magnetic or opti-
cal recording devices, to ensure a desired level of reliability of the communication
systems.
While its origin dates back to more than half a century, it was not until the 1990s
and the introduction of the turbo principle in information theory that theoretical lim-
its could be approached with practical designs. This discovery, based on the concept
of iterative decoding with feedback of newly processed information, revolutionized
the area of forward error correction (FEC) and nowadays every modern communica-
tions or storage system has been designed with the consideration of an iterative FEC
scheme. Consequently, wireless communications have been directly impacted by
iterative decoding methods. The turbo principle also motivated the designs of other
iteratively decodable codes and in particular contributed to the resurrection of low
density parity check (LDPC) codes. The iterative information processing gives rise to
so strong practical algorithms that the concept has also been applied for more general
communication systems and receivers, incorporating feedback loops between the
FEC and the diverse signal processing blocks. We can cite as most popular examples
receivers implementing turbo-equalization, turbo-detection, turbo-synchronization,
etc. The efficient design of those iterative receivers takes its root in the deep under-
standing of the theory of turbo and LDPC codes.
In this book, we review the concepts of channel coding relevant to wireless commu-
nications in conjunction with the designs that heavily rely on iterative decoding meth-
ods. Although an impressive leap has been achieved in the performance of FEC for
wireless communications due to iterative methods, issues about their design and imple-
mentation remain. In fact, the initial gains achieved were so large compared to previous
FEC schemes that at first, almost every iterative decoding scheme that you could think
of seemed good. These days, refinements about these designs in terms of structure,
complexity, latency, etc. are still of importance, both theoretically and practically.
The authors who contributed to this chapter are leading experts in the area they
cover, with a deep knowledge of both the latest theory and recent practical realiza-
tions of the topic, as well as of the remaining issues. In each chapter, an emphasis is
made on the presentation of the concepts and the most efficient and useful techniques,
with insistence on heavily referencing the corresponding literature. Consequently,
this book is intended to address a large audience from practical engineers to research-
ers to graduate students.
This book is formed of 13 chapters, which can be divided into four conceptual
parts: Part I (Chapters 1 to 4) describes the main iteratively decodable codes; Part II
(Chapters 5 to 7) covers tools to design these codes in practical implementations; Part
III (Chapters 8 to 12) presents the combination of these codes with other techniques
xv
xvi Preface
xvii
xviii Contributors
Ingmar Land
Institute for Telecommunications Research, University of South Australia,
Mawson Lakes, SA 5095, Australia
Guido Masera
Politecnico di Torino, Department of Electronics and Telecommunications,
corso Duca degli Abruzzi 24, 10129 Torino, Italy
Guido Montorsi
Dipartimento di Elettronica e Telecomunicazioni (DET), Politecnico di Torino
C.so Duca degli Abruzzi n. 24, 10129 Torino, Italy
Dung Viet Nguyen
Department of Electrical and Computer Engineering, University of Arizona,
Tucson, AZ 85721, USA
Enrico Paolini
Department of Electrical, Electronic and Information Engineering “G. Marconi”,
University of Bologna, Via Venezia 52, Cesena, FC 47521, Italy
C. Poulliat
IRIT Lab, INP/ENSEEIHT-Toulouse, 2 rue Charles Camichel, B.P. 7122,
31071 Toulouse Cedex 7, France
Aditya Ramamoorthy
Iowa State University, 3222 Coover Hall, Department of Electrical and
Computer Engineering, Ames, IA 50010, USA
Valentin Savin
CEA-LETI, MINATEC Campus, 17 rue des Martyrs, 38054 Grenoble, France
B. Sundar Rajan
Department of ECE, IISc, Bangalore 560012, India
Ragnar Thobaben
School of Electrical Engineering, Royal Institute of Technology (KTH),
Stockholm, Sweden
Bane Vasić
Department of Electrical and Computer Engineering, University of Arizona,
Tucson, AZ 85721, USA
CHAPTER
CHAPTER OUTLINE
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 History of turbo codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2.1 The origins of turbo codes . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Concatenation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.3 Negative feedback in the decoder and recursive systematic
convolutional codes . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.4 Extrinsic information and iterative decoding . . . . . . . . . . . . . . 4
2.5 Parallel concatenation . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3 Fundamentals of turbo coding . . . . . . . . . . . . . . . . . . . . . . . . . 8
3.1 Recursive systematic convolutional (RSC) component codes . . . . . . 8
3.2 Block coding with turbo codes . . . . . . . . . . . . . . . . . . . . . . 13
3.3 The permutation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
3.3.1 Regular permutation . . . . . . . . . . . . . . . . . . . . . . . . 19
3.3.2 Irregular permutations . . . . . . . . . . . . . . . . . . . . . . . 23
4 Fundamentals of turbo decoding . . . . . . . . . . . . . . . . . . . . . . . . 26
4.1 The turbo principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
4.2 Soft-input soft-output decoding . . . . . . . . . . . . . . . . . . . . . 30
4.2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
4.2.2 The MAP algorithm . . . . . . . . . . . . . . . . . . . . . . . . 32
4.2.3 The MAP algorithm in the logarithmic domain:
Log-MAP and Max-Log-MAP . . . . . . . . . . . . . . . . . . . . 36
5 Industrial impacts of turbo codes . . . . . . . . . . . . . . . . . . . . . . . . 38
5.1 The very first implementations of turbo codecs . . . . . . . . . . . . . 38
5.1.1 The CAS 5093 circuit . . . . . . . . . . . . . . . . . . . . . . . 39
5.1.2 The Turbo4 circuit . . . . . . . . . . . . . . . . . . . . . . . . . 40
5.2 Early applications of turbo codes . . . . . . . . . . . . . . . . . . . . 41
5.3 Turbo codes in standards . . . . . . . . . . . . . . . . . . . . . . . . . 43
1 Introduction
This chapter is a general introduction to the original turbo codes, proposed and
patented by Claude Berrou in 1991 [1–3] and known as convolutional turbo codes or
parallel concatenated convolutional codes. Turbo codes are an outcome of the research
activity of Telecom Bretagne1 (formerly École Nationale des Télécommunications de
Bretagne), a French graduate engineering school in the field of information technolo-
gies. The Electronics Department of Telecom Bretagne has been involved in research
in the field of algorithm-silicon interaction for more than 25 years. Its activity mainly
consists in jointly devising new algorithms and innovative hardware architectures,
digital and analog, for digital communications.
The chapter describes the main concepts of coding theory introduced with the
invention of turbo codes, provides the fundamental guidelines for the design of turbo
codes with good performance, gives the basics of turbo decoding, and briefly reviews
the industrial impacts of this new generation of error-correcting codes. Most of the
sections are introduced from a historical point of view. The chapter is organized as
follows. Section 2 describes the experimentations, observations, and reflections which
led to turbo codes and the ensuing concepts of iterative decoding, extrinsic informa-
tion, and parallel concatenation. Section 3 focuses on the different constituents of the
turbo encoder and analyzes their effects on the code performance. Section 4 provides
the basics of the turbo principle and soft-input soft-output decoding of convolutional
codes. Section 5 presents the very first hardware turbo codecs, some pioneer telecom-
munication applications having adopted these codes, and an overall picture of the
current telecommunication standards including turbo codes. Section 6 concludes the
chapter.
chronology describing the successive ideas that led to the development of the first
turbo codes, whose publication in 1993 [8] shook the coding community. With a
performance at 0.5 dB from the Shannon limit, they showed a gain of almost 3 dB
compared to solutions existing at that time.
2.2 Concatenation
Using the version of the SOVA in [11], it was possible to cascade SNR amplifiers
and do the experiments described in [6], which was the initial plan: decoding a
classical—i.e., serial—concatenation of two or more ordinary—i.e., non-systematic,
non-recursive—convolutional codes. Concatenation is a simple way to obtain large
asymptotic gains [13], but the performance at low SNR is debased due to the sharing
of the redundancy energy between the component codes.
The concatenated coding and decoding scheme that served as a starting point to
develop turbo codes is described in Figure 1.
Noise
x2 Serial to x1 Serial to
parallel Decoder parallel
Output Decoder Deinter-
+ leaver DEC1 +
DEC2 depunct- (SOVA) depunct-
d̂
y2 uring y1 uring
FIGURE 1
Serial (conventional) concatenation of two convolutional codes with coding rates 3/4
(outer code) and 2/3 (inner code). Global coding rate is 1/2.
decoder. This observation gave Berrou the idea of re-injecting the result of outer
decoding into the inner decoder. As the different levels of the composite decoder
do not represent the same pieces of information—the codes are not systematic, it
was necessary to build an estimate of symbols x2 and y2 at the output of decoder
DEC2. At first, it was a great surprise to observe that the bit error rate (BER) of these
reconstructed symbols after decoding was lower than the BER of decoded information
d̂. However, an intense search did not make it possible to find any explanation for
this strange behavior in the literature. It was then a straightforward task to (re)invent
recursive systematic convolutional (RSC) codes in order to have information data
carried by the encoder output instead of its state and take advantage of this property
not covered in other works. An insight into the distance properties of these codes
is given in Section 3.1. The detailed analysis can be found in [14] (in French). The
resulting serial concatenated coding scheme is shown in Figure 2.
The idea of re-injecting the result of outer decoding into the inner decoder, sim-
ilar to the principle of the turbo engine, gave its prefix to turbo codes, although it
would have been more rigorous to mention only turbo decoding, since no feedback
is implemented at the encoder side.
Y2 Puncturing Y1 Puncturing
FIGURE 2
Serial (conventional) concatenation of two recursive systematic convolutional (RSC) codes
with coding rates 3/4 (outer code) and 2/3 (inner code). Global coding rate is 1/2.
LLR (x2)
+
- Parallel Inter- z
LLR (y2) to leaver
+ serial Extrinsic
- information
Serial to x1 Serial to
Decoder parallel Decoder parallel From
x2
-
DEC2 + Deinter- +
leaver
+ DEC1
Output depunct- depunct- channel
(SOVA) (SOVA)
y2 uring y1 uring
dˆ
LLR(x1)
LLR(d)
FIGURE 3
Structure of the very first turbo decoding scheme.
Noise +
+ Deinter- z
LLR2(d) - leaver Extrinsic
information
x1 Serial to
Output Decoder - Decoder parallel
DEC2 Inter- + DEC1 +
leaver y1 depunct-
dˆ (SOVA2) (SOVA1)
y2 uring
LLR1(d)
FIGURE 4
Parallel concatenation of two RSC codes and associated (asymmetrical) decoder.
2 History of Turbo Codes 7
+ Inter-
LLR1(d) - leaver
x1
Decoder
DEC1
z2
(SOVA1) y1
Serial to
parallel From
+
y2 depunct- channel
Decoder uring
Output
DEC2 z1
dˆ x2 Inter-
(SOVA2)
leaver
Deinter-
-
LLR2(d) +
leaver
FIGURE 5
Symmetrical turbo decoder.
Later on, a symmetrical structure was also devised for the turbo decoder
(Figure 5), which is more natural is the sense that it reflects the symmetry of the
encoding process.
It was also observed that, for a given coding rate, parallel concatenation yields
more redundant symbols from the outer code than serial concatenation does. A parallel
concatenation of two elementary codes C1 and C2 with coding rates R1 and R2 has
a global coding rate:
R1 R2 R1 R2
Rp = = , (1)
R1 + R2 − R1 R2 1 − (1 − R1 )(1 − R2 )
whereas the global coding rate of the serially concatenated code is R S = R1 R2 . For
instance, a global coding rate 1/2 can be obtained with the parallel concatenation of
two codes with elementary rates 2/3 or with the serial concatenation of two codes
with elementary rates 2/3 and 3/4, as in Figure 1. Thanks to a greater number of
redundant symbols, the parallel structure can benefit from a higher diversity effect.
This explains why the convergence threshold, i.e., the minimum SNR at which the
iterative decoder starts to correct most of the errors, is lower when the concatenation
is parallel. In return, serially concatenated convolutional codes (SCCCs) show lower
changes of slope in the bit error probability curves than their parallel counterpart,
due to higher minimum Hamming distances. The distance properties of PCCCs and
SCCCs are analyzed in [19,20].
8 CHAPTER 1 Turbo Codes: From First Principles to Recent Standards
ENC1
Data
D D D
Y1
Interleaver
ENC2
Possible
puncturing
D D D
Y2
FIGURE 6
The turbo encoder structure, a parallel concatenation of two RSC encoders separated by
an interleaver.
Exploring the Variety of Random
Documents with Different Content
to make
Clary Wine.
Take twenty-four pounds of Malaga raisins, pick and chop them very small, put
them in a tub, and to each pound a quart of water; let them steep ten or eleven
days—this sounds like a school treat—stirring it twice every day; you must keep it
covered close all the while; then strain it off, and put it into a vessel, and about
half a peck of the tops of clary (what was clary?) when ’tis in blossom; stop it
close for six weeks, and then bottle it off; in two or three months ’tis fit to drink.
Take three pounds of sugar, and three quarts of water, let them boil together,
and scum it well; then put in six pounds of apricocks, pared and stoned, and let
them boil till they are tender; then take them up, and when the liquor is cold
bottle it up. You may, if you please, after you have taken out the apricocks, let the
liquor have one boil with a sprig of flower’d clary in it.
and boyle them in a faire panne, skimme it cleane, and straine it through a
faire cloth that there be no moats in it; then put to it one ounce of collianders
(coriander seeds?) and one ounce of aniseeds, foure or five orange pils (pips?) dry
and beaten to powder, let them lye three dayes; then draw your bastard into a
cleane pipe, then put in your honey with the rest, and beate it well; then let it lye
a weeke and touch it not, after draw it at pleasure.
small lump of double-refin’d sugar. This is excellent wine, and has a beautiful
colour.
and stamp him in a stone mortar till his bones are broken (you must craw and
gut him when you flea him), then put the cock into two quarts of sack, and put to
it three pounds of raisins of the sun stoned, some blades of mace, and a few
cloves; put all these into a canvas bag, and a little before you find the ale has
done working, put the ale and bag together into a vessel; in a week or nine days
bottle it up, fill the bottles but just above the neck, and give it the same time to
ripen as other ale.
skin clean off, and beat him flesh and bones in a stone mortar all to mash,
then slice into him half a pound of dates, two nutmegs quartered, two or three
blaids of mace, four cloves; and put to all this two quarts of sack that is very
good; stop all this up very close that no air may get to it for the space of sixteen
hours; then tun eight gallons of strong ale into your barrel so timely as it may
have done working at the sixteen hours’ end; and then put thereinto your infusion
and stop it close for five days, then bottle it in stone bottles; be sure your corks
are very good, and tye them with pack-thread; and about a fortnight or three
weeks after you may begin to drink of it; you must also put into your infusion two
pound of raisins of the sun stoned.
cream and ale. Sweeten to your taste and slice some nutmeg in it; set it over
the fire, and keep it stirring all the while, and when ’tis thick, and before it boils,
take it off, and pour it into the bason you serve it in to the table.
Frontiniac Wine
was simplicity itself.
Take six gallons of water and twelve pounds of white sugar, and six pounds of
raisins of the sun cut small; boil them together one hour; then take of the flowers
of elder, when they are falling and will shake off, the quantity of half a peck; put
them in the liquor when ’tis almost cold, and next day put in six spoonfuls of syrup
of lemons, and four spoonfuls of ale yeast; and two days after put it into a vessel
that is fit for it, and when it has stood two months bottle it off.
In the olden times, just before Oliver Cromwell was a going
concern, there were two sorts of what was then called {47}
Renish Wine,
that is to say, Elstertune and Barabant.
“The Elstertune,” says my informant, “are best, you shall know it
by the Fat, for it is double bard and double pinned”—I have not the
faintest idea what he means, but those are his words; “the Barabant
is nothing so good, and there is not so much good to be done with
them as with the other. If the Wines be good and pleasant, a man
may rid away a Hogshead or two of White wine, and this is the most
vantage a man can have by them; and if it be slender and hard,
then take three or four gallons of stone-honey and clarify it cleane;
then put into the honey four or five gallons of the same wine, and
then let it seeth a great while, and put into it twopence in cloves
bruised, let them seeth together, for it will take away the sent of
honey; and when it is sodden take it off, and set it by till it be
thorow cold; then take foure gallons of milke and order it as before,
and then put all into your wine, and all to beate it; and (if you can)
role it, for that is the best way; then stop it close and let it lie, and
that will make it pleasant.”
Possibly, but it seems a deal of trouble to take over a wine.
And now let us adjourn to a more familiar subject, for discussion
in the next chapter.
CHAPTER V
GLORIOUS BEER
Nectar on Olympus — Beer and the Bible — “Ninepenny” at Eton — “Number One”
Bass — “The wicked weed called hops” — All is not beer that’s bitter — Pathetic story
of “Poor Richard” — Secrets of brewing — Gervase Markham — An “espen” full of
hops — Eggs in ale — Beer soup — The wassail bowl — Sir Watkin Wynne — Brown
Betty — Rumfustian — Mother-in-law — A delightful summer drink — Brasenose ale.
Another way
To make Strong Beer
was published at a later date than the above, and to my thinking is
not a better way.
To a barrel of beer take two bushels of malt and half a bushel of wheat just
crackt in the mill, and some of the flour lifted out of it; when your water is {54}
scalding hot, put it in your mashing-fat; there let it stand till you can see your
face in it; then put your malt upon it, then put your wheat upon that, and do not
stir it; let it stand two hours and a half; then let it run into a tub that has two
pounds of hops in it, and a handful of rosemary flowers, and when ’tis all run put
it in your copper and boil it two hours; then strain it off, setting it a-cooling very
thin, and set it a-working very cool; clear it very well before you put it a-working,
put a little yeast to it; when the yeast begins to fall, put it into your vessel, and
when it has done working in the vessel, put in a pint of whole wheat and six eggs;
then stop it up, let it stand a year, and then bottle it. Then mash again, stir the
malt very well in, and let it stand two hours, and let that run, and mash again, and
stir it as before; be sure you cover your mashing-fat well up, mix the first and
second running together; it will make good household beer.
point. Beat two eggs with a tablespoonful of cold ale, and pour the boiling ale
into them, and then into a large jug. Pass the whole from one jug to another, as in
the case of Ale Flip, return to saucepan, and heat it again till almost, not quite, at
boiling-point.
With regard to
Wassail, or Swig (Cold),
which used to be a very popular beverage at the universities—at one
time it was peculiar to Jesus College, Oxford—is of very ancient date
indeed.
“Sir quod he,” is part of a conversation culled from an old MS.,
“Watsayll, for never days of your lyf ne dronk ye of such a cuppe,”
which sounds as if the Watsayll was of a seductive and harmful
nature. Nevertheless here is the recipe, taken from “Oxford
Nightcaps.”
Put into a bowl half a pound of Lisbon sugar (if you do not possess that brand,
I have no doubt “best lump,” pulverized, will do as well), and pour on it one pint of
warm beer; grate a nutmeg and some ginger into it; add four glasses of sherry
and five additional pints of beer; stir it well and sweeten to taste; let it stand
covered up two or three hours, then put three or four slices of bread cut thin and
toasted brown into it, and it is fit for use. Sometimes two or three slices of lemon
are introduced, together with a few lumps of sugar rubbed on the peel of a lemon.
Bottle this mixture, and in a few days it may be drunk in a state of effervescence.
Brown Betty
Here is another old recipe:—
Dissolve a quarter of a pound of brown sugar in one pint of water, slice a
lemon into it, let it stand a quarter of an hour, then add a small quantity of
pulverised cloves and cinnamon, half a pint of brandy, and one quart of good
strong ale; stir it well together, put a couple of slices of toasted bread in it, grate
some nutmeg and ginger over the toast, and it is fit for use. Ice it well, and it will
prove a good summer, warm it and it will become a pleasant winter, beverage. It is
drunk chiefly at dinner.
Beat well together in a jug, four eggs with a quarter of a pound of sifted sugar;
then add by degrees, stirring all the time, two quarts of old Burton ale, and half a
pint of gin; pour backwards and forwards from one jug to another, and when well
frothed serve in tumblers. Grate a little nutmeg atop of each portion. This is one of
the best “nightcaps” I know—especially after you may have been badger-hunting,
or burgling, or serenading anybody on Christmas Eve.
Rumfustian.
Beat up in a jug, the yolks of two eggs with a tablespoonful of sifted sugar;
then take half a pint of old Burton ale, one wine-glass of gin, one wine-glass of
sherry, a little spice and lemon rind. Let the ale, wine, and gin, mixed together
come to the boil, then pour in the egg mixture, whisking rapidly; serve hot, with a
little nutmeg grated atop.
Uncle,
are also in much request amongst the groundlings; whilst during the
warm weather I know of no more popular swallow, for moderate
drinkers, who do not require their throats to be scratched, than a
small bottle of lemonade to which is added just one “pull” of pale-
ale. This is called, for the sake of brevity, a
Small Lem and a Dash,
or the Poor Man’s Champagne; and is a refreshing and innocuous
drink which might commend itself to total abstainers.
In the Universities of Oxford and Cambridge there is probably as
much malt liquor drunk per head as in any other part of the world.
Brasenose Ale
has obtained a reputation which the beverage doubtless fully merits.
Since the foundation of this college a custom has prevailed of
introducing into the refectory on Shrove Tuesday, immediately after
dinner, what is denominated Brasenose Ale, but what is known in
many other parts of England as Lamb’s Wool. Verses in praise of the
Ale are—or at all events were—annually written by one of the
undergraduates, and a copy of them is sent to every resident
member of the College.
The following stanzas are taken from one of these
contributions:— {60}
Shall all our singing now be o’er,
Since Christmas carols fail?
No ! Let us shout one stanza more
In praise of Brasenose Ale !
A fig for Horace and his juice,
Falernian and Massic;
Far better drink can we produce,
Though ’tis not quite so classic.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookultra.com