Patentable/Patents/US-8503581
US-8503581

Encoding and decoding method for transmitting and estimating multiple simultaneous channels

PublishedAugust 6, 2013
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

An improved encoding and decoding method for the transmission and estimation of multiple simultaneous channels, thereby solving the problem of shortening the time required to measure the attenuation, absorption or distortion of signals passing through a predetermined medium.

Patent Claims
3 claims

Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.

Claim 1

Original Legal Text

1. A method of identifying a transmission channel, the method comprising the steps of: assigning to each of P transmitters a set of orthogonal complementary sequences; operating the P transmitters during a first time period to transmit simultaneously through the transmission channel a first sequence of each of the sets of orthogonal complementary sequences; operating the P transmitters during a second time period following the first time period to transmit simultaneously through the transmission channel a second sequence of each of the sets of orthogonal complementary sequences; repeatedly operating the P transmitters during each of a number of subsequent time periods following the second time period to transmit simultaneously through the transmission channel P subsequent sequences during each subsequent time period until P sequences of Q sets of orthogonal complementary sequences are transmitted through the transmission channel; operating Q receivers during the time periods to receive the transmitted orthogonal complementary sequences; and identifying the transmission channel based on the received transmitted orthogonal complementary sequences, wherein each of P and Q is an integer, wherein P is greater than two and Q is greater than 2, wherein the step of identifying the transmission channel based on the received transmitted orthogonal complementary, sequences comprises the step of identifying parameters of a transference matrix hp,q in accordance with the following equation: M · h p , q = ∑ k = 1 M ⁢ r q ( k ⊗ s p , k ; 1 ≤ p ≤ P ; 1 ≤ q ≤ Q wherein h pq is the transference matrix, M is the number of orthogonal complementary sequence sets, r q (k is the signal received at receiver q at time interval T k , and S p,k is the K-th sequence of orthogonal complementary sequence set S p .

Plain English Translation

A method for identifying a transmission channel by sending and receiving specific signal patterns. This involves multiple transmitters (P, greater than two) simultaneously sending a series of unique, orthogonal, complementary sequences through the channel over multiple time periods. The receivers (Q, greater than two) record these transmitted signals. The channel is then identified by analyzing the received sequences to determine a transference matrix (hp,q). This matrix is calculated using the equation M · h p , q = ∑ k = 1 M ⁢ r q ( k ⊗ s p , k , where M is the number of orthogonal complementary sequence sets, r q (k is the signal received at receiver q at time interval T k , and S p,k is the K-th sequence of orthogonal complementary sequence set S p . The method aims to improve channel estimation speed for signals passing through a medium.

Claim 2

Original Legal Text

2. The method of claim 1 , wherein each of the orthogonal complementary sequences is comprised of elements +1 and −1.

Plain English Translation

The method for identifying a transmission channel, using multiple transmitters (P, greater than two) and receivers (Q, greater than two) and sending/receiving orthogonal complementary sequences to determine a transference matrix, has a specific signal characteristic. The orthogonal complementary sequences used for transmission are comprised of only two elements: +1 and -1. This binary characteristic of the signal simplifies processing at both the transmitter and receiver, while still allowing for accurate channel estimation via the transference matrix (M · h p , q = ∑ k = 1 M ⁢ r q ( k ⊗ s p , k ). The overall goal is efficient channel measurement of signals passing through a medium.

Claim 3

Original Legal Text

3. The method of claim 1 , wherein each of the orthogonal complementary sequences is comprised only of elements +1 and −1.

Plain English Translation

The method for identifying a transmission channel, using multiple transmitters (P, greater than two) and receivers (Q, greater than two) and sending/receiving orthogonal complementary sequences to determine a transference matrix, has a strict signal composition. The orthogonal complementary sequences are exclusively composed of elements +1 and -1; no other values are permitted. This constraint on the signal set, used in calculating the transference matrix (M · h p , q = ∑ k = 1 M ⁢ r q ( k ⊗ s p , k ), simplifies implementation, potentially at the cost of overall system performance. The channel is estimated to quickly measure signal properties within a transmission medium.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

November 24, 2008

Publication Date

August 6, 2013

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, FAQs, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Encoding and decoding method for transmitting and estimating multiple simultaneous channels” (US-8503581). https://patentable.app/patents/US-8503581

© 2026 Nomic Interactive Technology LLC. Machine-readable context available at /api/llm-context/US-8503581. See llms.txt for full attribution policy.