# US 2026/0279361 A1 · Processing Spatial Descriptors from Higher Order Ambisonics Data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0279361 A1
- Document ID: US20260279361A1
- Status: Published application
- Kind: A1
- Application number: 19/079,074
- Filed: 2025-03-13
- Published: 2026-09-17
- Earliest claimed: 2025-03-13
- Assignees: Apple Inc.
- Applicants: Apple Inc.
- Inventors: Moo Young Kim; Dipanjan Sen; Ravi Kiran Chivukula; Tejaswi Nanjundaswamy
- Web page: https://patentgrep.com/patent/US20260279361A1

## CPC

- G10L 19/008: Multichannel audio signal coding or decoding using interchannel correlation to reduce redundancy, e.g. joint-stereo, intensity-coding or matrixing
- G10L 19/0017: {Lossless audio signal coding; Perfect reconstruction of coded audio signal by transmission of coding error (G10L19/24 takes precedence)}
- G10L 19/035: Scalar quantisation
- G10L 19/038: Vector quantisation, e.g. TwinVQ audio
- G10L 2019/0004: {Design or structure of the codebook}
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

Encoding, decoding, and processing spatial descriptors (SD) produced from higher order ambisonics (HOA) data for purposes of bitrate reduction is described. Some aspects include encoding an SD by subtracting a mean vector, multiplying a unitary transform matrix, clustering, and/or lossless encoding, and/or decoding an SD by adding a mean vector, multiplying an inverse of the unitary transform matrix, processing clusters, and/or lossless decoding. Other aspects are also described and claimed.

## Claims

### Claim 1

A method for decoding a k-dimensional spatial descriptor (SD) produced from higher order ambisonics (HOA) data, comprising:
receiving a bitstream;
generating a k-dimensional transformed SD based on the bitstream;
determining an inverse of a unitary transform; and
multiplying the k-dimensional transformed SD by the inverse of the unitary transform to produce an output k-dimensional SD to reconstruct HOA data.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
adding a mean vector to the k-dimensional transformed SD.

### Claim 3 (depends on 2)

The method of claim 2, wherein the mean vector is selected from one of a plurality of mean vector codebooks, and wherein an index of the mean vector is received with the bitstream.

### Claim 4 (depends on 1)

The method of claim 1, wherein the inverse of the unitary transform is selected from one of a plurality of transform codebooks, and wherein an index of the inverse of the unitary transform is received with the bitstream.

### Claim 5 (depends on 1)

The method of claim 1, wherein generating the k-dimensional transformed SD includes merging N sub-vectors of the bitstream.

### Claim 6 (depends on 5)

The method of claim 5, wherein the N sub-vectors include sub-vectors with different dimensions.

### Claim 7 (depends on 5)

The method of claim 5, wherein merging N sub-vectors includes utilizing N indices received in the bitstream corresponding to N sub-vectors.

### Claim 8 (depends on 5)

The method of claim 5, wherein generating the k-dimensional transformed SD includes split vector quantization (VQ) decoding.

### Claim 9 (depends on 1)

The method of claim 1, wherein generating the k-dimensional transformed SD includes scalar quantization (SQ) decoding.

### Claim 10 (depends on 1)

The method of claim 1, wherein generating the k-dimensional transformed SD includes decoding of an i-th cluster of a split VQ encoding.

### Claim 11 (depends on 1)

The method of claim 1, wherein generating the k-dimensional transformed SD includes decoding an i-th cluster of an SQ encoding.

### Claim 12 (depends on 1)

The method of claim 1, wherein generating the k-dimensional transformed SD includes Huffman or any lossless decoding of the bitstream to produce k-dimensional SQ elements followed by SQ decoding of the k-dimensional SQ elements.

### Claim 13 (depends on 1)

The method of claim 1, generating the k-dimensional transformed SD includes Huffman or any lossless decoding of an i-th cluster.

### Claim 14 (depends on 1)

The method of claim 1, wherein the output k-dimensional SD is used to reconstruct HOA data.

### Claim 15 (depends on 1)

The method of claim 1, further comprising:
decoding from the bitstream a k-dimensional salient component (SC) produced from HOA data.

### Claim 16

A method for processing a bitstream including a k-dimensional spatial descriptor (SD) produced from higher order ambisonics (HOA) data, comprising:
receiving a bitstream that includes a k-dimensional transformed SD and a transform index; and
processing the bitstream by multiplying the k-dimensional transformed SD by an inverse of a unitary transform matrix determined from a transform codebook based on the transform index to produce an output k-dimensional SD to reconstruct HOA data.

### Claim 17 (depends on 16)

The method of claim 16, further comprising:
processing the bitstream to add a mean vector to the k-dimensional transformed SD.

### Claim 18 (depends on 17)

The method of claim 17, wherein the mean vector is selected from one of a plurality of mean vector codebooks, and wherein an index of the mean vector is received with the bitstream.

### Claim 19 (depends on 16)

The method of claim 16, wherein the inverse of the unitary transform matrix is selected from one of a plurality of transform codebooks, and wherein an index of the inverse of the unitary transform matrix is received with the bitstream.

### Claim 20

A method for encoding a k-dimensional spatial descriptor (SD) produced from higher order ambisonics (HOA) data, comprising:
multiplying a unitary transform matrix by an input k-dimensional SD to produce a k-dimensional transformed SD; and
encoding the k-dimensional transformed SD into a bitstream to be transmitted to a decoder.
