CN1166900A - Method and apparatus for the provision and reception of symbols - Google Patents
Method and apparatus for the provision and reception of symbols Download PDFInfo
- Publication number
- CN1166900A CN1166900A CN96191306.1A CN96191306A CN1166900A CN 1166900 A CN1166900 A CN 1166900A CN 96191306 A CN96191306 A CN 96191306A CN 1166900 A CN1166900 A CN 1166900A
- Authority
- CN
- China
- Prior art keywords
- bit
- symbol
- less important
- choosing
- main
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
- H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
- H04L27/3405—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power
- H04L27/3416—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power in which the information is carried by both the individual signal points and the subset to which the individual points belong, e.g. using coset coding, lattice coding, or related schemes
- H04L27/3427—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power in which the information is carried by both the individual signal points and the subset to which the individual points belong, e.g. using coset coding, lattice coding, or related schemes in which the constellation is the n - fold Cartesian product of a single underlying two-dimensional constellation
- H04L27/3433—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power in which the information is carried by both the individual signal points and the subset to which the individual points belong, e.g. using coset coding, lattice coding, or related schemes in which the constellation is the n - fold Cartesian product of a single underlying two-dimensional constellation using an underlying square constellation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A symbol constellation is logically divided into a plurality of multi-symbol subsets (201-204). Additionally, a series of primary bits and a series of secondary bits are provided. At least a first selected primary bit is error control encoded (303) to provide an M bit pre-symbol (603) that uniquely corresponds to a multi-symbol subset (602). The M bit pre-symbol is modulated (304) by at least a first selected secondary bit to provide an N bit symbol (605) that uniquely corresponds to a symbol included in the multi-symbol subset. Recovered primary bits are determined by comparing a received symbol (609) with only one symbol in each of the multi-symbol subsets. Additionally, recovered secondary bits are determined by comparing the received symbol with predetermined decision boundaries (622). In this manner, varying degrees of error protection are provided allowing for a wider variety of coding rates.
Description
A kind of method and apparatus that provides with receiving symbol especially is provided relate generally to radio digital communication equipment of the present invention.
In the radio digital communication apparatus field, the use of error correction is in order to resist the Channel Transmission mistake, particularly trellis coded modulation (TCM) is a kind of method of known error correction, and it handles the symbol that generation will be transmitted to digital signal data (as binary bits) with the error correcting technique of knowing.
But also knownly provide variable level of error correction on the same group speech coding parameters not, particularly high to error sensitivity parameter is (if incorrect as receiving, the voice quality generation extremely passive effect of its meeting to recovering) want given stronger mistake proofing rank, yet for the parameter low to error sensitivity (as, if receive incorrect, it is very little or harmless to the influence of voice quality) if having a bit, just give the prevention of its lower mistake.
Although TCM occupies superiority in the system of the variable mistake proofing ability of needs, but under given modulation type, spendable code check is quantitatively restricted sometimes for TCM, and it is the ratio of K/n that the typical case of error correction code rate describes, here k is the bit number that is encoded, and n is a bit number of forming final symbol.For example, the sign indicating number of code check 1/2 is that 1 bit of every input is produced a symbol by two coded-bits definition, and the sign indicating number of code check 2/3 is that the dibit to every input produces one by symbol of three coded-bits definition or the like.Generally speaking, along with code check reduces/increases, the error correcting capability of sign indicating number also increases/reduces, and table 1 has shown the TCM sign indicating number code check to the different quadrature amplitude modulation (QAM) and phase shift keying (PSK) the modulation scheme limit.
| Modulation | Code check |
| 8PSK | 2/3, (1/3, Fei Angebaike (non-Ungerboeck) |
| 16QAM | 3/4, (2/4,1/4 Fei Angebaike) |
| 64QAM | 5/6, (4/6,3/6,2/6,1/6 Fei Angebaike) |
Table 1
As shown in table 1, only there is a kind of An Gebaike (Ungerboeck) code check (being the ratio of N/N+1) available to every kind of modulation type.Although can obtain non--Ungerboeck code check, but they are difficult to be designed to correct mistake proofing performance, generally need not in the reality, given available restricted code check uses TCM down, the designer often is faced with selection, make seldom bit have the mistake proofing of height, perhaps make most of bit have mistake proofing than low degree.But so alternately can not provide suitable error-correcting performance to needs fail-safe system in various degree, as voice system.
Therefore, in other system of the variable mistake proofing level of needs, allowing more, the method for the interior TCM of selection of wide region code check will be of great use.
Fig. 1 is the scheme diagram that prior art derives symbol.
Fig. 2 is the scheme diagram according to the derivation symbol of first kind of embodiment of the present invention.
Fig. 3 is according to the flow chart based on symbol that a plurality of bit sequence produces of the present invention.
Fig. 4 is the block diagram according to radio digital communication equipment of the present invention.
Fig. 5 recovers the flow chart of the method for main and less important bit according to the present invention is based on the symbol that receives.
Fig. 6 is the block diagram that has shown symbol sign indicating number example according to the present invention.
The present invention proposes a kind of method and apparatus that symbol is provided on the TCM basis, allow a plurality of bit sequences that in various degree mistake proofing is arranged, and this method and apparatus can be used in the radio digital communication equipment.
The symbol conformation can be divided into character subset more than a group in logic; and provide the main bit sequence that needs first order protection; protect less important bit sequence with the needs second level; its degree of protection is lower than the first order; at least one main bit of at first selecting is done error control coding; its produces M bit symbol (pre-symbol) that prelists generally speaking, and the M bit prelists symbol uniquely corresponding to character subset more than in many character subsets group.The M bit prelists symbol by at least one less important symbol-modulated of at first selecting, and (N＞M), this N bit symbol is unique corresponding to a symbol that is included in many character subsets here to produce the N bit symbol.In the environment of the present invention, modulation is meant in the zone of the symbol definition that prelists selects a special symbol.
At receiving terminal, the N bit symbol by only with each many character subset in a symbol relatively decode, produce the main bit that recovers.In addition, the N bit symbol produces the less important bit that recovers by comparing with predefined decision boundaries.In this way, a plurality of bit sequences can have error confinement in various degree.The more code check of wide range variable can be provided in addition.
With reference to figure 1～6, the present invention can be illustrated in more detail.Fig. 1 is the scheme diagram that prior art derives symbol, makes in this way, and each bit has only approximate same prevention degree to channel error in a certain bit sequence.Example shows that at first input bit is transformed into the symbol of being made up of 42 original bits through convolution coding, the Euclidean distance of original symbol quite little (I-Q plane, the left side).Other two of selecteed symbol 101 responses not coded-bit are shifted successively, produce 1 of 44 possible bit symbols 102～105.Make that the Euclidean distance between such 4 possibility symbols is bigger than the Euclidean distance of original symbol.
Euclidean distance between the method symbolization that Fig. 1 shows provides mistake proofing to two coded-bits and adopt convolution code that mistake proofing is provided to input bit at first not.This just has the net effect that input bit at first and two input bits of not encoding is provided other protection of similar level.By this way the symbol that receives of Chan Shenging in decoder by relatively deciding the transmission sequence of input bit with all possible candidate symbol.
Fig. 2 is the scheme diagram of the derivation symbol of first embodiment according to the invention.In the example of Fig. 2, main bit uses convolution code or lattice type (trellis) encoder to be encoded, and produces the 2 bits symbol that prelists, and its same regional 201～204 (or many character subset) is corresponding uniquely.This processing procedure below will more be described in detail.(the present invention expects that a symbol conformation can be divided into character subset more than two at least, for example, 16QAM symbol conformation can be divided into character subset more than 2, each subclass comprises 8 symbols, or being divided into character subset more than 4, each subclass comprises 4 symbols, or is divided into character subset more than 8, each subclass comprises 2 symbols, perhaps there is no need each symbol in the conformation as the member of many character subsets.For example, 8 symbols in the 16QAM symbol conformation can be divided into character subset more than 4, and each subclass comprises 2 symbols.Other 8 symbols can.Which many character subset which symbol is included in is the thing of design alternative.
In fact, the present invention is meant and decides the encoder state transitions to many character subsets, rather than all single symbols of the prior art.In the embodiment that recommends, it is for each many character subset that the selection of many character subsets requires, the Euclidean distance maximum between the nearest symbol of any symbol in many character subsets in other all many character subsets.In this manner, coded-bit is not only benefited from coding, and benefits from Euclidean distance greatly.
In case and the symbol that prelists of many character subsets correspondence is selected, two not coded-bit be used for selecting 4 specific bits (being N=M+2) symbol 205～208 from many character subsets of choosing.Balance between Fig. 1 and Fig. 2 is that uncoded bit can not benefit from bigger Euclidean distance.And decode procedure is also not too complicated, as described below.
Fig. 3 is the flow chart that produces the method for symbol among the present invention based on a plurality of bit sequences.Main bit sequence and less important bit sequence are provided in step 301.Another kind method is to produce a plurality of main bit sequences and/or less important bit sequence.Although these bit sequences can comprise the information of any kind usually, in the embodiment that recommends, they have comprised the speech coding parameters that different error sensitivities are arranged.Among the another kind of embodiment, bit sequence includes the picture coding parameter of different error sensitivities.In environment of the present invention, suppose to have one or more main bit sequences to have higher error sensitivity, therefore need be subjected to stronger protection; There is one or several less important bit sequence to have lower error sensitivity, therefore only need be subjected to weak protection.
In step 302, main bit and a less important bit of from main bit sequence and less important bit sequence, at least respectively selecting a bit to produce to choose at least at first.This selection course is selected next available bit from each bit sequence, or does not select those predetermined bits from each bit sequence in order.In addition, if a more than main and/or less important bit sequence is arranged, so, the main bit of choosing at least at first and less important bit of at first choosing can be respectively chosen from separately a plurality of main bit sequence and less important bit sequence.
In step 303, at least at first the main bit of choosing is encoded, produce and character subset is corresponding uniquely more than one the M bit symbol that prelists, in a preferred embodiment, the coding of the main bit of choosing at least at first adopts known lattice type sign indicating number to produce the M bit symbol that prelists, in another embodiment, adopt known convolution code to produce the M bit, they are transformed into the M bit symbol that prelists.According to prior art, lattice type sign indicating number and convolution code transition state are transferred to candidate symbol.In this manner, the state transitions that is produced by the input bit sequence produces the symbol sebolic addressing that allows.In contrast, the present invention transforms to many character subsets (or zone) to the state transitions that input bit produces, and these subclass are by the M bit Symbol recognition that prelists.If many character subsets have the Euclidean distance maximum to select according to making between each many character subset, be used to produce the prelist input bit of symbol of M bit so and not only benefit from the redundancy that coding brings, and benefit from the Euclidean distance of many character subsets.
In step 304, the M bit symbol that prelists produces the N bit symbol by the less important bit modulation of choosing at least at first, here N＞M and k=N-M.In the reality, each N bit symbol is expressed as a N bit symbol index." modulation " step is equivalent to prelisting with the M bit and selects a special symbol in the corresponding uniquely many character subsets of symbol.As mentioned above, each many character subset is by having 2 in logic
KThe diversity of individual symbol is formed.Symbol can from 0 to 2
K-1 is indexed.(" zone " is often referred to the generation of many character subsets because be included in symbol in each many character subset be in typical case select approximating).Selection (or modulation) process can be by directly finishing at the appropriate N bit symbol index that interior K less important bit transforms in the many character subsets of appointment comprising the less important bit of choosing at least at first.Among another embodiment, selection can adopt second encoder (lattice type or convolution) to finish.
In step 305, the N bit symbol can send alternatively by suitable communication sources such as radio-frequency carrier.How do not consider step 305, in step 306, judge, all be encoded if be included in main and inferior all bits in bit sequence, modulation, emission, then process finishes.If have remaining bits need be encoded, modulate, launch alternatively, then repeat in 302 processes.In preferred embodiment, selection main and less important bit should make the bit of every sequence use up simultaneously.For example, all bits are formed a vocoder frames.
Fig. 4 is the block diagram according to radio digital communication equipment 400 of the present invention.Radio digital communication equipment 400 comprises 402, one of 401, one encoders of a speech coder, 403, one transmitting sets 404 of Symbol modulator that prelist.Although do not show, in preferred embodiment, one or more processing apparatus (as microprocessor and/or digital signal processor) and memory device (as random access memory and/or read-only memory) are also contained in the radio digital communication equipment 400 in order to realize the method as the present invention's description of software algorithm.
Algorithm press to be compiled in voice encryption device 401 combine digital speeches, exports the digital voice coding parameter that two-way at least represents to import speech waveform feature (not have demonstration).Give an example, voice encryption device can be carried out and be known as VSELP (VSELP) or be called improved Multi-Band Excitation (IMBE).First channel 406 comprises a sequence speech coding parameter, these parameters have high error sensitivity (being called main bit sequence in the above), and second channel comprises the speech coding parameter (being called less important bit sequence in the above) that a sequence has low error sensitivity.
Fig. 5 is the flow chart that recovers the method for main and less important bit based on the symbol that receives according to of the present invention.The method that Fig. 5 describes for example can be introduced in the Wireless Telecom Equipment.In step 501, can receiving symbol by any suitable transmission medium such as RF Carrier.The symbol that receives is owing to be subjected to the symbol that the influence of transmitted noise and interference can be different from emission.As mentioned above, suppose that the symbol that receives is to use at least one main bit and at least one less important bit to produce.
In step 502, as mentioned above, the symbol conformation is divided into many character subsets.Although among the preferential embodiment, the operation to each receiving symbol shown in Figure 5 is as an independent step, determine that the step of many character subsets is to finish at system design stage.
In step 503, determine receiving symbol each symbol in each many character subset, and the distance between symbol only.This is determined to be selected at as described below with reference to Figure 6 usually nearest in each a many character subset symbol.Method of the prior art adopts all candidates' symbol, and the method has here reduced complexity than prior art.
In step 504, the distance of Que Dinging is used at least one main bit is produced all main bit decoding of recovery above.In the embodiment that recommends, step 503 and 504 adopts Viterbi (viterbl) decoders to operate, in this decoder branch metric corresponding to receiving symbol to Euclidean distance between many character subsets rather than the Euclidean distance between receiving symbol and candidate symbol.In fact, step 503 and 504 adopts and determines that maximal phase recovers at least one main bit like many character subsets.
In step 505, receiving symbol is determined with respect to the position of at least one predetermined Decision boundaries.In this case, at least one less important bit can be determined and produce the less important bit of recovery, and Fig. 6 has shown an example.In one embodiment of the invention, the part that step 505 can be used as viterbi algorithm is performed, so utilized the advantage of the ability that the trellis code error correction is arranged.
Be understood that the present invention by an example.Fig. 6 has shown according to the present invention the coding and the decoded instance block diagram of symbol.Especially, Fig. 6 with graphical display the out of phase of above-mentioned symbol sign indicating number.
Encoder 601 carries out lattice type (or convolution) coding to one or two main bit in this example, produces M bit symbol 603, and bit symbol 603 is corresponding with certain many character subset 602.The symbol 603 that prelists is transferred to the Symbol modulator 604 that prelists, and in this example, this modulator 604 uses a less important bit to select a symbol 605 from many character subsets 602.Symbol 605 is launched by wireless communication resources 607 then.
A received symbol 609 because the influence of transmitted noise and/or interference very likely is changed, is sent to soft decision decoder 610, for example, and Viterbi (Viterbi) decoder.The symbol 609 that receives is made comparisons with the only candidate symbol 612～619 in each many character subset.As mentioned above, candidate symbol 612～619 is selected as and the symbol 609 that receives has these symbols of each subclass of minimum Euclidean distance.As mentioned above, the branch metric of soft decision decoder 610 uses is corresponding to the Euclidean distance of many character subsets group.Decoder soft-decision 610 adopts maximal phase to determine many character subsets 611 like decision rule, and like this, one or two main bit (corresponding to one or two main bit of encoding in the past) just has been determined.
In case determine, maximal phase is sent to Hard decision decoding device 621 like many character subsets 611.The symbol 609 that Hard decision decoding device 621 relatively receives and decide a symbol 623 in many character subsets that most probable is launched corresponding to the decision boundaries 622 of many character subsets 611.Do like this, the less important bit of recovery (corresponding to the less important bit that is used to modulate precoded symbol 603) is just decided.
Shown the 16QAM conformation although be appreciated that Fig. 6, the present invention does not limit the conformation of this type or size.For example adopt device of the present invention can implement 64QAM or 8PSK conformation.
Utilize a kind of method and apparatus provided by the invention can make many bit sequences have in various degree mistake proofing ability.A tangible benefit of the present invention is owing to having used many character subsets to reduce the complexity of decoder.In addition, owing to use a plurality of bit sequences, each needs different code checks (or mistake proofing in various degree), and the present invention has greater flexibility aspect code rate selection.For example, the sign indicating number of 16QAM 1/3 code check can show as with 2/4 code check encoder to be realized, 1/3 code check coding is provided and uses a less important bit of not encoding just can increase effective code check to 2/4 but be actually main input bit.
Claims (23)
1. the method that comprises following step:
One of-generation needs the main bit sequence of the mistake prevention of first order protection;
-producing a less important bit sequence that needs the mistake prevention of second level protection, the second level is protected inferior to the first order;
-to the main bit of choosing at least at first of main bit sequence carry out error control coding with produce one with the corresponding M bit of the main bit of choosing at least at first symbol that prelists, wherein, the symbol conformation is divided into character subset more than a group, and the M bit prelists symbol uniquely corresponding to certain the many character subset in many character subsets group; And,
-produce uniquely corresponding to the N bit symbol that is included in certain symbol in many character subsets with the less important bit modulation M bit of choosing at least at first in the less important bit sequence symbol that prelists, wherein, M in a N bit symbol bit is corresponding to the main bit of choosing at least at first, and the bit of the N-M in the N bit symbol is corresponding to the less important bit of choosing at least at first.
2. the method for claim 1, the step that main bit sequence is provided also comprise the error sensitivity that provides higher level and need the step of the digital voice coding parameter of first order mistake prevention.
3. the method for claim 1 produces and also comprises the error sensitivity that provides lower grade in the step of less important bit sequence and wrong prevention uses bit one to one not need the step of the digital voice coding parameter of final redundancy protecting to symbol-bit conversion.
4. the method for claim 1, at least at first the main bit of choosing is carried out error control coding produce the prelist step of symbol of M bit and also comprised the main bit trellis coding of choosing is at least at first produced the prelist step of symbol of M bit, wherein lattice type state transitions has and the man-to-man corresponding relation of many character subsets group.
5. the method for claim 1, at least at first the main bit of choosing is carried out error control coding to be produced the prelist step of symbol of M bit and has also comprised the encode step of the symbol that prelists that produces the M bit of the main bit convolution of choosing at least at first, wherein, the convolution state transitions has and the man-to-man corresponding relation of many character subsets group.
6. the method for claim 1 is carried out error control coding to the main bit of choosing at least at first and is produced the prelist step of symbol of M bit and also comprised and the main bit of choosing is at least at first carried out error control coding produce the prelist step of symbol of 3 bits.
7. the method for claim 1 has also comprised with the less important bit modulation M bit of choosing at least at first symbol that prelists with the step that produces the N bit symbol and has produced 2 with the less important bit modulation M bit of choosing at least at first symbol that prelists
NIndividual quadrature amplitude modulation symbols.
8. the method for claim 1 has further comprised the step by wireless communication resources emission N bit symbol.
9. method that comprises following step:
One of-generation needs the main bit sequence of the mistake prevention of first order protection;
-producing a mistake that needs the second level to protect to prevent less important bit sequence, the second level is protected inferior to the first order;
-produce M bit corresponding to the main bit of choosing the at first symbol that prelists to choosing main bit sequence to carry out error control coding at least at first, wherein, the symbol conformation is divided into character subset more than a group, and the M bit prelists symbol uniquely corresponding to a certain many character subsets in many character subsets group; And,
-with want at least for the first time the less important bit modulation M bit of choosing at first in the bit sequence prelist symbol with generation uniquely corresponding to the N bit symbol of a symbol in many character subsets, wherein M is not less than 2, N is greater than M, wherein the M bit in the N bit symbol is corresponding to the main bit of choosing at least at first, and the N-M bit in the N bit symbol is corresponding to the less important bit of choosing at first.
10. the method for claim 9 also comprises the following step:
-generation needs at least the second less important bit sequence of the mistake prevention of second level protection,
-bit of choosing at least at first in the less important bit sequence group is carried out error control coding to produce a N-2 bit corresponding to the main bit of choosing the at first symbol that prelists, wherein, the N-2 bit prelists symbol uniquely corresponding to a certain many character subsets; And
-produce unique N bit symbol with the symbol that prelists of second less important bit modulation N-2 bit of choosing in the less important bit chosen at first and at least the second the less important bit sequence corresponding to a symbol in many character subsets, wherein N is greater than 3, wherein in the N bit symbol at least dibit corresponding to the main bit of choosing at least at first, 1 bit in the N bit symbol is corresponding to the less important bit of choosing at first, and 1 bit in the N bit symbol is corresponding to second less important bit of choosing.
11. the method in the claim 9, the main bit of choosing is at first carried out error control coding prelist and further comprised the main bit of choosing at first in the step of symbol and carry out trellis coding to produce the prelist step of symbol of N-1 bit to produce the N-1 bit, wherein lattice type state transitions and many character subsets group have man-to-man corresponding relation.
12. the method for claim 9, the main bit of choosing is at first carried out error control coding to prelist and has further comprised in the step of symbol the main bit convolution coding chosen at first to produce the prelist step of symbol of N-1 bit to produce the N-1 bit, wherein, convolution state transitions and many character subsets group have man-to-man corresponding relation.
13. the device of symbol encoder comprises:
-one encoder, reception needs the main bit sequence of the mistake prevention of first order protection, and produce at least one M bit corresponding at least one the main bit in main bit sequence symbol that prelists, wherein, the symbol conformation is divided into character subset more than a group, and the M bit prelists symbol uniquely corresponding to certain the many character subset in many character subsets group at least; And
-one Symbol modulator that prelists; link to each other with encoder; this encoder receives the less important bit sequence that at least one M bit is compiled symbol and needed the mistake prevention of second level protection; second level protection is inferior to the first order; prelist symbol to produce uniquely at least one N bit symbol corresponding to a symbol in many character subsets with at least one the less important bit modulation M bit in the less important bit sequence; wherein the M bit in the N bit symbol is corresponding at least one main bit, and the bit of the N-M in the N bit symbol is corresponding at least one less important bit.
14. the symbol encoder of claim 13, this encoder have further comprised a grid coder, wherein the state transitions of grid coder and many character subsets group have man-to-man corresponding relation.
15. the symbol encoder of claim 13, this encoder have further comprised a convolution coder, wherein the state transitions of convolution coder and many character subsets group have man-to-man corresponding relation.
16. being used for the device of radio digital communication equipment comprises:
-one encoder; reception needs the main bit sequence of the mistake prevention of first order protection; generation is corresponding at least one the M bit of at least one the main bit in main bit sequence symbol that prelists; wherein; the symbol conformation is divided into character subset more than a group, and at least one M bit prelists symbol corresponding to the character subset more than in many character subsets group.
-one Symbol modulator that prelists; link to each other with encoder; this encoder receives the less important bit sequence that at least one M bit prelists symbol and prevents with the mistake that needs want the second level to protect; second level protection is inferior to the first order; prelist symbol to produce uniquely at least one the N bit symbol corresponding to a symbol in many character subsets with at least one the less important bit modulation M bit in the less important bit sequence; wherein; M bit in this at least one N bit symbol is corresponding at least one main bit, and the bit of the N-M in the N bit symbol is corresponding at least one less important bit.
-transmitting set is coupled to the Symbol modulator that prelists, and receives at least one N bit symbol and launches the N bit symbol by wireless communication resources.
17. the radio digital communication equipment in the claim 16, this encoder have further comprised a grid coder, wherein, lattice type state transitions and many character subsets group of grid coder have man-to-man corresponding relation.
18. the radio digital communication equipment in the claim 16, encoder have further comprised a convolution coder, the state transitions of convolution coder and many character subsets group have man-to-man corresponding relation.
19. the radio digital communication equipment in the claim 16, transmitting set has further comprised the less radio-frequency transmitter.
20. the radio digital communication equipment in the claim 16 further comprises:
Speech coder is coupled to the encoder and the Symbol modulator that prelists, produce speech coding parameters that high-grade error sensitivity is arranged as the speech coding parameters of main bit sequence and low-grade error sensitivity as less important bit sequence.
21. comprise the method for the following step:
-receive a N bit symbol, wherein M bit in the N bit symbol is corresponding at least one main bit, and the N-M bit in the N bit symbol is corresponding at least one less important bit.
-the symbol conformation is divided into character subset more than a group.
-adopt to determine that the distance between only symbol of N bit symbol and each many character subset decodes to the N bit symbol.
22. the method for claim 21, the step that the N bit symbol is decoded has further comprised Viterbi (Viterbi) coding N bit symbol, to produce the main bit of at least one recovery.
23. the method for claim 22, the step that the N bit symbol is decoded further comprises:
-judgement N bit symbol is with respect to the position of at least one predetermined decision boundaries; And
-determine the less important bit of at least one recovery for the function of the position of at least one predetermined decision boundaries as the N bit symbol.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US55110395A | 1995-10-31 | 1995-10-31 | |
| US08/551,103 | 1995-10-31 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1166900A true CN1166900A (en) | 1997-12-03 |
Family
ID=24199875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN96191306.1A Pending CN1166900A (en) | 1995-10-31 | 1996-10-18 | Method and apparatus for the provision and reception of symbols |
Country Status (7)
| Country | Link |
|---|---|
| CN (1) | CN1166900A (en) |
| AR (1) | AR004249A1 (en) |
| BR (1) | BR9607557A (en) |
| FR (1) | FR2740634A1 (en) |
| GB (1) | GB2312814A (en) |
| IL (1) | IL119467A0 (en) |
| WO (1) | WO1997016910A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100596347C (en) * | 2008-05-21 | 2010-03-31 | 四川虹微技术有限公司 | Self-adaption error correction method for digital audio broadcasting receiver |
| CN1585397B (en) * | 2003-05-23 | 2011-12-07 | 三星电子株式会社 | Apparatus and method for estimating a decision boundary in symbol units in a mobile communication system |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4489418A (en) * | 1983-04-18 | 1984-12-18 | At&T Bell Laboratories | Differential encoding technique |
| US4941154A (en) * | 1989-05-30 | 1990-07-10 | At&T Bell Laboratories | Trellis coding method and arrangement for fractional bit rates |
| FR2660131B1 (en) * | 1990-03-23 | 1992-06-19 | France Etat | DEVICE FOR TRANSMITTING DIGITAL DATA WITH AT LEAST TWO LEVELS OF PROTECTION, AND CORRESPONDING RECEPTION DEVICE. |
| JPH0626346B2 (en) * | 1990-04-26 | 1994-04-06 | 郵政省通信総合研究所長 | Convolutional coded orthogonal FM / Viterbi reception system |
| US5263051A (en) * | 1991-07-05 | 1993-11-16 | Codex Corporation | Device and method of interleaving for a trellis precoding system |
| US5651032A (en) * | 1993-11-04 | 1997-07-22 | Kabushiki Kaisha Toshiba | Apparatus and method for trellis decoder |
| EP0679000A1 (en) * | 1994-04-22 | 1995-10-25 | Koninklijke Philips Electronics N.V. | Soft quantisation |
| US5546420A (en) * | 1994-04-29 | 1996-08-13 | At&T Corp. | Methods of and devices for enhancing communications that use spread spectrum technology by using variable code techniques |
-
1996
- 1996-10-18 GB GB9713516A patent/GB2312814A/en not_active Withdrawn
- 1996-10-18 WO PCT/US1996/016826 patent/WO1997016910A1/en active Application Filing
- 1996-10-18 BR BR9607557A patent/BR9607557A/en not_active Application Discontinuation
- 1996-10-18 CN CN96191306.1A patent/CN1166900A/en active Pending
- 1996-10-22 IL IL11946796A patent/IL119467A0/en unknown
- 1996-10-30 FR FR9613247A patent/FR2740634A1/en active Pending
- 1996-10-31 AR ARP960104989A patent/AR004249A1/en unknown
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1585397B (en) * | 2003-05-23 | 2011-12-07 | 三星电子株式会社 | Apparatus and method for estimating a decision boundary in symbol units in a mobile communication system |
| CN100596347C (en) * | 2008-05-21 | 2010-03-31 | 四川虹微技术有限公司 | Self-adaption error correction method for digital audio broadcasting receiver |
Also Published As
| Publication number | Publication date |
|---|---|
| FR2740634A1 (en) | 1997-04-30 |
| IL119467A0 (en) | 1997-01-10 |
| BR9607557A (en) | 1998-07-07 |
| GB2312814A (en) | 1997-11-05 |
| AR004249A1 (en) | 1998-11-04 |
| GB9713516D0 (en) | 1997-09-03 |
| MX9704951A (en) | 1997-10-31 |
| WO1997016910A1 (en) | 1997-05-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6125150A (en) | Transmission system using code designed for transmission with periodic interleaving | |
| JP3875693B2 (en) | Coded bit mapping method and transmission apparatus using LPC code | |
| US7190737B2 (en) | Multi-mode block-coded modulation/demodulation method | |
| US6311306B1 (en) | System for error control by subdividing coded information units into subsets reordering and interlacing the subsets, to produce a set of interleaved coded information units | |
| US8526547B2 (en) | System and method performing Quadrature Amplitude Modulation by combining co-sets and strongly coded co-set identifiers | |
| KR0181983B1 (en) | Apparatus and method for trellis decoder | |
| CA2079287C (en) | Coded modulation with unequal error protection for fading channels | |
| US8160170B2 (en) | Signal space expansion for a 16 QAM scheme | |
| US5926488A (en) | Method and apparatus for decoding second order reed-muller codes | |
| CN1320770C (en) | Method and system for allcating convolutional enconded bits into symbols before modulation | |
| CN1449152A (en) | Error correction with two block codes | |
| KR100904810B1 (en) | Digital signal transmitting apparatus | |
| US7046975B2 (en) | Method and system for blind detection of modulation type | |
| US6324224B1 (en) | Apparatus and method for receiving data with bit insertion | |
| KR20080092458A (en) | Coded modulation for partially coherent systems | |
| US5805613A (en) | Methods for efficient bounded-distance decoding of the Hexacode and associated decoders for the Leech Lattice and the Golay code | |
| US6327316B1 (en) | Data receiver using approximated bit metrics | |
| CN1166900A (en) | Method and apparatus for the provision and reception of symbols | |
| KR20060063012A (en) | Apparatus and method for transmitting data by constellation combination in a communication system | |
| WO1999017509A1 (en) | Symbol mappings for coded modulations | |
| US20090238302A1 (en) | Method and apparatus for signal coding | |
| AU667636B2 (en) | Method for encoding data | |
| US7292643B1 (en) | MIMO TCM with constellation rotation and coordinate swapping | |
| KR100320953B1 (en) | Symbol Mapping Method and Device of TCM Using Euclidean Distance And Hamming Distance And Apparatus Thereof | |
| GB2334862A (en) | Mapping symbol points in a quadrature amplitude modulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C01 | Deemed withdrawal of patent application (patent law 1993) | ||
| WD01 | Invention patent application deemed withdrawn after publication |