IP Library › Granted Patent US 12,525,995
Granted Patent B2
US 12,525,995 · App. 18/414,909 · Granted Jan 13, 2026

Transmitter, receiver, transmission method, and reception method

Inventors: Yutaka Murakami (Kanagawa, JP); Tomohiro Kimura (Osaka, JP); Mikihiro Ouchi (Osaka, JP)
Assignee: PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO., LTD.
H03M13/255H03M13/1102H03M13/1111H03M13/19H03M13/35H03M13/6362H04L1/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,525,995
App. No.
18/414,909
Granted
Jan 13, 2026
Kind
B2
Abstract

One coding scheme is selected from a plurality of coding schemes, an information sequence is encoded by using the selected coding scheme, and an obtained encoded sequence is modulated to obtain a modulated signal. The obtained modulated signal is subjected to a phase change and is transmitted. The plurality of coding schemes include at least a first coding scheme and a second coding scheme. The first coding scheme is a coding scheme with a first coding rate for forming a generated first codeword as a first encoded sequence by using a first parity check matrix. The second coding scheme is a coding scheme with a second coding rate obtained after puncturing processing, for generating a second encoded sequence by performing the puncturing processing on a generated second codeword by using a second parity check matrix different from the first parity check matrix. The number of bits of the first encoded sequence is equal to the number of bits of the second encoded sequence.

Claims (6)

1 . A transmission method, performed by a transmitter, for transmitting contents to a receiver, the transmission method comprising:

determining whether a first encoding scheme to generate a first codeword or a second encoding scheme to generate a second codeword is used for encoding, a first parity check matrix of the first encoding scheme being different from a second parity check matrix of the second encoding scheme, a first length of the first codeword being smaller than a second length of the second codeword;

encoding an information data sequence according to the determined encoding scheme to generate an encoded data sequence, wherein

the information data sequence includes multiplexed data in which at least two contents are multiplexed, the at least two contents including a compressed video content, and

the information data sequence includes control data used for reproducing the compressed video content as a High Dynamic Range (HDR) video in the receiver, the control data including a parameter indicating light level.

2 . The transmission method according to claim 1 , wherein if the first encoding scheme is determined to be used, (i) the first codeword is generated by encoding first information according to the first encoding scheme, and then (ii) a part of the first codeword is removed.

Priority Claims (1)
JP 2015-096313 · May 11, 2015 · national
Continuity (9)
Continuation 17341875 · Jun 8, 2021
Continuation 16801234 · Feb 26, 2020
Continuation 16254950 · Jan 23, 2019
Continuation 15297447 · Oct 19, 2016
Continuation PCTJP2015002613 · May 25, 2015
Provisional Application 62021811 · Jul 8, 2014
Provisional Application 62009387 · Jun 9, 2014
Provisional Application 62004994 · May 30, 2014
Related Publication 20240162919A1 · May 16, 2024
References Cited (43)
US 8356137B2 · Post · 2013 [cited by applicant]
US 8495477B2 · Song · 2013 [cited by applicant]
US 9281883B2 · Murakami · 2016 [cited by applicant]
US 9294165B2 · Murakami · 2016 [cited by applicant]
US 9461725B2 · Murakami · 2016 [cited by applicant]
US 9571131B2 · Murakami · 2017 [cited by applicant]
US 9882618B2 · Murakami · 2018 [cited by applicant]
US 10236914B2 · Murakami · 2019 [cited by examiner]
US 10237015B2 · Murakami · 2019 [cited by applicant]
US 10411835B2 · Murakami · 2019 [cited by applicant]
US 10637505B2 · Murakami · 2020 [cited by examiner]
US 10666386B2 · Murakami · 2020 [cited by applicant]
US 11063609B2 · Murakami · 2021 [cited by examiner]
US 11923871B2 · Murakami · 2024 [cited by examiner]
US 20020157058A1 · Ariel · 2002 [cited by applicant]
US 20060120481A1 · Hong · 2006 [cited by applicant]
US 20100011150A1 · Klein · 2010 [cited by applicant]
US 20100211854A1 · Wu · 2010 [cited by applicant]
US 20100325511A1 · Oh et al. · 2010 [cited by applicant]
US 20110320920A1 · Sampei et al. · 2011 [cited by applicant]
US 20130136208A1 · Murakami et al. · 2013 [cited by applicant]
US 20150358194A1 · Yu et al. · 2015 [cited by applicant]
US 20160345032A1 · Tsukagoshi · 2016 [cited by applicant]
US 20210226723A1 · Lomayev · 2021 [cited by examiner]
International Search Report of PCT application No. PCT/JP2015/002613 dated Jul. 21, 2015. [cited by applicant]
DVB Document A122, “Frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2)”, Jun. 2008. [cited by applicant]
Qiuju Diao et al., “LDPC codes on partial geometries: Construction, trapping set structure, and puncturing”, IEEE Transaction on Information Theory, vol. 59, No. 12, pp. 7898-7914, Dec. 2013. [cited by applicant]
ETSI EN 302 307 V1.1.1, Digital Video Broadcast (DVB); “Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite app… [cited by applicant]
R. G. Gallager, “Low-density parity-check codes”, IRE Transactions on information theory, pp. 21-28, 1962. [cited by applicant]
David J. C. MacKay, “Good error-correcting codes based on very sparse matrices”, IEEE Trans. Inform. theory, vol. 45, No. 2, pp. 399-431, Mar. 1999. [cited by applicant]
Marc P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices”, IEEE Trans. Inform. Theory, vol. 50, No. 8, pp. 1788-1793, Aug. 2004. [cited by applicant]
D. Divsalar et al., “Coding theorems for “turbo-like” codes”, pp. 1-10. [cited by applicant]
Seho Myung et al., “Quasi-cyclic LDPC codes for fast encoding”, IEEE Trans. Inform. Theory, vol. 51, No. 8, pp. 2894-2901, Aug. 2005. [cited by applicant]
Frank R. Kschischang et al., “Factor graphs and the sum-product algorithm”, IEEE Trans. Inform. Theory, vol. 47, No. 2, pp. 498-519, Feb. 2001. [cited by applicant]
Mark P. C. Fossorier et al., “Reduced complexity iterative decoding of low density parity check codes based on belief propagation”, IEEE Trans. Commun., vol. 47, No. 5, pp. 673-680, May 1999. [cited by applicant]
Jinghu Chen et al., “Reduced-complexity decoding of LDPC codes”, IEEE Trans. Commun., vol. 53, No. 8, pp. 1288-1299, Aug. 2005. [cited by applicant]
Juntan Zhang and M. P. C. Fossorier, “Shuffled iterative decoding”, IEEE Trans. Commun., vol. 53, No. 2, pp. 209-213, Feb. 2005. [cited by applicant]
Mohammad M. Mansour et al., “High-throughput LDPC decoders”, IEEE Trans. VLSI syst., vol. 11, No. 6, pp. 976-996, Dec. 2003. [cited by applicant]
Nenad Miladinovic et al., “Improved bit-flipping decoding of low-density parity-check codes”, IEEE Trans. Inform. Theory, vol. 51, No. 4, pp. 1594-1606, Apr. 2005. [cited by applicant]
Yang Zhang et al., “High dynamic range video compression by intensity dependent spatial quantization in HEVC”, Proc. of Picture Coding Symposium 2013, pp. 353-356. [cited by applicant]
Masaru Takeuchi et al., “Considerations on bit depth scalable video coding using gradation interpolation”, Institusion of Electronics, Information and Communication Engineering Magazine D, vol. J95-D, No. 9, pp. 1669-16… [cited by applicant]
Extended European Search Report issued May 4, 2017 in corresponding European Application No. 15800000.0. [cited by applicant]
Xiaonan Shi et al., “Evaluation and Implementation of Quasi-Cyclic LDPC Codes for IEEE802.11n Based MIMO-OFDM System”, IEEE Conference on Soft Computing in Industrial Applications (SMCia/08), 2008, pp. 277-280, XP031468… [cited by applicant]