Classifications

• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
  • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
  • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
  • H03M13/4107—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing add, compare, select [ACS] operations
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
  • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
  • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
  • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
  • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
  • H03M13/4161—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management
  • H03M13/4169—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management using traceback
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/65—Purpose and implementation aspects
  • H03M13/6502—Reduction of hardware complexity or efficient processing
  • H03M13/6505—Memory efficient implementations

Definitions

• the present disclosure generally relates to a Viterbi pack instruction. More particularly, the disclosure relates to a Viterbi pack instruction for packing bits from multiple predicate registers into a single destination register.
• a Viterbi algorithm is an algorithm useful in communications. It may be used to decode convolutional codes used in wireless communications systems. Such codes are used in many forms of wireless communications, such as, for example only, code division multiple access (CDMA), CDMA2000, wideband code division multiple access (WCDMA), time division synchronous code division multiple access (TD-SCDMA), and global system for mobile communications (GSM).
• CDMA code division multiple access
• WCDMA wideband code division multiple access
• TD-SCDMA time division synchronous code division multiple access
• GSM global system for mobile communications
• a Viterbi algorithm may also be used as an error-correction scheme, in 802.11 wireless local access networks (WLANs), in speech recognition and for many other purposes.
• Viterbi path in a trellis of states where there are multiple states with multiple paths that lead to each state.
• To determine which transition between states is most likely one may compare the likelihood of different transitions.
• a survivor path can be determined for each relevant state transition period across the trellis.
• a traceback is later performed along the survivor paths to generate the output bits.
• a flag bit can represent the output of such a comparison. This output may be stored in memory, e.g., to be used later when performing the traceback. Having the results of several compares written into memory from separate registers takes up more memory.
• Viterbi pack instruction that packs the bits within two or more predicate registers into a single destination register to speed up processing time and save memory space.
• a Viterbi pack instruction includes packing selected bits of one predicate register and selected bits of another predicate register into a single destination register.
• the Viterbi pack instruction masks the contents of a first predicate register with a first masking value and masks the contents of a second predicate register with a second masking value.
• the resulting masked data is written to a destination register.
• the first masking value is a hexadecimal 55 and the second masking value is a hexadecimal AA.
• the resulting masked data is ORed together prior to writing it to the destination register.
• the Viterbi pack instruction comprises a
• the Viterbi pack circuit comprises a first and second predicate register, a destination register, memory, a first and second AND gate and an OR gate.
• a digital signal processor is disclosed that operates the Viterbi pack instruction.
• a wireless communications device is disclosed that comprises the Viterbi pack instruction.
• An advantage of one or more of the embodiments disclosed herein can include reducing the time to execute a Viterbi algorithm.
• An advantage of one or more of the embodiments disclosed herein can include saving memory space.
• Another advantage can include quicker acquisition time for a wireless communications device, such as a cellular phone, in a wireless communications system.
• FIG. 1 is an exemplary state diagram such as those associated with a Viterbi algorithm
• FIG. 2 is a vector diagram based on the state diagram of FIG. 1;
• FIG. 3 is a functional diagram depicting a vector compare instruction
• FIG. 4 is a functional diagram depicting a Viterbi pack instruction
• FIG. 5 is a flow chart depicting a method of a Viterbi pack instruction
• FIG. 6 is a logic diagram depicting a Viterbi pack instruction circuit
• FIG. 7 is a diagram of a wireless communication device incorporating a Viterbi pack instruction of any of FIGs 4-6.
• FIG. 1 illustrates an example of a trellis of states such as those associated with a
• Viterbi algorithm In this example, 16 possible states (0-15) are shown. As shown, each state on the right hand side 0-7 can be reached from two different states on the left side. For example, state 0 can be reached from either state 0 or state 8.
• FIG. 2 illustrates a vector diagram depicting the possible transitions between states shown in FIG. 1.
• A-D represents the transitions from states 0, 1, 2 and 3 to states 0, 2, 4 and 6.
• Vector B represents the transitions from states 8, 9, 10 and 11 to states 0, 2, 4, and 6.
• Vector C represents the transitions from states 0, 1, 2 and 3 to states 1, 3, 5 and 7.
• Vector D represents the transitions from states 8, 9, 10 and 11 to states 1, 3, 5 and 7.
• a vector comparison may be used that compares the likelihood of different transition vectors.
• a compare instruction may be one that is capable of performing byte compares, 16-bit half-word compares, word compares and long word compares so that the algorithm could be used in various situations.
• the comparison of a long word with another may, for example, generate an output of a single bit that indicates which long word is greater.
• a comparison of two words with two other words may generate an output of two bits, each bit representing the result of one of the word comparisons.
• four half-word compares may generate four bits and eight byte compares may generate eight bits.
• each of the compare results may be written into a byte of data in a destination register, with a long word compare the resulting bit may be written into all bits of a byte within the destination register rather than just one bit.
• the first resulting bit could be written into the first four bits of the byte and the second resulting bit could be written into the other four bits.
• the first resulting bit can be written into the first two bits, the second could be written into the next two bits and so on.
• FIG. 3 illustrates the functioning of a versatile vector compare instruction 100 that may be useful with a Viterbi algorithm, such as during a Viterbi decoding.
• a vector stored in register 101 is compared with the B vector stored in register 102 and the results are stored in predicate register 110.
• the vectors and registers may be of any appropriate size.
• the both the A vector and the B vector may consist of four 16-bit half-words, 10Iw-IOIz and 102w-102z, each half-word representing path metrics of one of the state transitions shown in FIGs 1 and 2, e.g., state 0 to state 0.
• the A vector may be stored in a 64 bit register 101 and the B vector may be stored in a 64 bit register 102.
• Register 101 and register 102 may alternatively be implemented as a plurality of registers. For instance, one or both may be comprised of two separate registers.
• Compares 103-106 each compare a respective half-word 10Iw-IOIz with a respective half-word 102w-102z, as shown.
• a versatile vector compare instruction may simply store the resulting bit for each compare 103-106 in two adjacent bits in predicate register 110.
• the result of compare 103, bit d may be written into both bits 7 and 6 of predicate register 110.
• bits c, b and a each may be written into two bits of predicate register 110.
• FIG. 4 illustrates the functioning of an exemplary Viterbi pack instruction 150.
• predicate register 110 contains the results of a vector compare instruction 100 and predicate register 120 contains the results of a vector compare instruction that may have compared other vectors, C and D, for example. Rather than leave the results of the two vector compare instructions in two registers, in Viterbi pack instruction 150 those results are packed into destination register 130. Destination register 130 may be of any adequate size, for example, 8 bits long or larger. Viterbi pack instruction 150 can be implemented through software, firmware, hardware or any combination thereof.
• Viterbi pack instruction 150 can be represented as follows:
• R D (P O &OX55)
• R D is destination register 130
• P 0 is first predicate register 110
• Pi is second predicate register 120.
• the even bits of predicate register 110 (d, c, b and a) are written into the even bits of destination register 130 (bits 6, 4, 2 and 0).
• the odd bits of predicate register 120 (h, g, f and e) are written into the odd bits of destination register 130 (bits 7, 5, 3 and 1).
• the bits in destination register 130 will alternate between the bits stored in the two predicate registers 110 and 120. In this fashion, the bits in destination register 130 are placed in a more natural order so as to speed up processing.
• FIG. 5 illustrates a Viterbi pack method.
• a first masking value may be applied to the contents of the first predicate register 110 and a second masking value may be applied to the contents of the second predicate register 120 in step 310.
• the first masking value may be a hexadecimal 55 and the second masking value may be a hexadecimal AA.
• other different hexadecimal masking values would be used.
• step 320 the masked data resulting from the two maskings are ORed together.
• step 330 the ORed data is written to destination register 130. These steps may occur on a bitwise basis with steps occurring concurrently for different bits if desired.
• FIG. 6 illustrates a non-limiting embodiment of a Viterbi pack circuit 400.
• the contents of first predicate register 110 are fed into AND gate 401 and ANDed with a hexadecimal 55, for example, which may be stored in memory 405 .
• the contents of second predicate register 120 are fed into AND gate 402 and ANDed with a hexadecimal AA, for example, which may be stored in memory 406.
• Memory 405 and memory 406 may be a single memory element or may be separate memory elements of any appropriate type.
• AND gates 401 and 402 are coupled to the input of OR gate 410.
• the output of OR gate 410 is fed to destination register 130.
• FIG. 7 illustrates an exemplary, non-limiting embodiment of a wireless communication device that is generally designated 520.
• the wireless communication device includes a system 522 that includes a digital signal processor 524.
• Display controller 526 is coupled to the digital signal processor 524 and a display 528.
• an input device 530 is coupled to the digital signal processor 524.
• a memory 532 is coupled to the digital signal processor 524.
• a coder/decoder (CODEC) 534 can be coupled to the digital signal processor 524.
• a speaker 536 and a microphone 538 can be coupled to the CODEC 530.
• Digital signal processor 524 may include hardware or firmware and/or be capable of executing software that is capable of performing a Viterbi pack instruction 550, which may be of the type of any of the examples provided in FIGs. 4-6. If the Viterbi pack instruction 550 is in the form of software, the software may alternatively be stored in memory 532 and merely be executed in digital signal processor 524
• FIG. 7 also indicates that a wireless controller 540 can be coupled to the digital signal processor 524 and a wireless antenna 542.
• a power supply 544 is coupled to the system 522.
• the display 528, the input device 530, the speaker 536, the microphone 538, the wireless antenna 542, and the power supply 544 may be external to the system 522. However, each is coupled to a component of the system 522.
• a software module may reside in RAM memory, flash memory, ROM memory, PROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
• An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium.
• the storage medium may be integral to the processor.
• the processor and the storage medium may reside in an ASIC.
• the ASIC may reside in a computing device or a user terminal.
• the processor and the storage medium may reside as discrete components in a computing device or user terminal.

Landscapes

• Physics & Mathematics (AREA)
• Probability & Statistics with Applications (AREA)
• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Error Detection And Correction (AREA)
• Executing Machine-Instructions (AREA)

Priority Applications (8)

Applications Claiming Priority (2)

Publications (2)

Family

ID=38523331

Family Applications (1)

Country Status (11)

Families Citing this family (9)

Family Cites Families (16)

• 2006
  • 2006-03-23 US US11/389,443 patent/US8290095B2/en active Active
• 2007
  • 2007-03-23 RU RU2008141908/09A patent/RU2008141908A/ru not_active Application Discontinuation
  • 2007-03-23 KR KR1020127022669A patent/KR101585492B1/ko not_active Expired - Fee Related
  • 2007-03-23 BR BRPI0708809-4A patent/BRPI0708809A2/pt not_active IP Right Cessation
  • 2007-03-23 MX MX2008011985A patent/MX2008011985A/es not_active Application Discontinuation
  • 2007-03-23 WO PCT/US2007/064816 patent/WO2007109793A2/en not_active Ceased
  • 2007-03-23 KR KR20157006068A patent/KR20150038630A/ko not_active Ceased
  • 2007-03-23 IN IN2124MUN2008 patent/IN266883B/en unknown
  • 2007-03-23 JP JP2009503182A patent/JP5180186B2/ja not_active Expired - Fee Related
  • 2007-03-23 KR KR1020087025411A patent/KR20080112311A/ko not_active Ceased
  • 2007-03-23 CN CN2007800095654A patent/CN101405945B/zh not_active Expired - Fee Related
  • 2007-03-23 EP EP07759275A patent/EP1997229A2/en not_active Ceased
  • 2007-03-23 CA CA002643940A patent/CA2643940A1/en not_active Abandoned

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events