Source: http://www.google.com/patents/US8077800?ie=ISO-8859-1
Timestamp: 2014-07-25 19:46:54
Document Index: 27363282

Matched Legal Cases: ['Application No. 2004', 'Application No. 04', 'Application No. 04256381', 'Application No. 10184588', 'Application No. 10184618', 'Application No. 2004']

Patent US8077800 - Transmitting apparatus with bit arrangement method - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsA transmitting apparatus, that includes a means for generating bit sequences to adjust an occupation rate occupied with predetermined bits included in a first data block, which is obtained by encoding first data in a first encoding process, to be equal or closer to an occupation rate occupied with predetermined...http://www.google.com/patents/US8077800?utm_source=gb-gplus-sharePatent US8077800 - Transmitting apparatus with bit arrangement methodAdvanced Patent SearchPublication numberUS8077800 B2Publication typeGrantApplication numberUS 13/033,715Publication dateDec 13, 2011Filing dateFeb 24, 2011Priority dateFeb 12, 2004Also published asCN1655491A, CN100514900C, CN101572588A, CN101572588B, EP1564954A2, EP1564954A3, EP1564954B1, EP2293509A1, EP2293509B1, EP2375667A1, EP2381636A1, US7860186, US7965791, US8085872, US8213535, US20050180363, US20100278282, US20110058625, US20110142167, US20110142168Publication number033715, 13033715, US 8077800 B2, US 8077800B2, US-B2-8077800, US8077800 B2, US8077800B2InventorsTetsuya Yano, Kazuhisa Obuchi, Shunji MiyazakiOriginal AssigneeFujitsu LimitedExport CitationBiBTeX, EndNote, RefManPatent Citations (14), Non-Patent Citations (12), Classifications (33) External Links: USPTO, USPTO Assignment, EspacenetTransmitting apparatus with bit arrangement methodUS 8077800 B2Abstract A transmitting apparatus, that includes a means for generating bit sequences to adjust an occupation rate occupied with predetermined bits included in a first data block, which is obtained by encoding first data in a first encoding process, to be equal or closer to an occupation rate occupied with predetermined bits included in a second data block, which is obtained by encoding second data in a second encoding process, in regard to first bit positions of the bit sequences generated using bits included in the first and second data blocks and a modulator for performing multi-level modulation for transmission based on the generated bit sequences.
CROSS-REFERENCE TO RELATED APPLICATIONS This present application is a continuation of U.S. application Ser. No. 12/836,860, filed Jul. 15, 2010, now pending, which is a continuation of U.S. application Ser. No. 10/899,068, filed Jul. 27, 2004, which issued as U.S. Pat. No. 7,860,186 on Dec. 28, 2010, which claims the benefit of Japanese Patent Application No. 2004-35768 filed on Feb. 12, 2004, the contents of each are herein wholly incorporated by reference. This present application also relates to U.S. patent application Ser. No. 12/948,341 filed on Nov. 17, 2010.
Next, a quotient A and a remainder B are obtained by dividing Nsys with the total number of columns Nc (total number of bits 40� number of bit sequences 4=10).
Each block segmented in the code block segmentation unit 13 is stored within the same sub-frame and therefore this block must be coupled as only one aggregation. An example of such aggregation is the bit matrix expressed as Nr(4)�Nc(10). The total number of bits is equal to the value corresponding to the transmission parameter notified with the control unit 10. The regions indicated with S1, S2, S3, P2-1 of the first column (one bit sequence) are data corresponding to only one signal point for execution of the 16 QAM modulation. According to the figure, 10 columns are provided and therefore the data for 10 signal points are illustrated.
⁢ A = 〈 N sys � N c 〉 ⁢ B ⁢ ⁢ 1 = 〈 ( N sys - A � N c ) � M 〉 ⁢ B ⁢ ⁢ 2 = 〈 ( N sys - A � N c - B ⁢ ⁢ 1 ) � ( M - 1 ) 〉 � BL = 〈 { N sys - A � N c - ( B ⁢ ⁢ 1 + B ⁢ ⁢ 2 + � + B ⁡ ( L - 1 ) ) ) � ( M - ( L - 1 ) ) 〉 � ⁢ BM = N sys = A � N c - ( B ⁢ ⁢ 1 + B ⁢ ⁢ 2 + � + B ⁡ ( M - 1 ) ) Here, the following may also be considered under the condition that [N] is assumed to indicate the minimum integer equal to N or larger.
⁢ A = 〈 N sys � N c 〉 ⁢ B ⁢ ⁢ 1 = [ ( N sys - A � N c ) � M ] ⁢ B ⁢ ⁢ 2 = [ ( N sys - A � N c - B ⁢ ⁢ 1 ) � ( M - 1 ) ] � BL = [ { N sys - A � N c - ( B ⁢ ⁢ 1 + B ⁢ ⁢ 2 + � + B ⁡ ( L - 1 ) ) ) � ( M - ( L - 1 ) } ] � ⁢ BM = Nsys - A � Nc - ( B ⁢ ⁢ 1 + B ⁢ ⁢ 2 + � + B ⁡ ( M - 1 ) ) As described above, the present embodiment discloses a bit arrangement method for the bit sequence generating apparatus, which segments the transmitting data into the two or more bit groups, including a first bit group also including the X bits, and a second group also including the Y bits, and generates the L bit sequences by arranging the bits of the first bit group, and the bits of the second bit group, to each bit position in the bit sequences of predetermined length having the first bit position and the second bit position, which generates an error more easily than the first bit position, wherein when certain bits included in the first bit group and certain bits included in the second bit group are preferably arranged at the first bit position and <N> is defined as the maximum integer equal to or less than N, the number of the certain bits included in the first bit group arranged at the second bit position is set smaller than
(<(X+Y)�L>+1)�(X+Y<(X+Y)�L>�L)≦X (1), and2≦(X+Y−<(X+Y)�L>�L (2).
=1+<10�(2−1)+(24−2�10)>=3
=1+<10�(3−1)+(24−2�10)>=6
=1+<10�(4−1)+(24−2�10)>=8.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5970098Oct 2, 1997Oct 19, 1999Globespan Technologies, Inc.Multilevel encoderUS6598202May 19, 2000Jul 22, 2003Samsung Electronics Co., Ltd.Turbo interleaving apparatus and methodUS7324472 *Oct 2, 2002Jan 29, 2008Siemens AktiengesellschaftTransmission methodUS20020163975Sep 17, 2001Nov 7, 2002Mitsuru UesugiWireless transmission device, and transmission signal mapping methodUS20030031233Apr 2, 2002Feb 13, 2003Samsung Electronics Co., Ltd.Apparatus and method for transporting/receiving data in a CDMA mobile communication systemUS20030081576Oct 28, 2002May 1, 2003Samsung Electronics Co., LtdTransmitting/receiving apparatus and method for packet retransmission in a mobile communication systemUS20040001555Jun 26, 2002Jan 1, 2004Arnauld TaffinMethod and apparatus for producing and processing sequences of modulation symbolsUS20050076284Dec 27, 2002Apr 7, 2005Siemens AktiengesallschaftMethod and device for transferring data wherein a bit rate adaptation model is signaled between the transmitter and the receiverUS20050102600Nov 10, 2003May 12, 2005Anand AnandakumarHigh data rate communication system for wireless applicationsFR2800947A1 Title not availableJP2002171298A Title not availableJP2003023373A Title not availableWO2003034640A1Oct 2, 2002Apr 24, 2003Martin Walter DoettlingTransmission methodWO2003039055A1Oct 30, 2001May 8, 2003Doettling MartinMethod and device for representing the initial base of an encoder in the signal space of a qam or psk modulation* Cited by examinerNon-Patent CitationsReference1ETSI TS 125 212 V3.1.1; Jan. 2000; Universal Mobile Telecommunications System (UMTS); Multiplexing and Channel Coding (FDD); XP-002161524. dated Jan. 2000.2ETSI TS 125 213 V6.0.0; Dec. 2003; Universal Mobile Telecommunications System (UMTS), Spearding and Modulation (FDD); dated Dec. 2003.3European Patent Office "communication" issued for corresponding European Patent Application No. 04 256 381.7, dated Jan. 26, 2011.4European Search Report with Written Opinion for corresponding European Application No. 04256381.7-2415, dated Aug. 3, 2007.5Extended European Search Report with written opinion, issued by the European Patent Office for corresponding European Patent Application No. 10184588.1, mailed Mar. 8, 2011.6Extended European Search Report with written opinion, issued by the European Patent Office for corresponding European Patent Application No. 10184618.6, mailed Mar. 8, 2011.7Japanese Patent Office Notice of Rejection for corresponding Japanese Application No. 2004-035768, with English Translation attached; Issued Jun. 30, 2009.8Stephane LeGoff, Alain Glavieux, Claude Berrou; "Turbo-Codes and Hight Spectral Efficiency Modulation"; dated 1994, pp. 645-649.9TSG-RAN WG1 #21 meeting; Aug. 27-31, 2001; Consideration of SMP (Symbol Mapping Based on Priority); XP-002227070; 5-pages; dated Aug. 27-31, 2001.10TSG-RAN WG1 #23; Jan. 8-11, 2002; Text Proposal for SMP (Symbol Mapping Based on Bit Priority) 6 pages; dated Jan. 8-11, 2002.11TSG-RAN Working Group 1 #24; Feb. 18-22, 2002; An Optimisation of the Bit Distribution Function for HSDPA; XP-002227068; dated Feb. 18-22, 2002; pp. 1-3.12United States Patent & Trademark Office "Office Action" issued for corresponding U.S. Appl. No. 13/032,255, dated Apr. 1, 2011.Classifications U.S. Classification375/298, 714/786, 375/261, 714/792, 375/264, 375/300, 714/755, 375/260, 714/800, 714/810International ClassificationH04J13/00, H04L27/00, H04B7/216, H04L27/34, H03M13/29, H04L27/36, H04L12/66, H04L1/16, H03M13/25, H04L1/00Cooperative ClassificationH04L1/0057, H03M13/25, H03M13/2957, H04L1/0041, H04L1/0067, H04L27/3488, H04L1/16European ClassificationH04L1/00B7R, H03M13/29T, H04L1/00B3, H04L27/34M, H04L1/00B7B, H03M13/25RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google